{"id":"2308.15497","submitter":"J\\'unior Diniz Toniato","authors":"Felipe S. Esc\\'orcio, J\\'ulio C. Fabris, J\\'unior D. Toniato, Hermano\n  Velten","title":"Celestial mechanics in Newtonian-like gravity with variable $G$","comments":"11 pages, to be submitted to EPJP","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A Newtonian-like theory inspired by the Brans-Dicke gravitational Lagrangian\nhas been recently proposed in Ref. arXiv:2009.04434(v4). This work demonstrates\nthat the modified gravitational force acting on a test particle is analogous to\nthat derived from the Manev potential. Specifically, an additional term\n$\\propto r^{-3}$ emerges alongside the conventional Newtonian component. We\nanalyse the predicted expression for the pericenter advance and the Roche limit\nand use them to constraint the theory's single free parameter $\\omega$ which is\nanalogous to the Brans-Dicke parameter. At the same time this theory is able to\nsolve the advance of Mercury's perihelion, we also show that there is no\nrelevant impact on the Roche limit in comparison to the well known Newtonian\nresults.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:57:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Esc\u00f3rcio","Felipe S.",""],["Fabris","J\u00falio C.",""],["Toniato","J\u00fanior D.",""],["Velten","Hermano",""]]}
{"id":"2308.15498","submitter":"Bodo Billerbeck","authors":"David Hawking and Bodo Billerbeck","title":"Chunked Lists versus Extensible Arrays for Text Inversion","comments":"2 pages, 2 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In our 2017 work on in-memory list-based text inversion [Hawking and\nBillerbeck. Efficient In-Memory, List-Based Text Inversion. ADCS 2017] we\ncompared memory use and indexing speed of a considerable number of variants of\nchunked linked lists. In the present work we compare the best performing of\nthose variants (FBB - dynamic Fibonacci chunking) with the extensible SQ array\ntechnique (SQA) presented in [Moffat and Mackenzie. Immediate-Access Indexing\nUsing Space-Efficient Extensible Arrays. ADCS 2023].\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:42:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hawking","David",""],["Billerbeck","Bodo",""]]}
{"id":"2308.15499","submitter":"Patrick M\\\"uller","authors":"Patrick M\\\"uller, Alexander Braun, Margret Keuper","title":"Classification robustness to common optical aberrations","comments":"ICCVW2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computer vision using deep neural networks (DNNs) has brought about seminal\nchanges in people's lives. Applications range from automotive, face recognition\nin the security industry, to industrial process monitoring. In some cases, DNNs\ninfer even in safety-critical situations. Therefore, for practical\napplications, DNNs have to behave in a robust way to disturbances such as\nnoise, pixelation, or blur. Blur directly impacts the performance of DNNs,\nwhich are often approximated as a disk-shaped kernel to model defocus. However,\noptics suggests that there are different kernel shapes depending on wavelength\nand location caused by optical aberrations. In practice, as the optical quality\nof a lens decreases, such aberrations increase. This paper proposes\nOpticsBench, a benchmark for investigating robustness to realistic, practically\nrelevant optical blur effects. Each corruption represents an optical aberration\n(coma, astigmatism, spherical, trefoil) derived from Zernike Polynomials.\nExperiments on ImageNet show that for a variety of different pre-trained DNNs,\nthe performance varies strongly compared to disk-shaped kernels, indicating the\nnecessity of considering realistic image degradations. In addition, we show on\nImageNet-100 with OpticsAugment that robustness can be increased by using\noptical kernels as data augmentation. Compared to a conventionally trained\nResNeXt50, training with OpticsAugment achieves an average performance gain of\n21.7% points on OpticsBench and 6.8% points on 2D common corruptions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:36:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["M\u00fcller","Patrick",""],["Braun","Alexander",""],["Keuper","Margret",""]]}
{"id":"2308.15500","submitter":"Niclas Hamann","authors":"Manuel Formela, Niclas Hamann, Gudrid Moortgat-Pick, Gregor Loisch,\n  Kai Ludwig, Jens Osterhoff","title":"Plasma Lens Prototype Progress: Plasma Diagnostics And Particle Tracking\n  For ILC e+ Source","comments":"LCWS23, SLAC, 3 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, the concept of high-gradient, symmetric focusing using\nactive plasma lenses has regained notable attention owing to its potential\nbenefits in terms of compactness and beam dynamics when juxtaposed with\ntraditional focusing elements. An enticing application lies in the optical\nmatching of extensively divergent positrons originating from the\nundulator-based ILC positron source, thereby enhancing the positron yield in\nsubsequent accelerating structures. Through a collaboration between the\nUniversity of Hamburg and DESY Hamburg, a scaled-down prototype for this\npurpose has been conceptualized and fabricated. In this presentation, we\nprovide an overview of the ongoing progress in the development of this\nprototype. Furthermore, first insights into the development of a particle\ntracking code especially designed for plasma lenses with implemented Bayes\noptimization, are given.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:33:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Formela","Manuel",""],["Hamann","Niclas",""],["Moortgat-Pick","Gudrid",""],["Loisch","Gregor",""],["Ludwig","Kai",""],["Osterhoff","Jens",""]]}
{"id":"2308.15501","submitter":"Xingming Bao","authors":"Xingming Bao, Jian Wang, Shuai Jing, Yuanyong Deng and Dongguang Wang","title":"The AIMS Site Survey","comments":"10 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP astro-ph.SR physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper reports site survey results for the Infrared System for the\nAccurate Measurement of Solar Magnetic Field, especially in Saishiteng\nMountain, Qinghai, China. Since 2017, we have installed weather station,\nspectrometer for precipitable water vapor (PWV) and S-DIMM and carried out\nobservation on weather elements, precipitable water vapor and daytime seeing\ncondition for more than one year in almost all candidates. At Mt. Saishiteng,\nthe median value of daytime precipitable water vapor is 5.25 mm and its median\nvalue in winter season is 2.1 mm. The median value of Fried parameter of\ndaytime seeing observation at Saishiteng Mountain is 3.42 cm. Its solar direct\nradiation data shows that solar average observable time is 446 minutes per day\nand premium time is 401 minutes per day in August 2019.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:34:53 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bao","Xingming",""],["Wang","Jian",""],["Jing","Shuai",""],["Deng","Yuanyong",""],["Wang","Dongguang",""]]}
{"id":"2308.15502","submitter":"Mark Stamp","authors":"Rishit Agrawal and Kelvin Jou and Tanush Obili and Daksh Parikh and\n  Samarth Prajapati and Yash Seth and Charan Sridhar and Nathan Zhang and Mark\n  Stamp","title":"On the Steganographic Capacity of Selected Learning Models","comments":"arXiv admin note: text overlap with arXiv:2306.17189","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning and deep learning models are potential vectors for various\nattack scenarios. For example, previous research has shown that malware can be\nhidden in deep learning models. Hiding information in a learning model can be\nviewed as a form of steganography. In this research, we consider the general\nquestion of the steganographic capacity of learning models. Specifically, for a\nwide range of models, we determine the number of low-order bits of the trained\nparameters that can be overwritten, without adversely affecting model\nperformance. For each model considered, we graph the accuracy as a function of\nthe number of low-order bits that have been overwritten, and for selected\nmodels, we also analyze the steganographic capacity of individual layers. The\nmodels that we test include the classic machine learning techniques of Linear\nRegression (LR) and Support Vector Machine (SVM); the popular general deep\nlearning models of Multilayer Perceptron (MLP) and Convolutional Neural Network\n(CNN); the highly-successful Recurrent Neural Network (RNN) architecture of\nLong Short-Term Memory (LSTM); the pre-trained transfer learning-based models\nVGG16, DenseNet121, InceptionV3, and Xception; and, finally, an Auxiliary\nClassifier Generative Adversarial Network (ACGAN). In all cases, we find that a\nmajority of the bits of each trained parameter can be overwritten before the\naccuracy degrades. Of the models tested, the steganographic capacity ranges\nfrom 7.04 KB for our LR experiments, to 44.74 MB for InceptionV3. We discuss\nthe implications of our results and consider possible avenues for further\nresearch.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:41:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Agrawal","Rishit",""],["Jou","Kelvin",""],["Obili","Tanush",""],["Parikh","Daksh",""],["Prajapati","Samarth",""],["Seth","Yash",""],["Sridhar","Charan",""],["Zhang","Nathan",""],["Stamp","Mark",""]]}
{"id":"2308.15503","submitter":"Javier LLorca","authors":"Yu-Yao Liu, Juan Pedro Fern\\'andez Bl\\'azquez, Guang-Zhong Yin, De-Yi\n  Wang, Javier Llorca, Monica Echeverry-Rend\\'on","title":"A strategy to tailor the mechanical and degradation properties of\n  PCL-PEG-PCL based copolymers for biomedical application","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biodegradable and biocompatible 3D printable biomaterials with tunable\nmechanical properties and degradation rate adapted to target tissues were\nurgently required to manufacture scaffolds for tissue regeneration. Herein, a\nstrategy based on a series of copolymers are proposed where the mechanical and\ndegradation properties can be optimized regarding the specific biological\napplication. With this purpose, poly($\\epsilon$-caprolactone)-poly(ethylene\nglycol)-poly($\\epsilon$-caprolactone) (PCL-PEG-PCL, PCEC) triblock co-polymers\nwith high molecular weight were synthesized by using PEG with a wide range of\nmolecular weight (from 0.6 kg/mol to 35 kg/mol) as macroinitiators. PCEC\ncopolymers exhibited tunable mechanical properties with an elastic modulus in\nthe range 338-705 MPa and a degradation rate from 60% mass loss after 8 h to\n70% mass loss after 23 days in accelerated tests, as well as excellent\ncytocompatibility and cell attachment after culture with mouse fibroblast L929\ncells. The mechanisms responsible for these properties were ascertained by\nmeans of different techniques to ascertain the structure-property relationship\nin PCEC copolymers. Furthermore, it was shown that it is possible to\nmanufacture PCEC scaffolds by 3D printing with excellent dimensional accuracy\nand controlled microporosity. This study provides a promising strategy to\ndesign, select, and fabricate copolymers with tunable mechanical properties and\ndegradation rate for tissue engineering applications.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:40:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Yu-Yao",""],["Bl\u00e1zquez","Juan Pedro Fern\u00e1ndez",""],["Yin","Guang-Zhong",""],["Wang","De-Yi",""],["Llorca","Javier",""],["Echeverry-Rend\u00f3n","Monica",""]]}
{"id":"2308.15504","submitter":"Jesper Nielsen","authors":"Jesper Nielsen, Matthew Raymond Gent, Maria Bergemann, Philipp Eitner,\n  Anders Johansen","title":"Planet formation throughout the Milky Way: Planet populations in the\n  context of Galactic chemical evolution","comments":"21 pages, 16 figures, accepted in A&A","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":"  As stellar compositions evolve over time in the Milky Way, so will the\nresulting planet populations. In order to place planet formation in the context\nof Galactic chemical evolution, we make use of a large ($N = 5\\,325$) stellar\nsample representing the thin and thick discs, defined chemically, and the halo,\nand we simulate planet formation by pebble accretion around these stars. We\nbuild a chemical model of their protoplanetary discs, taking into account the\nrelevant chemical transitions between vapour and refractory minerals, in order\nto track the resulting compositions of formed planets. We find that the masses\nof our synthetic planets increase on average with increasing stellar\nmetallicity [Fe/H] and that giant planets and super-Earths are most common\naround thin-disc ($\\alpha$-poor) stars since these stars have an overall higher\nbudget of solid particles. Giant planets are found to be very rare\n($\\lesssim$1\\%) around thick-disc ($\\alpha$-rich) stars and nearly non-existent\naround halo stars. This indicates that the planet population is more diverse\nfor more metal-rich stars in the thin disc. Water-rich planets are less common\naround low-metallicity stars since their low metallicity prohibits efficient\ngrowth beyond the water ice line. If we allow water to oxidise iron in the\nprotoplanetary disc, this results in decreasing core mass fractions with\nincreasing [Fe/H]. Excluding iron oxidation from our condensation model instead\nresults in higher core mass fractions, in better agreement with the core-mass\nfraction of Earth, that increase with increasing [Fe/H]. Our work demonstrates\nhow the Galactic chemical evolution and stellar parameters, such as stellar\nmass and chemical composition, can shape the resulting planet population.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:58:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Nielsen","Jesper",""],["Gent","Matthew Raymond",""],["Bergemann","Maria",""],["Eitner","Philipp",""],["Johansen","Anders",""]]}
{"id":"2308.15505","submitter":"Pietro Corvaja","authors":"Pietro Corvaja, Umberto Zannier","title":"Examples of effectivity for integral points on certain curves of genus 2","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This short article concerns a method to obtain effectivity for the search of\nintegral points on certain (sets of) curves of genus 2. More precisely, we wish\nto illustrate just an example of application of a criterion of Bilu, to derive\neffectivity for integral points on certain families of affine curves of genus\n2. Future work, in collaboration with D. Lombardo, will contain details and\nmore general applications.\n  We shall construct morphisms from these curves to $\\G_{\\rm m}^2$, with image\nof increasing degrees. We note that as the degree increases, we may say that\nthe examples become `more interesting', since they cannot be derived by\nsubstitution from a universal family. As a counterpart, there is the negative\nfeature in that the relevant curves will somewhat have increasing fields of\ndefinition.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:16:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Corvaja","Pietro",""],["Zannier","Umberto",""]]}
{"id":"2308.15506","submitter":"Rahul Maitra","authors":"Anish Chakraborty and Pradipta Kumar Samanta and Rahul Maitra","title":"Accurate determination of excitation energy: An equation-of-motion\n  approach over a bi-exponential Coupled Cluster theory","comments":"14 pages, 1 Figure","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The calculation of molecular excited states is critically important to\ndecipher a plethora of molecular properties. In this manuscript, we develop an\nequation of motion formalism on top of a bi-exponentially parametrized ground\nstate wavefunction towards the determination of excited states. While the\nground state bi-exponential parametrization ensures an accurate description of\nthe wavefunction through the inclusion of high-rank correlation effects, the\nexcited state is parametrized by a novel linear response operator with an\neffective excitation rank beyond two. In order to treat the ground and the\nexcited states in the same footings, in addition to the conventional one and\ntwo-body response operators, we introduced certain two-body \"generalized\"\nresponse operator with an effective excitation rank of one. We introduce a\nprojective formulation towards the determination of the perturbed amplitudes\nfor the set of \"generalized\" operators. Our formulation entails significantly\nsmall number of unknown parameters and is shown to be highly accurate compared\nto allied methods for a number of difficult chemical systems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:26:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chakraborty","Anish",""],["Samanta","Pradipta Kumar",""],["Maitra","Rahul",""]]}
{"id":"2308.15507","submitter":"Christian Ledig","authors":"Sebastian Doerrich, Francesco Di Salvo, Christian Ledig","title":"unORANIC: Unsupervised Orthogonalization of Anatomy and\n  Image-Characteristic Features","comments":"to be published in International Workshop on Machine Learning in\n  Medical Imaging (MLMI 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":"  We introduce unORANIC, an unsupervised approach that uses an adapted loss\nfunction to drive the orthogonalization of anatomy and image-characteristic\nfeatures. The method is versatile for diverse modalities and tasks, as it does\nnot require domain knowledge, paired data samples, or labels. During test time\nunORANIC is applied to potentially corrupted images, orthogonalizing their\nanatomy and characteristic components, to subsequently reconstruct\ncorruption-free images, showing their domain-invariant anatomy only. This\nfeature orthogonalization further improves generalization and robustness\nagainst corruptions. We confirm this qualitatively and quantitatively on 5\ndistinct datasets by assessing unORANIC's classification accuracy, corruption\ndetection and revision capabilities. Our approach shows promise for enhancing\nthe generalizability and robustness of practical applications in medical image\nanalysis. The source code is available at\nhttps://github.com/sdoerrich97/unORANIC.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:37:13 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Doerrich","Sebastian",""],["Di Salvo","Francesco",""],["Ledig","Christian",""]]}
{"id":"2308.15508","submitter":"Shi Yin","authors":"Wei-jie Fu, Xiaofeng Luo, Jan M. Pawlowski, Fabian Rennecke, Shi Yin","title":"Ripples of the QCD Critical Point","comments":"7+7 pages, 12 figures, 2 tables","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 investigate the impact of a critical end point (CEP) on the experimentally\naccessible baryon number fluctuations of different orders. By now, its\npotential location has been constrained fairly accurately within first\nprinciples functional QCD, together with the location of the chiral crossover\nline and further thermodynamic observables. This information is incorporated in\nan advanced QCD-assisted low energy effective theory which is used for the\ncomputation of baryon number fluctuations at the chemical freeze-out. This\ncomputation also takes care of global baryon number conservation at larger\ndensity, where the system changes from grand-canonical to canonical statistics.\nWe observe a prominent peak structure, whose amplitude depends on the location\nof the CEP, while its position is more sensitive to the location of the\nfreeze-out curve. Our results provide guidance for future low energy heavy-ion\nexperiments.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:40:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fu","Wei-jie",""],["Luo","Xiaofeng",""],["Pawlowski","Jan M.",""],["Rennecke","Fabian",""],["Yin","Shi",""]]}
{"id":"2308.15509","submitter":"Malik Qirtas","authors":"Malik Muhammad Qirtas, Evi Zafeiridi, Eleanor Bantry White and Dirk\n  Pesch","title":"The Relationship between Loneliness and Depression among College\n  Students: Mining data derived from Passive Sensing","comments":"N/A","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Loneliness and depression are interrelated mental health issues affecting\nstudents well-being. Using passive sensing data provides a novel approach to\nexamine the granular behavioural indicators differentiating loneliness and\ndepression, and the mediators in their relationship. This study aimed to\ninvestigate associations between behavioural features and loneliness and\ndepression among students, exploring the complex relationships between these\nmental health conditions and associated behaviours. This study combined\nregression analysis, mediation analysis, and machine learning analysis to\nexplore relationships between behavioural features, loneliness, and depression\nusing passive sensing data, capturing daily life behaviours such as physical\nactivity, phone usage, sleep patterns, and social interactions. Results\nrevealed significant associations between behavioural features and loneliness\nand depression, emphasizing their interconnected nature. Increased activity and\nsleep duration were identified as protective factors. Distinct behavioural\nfeatures for each condition were also found. Mediation analysis highlighted\nsignificant indirect effects in the relationship between loneliness and\ndepression. The XGBoost model achieved the highest accuracy in predicting these\nconditions. This study demonstrated the importance of using passive sensing\ndata and a multi-method approach to understand the complex relationship between\nloneliness, depression, and associated behaviours. Identifying specific\nbehavioural features and mediators contributes to a deeper understanding of\nfactors influencing loneliness and depression among students. This\ncomprehensive perspective emphasizes the importance of interdisciplinary\ncollaboration for a more nuanced understanding of complex human experiences.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:20:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Qirtas","Malik Muhammad",""],["Zafeiridi","Evi",""],["White","Eleanor Bantry",""],["Pesch","Dirk",""]]}
{"id":"2308.15510","submitter":"Sonja Billerbeck","authors":"Min Lu and Sonja Billerbeck","title":"Improving homology-directed repair by small molecule agents for genetic\n  engineering in unconventional yeast? -- Learning from the engineering of\n  mammalian systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ability to precisely edit genomes by deleting or adding genetic\ninformation enables the study of biological functions and the building of\nefficient cell factories. In many unconventional yeasts, such as promising new\nhosts for cell factory design but also human pathogenic yeasts and food\nspoilers, this progress has been limited by the fact that most yeasts favor\nnon-homologous end joining (NHEJ) over homologous recombination (HR) as DNA\nrepair mechanism, impairing genetic access to these hosts. In mammalian cells,\nsmall molecules that either inhibit proteins involved in NHEJ, enhance protein\nfunction in HR, or molecules that arrest the cell cycle in HR-dominant phases\nare regarded as promising agents for the simple and transient increase of\nHR-mediated genome editing without the need for a priori host engineering. Only\na few of these chemicals have been applied to the engineering of yeast although\nthe targeted proteins are mostly conserved; making chemical agents a yet\nunderexplored area in enhancing yeast engineering. Here, we consolidate\nknowledge of available small molecules that have been used to improve HR\nefficiency in mammalian cells and the few ones that have been used in yeast. We\ninclude available high throughput (HTP)-compatible NHEJ/HR quantification\nassays that could be used to screen for and isolate yeast-specific inhibitors.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:26:13 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lu","Min",""],["Billerbeck","Sonja",""]]}
{"id":"2308.15511","submitter":"Pierre Matet","authors":"Pierre Matet","title":"The pcf theory of non fixed points","comments":"arXiv admin note: text overlap with arXiv:2308.14467. text overlap\n  with arXiv:2308.14779","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We deal with values taken by various pseudopower functions at a singular\ncardinal that is not a fixed point of the aleph function.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:49:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Matet","Pierre",""]]}
{"id":"2308.15512","submitter":"Dongwon Kim","authors":"Dongwon Kim, Namyup Kim, Cuiling Lan, Suha Kwak","title":"Shatter and Gather: Learning Referring Image Segmentation with Text\n  Supervision","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":"  Referring image segmentation, the task of segmenting any arbitrary entities\ndescribed in free-form texts, opens up a variety of vision applications.\nHowever, manual labeling of training data for this task is prohibitively\ncostly, leading to lack of labeled data for training. We address this issue by\na weakly supervised learning approach using text descriptions of training\nimages as the only source of supervision. To this end, we first present a new\nmodel that discovers semantic entities in input image and then combines such\nentities relevant to text query to predict the mask of the referent. We also\npresent a new loss function that allows the model to be trained without any\nfurther supervision. Our method was evaluated on four public benchmarks for\nreferring image segmentation, where it clearly outperformed the existing method\nfor the same task and recent open-vocabulary segmentation models on all the\nbenchmarks.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:39:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kim","Dongwon",""],["Kim","Namyup",""],["Lan","Cuiling",""],["Kwak","Suha",""]]}
{"id":"2308.15513","submitter":"Martin Skrodzki","authors":"Martin Skrodzki, Nicolas Chaves-de-Plaza, Klaus Hildebrandt, Thomas\n  H\\\"ollt, Elmar Eisemann","title":"Tuning the perplexity for and computing sampling-based t-SNE embeddings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI q-bio.QM stat.ML","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Widely used pipelines for the analysis of high-dimensional data utilize\ntwo-dimensional visualizations. These are created, e.g., via t-distributed\nstochastic neighbor embedding (t-SNE). When it comes to large data sets,\napplying these visualization techniques creates suboptimal embeddings, as the\nhyperparameters are not suitable for large data. Cranking up these parameters\nusually does not work as the computations become too expensive for practical\nworkflows. In this paper, we argue that a sampling-based embedding approach can\ncircumvent these problems. We show that hyperparameters must be chosen\ncarefully, depending on the sampling rate and the intended final embedding.\nFurther, we show how this approach speeds up the computation and increases the\nquality of the embeddings.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:24:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Skrodzki","Martin",""],["Chaves-de-Plaza","Nicolas",""],["Hildebrandt","Klaus",""],["H\u00f6llt","Thomas",""],["Eisemann","Elmar",""]]}
{"id":"2308.15514","submitter":"Robert Trager","authors":"Robert Trager, Ben Harack, Anka Reuel, Allison Carnegie, Lennart Heim,\n  Lewis Ho, Sarah Kreps, Ranjit Lall, Owen Larter, Se\\'an \\'O h\\'Eigeartaigh,\n  Simon Staffell, Jos\\'e Jaime Villalobos","title":"International Governance of Civilian AI: A Jurisdictional Certification\n  Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This report describes trade-offs in the design of international governance\narrangements for civilian artificial intelligence (AI) and presents one\napproach in detail. This approach represents the extension of a standards,\nlicensing, and liability regime to the global level. We propose that states\nestablish an International AI Organization (IAIO) to certify state\njurisdictions (not firms or AI projects) for compliance with international\noversight standards. States can give force to these international standards by\nadopting regulations prohibiting the import of goods whose supply chains embody\nAI from non-IAIO-certified jurisdictions. This borrows attributes from models\nof existing international organizations, such as the International Civilian\nAviation Organization (ICAO), the International Maritime Organization (IMO),\nand the Financial Action Task Force (FATF). States can also adopt multilateral\ncontrols on the export of AI product inputs, such as specialized hardware, to\nnon-certified jurisdictions. Indeed, both the import and export standards could\nbe required for certification. As international actors reach consensus on risks\nof and minimum standards for advanced AI, a jurisdictional certification regime\ncould mitigate a broad range of potential harms, including threats to public\nsafety.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:43:59 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Trager","Robert",""],["Harack","Ben",""],["Reuel","Anka",""],["Carnegie","Allison",""],["Heim","Lennart",""],["Ho","Lewis",""],["Kreps","Sarah",""],["Lall","Ranjit",""],["Larter","Owen",""],["h\u00c9igeartaigh","Se\u00e1n \u00d3",""],["Staffell","Simon",""],["Villalobos","Jos\u00e9 Jaime",""]]}
{"id":"2308.15515","submitter":"Ernestine Grossmann","authors":"Jannick Borowitz, Ernestine Gro{\\ss}mann, Christian Schulz, Dominik\n  Schweisgut","title":"Finding Optimal 2-Packing Sets on Arbitrary Graphs at Scale","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A 2-packing set for an undirected graph $G=(V,E)$ is a subset $\\mathcal{S}\n\\subset V$ such that any two vertices $v_1,v_2 \\in \\mathcal{S}$ have no common\nneighbors. Finding a 2-packing set of maximum cardinality is a NP-hard problem.\nWe develop a new approach to solve this problem on arbitrary graphs using its\nclose relation to the independent set problem. Thereby, our algorithm red2pack\nuses new data reduction rules specific to the 2-packing set problem as well as\na graph transformation. Our experiments show that we outperform the\nstate-of-the-art for arbitrary graphs with respect to solution quality and also\nare able to compute solutions multiple orders of magnitude faster than\npreviously possible. For example, we are able to solve 63% of our graphs to\noptimality in less than a second while the competitor for arbitrary graphs can\nonly solve 5% of the graphs in the data set to optimality even with a 10 hour\ntime limit. Moreover, our approach can solve a wide range of large instances\nthat have previously been unsolved.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:45:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Borowitz","Jannick",""],["Gro\u00dfmann","Ernestine",""],["Schulz","Christian",""],["Schweisgut","Dominik",""]]}
{"id":"2308.15516","submitter":"Xingbo Wei","authors":"Xingbo Wei, Liangqing Wu, Kewei Feng, Tong Liu, Yunbo Zhang","title":"Exact mobility edges in finite-height Wannier-Stark ladders","comments":"7 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the single-particle localization transition in one-dimensional\nWannier-Stark ladders with either a linear potential or a mosaic potential with\nspacing $\\kappa=2$. In both cases, we exactly determine the mobility edges\nseparating the Wannier-Stark localized states from extended states for a finite\npotential height. Especially in the latter case, we obtain mobility edges\nthrough a revised Lyapunov exponent, and demonstrate a rich phase diagram with\nextended states, weakly Wannier-Stark localized states, and strongly\nWannier-Stark localized states. Our results also exhibit that mobility edges\nare highly dependent on the height of the ladder and extended states only\nsurvive at $E\\approx0$ for the high ladder. Finally, we perform the simulation\nof the dynamical evolution for possible experimental observations. These\ninteresting features will shed light on the study of localization phenomena in\ndisorder-free systems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:55:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wei","Xingbo",""],["Wu","Liangqing",""],["Feng","Kewei",""],["Liu","Tong",""],["Zhang","Yunbo",""]]}
{"id":"2308.15517","submitter":"Sotirios Kastanas","authors":"Sotirios Kastanas, Shaomu Tan, Yi He","title":"Document AI: A Comparative Study of Transformer-Based, Graph-Based\n  Models, and Convolutional Neural Networks For Document Layout Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Document AI aims to automatically analyze documents by leveraging natural\nlanguage processing and computer vision techniques. One of the major tasks of\nDocument AI is document layout analysis, which structures document pages by\ninterpreting the content and spatial relationships of layout, image, and text.\nThis task can be image-centric, wherein the aim is to identify and label\nvarious regions such as authors and paragraphs, or text-centric, where the\nfocus is on classifying individual words in a document. Although there are\nincreasingly sophisticated methods for improving layout analysis, doubts remain\nabout the extent to which their findings can be generalized to a broader\ncontext. Specifically, prior work developed systems based on very different\narchitectures, such as transformer-based, graph-based, and CNNs. However, no\nwork has mentioned the effectiveness of these models in a comparative analysis.\nMoreover, while language-independent Document AI models capable of knowledge\ntransfer have been developed, it remains to be investigated to what degree they\ncan effectively transfer knowledge. In this study, we aim to fill these gaps by\nconducting a comparative evaluation of state-of-the-art models in document\nlayout analysis and investigating the potential of cross-lingual layout\nanalysis by utilizing machine translation techniques.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:58:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kastanas","Sotirios",""],["Tan","Shaomu",""],["He","Yi",""]]}
{"id":"2308.15518","submitter":"Joseph Lazio","authors":"T. Joseph W. Lazio, S. G. Djorgovski, Andrew Howard, Curt Cutler,\n  Sofia Z. Sheikh, Stefano Cavuoti, Denise Herzing, Kiri Wagstaff, Jason T.\n  Wright, Vishal Gajjar, Kevin Hand, Umaa Rebbapragada, Bruce Allen, Erica\n  Cartmill, Jacob Foster, Dawn Gelino, Matthew J. Graham, Giuseppe Longo,\n  Ashish A. Mahabal, Lior Pachter, Vikram Ravi, Gerald Sussman","title":"Data-Driven Approaches to Searches for the Technosignatures of Advanced\n  Civilizations","comments":"Final Report prepared for the W. M. Keck Institute for Space Studies\n  (KISS),\n  http://kiss.caltech.edu/workshops/technosignatures/technosignatures.html ;\n  eds. Lazio, Djorgovski, Howard, & Cutler; The study leads gratefully\n  acknowledge the outstanding support of Michele Judd, KISS Executive Director,\n  and her dedicated staff, who made the study experience invigorating and\n  enormously productive","journal-ref":null,"doi":"10.26206/gvmj-sn65","report-no":null,"categories":"astro-ph.IM astro-ph.EP physics.pop-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Humanity has wondered whether we are alone for millennia. The discovery of\nlife elsewhere in the Universe, particularly intelligent life, would have\nprofound effects, comparable to those of recognizing that the Earth is not the\ncenter of the Universe and that humans evolved from previous species. There has\nbeen rapid growth in the fields of extrasolar planets and data-driven\nastronomy. In a relatively short interval, we have seen a change from knowing\nof no extrasolar planets to now knowing more potentially habitable extrasolar\nplanets than there are planets in the Solar System. In approximately the same\ninterval, astronomy has transitioned to a field in which sky surveys can\ngenerate 1 PB or more of data. The Data-Driven Approaches to Searches for the\nTechnosignatures of Advanced Civilizations_ study at the W. M. Keck Institute\nfor Space Studies was intended to revisit searches for evidence of alien\ntechnologies in light of these developments. Data-driven searches, being able\nto process volumes of data much greater than a human could, and in a\nreproducible manner, can identify *anomalies* that could be clues to the\npresence of technosignatures. A key outcome of this workshop was that\ntechnosignature searches should be conducted in a manner consistent with\nFreeman Dyson's \"First Law of SETI Investigations,\" namely \"every search for\nalien civilizations should be planned to give interesting results even when no\naliens are discovered.\" This approach to technosignatures is commensurate with\nNASA's approach to biosignatures in that no single observation or measurement\ncan be taken as providing full certainty for the detection of life. Areas of\nparticular promise identified during the workshop were (*) Data Mining of Large\nSky Surveys, (*) All-Sky Survey at Far-Infrared Wavelengths, (*) Surveys with\nRadio Astronomical Interferometers, and (*) Artifacts in the Solar System.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:29:59 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lazio","T. Joseph W.",""],["Djorgovski","S. G.",""],["Howard","Andrew",""],["Cutler","Curt",""],["Sheikh","Sofia Z.",""],["Cavuoti","Stefano",""],["Herzing","Denise",""],["Wagstaff","Kiri",""],["Wright","Jason T.",""],["Gajjar","Vishal",""],["Hand","Kevin",""],["Rebbapragada","Umaa",""],["Allen","Bruce",""],["Cartmill","Erica",""],["Foster","Jacob",""],["Gelino","Dawn",""],["Graham","Matthew J.",""],["Longo","Giuseppe",""],["Mahabal","Ashish A.",""],["Pachter","Lior",""],["Ravi","Vikram",""],["Sussman","Gerald",""]]}
{"id":"2308.15519","submitter":"Luca Smaldone Ph.D","authors":"Alfredo Iorio and Luca Smaldone","title":"Quantum black holes as classical space factories","comments":null,"journal-ref":"International Journal of Modern Physics D, Vol. 32, No. 10,\n  2350063 (2023)","doi":"10.1142/S0218271823500633","report-no":null,"categories":"physics.gen-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Space and matter may both be manifestations of a single fundamental quantum\ndynamics, as it may become evident during black-hole evaporation. Inspired by\nthe fact that quantum electrodynamics underlies the classical theory of\nelasticity, that in turn has a natural and well-known geometric description in\nterms of curvature and torsion, related to topological defects, here we move\nsome necessary steps to find the map from such fundamental quantum level to the\nemergent level of classical space and quantum matter. We proceed by adapting\nthe boson transformation method of standard quantum field theory to the quantum\ngravity fundamental scenario and successfully obtain the emergence of curvature\nand torsion, our main focus here. In doing so, we have been able to overcome\ndifficult issues of interpretation, related to the Goldstone modes for\nrotational symmetry. In fact, we have been able to apply the boson\ntransformation method to disclinations, to relate them to the spin structure\nand to give an heuristic derivation of the matter field equation on curved\nspace. We also improve results of previous work on the emergence of geometric\ntensors from elasticity theory, as the non-Abelian contributions to the torsion\nand curvature tensors, postulated in those papers, here emerge naturally. More\nwork is necessary to identify the type of gravity theories one can obtain in\nthis way.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:57:10 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Iorio","Alfredo",""],["Smaldone","Luca",""]]}
{"id":"2308.15520","submitter":"Jahan Claes","authors":"Argyris Giannisis Manes and Jahan Claes","title":"Distance-preserving stabilizer measurements in hypergraph product codes","comments":"5 pages plus references, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unlike the surface code, quantum low-density parity-check (QLDPC) codes can\nhave a finite encoding rate, potentially lowering the error correction\noverhead. However, finite-rate QLDPC codes have nonlocal stabilizers, making it\ndifficult to design stabilizer measurement circuits that are low-depth and do\nnot decrease the effective distance. Here, we demonstrate that a popular family\nof finite-rate QLDPC codes, hypergraph product codes, has the convenient\nproperty of distance-robustness: any stabilizer measurement circuit preserves\nthe effective distance. In particular, we prove the depth-optimal circuit in\n[Tremblay et al, PRL 129, 050504 (2022)] is also optimal in terms of effective\ndistance.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Manes","Argyris Giannisis",""],["Claes","Jahan",""]]}
{"id":"2308.15521","submitter":"Yan Gong","authors":"Y. Gong, F.J. Du, C. Henkel, A.M. Jacob, A. Belloche, J.Z. Wang, K.M.\n  Menten, W. Yang, D.H. Quan, C.T. Bop, G.N. Ortiz-Le\\'on, X.D. Tang, M.R.\n  Rugel, S. Liu","title":"Protonated hydrogen cyanide as a tracer of pristine molecular gas","comments":"25 pages, 26 figures, accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Protonated hydrogen cyanide, HCNH$^{+}$, plays a fundamental role in\nastrochemistry because it is an intermediary in gas-phase ion-neutral reactions\nwithin cold molecular clouds. However, the impact of the environment on the\nchemistry of HCNH$^{+}$ remains poorly understood. With the IRAM-30 m and\nAPEX-12 m observations, we report the first robust distribution of HCNH$^{+}$\nin the Serpens filament and in Serpens South. Our data suggest that HCNH$^{+}$\nis abundant in cold and quiescent regions, but is deficit in active\nstar-forming regions. The observed HCNH$^{+}$ fractional abundances relative to\nH$_{2}$ range from $3.1\\times 10^{-11}$ in protostellar cores to $5.9\\times\n10^{-10}$ in prestellar cores, and the HCNH$^{+}$ abundance generally decreases\nwith increasing H$_{2}$ column density, which suggests that HCNH$^{+}$\ncoevolves with cloud cores. Our observations and modeling results suggest that\nthe abundance of HCNH$^{+}$ in cold molecular clouds is strongly dependent on\nthe H$_{2}$ number density. The decrease in the abundance of HCNH$^{+}$ is\ncaused by the fact that its main precursors (e.g., HCN and HNC) undergo\nfreeze-out as the number density of H$_{2}$ increases. However, current\nchemical models cannot explain other observed trends, such as the fact that the\nabundance of HCNH$^{+}$ shows an anti-correlation with that of HCN and HNC, but\na positive correlation with that of N$_{2}$H$^{+}$ in the southern part of the\nSerpens South northern clump. This indicates that additional chemical pathways\nhave to be invoked for the formation of HCNH$^{+}$ via molecules like N$_{2}$\nin regions in which HCN and HNC freeze out. Both the fact that HCNH$^{+}$ is\nmost abundant in molecular cores prior to gravitational collapse and the fact\nthat low-$J$ HCNH$^{+}$ transitions have very low H$_{2}$ critical densities\nmake this molecular ion an excellent probe of pristine molecular gas.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gong","Y.",""],["Du","F. J.",""],["Henkel","C.",""],["Jacob","A. M.",""],["Belloche","A.",""],["Wang","J. Z.",""],["Menten","K. M.",""],["Yang","W.",""],["Quan","D. H.",""],["Bop","C. T.",""],["Ortiz-Le\u00f3n","G. N.",""],["Tang","X. D.",""],["Rugel","M. R.",""],["Liu","S.",""]]}
{"id":"2308.15522","submitter":"Yuber F. Perez-Gonzalez","authors":"Marcos M. Flores, Alexander Kusenko, Lauren Pearce, Yuber F.\n  Perez-Gonzalez, Graham White","title":"Testing high scale supersymmetry via second order gravitational waves","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"IPMU23-0028, IPPP/23/48","categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Supersymmetry predicts multiple flat directions, some of which carry a net\nbaryon or lepton number. Condensates in such directions form during inflation\nand later fragment into Q-balls, which can become the building blocks of\nprimordial black holes. Thus supersymmetry can create conditions for an\nintermediate matter-dominated era with black holes dominating the energy\ndensity of the universe. Unlike particle matter, black holes decay suddenly\nenough to result in an observable gravitational wave signal via the poltergeist\nmechanism. We investigate the gravitational waves signatures of supersymmetry\nrealized at energy scales that might not be accessible to present-day\ncolliders.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Flores","Marcos M.",""],["Kusenko","Alexander",""],["Pearce","Lauren",""],["Perez-Gonzalez","Yuber F.",""],["White","Graham",""]]}
{"id":"2308.15523","submitter":"Jabir Ali Ouassou","authors":"Jabir Ali Ouassou, Takehito Yokoyama, and Jacob Linder","title":"RKKY interaction in triplet superconductors: Dzyaloshinskii-Moriya-type\n  interaction mediated by spin-polarized Cooper pairs","comments":"16 pages (including 7 figures, 3 appendices, and references)","journal-ref":null,"doi":null,"report-no":"QuSpin 2023","categories":"cond-mat.supr-con cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Ruderman-Kittel-Kasuya-Yosida (RKKY) interaction governs the coupling\nbetween localized spins and is strongly affected by the environment in which\nthese spins reside. In superconductors, this interaction becomes long-ranged\nand provides information about the orbital symmetry of the superconducting\norder parameter. In this work, we consider the RKKY interaction between\nlocalized spins mediated by a $p$-wave triplet superconductor. In contrast to\nthe well-studied RKKY interaction in $d$-wave superconductors, we find that the\nspin of the Cooper pair in a triplet state also modulates the spin-spin\ncoupling. We consider several different types of $p$-wave triplet states, and\nfind that the form of the RKKY interaction changes significantly with the\nsymmetries of the order parameter. For non-unitary superconducting states, two\nnew terms appear in the RKKY interaction: a background spin magnetization\ncoupling to the individual spins and, more interestingly, an effective\nDzyaloshinskii-Moriya term. The latter term oscillates with the separation\ndistance between the impurity spins. Finally, we find that the finite spin\nexpectation value in non-unitary superconductors in concert with the\nconventional RKKY interaction can lead to non-collinear magnetic ground states\neven when the Dzyaloshinskii-Moriya term is negligible. The RKKY interaction in\n$p$-wave triplet superconductors thus offers a way to achieve new ground state\nspin configurations of impurity spins and simultaneously provides information\nabout the underlying superconducting state.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ouassou","Jabir Ali",""],["Yokoyama","Takehito",""],["Linder","Jacob",""]]}
{"id":"2308.15524","submitter":"Noah Steinberg","authors":"Minerba Betancourt, Steven Gardiner, Noemi Rocco, Noah Steinberg","title":"Interfacing Electron and Neutrino Quasielastic Scattering Cross Sections\n  with the Spectral Function in GENIE","comments":"10 pages, 9 figures","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-458-CSAID-N","categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Progress in neutrino-nucleus cross section models is being driven by the need\nfor highly accurate predictions for the neutrino oscillation community. These\nsophisticated models are being developed within a microscopic description of\nthe nucleus with the goal of encompassing all reaction modes relevant for the\naccelerator neutrino program. The disconnect between these microscopic models\nand the event generators that will be used in the next generation of\nexperiments represents a critical obstacle that must be overcome in order to\nprecisely measure the neutrino oscillation parameters. To this end we have\ndeveloped a Fortran wrapper for lepton-nucleus quasielastic (QE) scattering\nwithin the GENIE event generator as a proof of principle, with the broader goal\nof creating an efficient pipeline for incorporating advanced theoretical models\nin event generators. As a demonstration of this interface, we have implemented\nthe Spectral Function model into GENIE, offering a more complete description of\nthe nuclear ground state, as well as the ability to provide quantifiable\ntheoretical uncertainties. We validate this implementation and compare its\npredictions against data and against QE models already available in GENIE.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Betancourt","Minerba",""],["Gardiner","Steven",""],["Rocco","Noemi",""],["Steinberg","Noah",""]]}
{"id":"2308.15525","submitter":"Andreas Schachner","authors":"Sven Krippendorf and Andreas Schachner","title":"New non-supersymmetric flux vacua in string theory","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":"LMU-ASC 30/23","categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this note we construct large ensembles of supersymmetry breaking solutions\narising in the context of flux compactifications of type IIB string theory.\nThis class of solutions was previously proposed in arXiv:hep-th/0402135 for\nwhich we provide the first explicit examples in Calabi-Yau orientifold\ncompactifications with discrete fluxes below their respective tadpole\nconstraint. As a proof of concept, we study the degree 18 hypersurface in\nweighted projective space $\\mathbb{CP}_{1,1,1,6,9}$. Furthermore, we look at 10\nadditional orientifolds with $h^{1,2}=2,3$. We find several flux vacua with\nhierarchical suppression of the vacuum energy with respect to the gravitino\nmass. These solutions provide a crucial stepping stone for the construction of\nexplicit de Sitter vacua in string theory. Lastly, we also report the\ndifference in the distribution of $W_0$ between supersymmetric and\nnon-supersymmetric minima.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Krippendorf","Sven",""],["Schachner","Andreas",""]]}
{"id":"2308.15526","submitter":"Lijie Ding","authors":"Lijie Ding, Robert A. Pelcovits, Thomas R. Powers","title":"Chiral fluid membranes with orientational order and multiple edges","comments":"12 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We carry out Monte Carlo simulations on fluid membranes with orientational\norder and multiple edges in the presence and absence of external forces. The\nmembrane resists bending and has an edge tension, the orientational order\ncouples with the membrane surface normal through a cost for tilting, and there\nis a chiral liquid crystalline interaction. In the absence of external forces,\na membrane initialized as a vesicle will form a disk at low chirality, with the\ndirectors forming a smectic-A phase with alignment perpendicular to the\nmembrane surface except near the edge. At large chirality a catenoid-like shape\nor a trinoid-like shape is formed, depending on the number of edges in the\ninitial vesicle. This shape change is accompanied by cholesteric ordering of\nthe directors and multiple $\\pi$ walls connecting the membrane edges and\nwrapping around the membrane neck. If the membrane is initialized instead in a\ncylindrical shape and stretched by an external force, it maintains a nearly\ncylindrical shape but additional liquid crystalline phases appear. For large\ntilt coupling and low chirality, a smectic-A phase forms. For lower values of\nthe tilt coupling, a nematic phase appears at zero chirality with the average\ndirector oriented perpendicular to the long axis of the membrane, while for\nnonzero chirality a cholesteric phase appears. The $\\pi$ walls are tilt walls\nat low chirality and transition to twist walls as chirality is increased. We\nconstruct a continuum model of the director field to explain this behavior.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ding","Lijie",""],["Pelcovits","Robert A.",""],["Powers","Thomas R.",""]]}
{"id":"2308.15527","submitter":"Tyler Holland-Ashford","authors":"Tyler Holland-Ashford, Patrick Slane, Laura A. Lopez, Katie Auchettl,\n  Vinay Kashyap","title":"Estimating Ejecta Mass Ratios in Kepler's SNR: Global X-Ray Spectral\n  Analysis Including Suzaku Systematics and Emitting Volume Uncertainties","comments":"25 pages, 12 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The exact origins of many Type Ia supernovae$\\unicode{x2013}$progenitor\nscenarios and explosive mechanisms$\\unicode{x2013}$remain uncertain. In this\nwork, we analyze the global Suzaku X-Ray spectrum of Kepler's supernova remnant\nin order to constrain mass ratios of various ejecta species synthesized during\nexplosion. Critically, we account for the Suzaku telescope effective area\ncalibration uncertainties of 5$\\unicode{x2013}$20% by generating 100 mock\neffective area curves and using Markov Chain Monte Carlo based spectral fitting\nto produce 100 sets of best-fit parameter values. Additionally, we characterize\nthe uncertainties from assumptions made about the emitting volumes of each\nmodel plasma component: finding that these uncertainties can be the dominant\nsource of error. We then compare our calculated mass ratios to previous\nobservational studies of Kepler's SNR and to the predictions of SN Ia\nsimulations. Our mass ratio estimates require a $\\sim$90% attenuated\n$^{12}$C$+^{16}$O reaction rate and are potentially consistent with both near-\nand sub-M$_{\\rm Ch}$ progenitors, but are inconsistent with the dynamically\nstable double detonation origin scenario and only marginally consistent with\nthe dynamically unstable dynamically-driven double-degenerate double detonation\n(D$^6$) scenario.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Holland-Ashford","Tyler",""],["Slane","Patrick",""],["Lopez","Laura A.",""],["Auchettl","Katie",""],["Kashyap","Vinay",""]]}
{"id":"2308.15528","submitter":"Kensuke Gallock-Yoshimura","authors":"Kensuke Gallock-Yoshimura and Vaishant Thakur and Robert B. Mann","title":"Quantum Otto engine driven by quantum fields","comments":"21 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a quantum Otto engine using an Unruh-DeWitt particle detector\nmodel which interacts with a quantum scalar field in curved spacetime. We\nexpress a generic condition for extracting positive work in terms of the\neffective temperature of the detector. This condition reduces to the well-known\npositive work condition in the literature under the circumstances where the\ndetector reaches thermal equilibrium with the field. We then evaluate the\namount of work extracted by the detector in two scenarios: an inertial detector\nin a thermal bath and a circulating detector in the Minkowski vacuum, which is\ninspired by the Unruh quantum Otto engine.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gallock-Yoshimura","Kensuke",""],["Thakur","Vaishant",""],["Mann","Robert B.",""]]}
{"id":"2308.15529","submitter":"Pramod Shukla","authors":"George K. Leontaris, Pramod Shukla","title":"Taxonomy of scalar potential with U-dual fluxes","comments":"51 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the context of $N =1$ four-dimensional type IIB supergravity theories, the\nU-dual completion arguments suggest to include four \"S-dual\" pairs of fluxes in\nthe holomorphic superpotential, namely the so-called $(F, \\, H), \\, (Q, \\, P),\n\\, (P^\\prime, Q^\\prime)$ and $(H^\\prime, \\, F^\\prime)$. These can generically\ninduce cubic polynomials for the complex-structure moduli as well as the\nK\\\"ahler-moduli in the flux superpotential. In this article, we explore the\ninsights of the four-dimensional non-geometric scalar potential in the presence\nof such generalized U-dual fluxes by considering an explicit type IIB toroidal\ncompactification model based on an orientifold of ${\\mathbb T}^6/({\\mathbb Z}_2\n\\times {\\mathbb Z}_2)$ orbifold. First, we observe that the flux superpotential\ninduces a huge scalar potential having a total of 76276 terms involving 128\nflux parameters and 14 real scalars. Subsequently, we invoke a new set of (the\nso-called) \"axionic fluxes\" comprising combinations of the standard fluxes and\nthe RR axions, and it turns out that these axionic fluxes can be very useful in\nrewriting the scalar potential in a relatively compact form. In this regard,\nusing the metric of the compactifying toroidal sixfold, we present a new\nformulation of the effective scalar potential, which might be useful for\nunderstanding the higher-dimensional origin of the various pieces via the\nso-called \"dimensional oxidation\" process. We also discuss the generalized\nBianchi identities and the tadpole cancellation conditions, which can be\nimportant while seeking the physical (AdS/dS) vacua in such models.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Leontaris","George K.",""],["Shukla","Pramod",""]]}
{"id":"2308.15530","submitter":"Michael Zevin","authors":"Michael Zevin, Corey B. Jackson, Zoheyr Doctor, Yunan Wu, Carsten\n  {\\O}sterlund, L. Clifton Johnson, Christopher P. L. Berry, Kevin Crowston,\n  Scott B. Coughlin, Vicky Kalogera, Sharan Banagiri, Derek Davis, Jane\n  Glanzer, Renzhi Hao, Aggelos K. Katsaggelos, Oli Patane, Jennifer Sanchez,\n  Joshua Smith, Siddharth Soni, Laura Trouille, Marissa Walker, Irina Aerith,\n  Wilfried Domainko, Victor-Georges Baranowski, Gerhard Niklasch, Barbara\n  T\\'egl\\'as","title":"Gravity Spy: Lessons Learned and a Path Forward","comments":"32 pages, 5 figures, submitted to European Physical Journal Plus for\n  focus issue on \"Citizen science for physics: From Education and Outreach to\n  Crowdsourcing fundamental research\"","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.IM physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Gravity Spy project aims to uncover the origins of glitches, transient\nbursts of noise that hamper analysis of gravitational-wave data. By using both\nthe work of citizen-science volunteers and machine-learning algorithms, the\nGravity Spy project enables reliable classification of glitches. Citizen\nscience and machine learning are intrinsically coupled within the Gravity Spy\nframework, with machine-learning classifications providing a rapid first-pass\nclassification of the dataset and enabling tiered volunteer training, and\nvolunteer-based classifications verifying the machine classifications,\nbolstering the machine-learning training set and identifying new morphological\nclasses of glitches. These classifications are now routinely used in studies\ncharacterizing the performance of the LIGO gravitational-wave detectors.\nProviding the volunteers with a training framework that teaches them to\nclassify a wide range of glitches, as well as additional tools to aid their\ninvestigations of interesting glitches, empowers them to make discoveries of\nnew classes of glitches. This demonstrates that, when giving suitable support,\nvolunteers can go beyond simple classification tasks to identify new features\nin data at a level comparable to domain experts. The Gravity Spy project is now\nproviding volunteers with more complicated data that includes auxiliary\nmonitors of the detector to identify the root cause of glitches.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zevin","Michael",""],["Jackson","Corey B.",""],["Doctor","Zoheyr",""],["Wu","Yunan",""],["\u00d8sterlund","Carsten",""],["Johnson","L. Clifton",""],["Berry","Christopher P. L.",""],["Crowston","Kevin",""],["Coughlin","Scott B.",""],["Kalogera","Vicky",""],["Banagiri","Sharan",""],["Davis","Derek",""],["Glanzer","Jane",""],["Hao","Renzhi",""],["Katsaggelos","Aggelos K.",""],["Patane","Oli",""],["Sanchez","Jennifer",""],["Smith","Joshua",""],["Soni","Siddharth",""],["Trouille","Laura",""],["Walker","Marissa",""],["Aerith","Irina",""],["Domainko","Wilfried",""],["Baranowski","Victor-Georges",""],["Niklasch","Gerhard",""],["T\u00e9gl\u00e1s","Barbara",""]]}
{"id":"2308.15531","submitter":"Diego Aristizabal","authors":"D. Aristizabal Sierra, S. Gariazzo, A. Villanueva","title":"Non-standard cosmic expansion histories: Neutrino decoupling and\n  primordial nucleosynthesis signatures","comments":"13 pages, 7 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cosmological scenarios with a non-standard equation of state can involve\nultrastiff fluids, understood as primordial fluids for which $p/\\rho> 1$. Their\nenergy densities can dominate the Universe energy budget at early times, in the\notherwise radiation dominated epoch. During that period the Universe undergoes\na faster expansion, that has implications for any decoupling process that takes\nplace in that era. Quintessence models or Ekpyrotic cosmologies are good\nexamples of such scenarios. Assuming the ultrastiff state to be thermally\ndecoupled at very early times, if ever coupled, its observational imprints are\nleft solely in the Universe expansion rate and in the radiation energy density.\nWe consider a complete set of ultrastiff fluids and study their signatures in\nthe neutrino decoupling and BBN eras. Measurements of $N_\\text{eff}$ alone\nplace mild constraints on these scenarios, with forthcoming measurements from\nthe Simons Observatory in the Chilean Atacama desert being able to test regions\nwhere still sizable effects are observable. However, when BBN data is taken\ninto account, those regions are proven to be barely reconcilable with\nprimordial helium-4 and deuterium abundances measurements. Our findings show\nthat measurements of the primordial helium-4 abundance imply the tightest\nconstraints, with measurements of primordial deuterium being -- to a certain\nextent -- competitive as well. We point out that a $\\sim 60\\%$ improvement on\nthe statistical uncertainty of the primordial helium-4 abundance measurement,\nwill test these scenarios in the region where they can produce sizable effects.\nBeyond that precision the regions that are accessible degenerate with standard\nexpectations. In that case, although potentially present, neither neutrino\ndecoupling nor BBN observables will be sensitive probes.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sierra","D. Aristizabal",""],["Gariazzo","S.",""],["Villanueva","A.",""]]}
{"id":"2308.15532","submitter":"Noa Feldman","authors":"Noa Feldman, Niv Davidson, Moshe Goldstein","title":"Information Bounds on phase transitions in disordered systems","comments":"9 pages, 2 figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Information theory, rooted in computer science, and many-body physics, have\ntraditionally been studied as (almost) independent fields. Only recently has\nthis paradigm started to shift, with many-body physics being studied and\ncharacterized using tools developed in information theory. In our work, we\nintroduce a new perspective on this connection, and study phase transitions in\nmodels with randomness, such as localization in disordered systems, or random\nquantum circuits with measurements. Utilizing information-based arguments\nregarding probability distribution differentiation, we bound critical exponents\nin such phase transitions (specifically, those controlling the correlation or\nlocalization lengths). We benchmark our method and rederive the well-known\nHarris criterion, bounding critical exponents in the Anderson localization\ntransition for noninteracting particles, as well as classical disordered spin\nsystems. We then move on to apply our method to many-body localization. While\nin real space our critical exponent bound agrees with recent consensus, we find\nthat, somewhat surprisingly, numerical results on Fock-space localization for\nlimited-sized systems do not obey our bounds, indicating that the simulation\nresults might not hold asymptotically (similarly to what is now believed to\nhave occurred in the real-space problem). We also apply our approach to random\nquantum circuits with random measurements, for which we can derive bounds\ntranscending recent mappings to percolation problems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:07 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Feldman","Noa",""],["Davidson","Niv",""],["Goldstein","Moshe",""]]}
{"id":"2308.15533","submitter":"Valerio Peri","authors":"Valerio Peri, Shahal Ilani, Patrick A. Lee, Gil Refael","title":"Probing quantum spin liquids with a quantum twisting microscope","comments":"18 pages, 3 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":"  The experimental characterization of quantum spin liquids poses significant\nchallenges due to the absence of long-range magnetic order, even at absolute\nzero temperature. The identification of these states of matter often relies on\nthe analysis of their excitations. In this paper, we propose a method for\ndetecting the signatures of the fractionalized excitations in quantum spin\nliquids using a tunneling spectroscopy setup. Inspired by the recent\ndevelopment of the quantum twisting microscope, we consider a planar tunneling\njunction, in which a candidate quantum spin liquid material is placed between\ntwo graphene layers. By tuning the relative twist angle and voltage bias\nbetween the leads, we can extract the dynamical spin structure factor of the\ntunneling barrier with momentum and energy resolution. Our proposal presents a\npromising tool for experimentally characterizing quantum spin liquids in\ntwo-dimensional materials.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Peri","Valerio",""],["Ilani","Shahal",""],["Lee","Patrick A.",""],["Refael","Gil",""]]}
{"id":"2308.15534","submitter":"Akhil Krishna R Mr","authors":"Akhil Krishna R, Sreeja S Kartha, Blesson Mathew, Ujjwal Krishnan,\n  Savithri H Ezhikode and Robin Thomas","title":"DES J024008.08-551047.5: A New Member to the Family of Polar Ring\n  Galaxies","comments":"6 pages, 5 figures, accepted for publication in A&A journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  During the visual observations of optical imaging data obtained from the\nDECaLS, a serendipitous discovery emerged, revealing the presence of a ringed\ngalaxy, DES J024008.08-551047.5 (DJ0240). We performed one dimensional\nisophotal and two dimensional GALFIT analysis to confirm the orthogonal nature\nof the ring galaxy and identify distinct components within the host galaxy. We\ndiscovered the galaxy DJ0240 as a potential PRG candidate with a ring component\npositioned almost perpendicular to the host galaxy. The position angles of the\nring and host components have been determined to be 80 and 10 degrees,\nrespectively, indicating that they are nearly orthogonal to each other. We\nobserved that the ring component extends three times more than the host galaxy\nand shows a distinct color separation, being bluer than the host. The estimated\ng - r color values of host and ring components are 0.86+/-0.02 and 0.59+/-0.10\nmag, respectively. The color value of the ring component is similar to typical\nspiral galaxies. The host galaxy`s color and the presence of a bulge and disk\ncomponents indicate the possibility of the host galaxy being a lenticular type.\nBased on the comparison of photometric properties between the PRGs and other\nring type galaxies (RTGs), our findings reveal a subtle, yet noticeable, color\ndifference between the host and ring components. We observed that both host and\nring components of DJ0240 align more closely with PRGs than with RTGs.\nFurthermore, we compared the sersic index values of the ring component (nring)\nof galaxy DJ0240 with a selected sample of PRGs and Hoag-type galaxies. The\nresults showed DJ0240 had a remarkably low nring value of 0.13, supporting the\ngalaxy`s classification as a PRG. Hence, we suggest that the ring galaxy DJ0240\nis a highly promising candidate for inclusion in the family of PRGs.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["R","Akhil Krishna",""],["Kartha","Sreeja S",""],["Mathew","Blesson",""],["Krishnan","Ujjwal",""],["Ezhikode","Savithri H",""],["Thomas","Robin",""]]}
{"id":"2308.15535","submitter":"Andrew Yuan","authors":"Andrew C. Yuan","title":"Exactly Solvable Model of Randomly Coupled Twisted Superconducting\n  Bilayers","comments":"21 pages (5 main + 16 appendix), 2 figures","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":"  Motivated by recent experiments on twisted junctions of cuprate\nsuperconductors (SC), it was proposed [1] that at zero temperature, a random\nfirst order Josephson coupling $J_1(\\textbf{r}) \\cos \\phi$ generates an\n\"effective\" global second order coupling, $J_2\\cos(2\\phi)$, with a sign that\nfavors $\\phi = \\pm \\pi/2$, i.e., spontaneous breaking of time reversal symmetry\n(TRS). To obtain a more controlled understanding of the suggested\n\"disorder-induced-order\" mechanism, we construct an exactly solvable lattice\nmean field model and prove that when the disorder-average $\\bar{J}_1=0$, the\nmodel exhibits a TRS breaking phase for all temperatures below the SC\ntransition, i.e., $T_c = T_{\\mathrm{TRSB}}$, regardless of the specific form of\ndisorder. In the presence of nonzero $\\bar{J}_1\\ne 0$, we show that the two\ntransitions split linearly for small $\\bar{J}_1 \\ll \\kappa$ (where $\\kappa$ is\nthe in-plane SC stiffness), and that $T_{\\mathrm{TRSB}}$ vanishes for $\\bar\nJ_1> J_c$ where $ J_c= \\overline{J^2_1}/\\kappa$ in the weak disorder limit.\n  [1] A. C. Yuan, Y. Vituri, E. Berg, B. Spivak, and S. A. Kivelson,\nInhomogeneity-induced time-reversal symmetry breaking in cuprate\ntwist-junctions, arXiv preprint arXiv:2305.15472 (2023)\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yuan","Andrew C.",""]]}
{"id":"2308.15536","submitter":"Yuting Xiao","authors":"Yuting Xiao, Jingwei Xu, Zehao Yu, Shenghua Gao","title":"DebSDF: Delving into the Details and Bias of Neural Indoor Scene\n  Reconstruction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, the neural implicit surface has emerged as a powerful\nrepresentation for multi-view surface reconstruction due to its simplicity and\nstate-of-the-art performance. However, reconstructing smooth and detailed\nsurfaces in indoor scenes from multi-view images presents unique challenges.\nIndoor scenes typically contain large texture-less regions, making the\nphotometric loss unreliable for optimizing the implicit surface. Previous work\nutilizes monocular geometry priors to improve the reconstruction in indoor\nscenes. However, monocular priors often contain substantial errors in thin\nstructure regions due to domain gaps and the inherent inconsistencies when\nderived independently from different views. This paper presents \\textbf{DebSDF}\nto address these challenges, focusing on the utilization of uncertainty in\nmonocular priors and the bias in SDF-based volume rendering. We propose an\nuncertainty modeling technique that associates larger uncertainties with larger\nerrors in the monocular priors. High-uncertainty priors are then excluded from\noptimization to prevent bias. This uncertainty measure also informs an\nimportance-guided ray sampling and adaptive smoothness regularization,\nenhancing the learning of fine structures. We further introduce a bias-aware\nsigned distance function to density transformation that takes into account the\ncurvature and the angle between the view direction and the SDF normals to\nreconstruct fine details better. Our approach has been validated through\nextensive experiments on several challenging datasets, demonstrating improved\nqualitative and quantitative results in reconstructing thin structures in\nindoor scenes, thereby outperforming previous work.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xiao","Yuting",""],["Xu","Jingwei",""],["Yu","Zehao",""],["Gao","Shenghua",""]]}
{"id":"2308.15537","submitter":"Robin Thomas","authors":"Thomas Robin, Sreeja S Kartha, Ujjwal Krishnan, Kanak Saha, Viral\n  Parekh, Koshy George, Blesson Mathew","title":"What drives the wheels of evolution in NGC 1512? A UVIT study","comments":"8 pages, 4 figures, accepted for publication in Astronomy and\n  Astrophyics journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Environmental and secular processes play a pivotal role in the evolution of\ngalaxies. These can be due to external processes such as interactions or\ninternal processes due to the action of bar, bulge and spiral structures.\nOngoing star formation in spiral galaxies can be affected by these processes.\nStudying the star formation in the galaxy can give insights into the evolution\nof the galaxy. The ongoing interaction between barred-spiral galaxy NGC 1512\nand its satellite NGC 1510 offers an opportunity to investigate how galactic\ninteractions and the presence of a galactic bar influence the evolution of NGC\n1512. We aim to understand the recent star formation activity in the galaxy\npair and thus gain insight into the evolution of NGC 1512. The UltraViolet\nImaging Telescope (UVIT) onboard AstroSat enables us to study the star-forming\nregions in the galaxy with a spatial resolution of ~85 pc in the galaxy rest\nframe. We identified and studied 175 star-forming regions in UVIT FUV image of\nNGC 1512 and correlated with the neutral hydrogen (HI) distribution. We\ndetected localized regions of star formation enhancement and distortions in the\ngalactic disk. This is consistent with HI distribution in the galaxy. This is\nevidence of past and ongoing interactions affecting the star formation\nproperties of the galaxy. We studied the properties of the inner ring. We find\nthat the regions of the inner ring show maximum star formation rate density\n(log(SFRDmean[Msolaryr-1kpc-2]) ~ -1.7) near the major axis of the bar, hinting\nat a possible crowding effect in these regions. The region of the bar in the\ngalaxy is also depleted of UV emission. This absence suggests that the galactic\nbar played an active role in the redistribution of gas and quenching of star\nformation inside identified bar region. Hence, we suggest that both the secular\nand environmental factors might influence the evolution of NGC 1512.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:00:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Robin","Thomas",""],["Kartha","Sreeja S",""],["Krishnan","Ujjwal",""],["Saha","Kanak",""],["Parekh","Viral",""],["George","Koshy",""],["Mathew","Blesson",""]]}
{"id":"2308.15538","submitter":"Fei Xu","authors":"Fei Xu and Dan Hooper","title":"The Dark Matter Discovery Potential of the Advanced\n  Particle-Astrophysics Telescope (APT)","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.CO astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gamma-ray observations of Milky Way dwarf galaxies have been used to place\nstringent constraints on the dark matter's annihilation cross section. In this\npaper, we evaluate the sensitivity of the proposed Advanced\nParticle-astrophysics Telescope (APT) to dark matter in these systems, finding\nthat such an instrument would be capable of constraining thermal relics with\nmasses as large as $m_X\\sim 600 \\, {\\rm GeV}$. Furthermore, in dark matter\nscenarios motivated by the observed Galactic Center Gamma-Ray Excess, we\npredict that APT would detect several dwarf galaxies with high-significance.\nSuch observations could be used to test the predicted proportionality between\nthe gamma-ray fluxes and $J$-factors of individual dwarf galaxies, providing us\nwith an unambiguous test of the origin of the Galactic Center Excess.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:01:07 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xu","Fei",""],["Hooper","Dan",""]]}
{"id":"2308.15539","submitter":"Suhas Ganjam","authors":"Suhas Ganjam, Yanhao Wang, Yao Lu, Archan Banerjee, Chan U Lei, Lev\n  Krayzman, Kim Kisslinger, Chenyu Zhou, Ruoshui Li, Yichen Jia, Mingzhao Liu,\n  Luigi Frunzio, Robert J. Schoelkopf","title":"Surpassing millisecond coherence times in on-chip superconducting\n  quantum memories by optimizing materials, processes, and circuit design","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The performance of superconducting quantum circuits for quantum computing has\nadvanced tremendously in recent decades; however, a comprehensive understanding\nof relaxation mechanisms does not yet exist. In this work, we utilize a\nmultimode approach to characterizing energy losses in superconducting quantum\ncircuits, with the goals of predicting device performance and improving\ncoherence through materials, process, and circuit design optimization. Using\nthis approach, we measure significant reductions in surface and bulk dielectric\nlosses by employing a tantalum-based materials platform and annealed sapphire\nsubstrates. With this knowledge we predict and experimentally verify the\nrelaxation times of aluminum- and tantalum-based transmon qubits. We\nadditionally optimize device geometry to maximize coherence within a coaxial\ntunnel architecture, and realize on-chip quantum memories with single-photon\nRamsey times of 2.0$-$2.7 ms, limited by their energy relaxation times of\n1.0$-$1.4 ms. To our knowledge this is the highest coherence achieved in an\non-chip quantum memory, and demonstrates an advancement towards a more modular\nand compact coaxial circuit architecture for bosonic qubits with reproducibly\nhigh coherence.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:01:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ganjam","Suhas",""],["Wang","Yanhao",""],["Lu","Yao",""],["Banerjee","Archan",""],["Lei","Chan U",""],["Krayzman","Lev",""],["Kisslinger","Kim",""],["Zhou","Chenyu",""],["Li","Ruoshui",""],["Jia","Yichen",""],["Liu","Mingzhao",""],["Frunzio","Luigi",""],["Schoelkopf","Robert J.",""]]}
{"id":"2308.15540","submitter":"Abhisek Samanta","authors":"Abhisek Samanta, Itay Mangel, Amit Keren, Daniel P. Arovas and Assa\n  Auerbach","title":"The two critical temperatures conundrum in\n  La$_{1.875}$Sr$_{0.125}$CuO$_4$","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":"  The in-plane and out-of-plane components of the stiffness tensor in LSCO,\nshow different transition temperatures, with strong variations of the\ninterplane stiffness on sample width. Disorder and critical finite size\ncorrections are too small to explain these effects. With evidence from Monte\nCarlo simulations, we show that due to the high anisotropy, a three dimensional\nsample approaching the transition temperature $T_c$ acts as a quasi one\ndimensional Josephson array. As such, the interplane stiffness exhibits an\nessential singularity $\\sim \\exp(-A/|T-T_c|^{2\\beta})$. At finite experimental\nor numerical resolution, the interplane stiffness always appears to vanish at a\nlower temperature than the in-plane stiffness. An analogy to studies of helium\nsuperfluids in nanopores is made.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:01:13 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 16:31:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Samanta","Abhisek",""],["Mangel","Itay",""],["Keren","Amit",""],["Arovas","Daniel P.",""],["Auerbach","Assa",""]]}
{"id":"2308.15541","submitter":"Daniel Mu\\~noz-Segovia","authors":"Daniel Mu\\~noz-Segovia, J\\\"orn W. F. Venderbos, Adolfo G. Grushin,\n  Fernando de Juan","title":"Nematic and stripe orders within the charge density wave state of doped\n  TiSe$_2$","comments":"7+9 pages, 4+2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we present a theory to reconcile conflicting experimental\nclaims regarding the charge density wave (CDW) state in TiSe$_2$, including\nwhether there is a single or multiple CDW transitions and the occasional\nobservation of rotation symmetry breaking. Using a\n$\\boldsymbol{k}\\cdot\\boldsymbol{p}$ model coupled to the CDW order parameter,\nwe show how commonplace conduction band doping $x$ must cause a transition from\nthe $C_3$-symmetric $3Q$ state to a $C_3$-breaking $1Q$ stripe state at a\ncritical doping $x_{1Q}$. In addition, for sufficient ellipticity of the\nconduction bands, as displayed by the realistic band stucture of TiSe$_2$, a\nnew nematic $3Q$ state also emerges in a region with $x < x_{1Q}$. We then show\nhow both stripe and nematic states emerge from a minimal interacting\ntight-binding model, for both positive and negative initial gaps. Our theory\nclarifies a long-standing puzzle and its predictions can be verified with a\nvariety of probes including transport, photoemission and tunneling.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:01:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mu\u00f1oz-Segovia","Daniel",""],["Venderbos","J\u00f6rn W. F.",""],["Grushin","Adolfo G.",""],["de Juan","Fernando",""]]}
{"id":"2308.15542","submitter":"Amir Burshtein","authors":"Amir Burshtein and Moshe Goldstein","title":"Inelastic decay from integrability","comments":"36 pages, 5 figures. See also a paper by M. Houzet, T. Yamamoto and\n  L. I. Glazman on the same arXiv posting","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall cond-mat.str-el hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A hallmark of integrable systems is the purely elastic scattering of their\nexcitations. Such systems posses an extensive number of locally conserved\ncharges, leading to the conservation of the number of scattered excitations, as\nwell as their set of individual momenta. In this work, we show that inelastic\ndecay can nevertheless be observed in circuit QED realizations of integrable\nboundary models. We consider the scattering of microwave photons off impurities\nin superconducting circuits implementing the boundary sine-Gordon and Kondo\nmodels, which are both integrable. We show that not only inelastic decay is\npossible for the microwave photons, in spite of integrability, and thanks to a\nnonlinear relation between them and the elastically-scattered excitations, but\nalso that integrability in fact provides powerful analytical tools allowing to\nobtain exact expressions for response functions describing the inelastic decay.\nUsing the framework of form factors, we calculate the total inelastic decay\nrate and elastic phase shift of the microwave photons, extracted from a 2-point\nresponse function. We then go beyond linear response and obtain the exact\nenergy-resolved inelastic decay spectrum, using a novel method to evaluate form\nfactor expansions of 3-point response functions, which could prove useful in\nother applications of integrable quantum field theories. We relate our results\nto several recent photon splitting experiments, and in particular to recent\nexperimental data that provides evidence for the elusive Schmid-Bulgadaev\ndissipative quantum phase transition.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:02:13 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Burshtein","Amir",""],["Goldstein","Moshe",""]]}
{"id":"2308.15543","submitter":"Adam Gonzalez","authors":"Adam G. Gonzalez, Luigi C. Gallo, Jon M. Miller, Elias S. Kammoun,\n  Akshay Ghosh, Ben A. Pottie","title":"Characterizing X-ray, UV, and optical variability in NGC 6814 using\n  high-cadence Swift observations from a 2022 monitoring campaign","comments":"11 pages, 7 figures, 4 tables, 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":"  We present the first results of a high-cadence Swift monitoring campaign\n($3-4$ visits per day for $75$ days) of the Seyfert 1.5 galaxy NGC 6814\ncharacterizing its variability throughout the X-ray and UV/optical wavebands.\nStructure function analysis reveals an X-ray power law\n($\\alpha=0.5^{+0.2}_{-0.1}$) that is significantly flatter than the one\nmeasured in the UV/optical bands ($\\langle\\alpha\\rangle\\approx1.5$), suggesting\ndifferent physical mechanisms driving the observed variability in each emission\nregion. The structure function break-time is consistent across the UV/optical\nbands ($\\langle\\tau\\rangle\\approx2.3~\\mathrm{d}$), suggesting a very compact\nemission region in the disc. Correlated short time-scale variability measured\nthrough cross-correlation analysis finds a lag-wavelength spectrum that is\ninconsistent with a standard disc reprocessing scenario\n($\\tau\\propto\\lambda^{4/3}$) due to significant flattening in the optical\nwavebands. Flux-flux analysis finds an extremely blue AGN spectral component\n($F_{\\nu}\\propto\\lambda^{-0.85}$) that does not follow a standard accretion\ndisc profile ($F_{\\nu}\\propto\\lambda^{-1/3}$). While extreme outer disc\ntruncation ($R_{\\mathrm{out}}=202\\pm5~r_g$) at a standard accretion rate\n($\\dot{m}_{\\mathrm{Edd}}=0.0255\\pm0.0006$) may explain the shape of the AGN\nspectral component, the lag-wavelength spectrum requires more modest truncation\n($R_{\\mathrm{out}}=1,382^{+398}_{-404}~r_g$) at an extreme accretion rate\n($\\dot{m}_{\\mathrm{Edd}}=1.3^{+2.1}_{-0.9}$). No combination of parameters can\nsimultaneously explain both results in a self-consistent way. Our results offer\nthe first evidence of a non-standard accretion disc in NGC 6814.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:02:58 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gonzalez","Adam G.",""],["Gallo","Luigi C.",""],["Miller","Jon M.",""],["Kammoun","Elias S.",""],["Ghosh","Akshay",""],["Pottie","Ben A.",""]]}
{"id":"2308.15544","submitter":"Lukas Antoniuk","authors":"Lukas Antoniuk, Niklas Lettner, Anna P. Ovvyan, Simon Haugg, Marco\n  Klotz, Helge Gehring, Daniel Wendland, Viatcheslav N. Agafonov, Wolfram H. P.\n  Pernice and Alexander Kubanek","title":"All-Optical Spin Initialization via a Cavity Broadened Optical\n  Transition in On-Chip Hybrid Quantum Photonics","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hybrid quantum photonic systems connect classical photonics to the quantum\nworld and promise to deliver efficient light-matter quantum interfaces while\nleveraging the advantages of both, the classical and the quantum, subsystems.\nHowever, combining efficient, scalable photonics and solid state quantum\nsystems with desirable optical and spin properties remains a formidable\nchallenge. In particular the access to individual spin states and coherent\nmapping to photons remains unsolved for these systems. In this letter, we\ndemonstrate all-optical initialization and readout of the electronic spin of a\nnegatively-charged silicon-vacancy center in a nanodiamond coupled to a silicon\nnitride photonic crystal cavity. We characterize relevant parameters of the\ncoupled emitter-cavity system and determine the silicon-vacancy center's\nspin-relaxation and spin-decoherence rate. Our results mark an important step\ntowards the realization of a hybrid spin-photon interface based on silicon\nnitride photonics and the silicon-vacancy center's electron spin in\nnanodiamonds with potential use for quantum networks, quantum communication and\ndistributed quantum computation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:03:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Antoniuk","Lukas",""],["Lettner","Niklas",""],["Ovvyan","Anna P.",""],["Haugg","Simon",""],["Klotz","Marco",""],["Gehring","Helge",""],["Wendland","Daniel",""],["Agafonov","Viatcheslav N.",""],["Pernice","Wolfram H. P.",""],["Kubanek","Alexander",""]]}
{"id":"2308.15545","submitter":"Vladimir Skokov","authors":"Alex Kovner, Michael Lublinsky, Vladimir V. Skokov, Zichen Zhao","title":"Not all that is $\\beta_0$ is $\\beta$-function: the DGLAP resummation and\n  the running coupling in NLO JIMWLK","comments":"43 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We reanalyze the origin of the large transverse logarithms associated with\nthe QCD one loop beta-function coefficient in the NLO JIMWLK Hamiltonian. We\nshow that some of these terms are not associated with the running of the QCD\ncoupling constant but rather with the DGLAP evolution. The DGLAP-like\nresummation of these logarithms is mandatory within the JIMWLK Hamiltonian, as\nlong as the color correlation length in the projectile is larger than that in\nthe target. This regime in fact covers the whole range of rapidities at which\nJIMWLK evolution is supposed to be applicable. We derive the RG equation that\nresums these logarithms to all orders in alpha_s in the JIMWLK Hamiltonian.\nThis is a nonlinear equation for the eikonal scattering matrix S(x). We solve\nthis equation and perform the DGLAP resummation in two simple cases: the dilute\nlimit, where both the projectile and the target are far from saturation, and\nthe saturated regime, where the target correlation length also determines its\nsaturation momentum.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:08:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kovner","Alex",""],["Lublinsky","Michael",""],["Skokov","Vladimir V.",""],["Zhao","Zichen",""]]}
{"id":"2308.15546","submitter":"Tanmay Inamdar","authors":"Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana","title":"FPT Approximation and Subexponential Algorithms for Covering Few or Many\n  Edges","comments":"Updated version of MFCS 2023 paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the \\textsc{$\\alpha$-Fixed Cardinality Graph Partitioning\n($\\alpha$-FCGP)} problem, the generic local graph partitioning problem\nintroduced by Bonnet et al. [Algorithmica 2015]. In this problem, we are given\na graph $G$, two numbers $k,p$ and $0\\leq\\alpha\\leq 1$, the question is whether\nthere is a set $S\\subseteq V$ of size $k$ with a specified coverage function\n$cov_{\\alpha}(S)$ at least $p$ (or at most $p$ for the minimization version).\nThe coverage function $cov_{\\alpha}(\\cdot)$ counts edges with exactly one\nendpoint in $S$ with weight $\\alpha$ and edges with both endpoints in $S$ with\nweight $1 - \\alpha$. $\\alpha$-FCGP generalizes a number of fundamental graph\nproblems such as \\textsc{Densest $k$-Subgraph}, \\textsc{Max $k$-Vertex Cover},\nand \\textsc{Max $(k,n-k)$-Cut}.\n  A natural question in the study of $\\alpha$-FCGP is whether the algorithmic\nresults known for its special cases, like \\textsc{Max $k$-Vertex Cover}, could\nbe extended to more general settings. One of the simple but powerful methods\nfor obtaining parameterized approximation [Manurangsi, SOSA 2019] and\nsubexponential algorithms [Fomin et al. IPL 2011] for \\textsc{Max $k$-Vertex\nCover} is based on the greedy vertex degree orderings. The main insight of our\nwork is that the idea of greed vertex degree ordering could be used to design\nfixed-parameter approximation schemes (FPT-AS) for $\\alpha > 0$ and the\nsubexponential-time algorithms for the problem on apex-minor free graphs for\nmaximization with $\\alpha > 1/3$ and minimization with $\\alpha < 1/3$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:11:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fomin","Fedor V.",""],["Golovach","Petr A.",""],["Inamdar","Tanmay",""],["Koana","Tomohiro",""]]}
{"id":"2308.15547","submitter":"Shilei Sun","authors":"Shilei Sun, Ming Liu, Zhongyi Fan, Yuxue Liu, Chengwei Lv, Liquan\n  Dong, Lingqin Kong (Beijing Institute of Technology, China)","title":"Efficient Ray Sampling for Radiance Fields Reconstruction","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accelerating neural radiance fields training is of substantial practical\nvalue, as the ray sampling strategy profoundly impacts network convergence.\nMore efficient ray sampling can thus directly enhance existing NeRF models'\ntraining efficiency. We therefore propose a novel ray sampling approach for\nneural radiance fields that improves training efficiency while retaining\nphotorealistic rendering results. First, we analyze the relationship between\nthe pixel loss distribution of sampled rays and rendering quality. This reveals\nredundancy in the original NeRF's uniform ray sampling. Guided by this finding,\nwe develop a sampling method leveraging pixel regions and depth boundaries. Our\nmain idea is to sample fewer rays in training views, yet with each ray more\ninformative for scene fitting. Sampling probability increases in pixel areas\nexhibiting significant color and depth variation, greatly reducing wasteful\nrays from other regions without sacrificing precision. Through this method, not\nonly can the convergence of the network be accelerated, but the spatial\ngeometry of a scene can also be perceived more accurately. Rendering outputs\nare enhanced, especially for texture-complex regions. Experiments demonstrate\nthat our method significantly outperforms state-of-the-art techniques on public\nbenchmark datasets.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:11:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sun","Shilei","","Beijing Institute of Technology, China"],["Liu","Ming","","Beijing Institute of Technology, China"],["Fan","Zhongyi","","Beijing Institute of Technology, China"],["Liu","Yuxue","","Beijing Institute of Technology, China"],["Lv","Chengwei","","Beijing Institute of Technology, China"],["Dong","Liquan","","Beijing Institute of Technology, China"],["Kong","Lingqin","","Beijing Institute of Technology, China"]]}
{"id":"2308.15548","submitter":"Carolina Da Silva Bourdot Dutra","authors":"Carolina Bourdot Dutra and Elia Merzari","title":"Study on Laminar-Turbulent Transition in Square Arrayed Rod Bundles","comments":"ICONE-28","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The study of coolant flow behavior in rod bundles is of relevance to the\ndesign of nuclear reactors. Although laminar and turbulent flows have been\nresearched extensively, there are still gaps in understanding the process of\nlaminar-turbulent transition. Such a process may involve the formation of a gap\nvortex street as the consequence of a related linear instability. In the\npresent work, a parametric study was performed to analyze the spatially\ndeveloping turbulence in a simplified geometry setting. The geometry includes\ntwo square arrayed rod bundle subchannels with periodic boundary conditions in\nthe cross-section. The pitch-to-diameter ratios range from 1.05 to 1.20, and\nthe length of the domain was selected to be 100 diameters. No-slip condition at\nthe wall, and inlet-outlet configuration were employed. Then, to investigate\nthe stability of the flow, the Reynolds number was varied from 250 to 3000. The\nsimulations were carried out using the spectral-element code Nek5000, with a\nDirect Numerical Simulation (DNS) approach. Data were analyzed to examine this\nSpatio-temporal developing instability. In particular, we evaluate the location\nof onset and spatial growth of the instability.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:12:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dutra","Carolina Bourdot",""],["Merzari","Elia",""]]}
{"id":"2308.15549","submitter":"Dayu Sun","authors":"Dayu Sun, Zhuowei Sun, Xingqiu Zhao and Hongyuan Cao","title":"Kernel meets sieve: transformed hazards models with sparse longitudinal\n  covariates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.TH","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We study the transformed hazards model with intermittently observed\ntime-dependent covariates for the censored outcome. Existing work assumes the\navailability of the whole trajectory of the time-dependent covariates, which is\nnot realistic. We propose to combine kernel-weighted log-likelihood and sieve\nmaximum log-likelihood estimation to conduct statistical inference. The method\nis robust and easy to implement. We establish the asymptotic properties of the\nproposed estimator and contribute to a rigorous theoretical framework for\ngeneral kernel-weighted sieve M-estimators. Numerical studies corroborate our\ntheoretical results and show that the proposed method has favorable performance\nover existing methods. An application to a COVID-19 study in Wuhan illustrates\nthe practical utility of our method.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:15:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sun","Dayu",""],["Sun","Zhuowei",""],["Zhao","Xingqiu",""],["Cao","Hongyuan",""]]}
{"id":"2308.15550","submitter":"Md Masudur Rahman","authors":"Md Masudur Rahman and Yexiang Xue","title":"Adversarial Style Transfer for Robust Policy Optimization in Deep\n  Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes an algorithm that aims to improve generalization for\nreinforcement learning agents by removing overfitting to confounding features.\nOur approach consists of a max-min game theoretic objective. A generator\ntransfers the style of observation during reinforcement learning. An additional\ngoal of the generator is to perturb the observation, which maximizes the\nagent's probability of taking a different action. In contrast, a policy network\nupdates its parameters to minimize the effect of such perturbations, thus\nstaying robust while maximizing the expected future reward. Based on this\nsetup, we propose a practical deep reinforcement learning algorithm,\nAdversarial Robust Policy Optimization (ARPO), to find a robust policy that\ngeneralizes to unseen environments. We evaluate our approach on Procgen and\nDistracting Control Suite for generalization and sample efficiency.\nEmpirically, ARPO shows improved performance compared to a few baseline\nalgorithms, including data augmentation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:17:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rahman","Md Masudur",""],["Xue","Yexiang",""]]}
{"id":"2308.15551","submitter":"Mallory Molina","authors":"M. Molina (1,2,3), L. Duffy (4), M. Eracleous (4), M. Ogborn (4), M.\n  E. Kaldor (4), R. Yan (5), C. Gronwall (4), R. Ciardullo (4), N. Ajgaonkar\n  (5,6) (1 Montana State, 2 U of Utah, 3 Vanderbilt U, 4 Penn State, 5 U of\n  Kentucky, 6 Intel Corp)","title":"The New Swift/UVOT+MaNGA (SwiM) Value-added Catalog","comments":"Accepted to ApJS Aug 15, 2023. arXiv admin note: text overlap with\n  arXiv:2007.08541","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the the new Swift/UVOT+MaNGA (SwiM) catalog (SwiM_v4.1). SwiM_v4.1\nis designed to study star-formation and dust attenuation within nearby galaxies\ngiven the unique overlap of Swift/UVOT near-ultraviolet (NUV) imaging and MaNGA\nintegral field optical spectroscopy. SwiM_v4.1 comprises 559 objects, ~4 times\nmore than the original SwiM catalog (SwiM_v3.1), spans a redshift range\nz~0.0002-0.1482, and provides a more diverse and rich sample. Approximately 5%\nof the final MaNGA sample is included in SwiM_v4.1, and 42% of the SwiM_v4.1\ngalaxies are cross-listed with other well-known catalogs. We present the same\ndata as SwiM_v3.1, including UVOT images, SDSS images and MaNGA emission-line\nand spectral index maps with the same pixel size and angular resolution for\neach galaxy, and a file containing galaxy and observational properties. We\ndesigned SwiM_v4.1 to be unbiased, which resulted in some objects having low\nsignal-to-noise ratios in their MaNGA or Swift data. We addressed this by\nproviding a new file containing the fraction of science-ready pixels in each\nMaNGA emission-line map, and the integrated flux and inverse variance for all\nthree NUV filters. The uniform angular resolution and sampling in SwiM_v4.1\nwill help answer a number of scientific questions, including constraining\nquenching and attenuation in the local Universe and studying the effects of\nblack hole feedback. The galaxy maps, catalog files, and their associated data\nmodels are publicly released on the SDSS website:\nhttps://www.sdss4.org/dr17/data_access/value-added-catalogs/?vac_id=swift-manga-value-added-catalog.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:18:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Molina","M.",""],["Duffy","L.",""],["Eracleous","M.",""],["Ogborn","M.",""],["Kaldor","M. E.",""],["Yan","R.",""],["Gronwall","C.",""],["Ciardullo","R.",""],["Ajgaonkar","N.",""]]}
{"id":"2308.15552","submitter":"Riccardo Poiani","authors":"Riccardo Poiani, Alberto Maria Metelli, Marcello Restelli","title":"Pure Exploration under Mediators' Feedback","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Stochastic multi-armed bandits are a sequential-decision-making framework,\nwhere, at each interaction step, the learner selects an arm and observes a\nstochastic reward. Within the context of best-arm identification (BAI)\nproblems, the goal of the agent lies in finding the optimal arm, i.e., the one\nwith highest expected reward, as accurately and efficiently as possible.\nNevertheless, the sequential interaction protocol of classical BAI problems,\nwhere the agent has complete control over the arm being pulled at each round,\ndoes not effectively model several decision-making problems of interest (e.g.,\noff-policy learning, partially controllable environments, and human feedback).\nFor this reason, in this work, we propose a novel strict generalization of the\nclassical BAI problem that we refer to as best-arm identification under\nmediators' feedback (BAI-MF). More specifically, we consider the scenario in\nwhich the learner has access to a set of mediators, each of which selects the\narms on the agent's behalf according to a stochastic and possibly unknown\npolicy. The mediator, then, communicates back to the agent the pulled arm\ntogether with the observed reward. In this setting, the agent's goal lies in\nsequentially choosing which mediator to query to identify with high probability\nthe optimal arm while minimizing the identification time, i.e., the sample\ncomplexity. To this end, we first derive and analyze a statistical lower bound\non the sample complexity specific to our general mediator feedback scenario.\nThen, we propose a sequential decision-making strategy for discovering the best\narm under the assumption that the mediators' policies are known to the learner.\nAs our theory verifies, this algorithm matches the lower bound both almost\nsurely and in expectation. Finally, we extend these results to cases where the\nmediators' policies are unknown to the learner obtaining comparable results.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:18:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Poiani","Riccardo",""],["Metelli","Alberto Maria",""],["Restelli","Marcello",""]]}
{"id":"2308.15553","submitter":"Tendai Mapungwana Chikake","authors":"Tendai Mapungwana Chikake and Boris Goldengorin","title":"Dimensionality Reduction Using pseudo-Boolean polynomials For Cluster\n  Analysis","comments":"14 pages, 4 figures, submitted to the International Conference Data\n  Analysis, Optimization and Their Applications on the Occasion of Boris\n  Mirkin's 80th Birthday January 30-31, 2023, Dolgoprudny, Moscow Region,\n  Moscow Institute of Physics and Technology\n  https://mipt.ru/education/chairs/dm/conferences/data-analysis-optimization-and-their-applications-2023.php","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We introduce usage of a reduction property of penalty-based formulation of\npseudo-Boolean polynomials as a mechanism for invariant dimensionality\nreduction in cluster analysis processes. In our experiments, we show that\nmultidimensional data, like 4-dimensional Iris Flower dataset can be reduced to\n2-dimensional space while the 30-dimensional Wisconsin Diagnostic Breast Cancer\n(WDBC) dataset can be reduced to 3-dimensional space, and by searching lines or\nplanes that lie between reduced samples we can extract clusters in a linear and\nunbiased manner with competitive accuracies, reproducibility and clear\ninterpretation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:19:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chikake","Tendai Mapungwana",""],["Goldengorin","Boris",""]]}
{"id":"2308.15554","submitter":"Muhammad Rizwan Akram","authors":"Muhammad Rizwan Akram and Abbas Semnani","title":"A Microwave Anapole Source Based on Electric Dipole Interactions Over a\n  Low-Index Dielectric","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The pursuit of non-radiating sources and radiation-less motion for\naccelerated charged particles has captivated physicists for generations.\nNon-radiating sources represent intricate current charge configurations that do\nnot emit radiation beyond their source domain. In this study, we investigate a\nsingle non-radiating source, comprising a low-index dielectric disk excited by\na split ring resonator. Employing analytical and numerical methods, we\ndemonstrate that this configuration supports an anapole state, exhibiting\nminimal or no radiation, effectively representing a non-radiating source. The\nradiation suppression is accomplished through the destructive interference of\nelectric dipoles excited on the metallic and dielectric components of the\nproposed prototype. Transforming the design into a cost-effective device\ncapable of suppressing radiation, we achieve impressive numerical and\nexperimental agreement, affirming the formation of the anapole state using the\nlowest order multi-poles. Moreover, the devised anapole device is remarkably\ncompact, constructed from a low-index dielectric, and employs readily available\ncomponents. As a versatile platform, the proposed device can spearhead anapole\nresearch for diverse applications, including sensing, wireless charging, RFID\ntags, and other non-linear applications.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:19:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Akram","Muhammad Rizwan",""],["Semnani","Abbas",""]]}
{"id":"2308.15555","submitter":"Robert-Jan Slager","authors":"Zory Davoyan, Wojciech J. Jankowski, Adrien Bouhon, Robert-Jan Slager","title":"$\\mathcal{P}\\mathcal{T}$-symmetric topological phases with Pontryagin\n  index in three spatial dimensions","comments":"16+3 pages, 7+1 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on a certain class of three-dimensional topological insulators and\nsemimetals protected by spinless $\\mathcal{P}\\mathcal{T}$ symmetry, hosting an\ninteger-valued bulk invariant. We show using homotopy arguments that these\nphases host multi-gap topology, providing a realization of a single\n$\\mathbb{Z}$ invariant in three spatial dimensions that is distinct from the\nHopf index. We identify this invariant with the Pontryagin index, which\ndescribes BPST instantons in particle physics contexts and corresponds to a\n3-sphere winding number. We study naturally arising multi-gap linked nodal\nrings, topologically characterized by split-biquaternion charges, which can be\nremoved by non-Abelian braiding of nodal rings, even without closing a gap. We\nadditionally connect the describing winding number in terms of gauge-invariant\ncombinations of non-Abelian Berry connection elements, indicating relations to\nPontryagin characteristic class in four dimensions. These topological\nconfigurations are furthermore related to fully non-degenerate multi-gap phases\nthat are characterized by a pair of winding numbers relating to two isoclinic\nrotations in the case of four bands and can be generalized to an arbitrary\nnumber of bands. From a physical perspective, we also analyze the edge states\ncorresponding to this Pontryagin index as well as their dissolution subject to\nthe gap-closing disorder. Finally, we elaborate on the realization of these\nnovel non-Abelian phases, their edge states and linked nodal structures in\nacoustic metamaterials and trapped-ion experiments.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:21:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Davoyan","Zory",""],["Jankowski","Wojciech J.",""],["Bouhon","Adrien",""],["Slager","Robert-Jan",""]]}
{"id":"2308.15556","submitter":"Suyash Fulay","authors":"Suyash Fulay and Deb Roy","title":"Polarized Speech on Online Platforms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  While political polarization has increased as measured through surveys,\ncurrently we lack comprehensive, longitudinal, and ecologically valid\nmeasurement of the polarization of online political speech that spans social\nmedia platforms. Using language models, we analyze ~2.5 billion comments on\nReddit and Twitter across ~1.7 million accounts from 2007-2023 and find that\npolarized speech has been rising on both platforms since their inception, with\noutgroup polarization levels higher on Twitter than Reddit. On Twitter, while\nU.S. politicians on the left have been consistently more polarized than\neveryday users, politicians on the right experienced the highest growth in\npolarization, overtaking journalists, media, and everyday users over the past\nfour years. Today, politicians, the group listened to the most for their\npolitical rhetoric, are far more polarized than everyday users. Additionally,\nwhile polarized speech is typically lower for accounts with more followers,\nright-leaning political influencers are an exception to this trend, which may\ninfluence perceptions of polarization on the left versus the right.\nPolarization is more diffuse across users on Twitter than on Reddit, where it\nis localized to a few communities. Polarization also varies by topic, with\nright-leaning users twice as likely to use polarized rhetoric about immigration\nas left-leaning users while left-leaning users are somewhat more likely to be\npolarized around healthcare. Our large-scale analysis reveals previously\nunknown patterns of polarization across platforms, groups, and topics that will\nhelp us better contextualize polarized content and potentially intervene to\nreduce it.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:22:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fulay","Suyash",""],["Roy","Deb",""]]}
{"id":"2308.15557","submitter":"Tendai Mapungwana Chikake","authors":"Tendai Mapungwana Chikake, Boris Goldengorin","title":"A Pseudo-Boolean Polynomials Approach for Image Edge Detection","comments":"8 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.DM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We introduce a novel approach for image edge detection based on\npseudo-Boolean polynomials for image patches. We show that patches covering\nedge regions in the image result in pseudo-Boolean polynomials with higher\ndegrees compared to patches that cover blob regions. The proposed approach is\nbased on reduction of polynomial degree and equivalence properties of\npenalty-based pseudo-Boolean polynomials.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:24:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chikake","Tendai Mapungwana",""],["Goldengorin","Boris",""]]}
{"id":"2308.15558","submitter":"Shintaro Minagawa","authors":"Shintaro Minagawa, Kenta Sakai, Kohtaro Kato, Francesco Buscemi","title":"The second law of information thermodynamics for general quantum\n  measurement processes","comments":"21 pages, 2 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":"  Feedback control protocols have often been considered as a model to embody\nand study Maxwell's demon paradox and the interplay between thermodynamics and\ninformation processing. Such studies have led to the conclusion, now widely\naccepted in the community, that Maxwell's demon and thermodynamics can\npeacefully coexist because any gain provided by the demon must be offset by the\ncost of performing the measurement and resetting the demon's memory to its\ninitial state. Statements of this kind are collectively referred to as the\nsecond law of information thermodynamics. However, previous studies in this\ndirection made several assumptions, thus obtaining a second law of information\nthermodynamics that is not universally applicable and whose range of validity\nis not clear. In this work, we fill this gap by providing necessary and\nsufficient conditions for the validity of the second law inequalities and\nformulate a generalized second law of information thermodynamics. The\ngeneralized second law can be reduced to the known ones under the same or fewer\nassumptions. As a by-product, we identify the Groenewold-Ozawa information gain\nas the proper information measure characterizing the work extractable by\nfeedback control.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:24:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Minagawa","Shintaro",""],["Sakai","Kenta",""],["Kato","Kohtaro",""],["Buscemi","Francesco",""]]}
{"id":"2308.15559","submitter":"Mustafa Cavus","authors":"Mustafa Cavus, Adrian Stando, Przemyslaw Biecek","title":"Glocal Explanations of Expected Goal Models in Soccer","comments":"26 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The expected goal models have gained popularity, but their interpretability\nis often limited, especially when trained using black-box methods. Explainable\nartificial intelligence tools have emerged to enhance model transparency and\nextract descriptive knowledge for a single observation or for all observations.\nHowever, explaining black-box models for a specific group of observations may\nbe more useful in some domains. This paper introduces the glocal explanations\n(between local and global levels) of the expected goal models to enable\nperformance analysis at the team and player levels by proposing the use of\naggregated versions of the SHAP values and partial dependence profiles. This\nallows knowledge to be extracted from the expected goal model for a player or\nteam rather than just a single shot. In addition, we conducted real-data\napplications to illustrate the usefulness of aggregated SHAP and aggregated\nprofiles. The paper concludes with remarks on the potential of these\nexplanations for performance analysis in soccer analytics.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:29:56 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cavus","Mustafa",""],["Stando","Adrian",""],["Biecek","Przemyslaw",""]]}
{"id":"2308.15560","submitter":"Stephan Rasp","authors":"Stephan Rasp, Stephan Hoyer, Alexander Merose, Ian Langmore, Peter\n  Battaglia, Tyler Russel, Alvaro Sanchez-Gonzalez, Vivian Yang, Rob Carver,\n  Shreya Agrawal, Matthew Chantry, Zied Ben Bouallegue, Peter Dueben, Carla\n  Bromberg, Jared Sisk, Luke Barrington, Aaron Bell, Fei Sha","title":"WeatherBench 2: A benchmark for the next generation of data-driven\n  global weather models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  WeatherBench 2 is an update to the global, medium-range (1-14 day) weather\nforecasting benchmark proposed by Rasp et al. (2020), designed with the aim to\naccelerate progress in data-driven weather modeling. WeatherBench 2 consists of\nan open-source evaluation framework, publicly available training, ground truth\nand baseline data as well as a continuously updated website with the latest\nmetrics and state-of-the-art models:\nhttps://sites.research.google/weatherbench. This paper describes the design\nprinciples of the evaluation framework and presents results for current\nstate-of-the-art physical and data-driven weather models. The metrics are based\non established practices for evaluating weather forecasts at leading\noperational weather centers. We define a set of headline scores to provide an\noverview of model performance. In addition, we also discuss caveats in the\ncurrent evaluation setup and challenges for the future of data-driven weather\nforecasting.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:32:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rasp","Stephan",""],["Hoyer","Stephan",""],["Merose","Alexander",""],["Langmore","Ian",""],["Battaglia","Peter",""],["Russel","Tyler",""],["Sanchez-Gonzalez","Alvaro",""],["Yang","Vivian",""],["Carver","Rob",""],["Agrawal","Shreya",""],["Chantry","Matthew",""],["Bouallegue","Zied Ben",""],["Dueben","Peter",""],["Bromberg","Carla",""],["Sisk","Jared",""],["Barrington","Luke",""],["Bell","Aaron",""],["Sha","Fei",""]]}
{"id":"2308.15561","submitter":"Carolina Da Silva Bourdot Dutra","authors":"Carolina Bourdot Dutra and Elia Merzari","title":"Toward Direct Numerical Simulation of Turbulent and Transitional Flow in\n  Hexagonal Subchannels for Helium Conditions","comments":"NURETH-19","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the coolant thermal hydraulics in rod bundles is essential to\nthe design of nuclear reactors. However, flows with low Reynolds numbers\npresent serious modeling challenges, especially in heat transfer and natural\nconvection. They are difficult to analyze through standard Computational Fluid\nDynamics (CFD) tools. High-fidelity simulations, such as Direct Numerical\nSimulations (DNS), can provide invaluable insight into flow physics, supporting\nexperiments in developing a deeper understanding and eventually enabling the\naccurate simulation of this class of flows. Data generated from these\nhigh-fidelity methods can then be used to benchmark available turbulence models\nand deliver cheap, faster running methods. In the present work, the convective\nheat transfer in hexagonal subchannels was studied through a DNS approach,\nusing the high-order spectral element method code Nek5000, developed at Argonne\nNational Laboratory. First, the geometric model composed of two hexagonal\narrayed rod bundle subchannels with a pitch-to-diameter ratio of 1.5 is built,\nand then, the mesh is generated. These unusually high P/D and low Reynolds\nnumbers represent conditions of interest for gas-fast reactors (GFRs). To our\nknowledge, there is no available dataset in these conditions. In this work, we\ndetailed the development of the numerical benchmark and a series of preliminary\nLES simulations. Periodic boundary conditions are applied in the streamwise and\nspanwise directions and non-slip boundary conditions at the wall. Four cases\nare studied, with Reynolds of Re=2500, 5000, 7500, and 10000. All calculations\nhave been performed with the Prandtl number of 0.61, corresponding to helium\nconditions of interest for Gas Fast Reactor applications. The results are\nanalyzed with a polynomial-order convergence study, and the Reynolds stresses,\nand the turbulent kinetic budgets are presented and discussed.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:32:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dutra","Carolina Bourdot",""],["Merzari","Elia",""]]}
{"id":"2308.15562","submitter":"Christos Argyropoulos Prof","authors":"L. Khosravi Khorashad, A. Reicks, A. Erickson, J. E. Shield, D.\n  Alexander, A. Laraoui, G. Gogos, C. Zuhlke, and C. Argyropoulos","title":"Unraveling the formation dynamics of metallic femtosecond laser induced\n  periodic surface structures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Femtosecond laser surface processing (FLSP) is an emerging fabrication\ntechnique to efficiently control the surface morphology of many types of\nmaterials including metals. However, the theoretical understanding of the FLSP\nformation dynamics is not a trivial task, since it involves the interaction of\nvarious physical processes (electromagnetic, thermal, fluid dynamics) and\nremains relatively unexplored. In this work, we tackle this problem and present\nrigorous theoretical results relevant to low-fluence FLSP that accurately match\nthe outcomes of an experimental campaign focused on the formation dynamics of\nlaser induced periodic surface structures (LIPSS) on stainless steel. More\nspecifically, the topology and maximum depth of LIPSS trenches are\ntheoretically and experimentally investigated as a function of the number of\nlaser pulses. Moreover, precise LIPSS morphology measurements are performed\nusing atomic force microscopy (AFM). The proposed comprehensive simulation\nstudy is based on two-temperature model (TTM) non-equilibrium thermal\nsimulations coupled with fluid dynamic computations to capture the melting\nmetal phase occurring during FLSP. Our rigorous simulation results are found to\nbe in excellent agreement with the AFM measurements. The presented theoretical\nframework to model FLSP under low-fluence femtosecond laser pulses will be\nbeneficial to various emerging applications of LIPSS on metallic surfaces, such\nas cooling high-powered laser diodes and controlling the thermal emission or\nabsorption of metals.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:33:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Khorashad","L. Khosravi",""],["Reicks","A.",""],["Erickson","A.",""],["Shield","J. E.",""],["Alexander","D.",""],["Laraoui","A.",""],["Gogos","G.",""],["Zuhlke","C.",""],["Argyropoulos","C.",""]]}
{"id":"2308.15563","submitter":"Rachel Yun Zhang","authors":"Irit Dinur, Siqi Liu, Rachel Yun Zhang","title":"New Codes on High Dimensional Expanders","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.CC math.GR math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe a new parameterized family of symmetric error-correcting codes\nwith low-density parity-check matrices (LDPC).\n  Our codes can be described in two seemingly different ways. First, in\nrelation to Reed-Muller codes: our codes are functions on a subset of\n$\\mathbb{F}^n$ whose restrictions to a prescribed set of affine lines has low\ndegree. Alternatively, they are Tanner codes on high dimensional expanders,\nwhere the coordinates of the codeword correspond to triangles of a\n$2$-dimensional expander, such that around every edge the local view forms a\nReed-Solomon codeword.\n  For some range of parameters our codes are provably locally testable, and\ntheir dimension is some fixed power of the block length. For another range of\nparameters our codes have distance and dimension that are both linear in the\nblock length, but we do not know if they are locally testable. The codes also\nhave the multiplication property: the coordinate-wise product of two codewords\nis a codeword in a related code.\n  The definition of the codes relies on the construction of a specific family\nof simplicial complexes which is a slight variant on the coset complexes of\nKaufman and Oppenheim. We show a novel way to embed the triangles of these\ncomplexes into $\\mathbb{F}^n$, with the property that links of edges embed as\naffine lines in $\\mathbb{F}^n$.\n  We rely on this embedding to lower bound the rate of these codes in a way\nthat avoids constraint-counting and thereby achieves non-trivial rate even when\nthe local codes themselves have arbitrarily small rate, and in particular below\n$1/2$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:34:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dinur","Irit",""],["Liu","Siqi",""],["Zhang","Rachel Yun",""]]}
{"id":"2308.15564","submitter":"Nicha Dvornek","authors":"Jiyao Wang, Nicha C. Dvornek, Lawrence H. Staib, and James S. Duncan","title":"Learning Sequential Information in Task-based fMRI for Synthetic Data\n  Augmentation","comments":"Accepted by Machine Learning in Clinical Neuroimaging 2023 (MICCAI\n  workshop), preprint version","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Insufficiency of training data is a persistent issue in medical image\nanalysis, especially for task-based functional magnetic resonance images (fMRI)\nwith spatio-temporal imaging data acquired using specific cognitive tasks. In\nthis paper, we propose an approach for generating synthetic fMRI sequences that\ncan then be used to create augmented training datasets in downstream learning\ntasks. To synthesize high-resolution task-specific fMRI, we adapt the\n$\\alpha$-GAN structure, leveraging advantages of both GAN and variational\nautoencoder models, and propose different alternatives in aggregating temporal\ninformation. The synthetic images are evaluated from multiple perspectives\nincluding visualizations and an autism spectrum disorder (ASD) classification\ntask. The results show that the synthetic task-based fMRI can provide effective\ndata augmentation in learning the ASD classification task.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:36:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wang","Jiyao",""],["Dvornek","Nicha C.",""],["Staib","Lawrence H.",""],["Duncan","James S.",""]]}
{"id":"2308.15565","submitter":"Mona Saad","authors":"Ahmed Gaber, M.A.Seoud and Mona Tarek","title":"Fuzzy Extended Filters oF MS-Algebras","comments":"12pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this article, for an $\\emph{MS}$- algebra and a fuzzy filter $\\chi $, the\nconcept of extended fuzzy filter of $\\chi$ is presented, notated by $\n\\Upsilon_{\\chi,W}$ with $W \\subseteq \\mathcal{L}$. The features of\n$\\Upsilon_{\\chi,W}$ are investigated. Furthermore, the strong fuzzy filter is\nintroduced, donated by $\\Omega_{\\chi,W}$. Many properties are studied.\nCharacterisation of both $ \\Upsilon_{\\chi,W}, \\Omega_{\\chi,W}$ are clarified by\nusing the notion of dense elements with respect to a fuzzy filter. The\nhomomorphisms of both $\\Upsilon_{\\chi,W}$ and $\\Omega_{\\chi,W}$ are triggered.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:38:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gaber","Ahmed",""],["Seoud","M. A.",""],["Tarek","Mona",""]]}
{"id":"2308.15566","submitter":"Jos\\'e Hasbani Mr","authors":"Jos\\'e G. Hasbani, Evan M. C. Kias, Roberto Suarez-Rivera and Victor\n  M. Calo","title":"Shear-enhanced compaction analysis of the Vaca Muerta formation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Laboratory measurements on Vaca Muerta formation samples show\nstress-dependent elastic behavior and compaction at representative in-situ\nconditions. Experimental results show that the analyzed samples exhibit\nelasto-plastic deformation and shear-enhanced compaction as the main plasticity\nmechanism. These experimental observations conflict with the anticipated\nlinear-elastic response prior to the brittle failure reported in several works\non the geomechanical characterization of the Vaca Muerta formation. Therefore,\nwe present a complete laboratory analysis of samples from the Vaca Muerta\nformation showing experimental evidence of nonlinear elastic and unrecoverable\nshear-enhanced compaction. We also calibrate an elastoplastic constitutive\nmodel using these experimental observations; the resulting model reproduces the\nobserved phenomena adequately.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:38:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hasbani","Jos\u00e9 G.",""],["Kias","Evan M. C.",""],["Suarez-Rivera","Roberto",""],["Calo","Victor M.",""]]}
{"id":"2308.15567","submitter":"Stefan Wils","authors":"Stefan Wils and Bart Jacobs","title":"Certifying C program correctness with respect to CH2O with VeriFast","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  VeriFast is a powerful tool for verification of various correctness\nproperties of C programs using symbolic execution. However, VeriFast itself has\nnot been verified. We present a proof-of-concept extension which generates a\ncorrectness certificate for each successful verification run individually. This\ncertificate takes the form of a Coq script which, when successfully checked by\nCoq, removes the need for trusting in the correctness of VeriFast itself.\n  The Coq script achieves this by applying a chain of soundness results,\nallowing us to prove correctness of the program with regards to the third-party\nCH2O small step semantics for C11 by proving correctness in terms of symbolic\nexecution in Coq. This proof chain includes two intermediate auxiliary big step\nsemantics, the most important of which describes VeriFast's interpretation of\nC. Finally, symbolic execution in Coq is implemented by transforming the\nexported AST of the program into a Coq proposition representing the symbolic\nexecution performed by VeriFast itself.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:41:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wils","Stefan",""],["Jacobs","Bart",""]]}
{"id":"2308.15568","submitter":"Singh Akansha","authors":"Singh Akansha","title":"Over-Squashing in Graph Neural Networks: A Comprehensive survey","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph Neural Networks (GNNs) have emerged as a revolutionary paradigm in the\nrealm of machine learning, offering a transformative approach to dissect\nintricate relationships inherent in graph-structured data. The foundational\narchitecture of most GNNs involves the dissemination of information through\nmessage aggregation and transformation among interconnected nodes, a mechanism\nthat has demonstrated remarkable efficacy across diverse applications\nencompassing node classification, link prediction, and recommendation systems.\nNonetheless, their potential prowess encounters a restraint intrinsic to\nscenarios necessitating extensive contextual insights. In certain contexts,\naccurate predictions hinge not only upon a node's immediate local surroundings\nbut also on interactions spanning far-reaching domains. This intricate demand\nfor long-range information dissemination exposes a pivotal challenge recognized\nas \"over-squashing,\" wherein the fidelity of information flow from distant\nnodes becomes distorted. This phenomenon significantly curtails the efficiency\nof message-passing mechanisms, particularly for tasks reliant on intricate\nlong-distance interactions. In this comprehensive article, we illuminate the\nprevalent constraint of over-squashing pervading GNNs. Our exploration entails\na meticulous exposition of the ongoing efforts by researchers to improve the\nramifications posed by this limitation. Through systematic elucidation, we\ndelve into strategies, methodologies, and innovations proposed thus far, all\naimed at mitigating the detriments of over-squashing. By shedding light on this\nintricately woven issue, we aim to contribute to a nuanced understanding of the\nchallenges within the GNN landscape and the evolving solutions designed to\nsurmount them.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:46:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Akansha","Singh",""]]}
{"id":"2308.15569","submitter":"Jacob Caudell","authors":"Jacob Caudell","title":"On lens space surgeries from the Poincar\\'e homology sphere","comments":"66 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Building on Greene's changemaker lattices, we develop a lattice embedding\nobstruction to realizing an L-space bounding a definite 4-manifold as integer\nsurgery on a knot in the Poincar\\'e homology sphere. As the motivating\napplication, we determine which lens spaces are realized by $p/q$-surgery on a\nknot $K$ when $p/q > 2g(K) -1$. Specifically, we use the lattice embedding\nobstruction to show that if $K(p)$ is a lens space and $p \\geq 2g(K)$, then\nthere exists an equivalent surgery on a Tange knot with the same knot Floer\nhomology groups; additionally, using input from Baker, Hedden, and Ni, we\nidentify the only two knots in the Poincar\\'e homology sphere that admit\nhalf-integer lens space surgeries. Thus, together with the Finite/Cyclic\nSurgery Theorem of Boyer and Zhang, we obtain the corollary that lens space\nsurgeries on hyperbolic knots in the Poincar\\'e homology sphere are integral.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:49:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Caudell","Jacob",""]]}
{"id":"2308.15570","submitter":"Federico Vincentelli","authors":"F.M. Vincentelli, P. Casella, A. Borghese, Y. Cavecchi, G.\n  Mastroserio, L. Stella, D. Altamirano, M. Armas Padilla, M. C. Baglio, T. M.\n  Belloni, J. Casares, V. A. C\\'uneo, N. Degenaar, M. D\\'iaz Trigo, R. Fender,\n  T. Maccarone, J. Malzac, D. Mata S\\'anchez, M. Middleton, S. Migliari, T.\n  Mu\\~noz-Darias, K. O'Brien, G. Panizo-Espinar, J. S\\'anchez-Sierras, D. M.\n  Russell, P. Uttley","title":"Sub-second infrared variability from the archetypal accreting neutron\n  star 4U~1728-34","comments":"Accepted for publication in MNRAS, 11 pages 7 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 the first simultaneous high-time resolution X-ray and infrared\n(IR) observations of a neutron star low mass X-ray binary in its hard state. We\nperformed $\\approx 2\\,$h of simultaneous observations of 4U 1728-34 using\nHAWK-I@VLT, XMM-Newton and NuSTAR. The source displayed significant X-ray and\nIR variability down to sub-second timescales. By measuring the\ncross-correlation function between the infrared and X-ray lightcurves, we\ndiscovered a significant correlation with an infrared lead of $\\approx\n30-40\\,$ms with respect to the X-rays. We analysed the X-ray energy dependence\nof the lag, finding a marginal increase towards higher energies. Given the sign\nof the lag, we interpret this as possible evidence of Comptonization from\nexternal seed photons. We discuss the origin of the IR seed photons in terms of\ncyclo-synchrotron radiation from an extended hot flow. Finally, we also\nobserved the IR counterpart of a type-I X-ray burst, with a delay of\n$\\approx7.2\\,$s. Although some additional effects may be at play, by assuming\nthat this lag is due to light travel time between the central object and the\ncompanion star, we find that 4U 1728-34 must have an orbital period longer than\n$3\\,$h and an inclination higher than 8$^\\circ$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:52:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Vincentelli","F. M.",""],["Casella","P.",""],["Borghese","A.",""],["Cavecchi","Y.",""],["Mastroserio","G.",""],["Stella","L.",""],["Altamirano","D.",""],["Padilla","M. Armas",""],["Baglio","M. C.",""],["Belloni","T. M.",""],["Casares","J.",""],["C\u00faneo","V. A.",""],["Degenaar","N.",""],["Trigo","M. D\u00edaz",""],["Fender","R.",""],["Maccarone","T.",""],["Malzac","J.",""],["S\u00e1nchez","D. Mata",""],["Middleton","M.",""],["Migliari","S.",""],["Mu\u00f1oz-Darias","T.",""],["O'Brien","K.",""],["Panizo-Espinar","G.",""],["S\u00e1nchez-Sierras","J.",""],["Russell","D. M.",""],["Uttley","P.",""]]}
{"id":"2308.15571","submitter":"Helton Saulo","authors":"Helton Saulo, Suvra Pal, Rubens Souza, Roberto Vila, Alan Dasilva","title":"Parametric quantile autoregressive conditional duration models with\n  application to intraday value-at-risk","comments":"19 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The modeling of high-frequency data that qualify financial asset transactions\nhas been an area of relevant interest among statisticians and econometricians\n-- above all, the analysis of time series of financial durations.\nAutoregressive conditional duration (ACD) models have been the main tool for\nmodeling financial transaction data, where duration is usually defined as the\ntime interval between two successive events. These models are usually specified\nin terms of a time-varying mean (or median) conditional duration. In this\npaper, a new extension of ACD models is proposed which is built on the basis of\nlog-symmetric distributions reparametrized by their quantile. The proposed\nquantile log-symmetric conditional duration autoregressive model allows us to\nmodel different percentiles instead of the traditionally used conditional mean\n(or median) duration. We carry out an in-depth study of theoretical properties\nand practical issues, such as parameter estimation using maximum likelihood\nmethod and diagnostic analysis based on residuals. A detailed Monte Carlo\nsimulation study is also carried out to evaluate the performance of the\nproposed models and estimation method in retrieving the true parameter values\nas well as to evaluate a form of residuals. Finally, the proposed class of\nmodels is applied to a price duration data set and then used to derive a\nsemi-parametric intraday value-at-risk (IVaR) model.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:57:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Saulo","Helton",""],["Pal","Suvra",""],["Souza","Rubens",""],["Vila","Roberto",""],["Dasilva","Alan",""]]}
{"id":"2308.15572","submitter":"Ismael Mireles","authors":"Ismael Mireles, Diana Dragomir, Hugh P. Osborn, Katharine Hesse, Karen\n  A. Collins, Steven Villanueva, Allyson Bieryla, David R. Ciardi, Keivan G.\n  Stassun, Mallory Harris, Jack J. Lissauer, Richard P. Schwarz, Gregor Srdoc,\n  Khalid Barkaoui, Arno Riffeser, Kim K. McLeod, Joshua Pepper, Nolan Grieves,\n  Vera Maria Passegger, Sol\\`ene Ulmer-Moll, Joseph E. Rodriguez, Dax L. Feliz,\n  Samuel Quinn, Andrew W. Boyle, Michael Fausnaugh, Michelle Kunimoto, Pamela\n  Rowden, Andrew Vanderburg, Bill Wohler, Jon M. Jenkins, David W. Latham,\n  George R. Ricker, Sara Seager, and Joshua N. Winn","title":"TOI-4600 b and c: Two long-period giant planets orbiting an early K\n  dwarf","comments":"Accepted for publication in ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report the discovery and validation of two long-period giant exoplanets\norbiting the early K dwarf TOI-4600 (V=12.6, T=11.9), first detected using\nobservations from the Transiting Exoplanet Survey Satellite (TESS) by the TESS\nSingle Transit Planet Candidate Working Group (TSTPC-WG). The inner planet,\nTOI-4600 b, has a radius of 6.80$\\pm$0.31 R$_{\\oplus}$ and an orbital period of\n82.69 d. The outer planet, TOI-4600 c, has a radius of 9.42$\\pm$0.42\nR$_{\\oplus}$ and an orbital period of 482.82 d, making it the longest-period\nconfirmed or validated planet discovered by TESS to date. We combine TESS\nphotometry and ground-based spectroscopy, photometry, and high-resolution\nimaging to validate the two planets. With equilibrium temperatures of 347 K and\n191 K, respectively, TOI-4600 b and c add to the small but growing population\nof temperate giant exoplanets that bridge the gap between hot/warm Jupiters and\nthe solar system's gas giants. TOI-4600 is a promising target for further\ntransit and precise RV observations to measure masses and orbits for the\nplanets as well as search for additional non-transiting planets. Additionally,\nwith Transit Spectroscopy Metric (TSM) values of $\\sim$30, both planets are\namenable for atmospheric characterization with JWST. Altogether will lend\ninsight into the formation and evolution of planet systems with multiple giant\nexoplanets.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 18:58:59 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mireles","Ismael",""],["Dragomir","Diana",""],["Osborn","Hugh P.",""],["Hesse","Katharine",""],["Collins","Karen A.",""],["Villanueva","Steven",""],["Bieryla","Allyson",""],["Ciardi","David R.",""],["Stassun","Keivan G.",""],["Harris","Mallory",""],["Lissauer","Jack J.",""],["Schwarz","Richard P.",""],["Srdoc","Gregor",""],["Barkaoui","Khalid",""],["Riffeser","Arno",""],["McLeod","Kim K.",""],["Pepper","Joshua",""],["Grieves","Nolan",""],["Passegger","Vera Maria",""],["Ulmer-Moll","Sol\u00e8ne",""],["Rodriguez","Joseph E.",""],["Feliz","Dax L.",""],["Quinn","Samuel",""],["Boyle","Andrew W.",""],["Fausnaugh","Michael",""],["Kunimoto","Michelle",""],["Rowden","Pamela",""],["Vanderburg","Andrew",""],["Wohler","Bill",""],["Jenkins","Jon M.",""],["Latham","David W.",""],["Ricker","George R.",""],["Seager","Sara",""],["Winn","Joshua N.",""]]}
{"id":"2308.15573","submitter":"Mathieu Anel","authors":"Mathieu Anel, Georg Biedermann, Eric Finster, Andr\\'e Joyal","title":"Left-exact Localizations of $\\infty$-Topoi III: The Acyclic Product","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We define a commutative monoid structure on the poset of left-exact\nlocalizations of a higher topos, that we call the acyclic product. Our approach\nis anchored in a structural analogy between the poset of left-exact\nlocalizations of a topos and the poset of ideals of a commutative ring. The\nacyclic product is analogous to the product of ideals. The sequence of powers\nof a given left-exact localization defines a tower of localizations. We show\nhow this recovers the towers of Goodwillie calculus in the unstable homotopical\nsetting. We use this to describe the topoi of $n$-excisive functors as\nclassifying $n$-nilpotent objects.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:00:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Anel","Mathieu",""],["Biedermann","Georg",""],["Finster","Eric",""],["Joyal","Andr\u00e9",""]]}
{"id":"2308.15574","submitter":"Hongchao Zhang","authors":"Hongchao Zhang, Wen-Cong Gan, Yungui Gong, Anzhong Wang","title":"On the improved dynamics approach in loop quantum black holes","comments":"8 pages, 20 figures. arXiv admin note: text overlap with\n  arXiv:2212.14535","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this brief communication, we consider the B\\\"ohmer-Vandersloot (BV) model\nof loop quantum black holes obtained from the improved dynamics approach. We\nadopt the Saini-Singh gauge, in which it was found analytically that the BV\nspacetime is geodesically complete. In this paper, we show that black/white\nhole horizons do not exist in this geodesically complete spacetime. Instead,\nthere exists only an infinite number of transition surfaces, which always\nseparate trapped regions from anti-trapped ones. Comments on the improved\ndynamics approach adopted in other models of loop quantum black holes are also\ngiven.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:00:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Hongchao",""],["Gan","Wen-Cong",""],["Gong","Yungui",""],["Wang","Anzhong",""]]}
{"id":"2308.15575","submitter":"Xuwei Tan","authors":"Xuwei Tan, Yi-Jie Huang, Yaqian Li","title":"Prototype Fission: Closing Set for Robust Open-set Semi-supervised\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Semi-supervised Learning (SSL) has been proven vulnerable to\nout-of-distribution (OOD) samples in realistic large-scale unsupervised\ndatasets due to over-confident pseudo-labeling OODs as in-distribution (ID). A\nkey underlying problem is class-wise latent space spreading from closed seen\nspace to open unseen space, and the bias is further magnified in SSL's\nself-training loops. To close the ID distribution set so that OODs are better\nrejected for safe SSL, we propose Prototype Fission(PF) to divide class-wise\nlatent spaces into compact sub-spaces by automatic fine-grained latent space\nmining, driven by coarse-grained labels only. Specifically, we form multiple\nunique learnable sub-class prototypes for each class, optimized towards both\ndiversity and consistency. The Diversity Modeling term encourages samples to be\nclustered by one of the multiple sub-class prototypes, while the Consistency\nModeling term clusters all samples of the same class to a global prototype.\nInstead of \"opening set\", i.e., modeling OOD distribution, Prototype Fission\n\"closes set\" and makes it hard for OOD samples to fit in sub-class latent\nspace. Therefore, PF is compatible with existing methods for further\nperformance gains. Extensive experiments validate the effectiveness of our\nmethod in open-set SSL settings in terms of successfully forming sub-classes,\ndiscriminating OODs from IDs and improving overall accuracy. Codes will be\nreleased.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:04:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Tan","Xuwei",""],["Huang","Yi-Jie",""],["Li","Yaqian",""]]}
{"id":"2308.15576","submitter":"Izak Snyman","authors":"I. Snyman","title":"The structure of quasiparticles in a local Fermi liquid","comments":"15 + 4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Conduction electrons interacting with a dynamic impurity can give rise to a\nlocal Fermi liquid. The latter has the same low energy spectrum as an ideal\nFermi gas containing a static impurity. The Fermi liquids's elementary\nexcitations are however not bare electrons. In the vicinity of the impurity,\nthey are dressed by virtual particle-hole pairs. Here we study this dressing.\nAmong other things, we construct a mode-resolved measure of dressing. To\nevaluate it in position representation, we have to circumvent the limitations\nof the Numerical Renormalization Group, which discretizes the conduction band\nlogarithmically. We therefore extend Natural Orbital methods, that successfully\ncharacterize the ground state, to describe excitations. We demonstrate that the\ndressing profile shows nontrivial powerlaw decay at large distances. Our\nNatural Orbital methodology could lay the foundation for calculating the\nproperties of local Fermi liquid quasiparticles in nontrivial geometries such\nas disordered hosts or mesoscopic devices.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:05:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Snyman","I.",""]]}
{"id":"2308.15577","submitter":"Mark Zic","authors":"Mark P. Zic, Matthias S. Ikeda, Pierre Massat, Patrick M. Hollister,\n  Linda Ye, Elliott W. Rosenberg, Joshua A. W. Straquadine, Brad J. Ramshaw,\n  Ian R. Fisher","title":"Giant elastocaloric effect at low temperatures in TmVO$_4$ and\n  implications for cryogenic cooling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adiabatic decompression of para-quadrupolar materials has significant\npotential as a cryogenic cooling technology. We focus on TmVO$_4$, an\narchetypal material that undergoes a continuous phase transition to a\nferroquadrupole-ordered state at 2.15 K. Above the phase transition, each Tm\nion contributes an entropy of $k_B \\ln{2}$ due to the degeneracy of the crystal\nelectric field groundstate. Owing to the large magnetoelastic coupling, which\nis a prerequisite for a material to undergo a phase transition via the\ncooperative Jahn-Teller effect, this level splitting, and hence the entropy,\ncan be readily tuned by externally-induced strain. Using a dynamic technique in\nwhich the strain is rapidly oscillated, we measure the adiabatic elastocaloric\ncoefficient of single-crystal TmVO$_4$, and thus experimentally obtain the\nentropy landscape as a function of strain and temperature. The measurement\nconfirms the suitability of this class of materials for cryogenic cooling\napplications, and provides insight to the dynamic quadrupole strain\nsusceptibility.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:05:56 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zic","Mark P.",""],["Ikeda","Matthias S.",""],["Massat","Pierre",""],["Hollister","Patrick M.",""],["Ye","Linda",""],["Rosenberg","Elliott W.",""],["Straquadine","Joshua A. W.",""],["Ramshaw","Brad J.",""],["Fisher","Ian R.",""]]}
{"id":"2308.15578","submitter":"Pranab Kumar Mondal","authors":"Pranab Kumar Mondal","title":"Chemiosomotic flow in a narrow fluidic channel","comments":"This draft contains 18 pages and 7 figures, which explain the\n  underlying physics of chemiosmotic flow along a finite-sized slit channel","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A liquid volume containing dissolved solutes moves through a charged\nnanofluidic channel under the influence of the concentration gradient of the\nsolutes, non-trivially modulated by the electrostatic interaction between ionic\nliquid and charged surface. The available studies in this paradigm primarily\nfocus on either of diffusioosmosis or electrodiffusioosmosis modulated\nphysicochemical hydrodynamical phenomenon, essentially to obtain a net\nthroughput at the overlapping scales. Here, we develop a theoretical model that\naccounts for the induced pressure gradient stemming from the concentration\ngradient of the solutes alongside the axially varying electrical double layer\neffect in tandem and characterizes the chemiosmotic flow in a\nreservoir-connected nanofluidic system. Starting from the potential\ndistribution developed due to the solute gradient modulated electrical double\nlayer effect, we look at the effect of pertinent physicochemical parameters and\ntheir eventual manifestations onto the purely chemiosmotic transport, aptly\ndescribed in this endeavor. We analytically establish a chemiosmotic velocity\nscale from a macroscopic viewpoint, relating flow velocity with the relevant\nparameters, and uniquely measuring the magnitude of chemiosmotic velocity. A\ncloser as well as consistent agreement on theoretical predictions with the\ncorresponding full-scale simulated results, both in the limit and beyond the\nDebye-Huckel approximation, substantiates the efficacy of our theory.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:12:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mondal","Pranab Kumar",""]]}
{"id":"2308.15579","submitter":"Elijah Pelofske","authors":"Elijah Pelofske, Andreas B\\\"artschi, Stephan Eidenbenz, Bryan Garcia,\n  Boris Kiefer","title":"Probing Quantum Telecloning on Superconducting Quantum Processors","comments":null,"journal-ref":null,"doi":null,"report-no":"LA-UR-23-29397","categories":"quant-ph cs.DS cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum information can not be perfectly cloned, but approximate copies of\nquantum information can be generated. Quantum telecloning combines approximate\nquantum cloning, more typically referred as quantum cloning, and quantum\nteleportation. Quantum telecloning allows approximate copies of quantum\ninformation to be constructed by separate parties, using the classical results\nof a Bell measurement made on a prepared quantum telecloning state. Quantum\ntelecloning can be implemented as a circuit on quantum computers using a\nclassical co-processor to compute classical feed forward instructions using if\nstatements based on the results of a mid-circuit Bell measurement in real time.\nWe present universal, symmetric, optimal $1 \\rightarrow M$ telecloning\ncircuits, and experimentally demonstrate these quantum telecloning circuits for\n$M=2$ up to $M=10$, natively executed with real time classical control systems\non IBM Quantum superconducting processors, known as dynamic circuits. We\nperform the cloning procedure on many different message states across the Bloch\nsphere, on $7$ IBM Quantum processors, optionally using the error suppression\ntechnique X-X sequence digital dynamical decoupling. Two circuit optimizations\nare utilized, one which removes ancilla qubits for $M=2, 3$, and one which\nreduces the total number of gates in the circuit but still uses ancilla qubits.\nParallel single qubit tomography with MLE density matrix reconstruction is used\nin order to compute the mixed state density matrices of the clone qubits, and\nclone quality is measured using quantum fidelity. These results present one of\nthe largest and most comprehensive NISQ computer experimental analyses on\n(single qubit) quantum telecloning to date. The clone fidelity sharply\ndecreases to $0.5$ for $M > 5$, but for $M=2$ we are able to achieve a mean\nclone fidelity of up to $0.79$ using dynamical decoupling.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:12:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pelofske","Elijah",""],["B\u00e4rtschi","Andreas",""],["Eidenbenz","Stephan",""],["Garcia","Bryan",""],["Kiefer","Boris",""]]}
{"id":"2308.15580","submitter":"Vladlen Timorin","authors":"Alexander Blokh, Lex Oversteegen, and Vladlen Timorin","title":"Immediate renormalization of cubic complex polynomials with empty\n  rational lamination","comments":"26 pages, 1 figure; accepted to a special issue of the MMJ dedicated\n  to Yulij Ilyashenko's 80th Birthday. arXiv admin note: substantial text\n  overlap with arXiv:2102.10325","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A cubic polynomial $P$ with a non-repelling fixed point $b$ is said to be\nimmediately renormalizable if there exists a (connected) QL invariant filled\nJulia set $K^*$ such that $b\\in K^*$. In that case, exactly one critical point\nof $P$ does not belong to $K^*$. We show that if, in addition, the Julia set of\n$P$ has no (pre)periodic cutpoints, then this critical point is recurrent.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:12:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Blokh","Alexander",""],["Oversteegen","Lex",""],["Timorin","Vladlen",""]]}
{"id":"2308.15581","submitter":"David Moutard","authors":"David Moutard, Renee Ludlam, Javier A. Garc\\'ia, Diego Altamirano,\n  Douglas J. K. Buisson, Edward M. Cackett, J\\'er\\^ome Chenevez, Nathalie\n  Degenaar, Andrew C. Fabian, Jeroen Homan, Amruta Jaodand, Sean N. Pike,\n  Aarran W. Shaw, Tod E. Strohmayer, John A. Tomsick, Benjamin M. Coughenour","title":"Simultaneous NICER and NuSTAR Observations of the Ultra-compact X-ray\n  Binary 4U 0614+091","comments":"14 Pages, 6 Figures, 6 Tables, 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":"  We present the first joint NuSTAR and NICER observations of the ultra-compact\nX-ray binary (UCXB) 4U 0614+091. This source shows quasi-periodic flux\nvariations on the timescale of ~days. We use reflection modeling techniques to\nstudy various components of the accretion system as the flux varies. We find\nthat the flux of the reflected emission and the thermal components representing\nthe disk and the compact object trend closely with the overall flux. However,\nthe flux of the power-law component representing the illuminating X-ray corona\nscales in the opposite direction, increasing as the total flux decreases.\nDuring the lowest flux observation, we see evidence of accretion disk\ntruncation from roughly 6 gravitational radii to 11.5 gravitational radii. This\nis potentially analogous to the truncation seen in black hole low-mass X-ray\nbinaries, which tends to occur during the low/hard state at sufficiently low\nEddington ratios.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:15:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Moutard","David",""],["Ludlam","Renee",""],["Garc\u00eda","Javier A.",""],["Altamirano","Diego",""],["Buisson","Douglas J. K.",""],["Cackett","Edward M.",""],["Chenevez","J\u00e9r\u00f4me",""],["Degenaar","Nathalie",""],["Fabian","Andrew C.",""],["Homan","Jeroen",""],["Jaodand","Amruta",""],["Pike","Sean N.",""],["Shaw","Aarran W.",""],["Strohmayer","Tod E.",""],["Tomsick","John A.",""],["Coughenour","Benjamin M.",""]]}
{"id":"2308.15582","submitter":"Claire Zwicker","authors":"Claire Zwicker, Aaron M. Geller, Anna C. Childs, Erin Motherway, Ted\n  von Hippel","title":"Investigating Mass Segregation of the Binary Stars in the Open Cluster\n  NGC 6819","comments":"6 pages, 4, figures, submitted to ApJL","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 search for mass segregation in the intermediate-aged open cluster NGC 6819\nwithin a carefully identified sample of likely cluster members. Using\nphotometry from the Gaia, 2MASS, and Pan-STARRS surveys as inputs for a\nBayesian statistics software suite, BASE-9, we identify a rich population of\n(photometric) binaries and derive posterior distributions for the cluster age,\ndistance, metallicity and reddening as well as star-by-star photometric\nmembership probabilities, masses and mass ratios (for binaries). Within our\nentire sample, we find 2781 likely cluster members and 831 binaries. We select\na main-sequence 'primary sample' with 14.85 < G < 19.5 containing 1515 likely\ncluster members and 256 binaries with mass ratios q > 0.5, to investigate for\nmass segregation. Within this primary sample, we find the binary radial\ndistribution is significantly shifted toward the cluster center as compared to\nthe single stars, resulting in a binary fraction that increases significantly\ntoward the cluster core. Furthermore, we find that within the binary sample,\nmore massive binaries have more centrally concentrated radial distributions\nthan less massive binaries. The same is true for the single stars. As the\ncluster has persisted through several half-mass relaxation times, and the\nexpected mass-segregation timescale for stars in our primary sample is also\nsignificantly shorter than the cluster age, we interpret these results as\nstrong evidence for mass segregation in the cluster. Importantly, this is the\nfirst study to investigate mass segregation of the binaries in the open cluster\nNGC 6819.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:22:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zwicker","Claire",""],["Geller","Aaron M.",""],["Childs","Anna C.",""],["Motherway","Erin",""],["von Hippel","Ted",""]]}
{"id":"2308.15583","submitter":"Chiaki Kobayashi","authors":"Chiaki Kobayashi, Andrea Ferrara","title":"Rapid Chemical Enrichment by Intermittent Star Formation in GN-z11","comments":"8 pagaes, 4 figures, 1 table, submitted to The Astrophysical Journal\n  Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE astro-ph.SR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We interpret the peculiar super-solar nitrogen abundance recently reported by\nthe James Webb Space Telescope observations for GN-z11 (z=10.6) using our\nstate-of-the-art chemical evolution models. The observed CNO ratios can be\nsuccessfully reproduced -- independently of the adopted initial mass function,\nnucleosynthesis yields and presence of supermassive ($>$1000$M_\\odot$) stars --\nif the galaxy has undergone an intermittent star formation history with a\nquiescent phase lasting $\\sim$100 Myr, separating two strong star bursts.\nImmediately after the second burst, Wolf-Rayet stars (up to $120M_\\odot$)\nbecome the dominant enrichment source, also temporarily ($<$1 Myr) enhancing\nparticular elements (N, F, Na, Al) and isotopes ($^{13}$C, $^{18}$O).\nAlternative explanations involving (i) single burst models, also including very\nmassive stars and/or pair-instability supernovae, or (ii) pre-enrichment\nscenarios fail to match the data. Feedback-regulated, intermittent star\nformation might be common in early systems. Elemental abundances can be used to\ntest this hypothesis, and to get new insights on nuclear and stellar\nastrophysics.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:25:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kobayashi","Chiaki",""],["Ferrara","Andrea",""]]}
{"id":"2308.15584","submitter":"Alan Williams","authors":"Alan Williams, Alexander Scheinker, En-Chuan Huang, Charles Taylor,\n  Miroslav Krstic","title":"Experimental Safe Extremum Seeking for Accelerators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate the recent designs of Safe Extremum Seeking (Safe ES) on the 1\nkilometer-long charged particle accelerator at the Los Alamos Neutron Science\nCenter (LANSCE). Safe ES is a modification of ES which, in addition to\nminimizing an analytically unknown cost, also employs a safety filter based on\nan analytically unknown control barrier function (CBF) safety metric.\nAccelerator tuning is necessitated by the accelerators being large, with many\ndrifting parameters due to thermal effects and degradation. At the same time,\nsafe operation (the maintenance of state constraints) is crucial, as damage\nbrings astronomical costs, both financially and in operation downtime. Our\nmeasured (but analytically unknown) safety metric is the beam current. We\nperform multivariable Safe ES on three accelerator applications, in which we\nadapt 4, 6, and 3 magnet strength parameters, respectively. Two of the three\napplications are for validated simulation models of beamlines at LANSCE: the\nfirst for the Proton Radiography (pRad) beamline of 800 MeV protons for spot\nsize tuning; the second on a high performance code, HPSim, for tuning the low\nenergy beam transport (LEBT) region of of 750 keV protons. The third is an\nexperimental tuning of the steering magnets in the LEBT at LANSCE.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:26:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Williams","Alan",""],["Scheinker","Alexander",""],["Huang","En-Chuan",""],["Taylor","Charles",""],["Krstic","Miroslav",""]]}
{"id":"2308.15585","submitter":"Dmitrii V. Pasechnik","authors":"Dmitrii V. Pasechnik","title":"On hyperovals in $Q^+(6,4)$","comments":"3 pages, LaTeX, GAP code included","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.GR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  According to a computer search conducted by the author and described in [7],\nin $Q^+(6, 4)$ there are two types of hyperovals, having 72 and 96 points,\nrespectively. Here we give geometric descriptions for these examples.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:28:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pasechnik","Dmitrii V.",""]]}
{"id":"2308.15586","submitter":"Qiaoya Wu","authors":"Qiaoya Wu, Yue Shen","title":"Improved Redshifts for DESI EDR Quasars","comments":"3 pages, 1 figure. Submitted to RNAAS, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Dark Energy Spectroscopic Instrument (DESI) survey will provide optical\nspectra for $\\sim 3$ million quasars. Accurate redshifts for these quasars will\nfacilitate a broad range of science applications. Here we provide improved\nsystemic redshift estimates for the $\\sim 95$k quasars included in the DESI\nEarly Data Release (EDR), based on emission-line fits to the quasar spectra.\nThe majority of the DESI pipeline redshifts are reliable. However, $\\sim 19\\%$\nof the EDR quasars have pipeline redshifts that deviate from our new redshifts\nby $>500\\,{\\rm km\\,s^{-1}}$. We use composite quasar spectra to demonstrate the\nimprovement of our redshift estimates, particularly at $z>1$. These new\nredshifts are available at\n\\url{https://github.com/QiaoyaWu/DESI_EDR_qsofit/blob/main/DESI_EDR_Aug29_redshift_only.fits}.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:31:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wu","Qiaoya",""],["Shen","Yue",""]]}
{"id":"2308.15587","submitter":"Werner Sauter","authors":"Jo\\~ao Vitor Bulh\\~oes da Silva and Werner Krambeck Sauter","title":"Production of bound states of magnetic monopoles in high energy\n  collisions at LHC","comments":"16 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we present the studies carried out for the production of the\nmonopolium at the LHC in ultraperipheral collisions for the processes $pp$ and\n$PbPb$. The monopolium is described by the bound state of a\nmonopole-antimonopole pair, and we assume the study of the monopole in this\ncharacteristic state because the coupling constant is very large, which allows\nus to suggest that this exotic particle can be produced in the bound state. The\nmonopolium is defined by a wave function arising from the numerical solution of\nthe Schr\\\"{o}dinger equation for the modified Cornell potential. We used the\nphoton fusion production mechanism, with the Weizs\\\"{a}cker-Williams and\nDrees-Zeppenfeld expressions to describe the lead and proton equivalent photon\ndistributions. We estimate a high production rate of monopolium production for\n$pp$ collisions with $\\sqrt{s}=14$ TeV and $PbPb$ collisions with\n$\\sqrt{s}=5.5$ TeV in LHC.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:31:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["da Silva","Jo\u00e3o Vitor Bulh\u00f5es",""],["Sauter","Werner Krambeck",""]]}
{"id":"2308.15588","submitter":"Guangming Jing","authors":"Guangming Jing","title":"On Edge Coloring of Multigraphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\Delta(G)$ and $\\chi'(G)$ be the maximum degree and chromatic index of a\ngraph $G$, respectively.\n  Appearing in different format, Gupta\\,(1967), Goldberg\\,(1973),\nAndersen\\,(1977), and Seymour\\,(1979) made the following conjecture: Every\nmultigraph $G$ satisfies $\\chi'(G) \\le \\max\\{ \\Delta(G) + 1, \\Gamma(G) \\}$,\nwhere $\\Gamma(G) = \\max_{H \\subseteq G} \\left\\lceil \\frac{ |E(H)| }{ \\lfloor\n\\tfrac{1}{2} |V(H)| \\rfloor} \\right\\rceil$ is the density of $G$. In this\npaper, we present a polynomial-time algorithm for coloring any multigraph with\n$\\max\\{ \\Delta(G) + 1, \\Gamma(G) \\}$ many colors, confirming the conjecture.\nSince $\\chi'(G)\\geq \\max\\{ \\Delta(G), \\Gamma(G) \\}$, this algorithm gives a\nproper edge coloring that uses at most one more color than the optimum. As\ndetermining the chromatic index of an arbitrary graph is $NP$-hard, the $\\max\\{\n\\Delta(G) + 1, \\Gamma(G) \\}$ bound is best possible for efficient proper edge\ncoloring algorithms on general multigraphs, unless $P=NP$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:32:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Jing","Guangming",""]]}
{"id":"2308.15589","submitter":"Christian Reiher","authors":"Christian Reiher and Vojt\\v{e}ch R\\\"odl","title":"The girth Ramsey theorem","comments":"27 beautiful figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a hypergraph $F$ and a number of colours $r$, there exists a hypergraph\n$H$ of the same girth satisfying $H\\longrightarrow (F)_r$. Moreover, for every\nlinear hypergraph $F$ there exists a Ramsey hypergraph $H$ that locally looks\nlike a forest of copies of $F$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:33:59 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Reiher","Christian",""],["R\u00f6dl","Vojt\u011bch",""]]}
{"id":"2308.15590","submitter":"Petr Chmel","authors":"Petr Chmel and V\\'it Jel\\'inek","title":"String graphs with precise number of intersections","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.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A string graph is an intersection graph of curves in the plane. A $k$-string\ngraph is a graph with a string representation in which every pair of curves\nintersects in at most $k$ points. We introduce the class of $(=k)$-string\ngraphs as a further restriction of $k$-string graphs by requiring that every\ntwo curves intersect in either zero or precisely $k$ points. We study the\nhierarchy of these graphs, showing that for any $k\\geq 1$, $(=k)$-string graphs\nare a subclass of $(=k+2)$-string graphs as well as of $(=4k)$-string graphs;\nhowever, there are no other inclusions between the classes of $(=k)$-string and\n$(=\\ell)$-string graphs apart from those that are implied by the above rules.\nIn particular, the classes of $(=k)$-string graphs and $(=k+1)$-string graphs\nare incomparable by inclusion for any $k$, and the class of $(=2)$-string\ngraphs is not contained in the class of $(=2\\ell+1)$-string graphs for any\n$\\ell$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:36:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chmel","Petr",""],["Jel\u00ednek","V\u00edt",""]]}
{"id":"2308.15591","submitter":"Suhan Zhong","authors":"Jiawang Nie and Suhan Zhong","title":"Distributionally Robust Optimization with Polynomial Robust Constraints","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies distributionally robust optimization (DRO) with polynomial\nrobust constraints. We give a Moment-SOS relaxation approach to solve the DRO.\nThis reduces to solving linear conic optimization with semidefinite\nconstraints. When the DRO problem is SOS-convex, we show that it is equivalent\nto the linear conic relaxation and it can be solved by the Moment-SOS\nalgorithm. For nonconvex cases, we also give concrete conditions such that the\nDRO can be solved globally. Numerical experiments are given to show the\nefficiency of the method.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:37:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Nie","Jiawang",""],["Zhong","Suhan",""]]}
{"id":"2308.15592","submitter":"Ahmad Borzou","authors":"Ahmad Borzou","title":"Non-local Interactions are Essential Elements for Dark Matter Halo\n  Stability: A Cross-Model Study","comments":"9 pages, 1 figure. Accepted for publication by Universe","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces a comprehensive methodology for examining the stability\nof dark matter (DM) halos, emphasizing the necessity for non-local\ninter-particle interactions, whether they are fundamental or effective in\nnature, to maintain halo stability. We highlight the inadequacy of vanilla cold\ncollision-less DM models in forecasting a stable halo without considering a\n\"non-local\" interaction in the halo's effective free energy, which could\npotentially arise from factors like baryonic feedback, self-interactions, or\nthe intrinsic quantum characteristics of dark particles. The stability\nprerequisite necessitates significant effective interactions between any two\npoints within the halo, regardless of their distance from the center. The\nmethodology proposed herein offers a systematic framework to scrutinize the\nstability of various DM models and refine their parameter spaces. We deduce\nthat DM halos within a model, where the deviation from the standard cold\ncollision-less framework is confined to regions near the halo center, are\nunlikely to exhibit stability in their outer sectors. In our study, we\ndemonstrate that the issue of instability within DM halos cannot be addressed\nadequately using perturbative quantum effects. This issue is less pronounced\nfor fermionic DM but suffers from a higher degree of severity when considering\nbosonic DM. We find that halos made of bosons with notable quantum effects have\nsharp edges, while those made of fermions show more diffuse boundaries\nextending toward infinity. We also explore the broadest form of the effective\nfree-energy around a chosen mass profile.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:38:10 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Borzou","Ahmad",""]]}
{"id":"2308.15593","submitter":"Amiram Braun","authors":"Amiram Braun","title":"Finite groups, smooth invariants, and isolated quotient singularities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.AG math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let G < SL(V) be a finite group, V is finite dimensional over a field F,\np=char F and S(V) is the symmetric algebra of V. We determine when the subring\nof G-invariants S(V)^G is a polynomial ring. As a consequence, we classify, if\nF is algebraically closed, all S(V)^G which are isolated singularities. We show\nthat the completion of S(V)^G, at its unique graded maximal ideal, is\nisomorphic to the completion of S(W)^H, where (H,W) is a reduction mod p of a\nmember of the Zassenhaus-Vincent-Wolf list of complex isolated quotient\nsingularities.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:38:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Braun","Amiram",""]]}
{"id":"2308.15594","submitter":"Fran\\c{c}ois Charton","authors":"Fran\\c{c}ois Charton","title":"Can transformers learn the greatest common divisor?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  I investigate the capability of small transformers to compute the greatest\ncommon divisor (GCD) of two positive integers. When the training distribution\nand the representation base are carefully chosen, models achieve 98% accuracy\nand correctly predict 91 of the 100 first GCD. Model predictions are\ndeterministic and fully interpretable. During training, the models learn to\ncluster input pairs with the same GCD, and classify them by their divisors.\nBasic models, trained from uniform operands encoded on small bases, only\ncompute a handful of GCD (up to 38 out of 100): the products of divisors of the\nbase. Longer training and larger bases allow some models to \"grok\" small prime\nGCD. Training from log-uniform operands boosts performance to 73 correct GCD,\nand balancing the training distribution of GCD, from inverse square to\nlog-uniform, to 91 GCD. Training models from a uniform distribution of GCD\nbreaks the deterministic model behavior.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:38:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Charton","Fran\u00e7ois",""]]}
{"id":"2308.15595","submitter":"Roberto Alvarenga","authors":"Roberto Alvarenga and Herivelto Borges","title":"On the number of elements with prescribed norm and trace","comments":"21 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let F_q be the finite field with cardinality q, where q is a prime power.\nGiven a finite field extension F_q^n over F_q and a,b in (F_q)^{*}, we\ninvestigate in this article the number N_n(a,b) of elements in F_q^n whose norm\nequals a and trace equals b. Our approach to probe N_n(a,b) is to connect it\nwith the number of rational points on certain Artin-Schreier curve. After\nestablish an improvement of the Hasse-Weil bound for that Artin-Schreier curve,\nwe improve the known estimates for N_n(a,b) when (roughly speaking) n \\geq\n\\sqrt{q}-1. Moreover, we use this approach to improve the bound given by Moisio\nand Wan for the number of rational points on the toric Calabi-Yau variety\nstudied by Rojas-Leon and Wan in 2011. We finish the paper with explicit\ncalculations of N_n(a,b) and an application to the number of irreducible monic\npolynomials in an arithmetic progression.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:39:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Alvarenga","Roberto",""],["Borges","Herivelto",""]]}
{"id":"2308.15596","submitter":"Lu Yang","authors":"Lu Yang","title":"Double Probability Integral Transform Residuals for Regression Models\n  with Discrete Outcomes","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":"  The assessment of regression models with discrete outcomes is challenging and\nhas many fundamental issues. With discrete outcomes, standard regression model\nassessment tools such as Pearson and deviance residuals do not follow the\nconventional reference distribution (normal) under the true model, calling into\nquestion the legitimacy of model assessment based on these tools. To fill this\ngap, we construct a new type of residuals for general discrete outcomes,\nincluding ordinal and count outcomes. The proposed residuals are based on two\nlayers of probability integral transformation. When at least one continuous\ncovariate is available, the proposed residuals closely follow a uniform\ndistribution (a normal distribution after transformation) under the correctly\nspecified model. One can construct visualizations such as QQ plots to check the\noverall fit of a model straightforwardly, and the shape of QQ plots can further\nhelp identify possible causes of misspecification such as overdispersion. We\nprovide theoretical justification for the proposed residuals by establishing\ntheir asymptotic properties. Moreover, in order to assess the mean structure\nand identify potential covariates, we develop an ordered curve as a\nsupplementary tool, which is based on the comparison between the partial sum of\noutcomes and of fitted means. Through simulation, we demonstrate empirically\nthat the proposed tools outperform commonly used residuals for various model\nassessment tasks. We also illustrate the workflow of model assessment using the\nproposed tools in data analysis.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:40:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yang","Lu",""]]}
{"id":"2308.15597","submitter":"David Cutler","authors":"David J. Cutler, Kiana Jodeiry, Andrew J. Bass and Michael P. Epstein","title":"The Quantitative Genetics of Human Disease: 1 Foundations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this the first of an anticipated four paper series, fundamental results of\nquantitative genetics are presented from a first principles approach. While\nnone of these results are in any sense new, they are presented in extended\ndetail to precisely distinguish between definition and assumption, with a\nfurther emphasis on distinguishing quantities from their usual approximations.\nTerminology frequently encountered in the field of human genetic disease\nstudies will be defined in terms of their quantitive genetics form. Methods for\nestimation of both quantitative genetics and the related human genetics\nquantities will be demonstrated. While practitioners in the field of human\nquantitative disease studies may find this work pedantic in detail, the\nprinciple target audience for this work is trainees reasonably familiar with\npopulation genetics theory, but with less experience in its application to\nhuman disease studies. We introduce much of this formalism because in later\npapers in this series, we demonstrate that common areas of confusion in human\ndisease studies can be resolved be appealing directly to these formal\ndefinitions. The second paper in this series will discuss polygenic risk\nscores. The third paper will concern the question of \"missing\" heritability and\nthe role interactions may play. The fourth paper will discuss sexually\ndimorphic disease and the potential role of the X chromosome.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:42:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cutler","David J.",""],["Jodeiry","Kiana",""],["Bass","Andrew J.",""],["Epstein","Michael P.",""]]}
{"id":"2308.15598","submitter":"Yulia Alexandr","authors":"Yulia Alexandr and Serkan Ho\\c{s}ten","title":"Maximum information divergence from linear and toric models","comments":"33 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST cs.IT math.AG math.IT stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of maximizing information divergence from a new\nperspective using logarithmic Voronoi polytopes. We show that for linear\nmodels, the maximum is always achieved at the boundary of the probability\nsimplex. For toric models, we present an algorithm that combines the\ncombinatorics of the chamber complex with numerical algebraic geometry. We pay\nspecial attention to reducible models and models of maximum likelihood degree\none.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:42:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Alexandr","Yulia",""],["Ho\u015ften","Serkan",""]]}
{"id":"2308.15599","submitter":"Alec Lessing","authors":"Michael M. Shara, Alec M. Lessing, Rebekah Hounsell, Shifra Mandel,\n  David Zurek, Matthew J. Darnley, Or Graur, Yael Hillman, Eileen T. Meyer,\n  Joanna Mikolajewska, James D. Neill, Dina Prialnik, William Sparks","title":"A 9-Month $\\textit{Hubble Space Telescope}$ Near-UV Survey of M87. I.\n  Light and Color Curves of 94 Novae, and a Re-determination of the Nova Rate","comments":"Submitted to ApJSS 3 Tables, 107 Figures, 180 pages","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":"  M87 has been monitored with a cadence of 5 days over a 9 month-long span\nthrough the near-ultraviolet (NUV:F275W) and optical (F606W) filters of the\nWide Field Camera 3 (WFC3) of the HST. This unprecedented dataset yields the\nNUV and optical light and color curves of 94 M87 novae, characterizing the\noutburst and decline properties of the largest extragalactic nova dataset in\nthe literature (after M31). We test and confirm nova modelers' prediction that\nrecurrent novae cannot erupt more frequently that once every 45 days; show that\nthere are zero rapidly recurring novae in the central $\\sim$ 1/3 of M87 with\nrecurrence times $ < $ 130 days; demonstrate that novae closely follow the\nK-band light of M87 to within a few arcsec of the galaxy nucleus; show that\nnova NUV light curves are as heterogeneous as their optical counterparts, and\nusually peak 5 to 30 days after visible light maximum; determine our\nobservations' detection completeness to be in the 90-96\\% range; and measure\nthe rate Rnova of nova eruptions in M87 as $325_{-38}^{+38}$/yr. The\ncorresponding luminosity-specific classical nova rate for this galaxy is\n$7.06_{-.83}^{+.83}/yr/10^{10}L_\\odot,_{K}$. These rates confirm that\ngroundbased observations of extragalactic novae miss most faint, fast novae and\nthose near the centers of galaxies.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:44:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Shara","Michael M.",""],["Lessing","Alec M.",""],["Hounsell","Rebekah",""],["Mandel","Shifra",""],["Zurek","David",""],["Darnley","Matthew J.",""],["Graur","Or",""],["Hillman","Yael",""],["Meyer","Eileen T.",""],["Mikolajewska","Joanna",""],["Neill","James D.",""],["Prialnik","Dina",""],["Sparks","William",""]]}
{"id":"2308.15600","submitter":"Gennady Romanov","authors":"Gennady Romanov (1) ((1) Fermi National Accelerator Laboratory)","title":"Resonant dynamics of one-side multipactor on dielectric surface","comments":"To be published in Physics of Plasmas. arXiv admin note: text overlap\n  with arXiv:2202.07709","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-371-TD","categories":"physics.plasm-ph physics.acc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Breakdown of dielectric RF windows is an important issue for particle\naccelerators and high-power RF sources. One of the common reasons for RF window\nfailure is the multipactor on a dielectric surface. The multipactor may be\nresponsible for excessive heating of the dielectric and discharge of charges\nthat accumulated in the ceramic due to secondary emission. In this study,\ncomprehensive self-consistent PIC simulations with space charge effect were\nperformed. This was to better understand the dynamic of one-side multipactor\ndevelopment and floating potential on the dielectric induced by the emission.\nThe important correlations between the multipactor parameters at saturation,\nthe secondary emission properties of dielectric, and the applied RF field\nparameters have been found, which led to the conclusion that the dynamics of\none-side multipactor on dielectric is a resonant phenomenon.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:46:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Romanov","Gennady","","Fermi National Accelerator Laboratory"]]}
{"id":"2308.15601","submitter":"Panagiotis Athanasopoulos","authors":"Panagiotis Athanasopoulos","title":"Cognitive dissonance or p-prims? Towards identifying the best way to\n  overcome misconceptions in physics","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this classroom-based action-research project, I compared the following two\napproaches to check their effectiveness in helping students overcome physics\nmisconceptions: Inducing cognitive dissonance or gradually building on\nstudents' previous knowledge activating the relevant phenomenological\nprimitives (p-prims). This took place over a two-lesson sequence (each an hour\nlong) using year 8 (12 years old) and year 9 (13 years old) top set students\n(N=87 in total), in the context of Newton's first law. Results were better for\nboth year groups when inducing cognitive dissonance, which seems to be more\neffective not only with surface-level learning, but deep-learning as well.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:46:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Athanasopoulos","Panagiotis",""]]}
{"id":"2308.15602","submitter":"Nikolai Merkel","authors":"Nikolai Merkel, Daniel Stoll, Ruben Mayer, Hans-Arno Jacobsen","title":"An Experimental Comparison of Partitioning Strategies for Distributed\n  Graph Neural Network Training","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recently, graph neural networks (GNNs) have gained much attention as a\ngrowing area of deep learning capable of learning on graph-structured data.\nHowever, the computational and memory requirements for training GNNs on\nlarge-scale graphs can exceed the capabilities of single machines or GPUs,\nmaking distributed GNN training a promising direction for large-scale GNN\ntraining. A prerequisite for distributed GNN training is to partition the input\ngraph into smaller parts that are distributed among multiple machines of a\ncompute cluster. Although graph partitioning has been extensively studied with\nregard to graph analytics and graph databases, its effect on GNN training\nperformance is largely unexplored.\n  In this paper, we study the effectiveness of graph partitioning for\ndistributed GNN training. Our study aims to understand how different factors\nsuch as GNN parameters, mini-batch size, graph type, features size, and\nscale-out factor influence the effectiveness of graph partitioning. We conduct\nexperiments with two different GNN systems using vertex and edge partitioning.\nWe found that graph partitioning is a crucial pre-processing step that can\nheavily reduce the training time and memory footprint. Furthermore, our results\nshow that invested partitioning time can be amortized by reduced GNN training,\nmaking it a relevant optimization.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:47:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Merkel","Nikolai",""],["Stoll","Daniel",""],["Mayer","Ruben",""],["Jacobsen","Hans-Arno",""]]}
{"id":"2308.15603","submitter":"Mar\\'ia Gracia Cornet","authors":"Mar\\'ia Gracia Cornet and Pablo Torres","title":"$k$-tuple domination on Kneser graphs","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 continue the study of different types of dominating sets in\nKneser graphs. We focus on $k$-tuple dominating sets, $2$-packings and the\nassociated graph parameters $k$-tuple domination number and $2$-packing number.\nIn particular, we determine the Kneser graphs $K(n,r)$ with $k$-tuple\ndomination number exactly $k+r$ and find all the minimum sized $k$-tuple\ndominating sets for these graphs, which generalize results for dominating sets\nin Kneser graphs. Besides, we give a characterization of the $k$-tuple\ndominating sets of $K(n,2)$ in terms of the occurrences of the elements in\n$[n]$, which allows us to obtain minimum sized $k$-tuple dominating sets for\nalmost all positive integers $n\\geq 4$. Finally, we compute both parameters for\ncertain Kneser graphs, and specifically in odd graphs we show that these\ninvariants are extremely related with perfect $1$-codes and Steiner systems.\n  Keywords: Kneser graphs, $k$-tuple dominating set.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:50:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cornet","Mar\u00eda Gracia",""],["Torres","Pablo",""]]}
{"id":"2308.15604","submitter":"Robert Conte","authors":"Robert Conte (ENS Paris-Saclay)","title":"On a dynamical system linked to the BKL scenario","comments":"9 pages, to appear, Physica scripta","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc nlin.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the six-dimensional dynamical system in three components\nintroduced by Ryan to describe the scenario of Belinskii, Khalatnikov and\nLifshitz to the cosmological singularity when the spatial metric tensor is not\ndiagonal. Despite its nonintegrability, recently proven by Goldstein and\nPiechocki, the three four-dimensional systems defined by canceling one of the\nthree components happen to be integrable. We express their general solution as\na rational function of, respectively, two exponential functions, a third\nPainlev\\'e function, two exponential functions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:53:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Conte","Robert","","ENS Paris-Saclay"]]}
{"id":"2308.15605","submitter":"Fabien Roger","authors":"Fabien Roger, Ryan Greenblatt, Max Nadeau, Buck Shlegeris, Nate Thomas","title":"Measurement Tampering Detection Benchmark","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When training powerful AI systems to perform complex tasks, it may be\nchallenging to provide training signals which are robust to optimization. One\nconcern is measurement tampering, where the AI system manipulates multiple\nmeasurements to create the illusion of good results instead of achieving the\ndesired outcome. In this work, we build four new text-based datasets to\nevaluate measurement tampering detection techniques on large language models.\nConcretely, given sets of text inputs and measurements aimed at determining if\nsome outcome occurred, as well as a base model able to accurately predict\nmeasurements, the goal is to determine if examples where all measurements\nindicate the outcome actually had the outcome occur, or if this was caused by\nmeasurement tampering. We demonstrate techniques that outperform simple\nbaselines on most datasets, but don't achieve maximum performance. We believe\nthere is significant room for improvement for both techniques and datasets, and\nwe are excited for future work tackling measurement tampering.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:54:37 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Roger","Fabien",""],["Greenblatt","Ryan",""],["Nadeau","Max",""],["Shlegeris","Buck",""],["Thomas","Nate",""]]}
{"id":"2308.15606","submitter":"Carmelo Rosales-Guzm\\'an Dr.","authors":"Mitchell A. Cox and Carmelo Rosales Guzm\\'an","title":"Real-time stokes polarimetry based on a polarisation camera","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This lab note introduces the \"Stokes Camera,\" a simple and novel experimental\narrangement for real-time measurement of spatial amplitude and polarisation and\nthus spatially resolved Stokes parameters. It uses a polarisation sensitive\ncamera and a fixed quarter-wave plate, providing a one-shot, digital solution\nfor polarisation measurement that is only limited by the frame rate of the\ncamera and the computation speed of the provided code. The note also provides\nbackground information on relevant polarisation theory and vector vortex beams,\nwhich are used as a demonstration of the device.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:56:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cox","Mitchell A.",""],["Guzm\u00e1n","Carmelo Rosales",""]]}
{"id":"2308.15607","submitter":"Soren Galatius","authors":"Soren Galatius, Oscar Randal-Williams","title":"The Alexander trick for homology spheres","comments":"14 pages","journal-ref":null,"doi":null,"report-no":"CPH-GEOTOP-DNRF151","categories":"math.GT math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the group of homeomorphisms of a compact contractible\n$d$-manifold which fix the boundary is contractible, as long as $d \\geq 6$. We\ndeduce this from a strong uniqueness statement for one-sided $h$-cobordisms.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:59:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Galatius","Soren",""],["Randal-Williams","Oscar",""]]}
{"id":"2308.15608","submitter":"Rainer J. Fries","authors":"Rainer J. Fries, Jacob Purcell, Michael Kordell II, Che-Ming Ko","title":"Excited Hadron Channels in Hadronization","comments":"6 pages, 3 figures; submitted to Proceedings of Science","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The proper treatment of hadronic resonances plays an important role in many\naspects of heavy ion collisions. This is expected to be the case also for\nhadronization, due to the large degeneracies of excited states, and the\nabundant production of hadrons from their decays. We first show how a\ncomprehensive treatment of excited meson states can be incorporated into quark\nrecombination, and in extension, into Hybrid Hadronization. We then discuss the\nquantum mechanics of forming excited states, utilizing the Wigner distribution\nfunctions of angular momentum eigenstates of isotropic 3-D harmonic\noscillators. We further describe how resonance decays can be handled, based on\na set of minimal assumptions, by creating an extension of hadron decays in\nPYTHIA 8. Finally, we present first results by simulating $e^+e^-$ collisions\nusing PYTHIA and Hybrid Hadronization with excited mesons up to orbital angular\nmomentum $L=4$ and radial quantum number 2. We find that states up to $L=2$ are\nproduced profusely by quark recombination.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 19:59:59 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fries","Rainer J.",""],["Purcell","Jacob",""],["Kordell","Michael","II"],["Ko","Che-Ming",""]]}
{"id":"2308.15609","submitter":"Anthony Sarah","authors":"Sharath Nittur Sridhar, Souvik Kundu, Sairam Sundaresan, Maciej\n  Szankin, Anthony Sarah","title":"InstaTune: Instantaneous Neural Architecture Search During Fine-Tuning","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":"  One-Shot Neural Architecture Search (NAS) algorithms often rely on training a\nhardware agnostic super-network for a domain specific task. Optimal\nsub-networks are then extracted from the trained super-network for different\nhardware platforms. However, training super-networks from scratch can be\nextremely time consuming and compute intensive especially for large models that\nrely on a two-stage training process of pre-training and fine-tuning. State of\nthe art pre-trained models are available for a wide range of tasks, but their\nlarge sizes significantly limits their applicability on various hardware\nplatforms. We propose InstaTune, a method that leverages off-the-shelf\npre-trained weights for large models and generates a super-network during the\nfine-tuning stage. InstaTune has multiple benefits. Firstly, since the process\nhappens during fine-tuning, it minimizes the overall time and compute resources\nrequired for NAS. Secondly, the sub-networks extracted are optimized for the\ntarget task, unlike prior work that optimizes on the pre-training objective.\nFinally, InstaTune is easy to \"plug and play\" in existing frameworks. By using\nmulti-objective evolutionary search algorithms along with lightly trained\npredictors, we find Pareto-optimal sub-networks that outperform their\nrespective baselines across different performance objectives such as accuracy\nand MACs. Specifically, we demonstrate that our approach performs well across\nboth unimodal (ViT and BERT) and multi-modal (BEiT-3) transformer based\narchitectures.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:02:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sridhar","Sharath Nittur",""],["Kundu","Souvik",""],["Sundaresan","Sairam",""],["Szankin","Maciej",""],["Sarah","Anthony",""]]}
{"id":"2308.15610","submitter":"Maria Barba","authors":"Maria Barba (1), Benjamin Hansen (1), Michael White (1), Gregory\n  Johnson (1), Omar Al Atassi (1), Jun Dong (1), Shreya Ranpariya (1), William\n  Soyars (1), Ahmed Faraj (1), Pratik Patel (1), Noelle Besse (2), Annelise\n  Machefel (2) and Lois Perrot (2) ((1) Fermi National Accelerator Laboratory,\n  (2) Air Liquide Advanced Technologies)","title":"Integration of a new Cryogenic Liquefier into the IB-1 Cryogenic Test\n  Facility","comments":"Cryogenic Eng Conf and Intnl Cryo Materials Conf (CEC/ICMC 2023)","journal-ref":null,"doi":null,"report-no":"FERMILAB-CONF-23-374-TD","categories":"physics.acc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The increase over the last years of the testing activities related to quantum\nsystems, SRF cavities for the PIP-II and the LCLS-II projects, as well as\nsuperconducting magnets for the HL-LHC project and Fusion research activities,\nhas required the addition of a new Helium cryogenic plant into the existing\nIB-1 Industrial Cryogenic Test Facility. The new cryogenic plant is composed of\na cryogenic liquefier (Cold Box) able to provide up to 340 L/h, a 4 kL Dewar\nand two Mycom compressors providing up to 120 g/s. AL-AT (Air Liquide Advanced\nTechnologies) has taken part of this project by designing and manufacturing the\ncryogenic liquefier. This new cryogenic plant is connected through a cryogenic\ndistribution system to a 10 kL Dewar, which is part of the existing cryogenic\ntest facility, itself composed of another Cold Box and a Sullair compressor.\nThe new cryogenic plant has two main operating modes: one allows to transfer\nliquid helium at 1.7 bar between the two Dewars, the other allows to transfer\nsupercritical Helium at 2 bar or more between the new Cold Box and the 10 kL\nDewar. The entire industrial cryogenic facility is handled by a common\nInventory Control System, composed of three control valves, and 9 tanks giving\na total buffer volume of more than 1000 m3. This paper presents the technical\nfeatures of the new Helium cryogenic plant, as well as the main results of the\nliquefier commissioning phase and details of the helium transfer between the\ntwo Dewars, making the connection between the cryogenic plants at the IB-1\nIndustrial Cryogenic Test Facility.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:06:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Barba","Maria",""],["Hansen","Benjamin",""],["White","Michael",""],["Johnson","Gregory",""],["Atassi","Omar Al",""],["Dong","Jun",""],["Ranpariya","Shreya",""],["Soyars","William",""],["Faraj","Ahmed",""],["Patel","Pratik",""],["Besse","Noelle",""],["Machefel","Annelise",""],["Perrot","Lois",""]]}
{"id":"2308.15611","submitter":"Sarah Plosker","authors":"Nathaniel Johnston and Sarah Plosker","title":"Laplacian $\\{-1,0,1\\}$- and $\\{-1,1\\}$-diagonalizable graphs","comments":"24 pages, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A graph is called \"Laplacian integral\" if the eigenvalues of its Laplacian\nmatrix are all integers. We investigate the subset of these graphs whose\nLaplacian is furthermore diagonalized by a matrix with entries coming from a\nfixed set, with particular emphasis on the sets $\\{-1,0,1\\}$ or $\\{-1,1\\}$.\nSuch graphs include as special cases the recently-investigated families of\n\"Hadamard-diagonalizable\" and \"weakly Hadamard-diagonalizable\" graphs. As a\ncombinatorial tool to aid in our investigation, we introduce a family of\nvectors that we call \"balanced\", which generalize totally balanced partitions,\nregular sequences, and complete partitions. We show that balanced vectors\ncompletely characterize which graph complements and complete multipartite\ngraphs are $\\{-1,0,1\\}$-diagonalizable, and we furthermore prove results on\ndiagonalizability of the Cartesian product, disjoint union, and join of graphs.\nParticular attention is paid to the $\\{-1,0,1\\}$- and\n$\\{-1,1\\}$-diagonalizability of the complete graphs and complete multipartite\ngraphs. Finally, we provide a complete list of all simple, connected graphs on\nnine or fewer vertices that are $\\{-1,0,1\\}$- or $\\{-1,1\\}$-diagonalizable.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:10:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Johnston","Nathaniel",""],["Plosker","Sarah",""]]}
{"id":"2308.15612","submitter":"Andrea Celentano","authors":"Yu. M. Andreev, A. Antonov, D. Banerjee, B. Banto Oberhauser, J.\n  Bernhard, P. Bisio, M. Bondi, A. Celentano, N. Charitonidis, D. Cooke, P.\n  Crivelli, E. Depero, A. V. Dermenev, S. V. Donskov, R. R. Dusaev, T. Enik, V.\n  N. Frolov, A. Gardikiotis, S. G. Gerassimov, S. N. Gninenko, M. Hosgen, M.\n  Jeckel, V. A. Kachanov, Y. Kambar, A. E. Karneyeu, G. Kekelidze, B. Ketzer,\n  D. V. Kirpichnikov, M. M. Kirsanov, V. N. Kolosov, I. V. Konorov, S. V.\n  Gertsenberger, E. A. Kasianova, V. A. Kramarenko, L. V. Kravchuk, N. V.\n  Krasnikov, S. V. Kuleshov, V. E. Lyubovitskij, V. Lysan, A. Marini, L.\n  Marsican, V. A. Matveev, R. M. Fredes, R. M. Yanssen, Yu. V. Mikhailov, L.\n  Molina Bueno, M. Mongillo, D. V. Peshekhonov, V. A. Polyakov, B. Radics, K.\n  Salamatin, V. D. Samoylenko, H. Sieber, D. Shchukin, O. Soto, V. O.\n  Tikhomirov, I. Tlisova, A. N. Toropin, A. Yu. Trifonov, M. Tuzi, P. Ulloa, P.\n  V. Volkov, V. Yu. Volkov, I. V. Voronchikhin, J. Zamora-Saa, A. S. Zhevlakov","title":"Probing Light Dark Matter with positron beams at NA64","comments":"Version submitted to PRL","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-192","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the results of a missing-energy search for Light Dark Matter which\nhas a new interaction with ordinary matter transmitted by a vector boson,\ncalled dark photon $A^\\prime$. For the first time, this search is performed\nwith a positron beam by using the significantly enhanced production of\n$A^\\prime$ in the resonant annihilation of positrons with atomic electrons of\nthe target nuclei, followed by the invisible decay of $A^\\prime$ into dark\nmatter. No events were found in the signal region with $(10.1 \\pm\n0.1)~\\times~10^{9}$ positrons on target with 100 GeV energy. This allowed us to\nset new exclusion limits that, relative to the collected statistics, prove the\npower of this experimental technique. This measurement is a crucial first step\ntoward a future exploration program with positron beams, whose estimated\nsensitivity is here presented.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:12:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Andreev","Yu. M.",""],["Antonov","A.",""],["Banerjee","D.",""],["Oberhauser","B. Banto",""],["Bernhard","J.",""],["Bisio","P.",""],["Bondi","M.",""],["Celentano","A.",""],["Charitonidis","N.",""],["Cooke","D.",""],["Crivelli","P.",""],["Depero","E.",""],["Dermenev","A. V.",""],["Donskov","S. V.",""],["Dusaev","R. R.",""],["Enik","T.",""],["Frolov","V. N.",""],["Gardikiotis","A.",""],["Gerassimov","S. G.",""],["Gninenko","S. N.",""],["Hosgen","M.",""],["Jeckel","M.",""],["Kachanov","V. A.",""],["Kambar","Y.",""],["Karneyeu","A. E.",""],["Kekelidze","G.",""],["Ketzer","B.",""],["Kirpichnikov","D. V.",""],["Kirsanov","M. M.",""],["Kolosov","V. N.",""],["Konorov","I. V.",""],["Gertsenberger","S. V.",""],["Kasianova","E. A.",""],["Kramarenko","V. A.",""],["Kravchuk","L. V.",""],["Krasnikov","N. V.",""],["Kuleshov","S. V.",""],["Lyubovitskij","V. E.",""],["Lysan","V.",""],["Marini","A.",""],["Marsican","L.",""],["Matveev","V. A.",""],["Fredes","R. M.",""],["Yanssen","R. M.",""],["Mikhailov","Yu. V.",""],["Bueno","L. Molina",""],["Mongillo","M.",""],["Peshekhonov","D. V.",""],["Polyakov","V. A.",""],["Radics","B.",""],["Salamatin","K.",""],["Samoylenko","V. D.",""],["Sieber","H.",""],["Shchukin","D.",""],["Soto","O.",""],["Tikhomirov","V. O.",""],["Tlisova","I.",""],["Toropin","A. N.",""],["Trifonov","A. Yu.",""],["Tuzi","M.",""],["Ulloa","P.",""],["Volkov","P. V.",""],["Volkov","V. Yu.",""],["Voronchikhin","I. V.",""],["Zamora-Saa","J.",""],["Zhevlakov","A. S.",""]]}
{"id":"2308.15613","submitter":"Gian Carlo Diluvi","authors":"Gian Carlo Diluvi, Benjamin Bloem-Reddy, Trevor Campbell","title":"Mixed Variational Flows for Discrete Variables","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Variational flows allow practitioners to learn complex continuous\ndistributions, but approximating discrete distributions remains a challenge.\nCurrent methodologies typically embed the discrete target in a continuous space\n- usually via continuous relaxation or dequantization - and then apply a\ncontinuous flow. These approaches involve a surrogate target that may not\ncapture the original discrete target, might have biased or unstable gradients,\nand can create a difficult optimization problem. In this work, we develop a\nvariational flow family for discrete distributions without any continuous\nembedding. First, we develop a measure-preserving and discrete (MAD) invertible\nmap that leaves the discrete target invariant, and then create a mixed\nvariational flow (MAD Mix) based on that map. We also develop an extension to\nMAD Mix that handles joint discrete and continuous models. Our experiments\nsuggest that MAD Mix produces more reliable approximations than\ncontinuous-embedding flows while being significantly faster to train.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:13:37 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Diluvi","Gian Carlo",""],["Bloem-Reddy","Benjamin",""],["Campbell","Trevor",""]]}
{"id":"2308.15614","submitter":"Haoran Liu","authors":"Haoran Liu, Bokun Wang, Jianling Wang, Xiangjue Dong, Tianbao Yang,\n  James Caverlee","title":"Everything Perturbed All at Once: Enabling Differentiable Graph Attacks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As powerful tools for representation learning on graphs, graph neural\nnetworks (GNNs) have played an important role in applications including social\nnetworks, recommendation systems, and online web services. However, GNNs have\nbeen shown to be vulnerable to adversarial attacks, which can significantly\ndegrade their effectiveness. Recent state-of-the-art approaches in adversarial\nattacks rely on gradient-based meta-learning to selectively perturb a single\nedge with the highest attack score until they reach the budget constraint.\nWhile effective in identifying vulnerable links, these methods are plagued by\nhigh computational costs. By leveraging continuous relaxation and\nparameterization of the graph structure, we propose a novel attack method\ncalled Differentiable Graph Attack (DGA) to efficiently generate effective\nattacks and meanwhile eliminate the need for costly retraining. Compared to the\nstate-of-the-art, DGA achieves nearly equivalent attack performance with 6\ntimes less training time and 11 times smaller GPU memory footprint on different\nbenchmark datasets. Additionally, we provide extensive experimental analyses of\nthe transferability of the DGA among different graph models, as well as its\nrobustness against widely-used defense mechanisms.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:14:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Haoran",""],["Wang","Bokun",""],["Wang","Jianling",""],["Dong","Xiangjue",""],["Yang","Tianbao",""],["Caverlee","James",""]]}
{"id":"2308.15615","submitter":"J. Subedi","authors":"J. Subedi (1), B. Hansen (1), M. White (1), V. Patel (1), J. Makara\n  (1), O. Atassi (1) and G. Johnson (1) ((1) Fermi National Accelerator\n  Laboratory)","title":"Nitrogen Precooling Heat Exchanger replacement and control system\n  upgrade in Superfluid Cryoplant at CMTF","comments":"Cryogenic Eng Conf and Intnl Cryo Materials Conf (CEC/ICMC 2023)","journal-ref":null,"doi":null,"report-no":"FERMILAB-CONF-23-379-TD","categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Liquid Nitrogen precooling is used in most Cryoplants to achieve cooldown to\n80 K temperature range. In one such system at Fermilab's CMTF Superfluid\nCryoplant, where the Helium supply directly exchanges heat with liquid\nNitrogen, freezing of Nitrogen occurred inside the heat exchanger due to heat\nexchanger imbalance during a Cryoplant trip. Trapped vapor pockets of N2 within\nthe frozen heat exchanger channels were formed while warming up the heat\nexchanger, creating high localized pressure and subsequent damage/rupture of\nthe heat exchanger. Replacement of the heat exchanger was done, and\nmodifications were made in the system to rectify future occurrences. The\ncontrol system was updated to bypass the heat exchanger entirely if the\nincoming Helium stream temperature drops below 76 K. This was done by\nrepurposing two control valves as heat exchanger bypass valves that were\npreviously used for a redundant 80 K adsorber in the coldbox. Additional\nmodifications were made to further prevent return of large amount of cold\nHelium gas from cold end during abrupt Cryoplant shutdown. This modification\nhas ensured high reliability of heat exchanger with prevention of freezing of\nNitrogen which can damage the heat exchanger.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:16:37 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Subedi","J.",""],["Hansen","B.",""],["White","M.",""],["Patel","V.",""],["Makara","J.",""],["Atassi","O.",""],["Johnson","G.",""]]}
{"id":"2308.15616","submitter":"J. Subedi","authors":"J. Subedi (1), T. Tope (1), B. Hansen (1), Y. Jia (1), J. Makara (1),\n  J. Tillman (1), Z. Tang (1) ((1) Fermi National Accelerator Laboratory)","title":"Design of Muon Campus full flow purifier for varying operational\n  conditions and horizontal shipping","comments":"Cryogenic Eng Conf and Intnl Cryo Materials Conf (CEC/ICMC 2023)","journal-ref":null,"doi":null,"report-no":"FERMILAB-CONF-23-380-PPD-TD","categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Constant ingress of impurities in Muon Campus g-2 experiment at Fermilab has\nresulted in reduction of efficiency of cryogenic expanders and occasional\nundesired downtime to flush the impurities. Due to insufficiency of current 60\ng/s mobile purifier, a full flow purifier is designed to be used in Muon Campus\nwhich purifies 240 g/s of Helium throughput of 4 compressors through charcoal\nbed at 80 K and returns ambient Helium back to the system. The purifier is\ndesigned to be operated near liquid Nitrogen temperature during cold operations\nand up to 400 K during regeneration. Both warm and cold operational range of\nthe purifier has required use of appropriate clearances in design due to\nexpansion and contraction. The vessel of around 16 ft height which is designed\nto be operated vertically is to be shipped horizontally. The asymmetrical\nposition of heavy stainless steel heat exchanger in the purifier support frame\nand 5g vertical load design consideration for shipping has required use of\nshipping supports and heat exchanger rotational stops to comply with design\nrequirements. FEA of purifier system is performed in cold, warm and shipping\ncases to verify that the purifier satisfies the design requirements.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:20:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Subedi","J.","","Fermi National Accelerator Laboratory"],["Tope","T.","","Fermi National Accelerator Laboratory"],["Hansen","B.","","Fermi National Accelerator Laboratory"],["Jia","Y.","","Fermi National Accelerator Laboratory"],["Makara","J.","","Fermi National Accelerator Laboratory"],["Tillman","J.","","Fermi National Accelerator Laboratory"],["Tang","Z.","","Fermi National Accelerator Laboratory"]]}
{"id":"2308.15617","submitter":"Marcelo Fonseca Faraj","authors":"Marcelo Fonseca Faraj","title":"Streaming, Local, and Multi-Level (Hyper)Graph Decomposition","comments":"Doctoral thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  (Hyper)Graph decomposition is a family of problems that aim to break down\nlarge (hyper)graphs into smaller sub(hyper)graphs for easier analysis. The\nimportance of this lies in its ability to enable efficient computation on large\nand complex (hyper)graphs, such as social networks, chemical compounds, and\ncomputer networks. This dissertation explores several types of (hyper)graph\ndecomposition problems, including graph partitioning, hypergraph partitioning,\nlocal graph clustering, process mapping, and signed graph clustering. Our main\nfocus is on streaming algorithms, local algorithms and multilevel algorithms.\nIn terms of streaming algorithms, we make contributions with highly efficient\nand effective algorithms for (hyper)graph partitioning and process mapping. In\nterms of local algorithms, we propose sub-linear algorithms which are effective\nin detecting high-quality local communities around a given seed node in a graph\nbased on the distribution of a given motif. In terms of multilevel algorithms,\nwe engineer high-quality multilevel algorithms for process mapping and signed\ngraph clustering. We provide a thorough discussion of each algorithm along with\nexperimental results demonstrating their superiority over existing\nstate-of-the-art techniques. The results show that the proposed algorithms\nachieve improved performance and better solutions in various metrics, making\nthem highly promising for practical applications. Overall, this dissertation\nshowcases the effectiveness of advanced combinatorial algorithmic techniques in\nsolving challenging (hyper)graph decomposition problems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:24:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Faraj","Marcelo Fonseca",""]]}
{"id":"2308.15618","submitter":"Anirudh Choudhary","authors":"Anirudh Choudhary, Angelina Hwang, Jacob Kechter, Krishnakant Saboo,\n  Blake Bordeaux, Puneet Bhullar, Nneka Comfere, David DiCaudo, Steven Nelson,\n  Emma Johnson, Leah Swanson, Dennis Murphree, Aaron Mangold, Ravishankar K.\n  Iyer","title":"RACR-MIL: Weakly Supervised Skin Cancer Grading using Rank-Aware\n  Contextual Reasoning on Whole Slide Images","comments":"7 pages main text, 2 page references, 3 page appendix; submitted to\n  AAAI","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cutaneous squamous cell cancer (cSCC) is the second most common skin cancer\nin the US. It is diagnosed by manual multi-class tumor grading using a tissue\nwhole slide image (WSI), which is subjective and suffers from inter-pathologist\nvariability. We propose an automated weakly-supervised grading approach for\ncSCC WSIs that is trained using WSI-level grade and does not require\nfine-grained tumor annotations. The proposed model, RACR-MIL, transforms each\nWSI into a bag of tiled patches and leverages attention-based multiple-instance\nlearning to assign a WSI-level grade. We propose three key innovations to\naddress general as well as cSCC-specific challenges in tumor grading. First, we\nleverage spatial and semantic proximity to define a WSI graph that encodes both\nlocal and non-local dependencies between tumor regions and leverage graph\nattention convolution to derive contextual patch features. Second, we introduce\na novel ordinal ranking constraint on the patch attention network to ensure\nthat higher-grade tumor regions are assigned higher attention. Third, we use\ntumor depth as an auxiliary task to improve grade classification in a multitask\nlearning framework. RACR-MIL achieves 2-9% improvement in grade classification\nover existing weakly-supervised approaches on a dataset of 718 cSCC tissue\nimages and localizes the tumor better. The model achieves 5-20% higher accuracy\nin difficult-to-classify high-risk grade classes and is robust to class\nimbalance.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:25:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Choudhary","Anirudh",""],["Hwang","Angelina",""],["Kechter","Jacob",""],["Saboo","Krishnakant",""],["Bordeaux","Blake",""],["Bhullar","Puneet",""],["Comfere","Nneka",""],["DiCaudo","David",""],["Nelson","Steven",""],["Johnson","Emma",""],["Swanson","Leah",""],["Murphree","Dennis",""],["Mangold","Aaron",""],["Iyer","Ravishankar K.",""]]}
{"id":"2308.15619","submitter":"Guillaume Thekkadath","authors":"Guillaume Thekkadath and Duncan England and Benjamin Sussman","title":"Intensity correlation holography for remote phase sensing and 3D imaging","comments":"9 pages; 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Holography is an established technique for measuring the wavefront of optical\nsignals through interferometric combination with a reference wave.\nConventionally the integration time of a hologram is limited by the\ninterferometer coherence time, thus making it challenging to prepare holograms\nof remote objects, especially using weak illumination. Here, we circumvent this\nlimitation by using intensity correlation interferometry. Although the exposure\ntime of individual holograms must be shorter than the interferometer coherence\ntime, we show that any number of randomly phase-shifted holograms can be\ncombined into a single intensity-correlation hologram. In a proof-of-principle\nexperiment, we use this technique to perform phase imaging and 3D\nreconstruction of an object at a ~3m distance using weak illumination and\nwithout active phase stabilization.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:28:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Thekkadath","Guillaume",""],["England","Duncan",""],["Sussman","Benjamin",""]]}
{"id":"2308.15620","submitter":"Pakizar Shamoi Dr","authors":"Izbassar Assylzhan, Muragul Muratbekova, Daniyar Amangeldi, Nazzere\n  Oryngozha, Anna Ogorodova, Pakizar Shamoi","title":"Intelligent System for Assessing University Student Personality\n  Development and Career Readiness","comments":"8 pages. Submitted to Elsevier conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While academic metrics such as transcripts and GPA are commonly used to\nevaluate students' knowledge acquisition, there is a lack of comprehensive\nmetrics to measure their preparedness for the challenges of post-graduation\nlife. This research paper explores the impact of various factors on university\nstudents' readiness for change and transition, with a focus on their\npreparedness for careers. The methodology employed in this study involves\ndesigning a survey based on Paul J. Mayer's \"The Balance Wheel\" to capture\nstudents' sentiments on various life aspects, including satisfaction with the\neducational process and expectations of salary. The collected data from a KBTU\nstudent survey (n=47) were processed through machine learning models: Linear\nRegression, Support Vector Regression (SVR), Random Forest Regression.\nSubsequently, an intelligent system was built using these models and fuzzy\nsets. The system is capable of evaluating graduates' readiness for their future\ncareers and demonstrates a high predictive power. The findings of this research\nhave practical implications for educational institutions. Such an intelligent\nsystem can serve as a valuable tool for universities to assess and enhance\nstudents' preparedness for post-graduation challenges. By recognizing the\nfactors contributing to students' readiness for change, universities can refine\ncurricula and processes to better prepare students for their career journeys.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:32:58 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Assylzhan","Izbassar",""],["Muratbekova","Muragul",""],["Amangeldi","Daniyar",""],["Oryngozha","Nazzere",""],["Ogorodova","Anna",""],["Shamoi","Pakizar",""]]}
{"id":"2308.15621","submitter":"Sander Rhebergen","authors":"Aycil Cesmelioglu, Jeonghun J. Lee, Sander Rhebergen","title":"A hybridizable discontinuous Galerkin method for the coupled\n  Navier-Stokes/Biot problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we present a hybridizable discontinuous Galerkin method for the\ntime-dependent Navier-Stokes equations coupled to the quasi-static\nporoelasticity equations via interface conditions. We determine a bound on the\ndata that guarantees stability and well-posedness of the fully discrete problem\nand prove a priori error estimates. A numerical example confirms our analysis.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:34:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cesmelioglu","Aycil",""],["Lee","Jeonghun J.",""],["Rhebergen","Sander",""]]}
{"id":"2308.15622","submitter":"Gu Zhang","authors":"Gu Zhang, Hao-Shu Fang, Hongjie Fang, Cewu Lu","title":"Flexible Handover with Real-Time Robust Dynamic Grasp Trajectory\n  Generation","comments":"Paper accepted by IROS2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, there has been a significant effort dedicated to developing\nefficient, robust, and general human-to-robot handover systems. However, the\narea of flexible handover in the context of complex and continuous objects'\nmotion remains relatively unexplored. In this work, we propose an approach for\neffective and robust flexible handover, which enables the robot to grasp moving\nobjects with flexible motion trajectories with a high success rate. The key\ninnovation of our approach is the generation of real-time robust grasp\ntrajectories. We also design a future grasp prediction algorithm to enhance the\nsystem's adaptability to dynamic handover scenes. We conduct one-motion\nhandover experiments and motion-continuous handover experiments on our novel\nbenchmark that includes 31 diverse household objects. The system we have\ndeveloped allows users to move and rotate objects in their hands within a\nrelatively large range. The success rate of the robot grasping such moving\nobjects is 78.15% over the entire household object benchmark.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:40:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Gu",""],["Fang","Hao-Shu",""],["Fang","Hongjie",""],["Lu","Cewu",""]]}
{"id":"2308.15623","submitter":"Richard Cloete","authors":"Abraham Loeb, Toby Adamson, Sophie Bergstrom, Richard Cloete, Shai\n  Cohen, Kevin Conrad, Laura Domine, Hairuo Fu, Charles Hoskinson, Eugenia\n  Hyung, Stein Jacobsen, Mike Kelly, Jason Kohn, Edwin Lard, Sebastian Lam,\n  Frank Laukien, Jim Lem, Rob McCallum, Rob Millsap, Christopher Parendo,\n  Michail Pataev, Chaitanya Peddeti, Jeff Pugh, Shmuel Samuha, Dimitar\n  Sasselov, Max Schlereth, J.J. Siler, Amir Siraj, Peter Mark Smith, Roald\n  Tagle, Jonathan Taylor, Ryan Weed, Art Wright, Jeff Wynn","title":"Discovery of Spherules of Likely Extrasolar Composition in the Pacific\n  Ocean Site of the CNEOS 2014-01-08 (IM1) Bolide","comments":"Submitted for publication in a peer-reviewed journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We have conducted an extensive towed-magnetic-sled survey during the period\n14-28 June, 2023, over the seafloor centered around the calculated path of the\nbolide CNEOS 2014-01-08 (IM1) about 85 km north of Manus Island, Papua New\nGuinea. We found about 700 spherules of diameter 0.05-1.3 millimeters in our\nsamples, of which 57 were analyzed so far. The spherules were significantly\nconcentrated along the expected meteor path. Mass spectrometry of 47 spherules\nnear the high-yield regions along IM1's path reveals a distinct extra-solar\nabundance pattern for 5 of them, while background spherules have abundances\nconsistent with a solar system origin. The unique spherules show an excess of\nBe, La and U, by up to three orders of magnitude relative to the solar system\nstandard of CI chondrites. These \"BeLaU\"-type spherules, never seen before,\nalso have very low refractory siderophile elements such as Re. Volatile\nelements, such as Mn, Zn, Pb, are depleted as expected from evaporation losses\nduring a meteor's airburst. In addition, the mass-dependent variations in\n$^{57}$Fe/$^{54}$Fe and $^{56}$Fe/$^{54}$Fe are also consistent with\nevaporative loss of the light isotopes during the spherules' travel in the\natmosphere. The \"BeLaU\" abundance pattern is not found in control regions\noutside of IM1's path and does not match commonly manufactured alloys or\nnatural meteorites in the solar system. This evidence points towards an\nassociation of \"BeLaU\"-type spherules with IM1, supporting its interstellar\norigin independently of the high velocity and unusual material strength implied\nfrom the CNEOS data. We suggest that the \"BeLaU\" abundance pattern could have\noriginated from a highly differentiated magma ocean of a planet with an iron\ncore outside the solar system or from more exotic sources.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:40:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Loeb","Abraham",""],["Adamson","Toby",""],["Bergstrom","Sophie",""],["Cloete","Richard",""],["Cohen","Shai",""],["Conrad","Kevin",""],["Domine","Laura",""],["Fu","Hairuo",""],["Hoskinson","Charles",""],["Hyung","Eugenia",""],["Jacobsen","Stein",""],["Kelly","Mike",""],["Kohn","Jason",""],["Lard","Edwin",""],["Lam","Sebastian",""],["Laukien","Frank",""],["Lem","Jim",""],["McCallum","Rob",""],["Millsap","Rob",""],["Parendo","Christopher",""],["Pataev","Michail",""],["Peddeti","Chaitanya",""],["Pugh","Jeff",""],["Samuha","Shmuel",""],["Sasselov","Dimitar",""],["Schlereth","Max",""],["Siler","J. J.",""],["Siraj","Amir",""],["Smith","Peter Mark",""],["Tagle","Roald",""],["Taylor","Jonathan",""],["Weed","Ryan",""],["Wright","Art",""],["Wynn","Jeff",""]]}
{"id":"2308.15624","submitter":"Muath Alsuhaibani","authors":"Muath Alsuhaibani, Hiroko H. Dodge, Mohammad H. Mahoor","title":"Detection of Mild Cognitive Impairment Using Facial Features in Video\n  Conversations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Early detection of Mild Cognitive Impairment (MCI) leads to early\ninterventions to slow the progression from MCI into dementia. Deep Learning\n(DL) algorithms could help achieve early non-invasive, low-cost detection of\nMCI. This paper presents the detection of MCI in older adults using DL models\nbased only on facial features extracted from video-recorded conversations at\nhome. We used the data collected from the I-CONECT behavioral intervention\nstudy (NCT02871921), where several sessions of semi-structured interviews\nbetween socially isolated older individuals and interviewers were video\nrecorded. We develop a framework that extracts spatial holistic facial features\nusing a convolutional autoencoder and temporal information using transformers.\nOur proposed DL model was able to detect the I-CONECT study participants'\ncognitive conditions (MCI vs. those with normal cognition (NC)) using facial\nfeatures. The segments and sequence information of the facial features improved\nthe prediction performance compared with the non-temporal features. The\ndetection accuracy using this combined method reached 88% whereas 84% is the\naccuracy without applying the segments and sequences information of the facial\nfeatures within a video on a certain theme.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:45:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Alsuhaibani","Muath",""],["Dodge","Hiroko H.",""],["Mahoor","Mohammad H.",""]]}
{"id":"2308.15625","submitter":"G\\'abor Cz\\'edli","authors":"G\\'abor Cz\\'edli","title":"Sperner theorems for unrelated copies of some partially ordered sets in\n  a powerset lattice and minimum generating sets of powers of distributive\n  lattices","comments":"20 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a finite poset (partially ordered set) $U$ and a natural number $n$, let\nSp$(U,n)$ denote the largest number of pairwise unrelated copies of $U$ in the\npowerset lattice (AKA subset lattice) of an $n$-element set. If $U$ is the\nsingleton poset, then Sp$(U,n)$ was determined by E. Sperner in 1928; this\nresult is well known in extremal combinatorics as well as Griggs, Stahl, and\nTrotter's 1984 result for $U$ being a finite chain. We determine Sp$(U,n)$ for\nall finite posets with 0 and 1, and we give estimates for some other posets.\n  For a lattice $L$, let Gmin($L$) denote the minimum size of generating sets\nof $L$. We prove that if $U$ is the poset of the join-irreducible elements of a\nfinite distributive lattice $D$, then the function $k\\mapsto$ Gmin($D^k)$ is\nthe left adjoint of the function $n\\mapsto$ Sp$(U,n)$ . This allows us to\ndetermine Gmin($D^k)$ in many cases. E.g., for a 5-element distributive lattice\n$D$, Gmin($D^{2023})=17$ if $D$ is a chain and Gmin($D^{2023})=15$ otherwise.\n  It follows that large direct powers of small distributive lattices are\nappropriate for our 2021 cryptographic authentication protocol.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:46:58 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cz\u00e9dli","G\u00e1bor",""]]}
{"id":"2308.15626","submitter":"Leonid Pekker","authors":"Leonid Pekker","title":"Analytical One-Dimensional Model of Drop Ejection from a Micro-Size\n  Nozzle","comments":"17 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we construct a novel one-dimensional model of drop ejection\nfrom a micro-size nozzle due to a short pressure pulse applied to the liquid in\nthe nozzle. The pressure pulse supplies the kinetic energy to the perturbed\nliquid-bulge squeezed from the nozzle, which then ballistically lengthens\nforming a ligament. The Plateau-Rayleigh instability forms a neck in the\nligament at the nozzle, leading to detachment of the ligament from the nozzle,\nwhich then collapses in a drop. This drop formation sequence is typical for\ndrop-on-demand printheads in which the drop is ejected from the nozzle by a\nshort pressure pulse at the needed moment of time when it should reach the\nsubstrate. The model calculates the velocity of the droplet, length of the\nligament vs. time, and the time when the ligament detaches from the nozzle as a\nfunction of the exit radius of the nozzle, the volume of the droplet, the time\nthat the volume of the droplet is squeezed from the nozzle, viscosity, surface\ntension, and mass density of the liquid drop. The model also calculates a\ncriterion for drop ejection from the nozzle.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:50:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pekker","Leonid",""]]}
{"id":"2308.15627","submitter":"Ruoxuan Xiong","authors":"Junting Duan, Markus Pelger, Ruoxuan Xiong","title":"Target PCA: Transfer Learning Large Dimensional Panel Data","comments":"Journal of Econometrics, accepted. The Internet Appendix\n  (https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4556029) collects the\n  detailed proofs for all the theoretical statements in the main text, the data\n  description, and additional simulation results","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 develops a novel method to estimate a latent factor model for a\nlarge target panel with missing observations by optimally using the information\nfrom auxiliary panel data sets. We refer to our estimator as target-PCA.\nTransfer learning from auxiliary panel data allows us to deal with a large\nfraction of missing observations and weak signals in the target panel. We show\nthat our estimator is more efficient and can consistently estimate weak\nfactors, which are not identifiable with conventional methods. We provide the\nasymptotic inferential theory for target-PCA under very general assumptions on\nthe approximate factor model and missing patterns. In an empirical study of\nimputing data in a mixed-frequency macroeconomic panel, we demonstrate that\ntarget-PCA significantly outperforms all benchmark methods.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:53:06 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Duan","Junting",""],["Pelger","Markus",""],["Xiong","Ruoxuan",""]]}
{"id":"2308.15628","submitter":"Eliza Gazda","authors":"Eliza Gazda (for the JEM-EUSO collaboration)","title":"The EUSO-SPB2 Cherenkov Telescope -- Flight Performance and Preliminary\n  Results","comments":null,"journal-ref":null,"doi":"10.22323/1.444.1029","report-no":null,"categories":"astro-ph.IM astro-ph.HE physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Astrophysical Very-High-Energy (VHE, >10PeV) neutrinos deliver crucial\ninformation about the sources of Ultra-High-Energy Cosmic Rays (UHECRs), the\ncomposition of UHECRs, and neutrino/particle physics at highest energies.\nUHE-tau neutrinos skimming the Earth's surface produce tau leptons, which can\nemerge from the ground, decay, and start an upward-going extensive air shower\n(EAS) in the Earth's atmosphere. The tau neutrino can be reconstructed by\nimaging the EAS. We developed an atmospheric Cherenkov Telescope flying on the\nExtreme Universe Space Observatory Super Pressure Balloon 2 (EUSO-SPB2) mission\nto test the air-shower imaging concept at highest altitudes. The EUSO-SPB2\nultra-long-duration balloon mission is a precursor of the Probe of Extreme\nMulti-Messenger Astrophysics (POEMMA), a candidate for an astrophysics\nprobe-class mission. The telescope implements Schmidt optics with a 0.785 m^2\nlight collection area and a 512-pixel SiPM camera covering a 12.8{\\deg} by\n6.4{\\deg} (Horizontal by Vertical) field-of-view with 0.4{\\deg} resolution. The\ncamera signals are sampled with 100MSa/s and digitized with 12-bit resolution.\nThe objectives of the EUSO-SPB2 Cherenkov telescope include a search for UHE\nneutrinos below Earth's limb, UHECRs above the limb, the study of the night sky\nbackground, and studying the telescope's performance. In this presentation, I\nwill present an overview of the Cherenkov telescope and discuss the in-flight\nperformance of the telescope.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:55:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gazda","Eliza","","for the JEM-EUSO collaboration"]]}
{"id":"2308.15629","submitter":"Marta Milewska","authors":"Marta Milewska and Remco van der Hofstad and Bert Zwart","title":"Dynamic random intersection graph: Dynamic local convergence and giant\n  structure","comments":"51 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Random intersection graphs containing an underlying community structure are a\npopular choice for modelling real-world networks. Given the group memberships,\nthe classical random intersection graph is obtained by connecting individuals\nwhen they share at least one group. We extend this approach and make the\ncommunities dynamic by letting them alternate between an active and inactive\nphase. We analyse the new model, delivering results on degree distribution,\nlocal convergence, giant component, and maximum group size, paying particular\nattention to the dynamic description of these properties. We also describe the\nconnection between our model and the bipartite configuration model, which is of\nindependent interest.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:55:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Milewska","Marta",""],["van der Hofstad","Remco",""],["Zwart","Bert",""]]}
{"id":"2308.15630","submitter":"Luis Flores","authors":"F. J. Escrihuela, L. J. Flores, O. G. Miranda, Javier Rend\\'on, R.\n  S\\'anchez-V\\'elez","title":"Examining the sensitivity of FASER to Generalized Neutrino Interactions","comments":"26 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 investigate the sensitivity of the FASER$\\nu$ detector, a novel\nexperimental setup at the LHC, to probe and constrain generalized neutrino\ninteractions (GNI). Employing a comprehensive theoretical framework, we model\nthe effects of generalized neutrino interactions on neutrino-nucleon deep\ninelastic scattering processes within the FASER$\\nu$ detector. By considering\nall the neutrino channels produced at the LHC, we perform a statistical\nanalysis to determine the sensitivity of FASER$\\nu$ to constrain these\ninteractions. Our results demonstrate that FASER$\\nu$ can place stringent\nconstraints on the GNI effective couplings. Additionally, we study the relation\nbetween GNI and a minimal Leptoquark model where the SM is augmented by a\nsinglet Leptoquark with hypercharge $1/3$. We have found that the sensitivities\nfor various combinations of the Leptoquark Yukawa couplings are approximately\n$\\mathcal{O}(1)$, particularly when considering a Leptoquark mass in the TeV\nrange.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:56:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Escrihuela","F. J.",""],["Flores","L. J.",""],["Miranda","O. G.",""],["Rend\u00f3n","Javier",""],["S\u00e1nchez-V\u00e9lez","R.",""]]}
{"id":"2308.15631","submitter":"Gregor Taylor","authors":"Gregor G. Taylor, Alexander B. Walter, Boris Korzh, Bruce Bumble,\n  Sahil R. Patel, Jason P. Allmaras, Andrew D. Beyer, Roger O'Brient, Matthew\n  D. Shaw and Emma E. Wollman","title":"Low-noise single-photon counting superconducting nanowire detectors at\n  infrared wavelengths up to 29 $\\mu$m","comments":"15 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.supr-con physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on the extension of the spectral sensitivity of superconducting\nnanowire single-photon detectors to a wavelength of 29 $\\mu$m. This represents\nthe first demonstration of a time correlated single-photon counting detector at\nthese long infrared wavelengths. We achieve saturated internal detection\nefficiency from 10 to 29 $\\mu$m, whilst maintaining dark count rates below 0.1\ncounts per second. Extension of superconducting nanowire single-photon\ndetectors to this spectral range provides low noise and high timing resolution\nphoton counting detection, effectively providing a new class of single-photon\nsensitive detector for these wavelengths. These detectors are important for\napplications such as exoplanet spectroscopy, infrared astrophysics, physical\nchemistry, remote sensing and direct dark-matter detection.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:56:04 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Taylor","Gregor G.",""],["Walter","Alexander B.",""],["Korzh","Boris",""],["Bumble","Bruce",""],["Patel","Sahil R.",""],["Allmaras","Jason P.",""],["Beyer","Andrew D.",""],["O'Brient","Roger",""],["Shaw","Matthew D.",""],["Wollman","Emma E.",""]]}
{"id":"2308.15632","submitter":"David Leisawitz","authors":"David Leisawitz, Matteo Bonato, Duncan Farrah, T. Tupper Hyde,\n  Al\\'aine Lee, Joshua Bennett Lovell, Brenda Matthews, Lee G. Mundy, Conor\n  Nixon, Petr Pokorny, Berke V. Ricketti, Giorgio Savini, Jeremy Scott, Irene\n  Shivaei, Locke Spencer, Kate Su, C. Megan Urry, and David Wilner","title":"The science case for a far-infrared interferometer in the era of JWST\n  and ALMA","comments":"11 pages, 12 figures. To be published in Proc. SPIE Conf. 12686\n  \"Instruments: Scientific Returns and Conceptual Designs\"","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A space-based far-infrared interferometer could work synergistically with the\nJames Webb Space Telescope (JWST) and the Atacama Large Millimeter Array (ALMA)\nto revolutionize our understanding of the astrophysical processes leading to\nthe formation of habitable planets and the co-evolution of galaxies and their\ncentral supermassive black holes. Key to these advances are measurements of\nwater in its frozen and gaseous states, observations of astronomical objects in\nthe spectral range where most of their light is emitted, and access to critical\ndiagnostic spectral lines, all of which point to the need for a far-infrared\nobservatory in space. The objects of interest - circumstellar disks and distant\ngalaxies - typically appear in the sky at sub-arcsecond scales, which rendered\nall but a few of them unresolvable with the successful and now-defunct 3.5-m\nHerschel Space Observatory, the largest far-infrared telescope flown to date. A\nfar-infrared interferometer with maximum baseline length in the tens of meters\nwould match the angular resolution of JWST at 10x longer wavelengths and\nobserve water ice and water-vapor emission, which ALMA can barely do through\nthe Earth's atmosphere. Such a facility was conceived and studied two decades\nago. Here we revisit the science case for a space-based far-infrared\ninterferometer in the era of JWST and ALMA and summarize the measurement\ncapabilities that will enable the interferometer to achieve a set of compelling\nscientific objectives. Common to all the science themes we consider is a need\nfor sub-arcsecond image resolution.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:56:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Leisawitz","David",""],["Bonato","Matteo",""],["Farrah","Duncan",""],["Hyde","T. Tupper",""],["Lee","Al\u00e1ine",""],["Lovell","Joshua Bennett",""],["Matthews","Brenda",""],["Mundy","Lee G.",""],["Nixon","Conor",""],["Pokorny","Petr",""],["Ricketti","Berke V.",""],["Savini","Giorgio",""],["Scott","Jeremy",""],["Shivaei","Irene",""],["Spencer","Locke",""],["Su","Kate",""],["Urry","C. Megan",""],["Wilner","David",""]]}
{"id":"2308.15633","submitter":"Pedram Rabiee","authors":"Pedram Rabiee, S. Alireza Seyyed Mousavi, Amelia J. S. Sheffler, Erik\n  Hellstr\\\"om, Mrdjan Jankovic, Mario A. Santillo, T. M. Seigler, Jesse B.\n  Hoagg","title":"The Impact of Reference-Command Preview on Human-in-the-Loop Control\n  Behavior","comments":"Preprint submitted to IEEE Transactions on Cybernetics","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article presents results from an experiment in which 44 human subjects\ninteract with a dynamic system to perform 40 trials of a command-following\ntask. The reference command is unpredictable and different on each trial, but\nall subjects have the same sequence of reference commands for the 40 trials.\nThe subjects are divided into 4 groups of 11 subjects. One group performs the\ncommand-following task without preview of the reference command, and the other\n3 groups are given preview of the reference command for different time lengths\ninto the future (0.5 s, 1 s, 1.5 s). A subsystem identification algorithm is\nused to obtain best-fit models of each subject's control behavior on each\ntrial. The time- and frequency-domain performance, as well as the identified\nmodels of the control behavior for the 4 groups are examined to investigate the\neffects of reference-command preview. The results suggest that preview tends to\nimprove performance by allowing the subjects to compensate for sensory time\ndelay and approximate the inverse dynamics in feedforward. However, too much\npreview may decrease performance by degrading the ability to use the correct\nphase lead in feedforward.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 20:56:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rabiee","Pedram",""],["Mousavi","S. Alireza Seyyed",""],["Sheffler","Amelia J. S.",""],["Hellstr\u00f6m","Erik",""],["Jankovic","Mrdjan",""],["Santillo","Mario A.",""],["Seigler","T. M.",""],["Hoagg","Jesse B.",""]]}
{"id":"2308.15634","submitter":"Jiangming Yao","authors":"A. Belley, J. M. Yao, B. Bally, J. Pitcher, J. Engel, H. Hergert, J.\n  D. Holt, T. Miyagi, T. R. Rodriguez, A. M. Romero, S. R. Stroberg, and X.\n  Zhang","title":"Ab initio uncertainty quantification of neutrinoless double-beta decay\n  in $^{76}$Ge","comments":"include 6+11 pages, 1+3 tables, and 2+10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ex hep-ph nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The observation of neutrinoless double-beta ($0\\nu\\beta\\beta$) decay would\noffer proof of lepton number violation, demonstrating that neutrinos are\nMajorana particles, while also helping us understand why there is more matter\nthan antimatter in the Universe. If the decay is driven by the exchange of the\nthree known light neutrinos, a discovery would, in addition, link the observed\ndecay rate to the neutrino mass scale through a theoretical quantity known as\nthe nuclear matrix element (NME). Accurate values of the NMEs for all nuclei\nconsidered for use in $0\\nu\\beta\\beta$ experiments are therefore crucial for\ndesigning and interpreting those experiments. Here, we report the first\ncomprehensive ab initio uncertainty quantification of the\n$0\\nu\\beta\\beta$-decay NME, in the key nucleus $^{76}$Ge. Our method employs\nnuclear strong and weak interactions derived within chiral effective field\ntheory and recently developed many-body emulators. Our result, with a\nconservative treatment of uncertainty, is an NME of $3.44^{+1.33}_{-1.56}$,\nwhich, together with the best-existing half-life sensitivity, sets an upper\nlimit for effective neutrino mass of $141^{+117}_{-39}$ meV. The result is\nimportant for designing next-generation germanium detectors aiming to cover the\nentire inverted hierarchy region of neutrino masses. When extended to other\nisotopes, our approach will allow a careful comparison of experiments.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:01:07 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Belley","A.",""],["Yao","J. M.",""],["Bally","B.",""],["Pitcher","J.",""],["Engel","J.",""],["Hergert","H.",""],["Holt","J. D.",""],["Miyagi","T.",""],["Rodriguez","T. R.",""],["Romero","A. M.",""],["Stroberg","S. R.",""],["Zhang","X.",""]]}
{"id":"2308.15635","submitter":"Marie Diana Sieper","authors":"Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar,\n  Stephen Kobourov, Marie Diana Sieper","title":"Parameterized and Approximation Algorithms for the Maximum Bimodal\n  Subgraph Problem","comments":"Appears in the Proceedings of the 31st International Symposium on\n  Graph Drawing and Network Visualization (GD 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A vertex of a plane digraph is bimodal if all its incoming edges (and hence\nall its outgoing edges) are consecutive in the cyclic order around it. A plane\ndigraph is bimodal if all its vertices are bimodal. Bimodality is at the heart\nof many types of graph layouts, such as upward drawings, level-planar drawings,\nand L-drawings. If the graph is not bimodal, the Maximum Bimodal Subgraph (MBS)\nproblem asks for an embedding-preserving bimodal subgraph with the maximum\nnumber of edges. We initiate the study of the MBS problem from the\nparameterized complexity perspective with two main results: (i) we describe an\nFPT algorithm parameterized by the branchwidth (and hence by the treewidth) of\nthe graph; (ii) we establish that MBS parameterized by the number of\nnon-bimodal vertices admits a polynomial kernel. As the byproduct of these\nresults, we obtain a subexponential FPT algorithm and an efficient\npolynomial-time approximation scheme for MBS.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:01:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Didimo","Walter",""],["Fomin","Fedor V.",""],["Golovach","Petr A.",""],["Inamdar","Tanmay",""],["Kobourov","Stephen",""],["Sieper","Marie Diana",""]]}
{"id":"2308.15636","submitter":"Shunqiao Sun","authors":"Shunqiao Sun, Yunqiao Hu, Kumar Vijay Mishra, and Athina P. Petropulu","title":"Widely Separated MIMO Radar Using Matrix Completion","comments":"13 pages, submitted to IEEE Transactions on Radar Systems","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a low-complexity widely separated multiple-input-multiple-output\n(WS-MIMO) radar that samples the signals at each of its multiple receivers at\nreduced rates. We process the low-rate samples of all transmit-receive chains\nat each receiver as data matrices. We demonstrate that each of these matrices\nis low rank as long as the target moves slowly within a coherent processing\ninterval. We leverage matrix completion (MC) to recover the missing samples of\neach receiver signal matrix at the common fusion center. Subsequently, we\nestimate the targets' positions and Doppler velocities via the maximum\nlikelihood method. Our MC-WS-MIMO approach recovers missing samples and\nthereafter target parameters at reduced rates without discretization. Our\nanalysis using ambiguity functions shows that antenna geometry affects the\nperformance of MC-WS-MIMO. Numerical experiments demonstrate reasonably\naccurate target localization at SNR of 20 dB and sampling rate reduction to\n20%.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:07:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sun","Shunqiao",""],["Hu","Yunqiao",""],["Mishra","Kumar Vijay",""],["Petropulu","Athina P.",""]]}
{"id":"2308.15637","submitter":"Akash Dhruv","authors":"Akash Dhruv, Anshu Dubey","title":"Designing Laboratory Notebooks for Managing Software-based Scientific\n  Studies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Scientific processes rely on software as an important tool for data\nacquisition, analysis, and discovery. Over the years sustainable software\ndevelopment practices have made progress in being considered as an integral\ncomponent of research. However, management of computation-based scientific\nstudies is often left to individual researchers who design their computational\nexperiments based on personal preferences and the nature of the study. We\nbelieve that the quality, efficiency, and reproducibility of computation-based\nscientific research can be improved by explicitly creating an execution\nenvironment that allows researchers to provide a clear record of traceability.\nThis is particularly relevant to complex computational studies in\nhigh-performance computing (HPC) environments. In this article, we review the\ndocumentation required to maintain a comprehensive record of HPC computational\nexperiments for reproducibility. We also provide an overview of tools and\npractices that we have developed to perform such studies around Flash-X, a\nmulti-physics scientific software\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:13:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dhruv","Akash",""],["Dubey","Anshu",""]]}
{"id":"2308.15638","submitter":"Guoxi Liu","authors":"Guoxi Liu and Federico Iuricich","title":"A Task-Parallel Approach for Localized Topological Data Structures","comments":"11pages, 13 figures, accepted at 2023 IEEE Visualization Conference\n  (VIS)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.CG cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unstructured meshes are characterized by data points irregularly distributed\nin the Euclidian space. Due to the irregular nature of these data, computing\nconnectivity information between the mesh elements requires much more time and\nmemory than on uniformly distributed data. To lower storage costs, dynamic data\nstructures have been proposed. These data structures compute connectivity\ninformation on the fly and discard them when no longer needed. However,\non-the-fly computation slows down algorithms and results in a negative impact\non the time performance. To address this issue, we propose a new task-parallel\napproach to proactively compute mesh connectivity. Unlike previous approaches\nimplementing data-parallel models, where all threads run the same type of\ninstructions, our task-parallel approach allows threads to run different\nfunctions. Specifically, some threads run the algorithm of choice while other\nthreads compute connectivity information before they are actually needed. The\napproach was implemented in the new Accelerated Clustered TOPOlogical (ACTOPO)\ndata structure, which can support any processing algorithm requiring mesh\nconnectivity information. Our experiments show that ACTOPO combines the\nbenefits of state-of-the-art memory-efficient (TTK CompactTriangulation) and\ntime-efficient (TTK ExplicitTriangulation) topological data structures. It\noccupies a similar amount of memory as TTK CompactTriangulation while providing\nup to 5x speedup. Moreover, it achieves comparable time performance as TTK\nExplicitTriangulation while using only half of the memory space.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:13:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Guoxi",""],["Iuricich","Federico",""]]}
{"id":"2308.15639","submitter":"Andrii Skliar","authors":"Andrii Skliar, Maurice Weiler","title":"Hyperbolic Convolutional Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep Learning is mostly responsible for the surge of interest in Artificial\nIntelligence in the last decade. So far, deep learning researchers have been\nparticularly successful in the domain of image processing, where Convolutional\nNeural Networks are used. Although excelling at image classification,\nConvolutional Neural Networks are quite naive in that no inductive bias is set\non the embedding space for images. Similar flaws are also exhibited by another\ntype of Convolutional Networks - Graph Convolutional Neural Networks. However,\nusing non-Euclidean space for embedding data might result in more robust and\nexplainable models. One example of such a non-Euclidean space is hyperbolic\nspace. Hyperbolic spaces are particularly useful due to their ability to fit\nmore data in a low-dimensional space and tree-likeliness properties. These\nattractive properties have been previously used in multiple papers which\nindicated that they are beneficial for building hierarchical embeddings using\nshallow models and, recently, using MLPs and RNNs.\n  However, no papers have yet suggested a general approach to using Hyperbolic\nConvolutional Neural Networks for structured data processing, although these\nare the most common examples of data used. Therefore, the goal of this work is\nto devise a general recipe for building Hyperbolic Convolutional Neural\nNetworks. We hypothesize that ability of hyperbolic space to capture hierarchy\nin the data would lead to better performance. This ability should be\nparticularly useful in cases where data has a tree-like structure. Since this\nis the case for many existing datasets \\citep{wordnet, imagenet, fb15k}, we\nargue that such a model would be advantageous both in terms of applications and\nfuture research prospects.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:20:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Skliar","Andrii",""],["Weiler","Maurice",""]]}
{"id":"2308.15640","submitter":"Hanxun Jin","authors":"Siyuan Song, Hanxun Jin","title":"Identifying Constitutive Parameters for Complex Hyperelastic Solids\n  using Physics-Informed Neural Networks","comments":"31 pages, 5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Identifying constitutive parameters in engineering and biological materials,\nparticularly those with intricate geometries and mechanical behaviors, remains\na longstanding challenge. The recent advent of Physics-Informed Neural Networks\n(PINNs) offers promising solutions, but current frameworks are often limited to\nbasic constitutive laws and encounter practical constraints when combined with\nexperimental data. In this paper, we introduce a new PINN-based framework\ndesigned to identify material parameters for soft materials, specifically those\nexhibiting complex constitutive behaviors, under large deformation in plane\nstress conditions. Distinctively, our model emphasizes training PINNs with\nmulti-modal time-dependent experimental datasets consisting of full-field\ndeformation and loading history, ensuring algorithm robustness even amidst\nnoisy data. Our results reveal that our framework can accurately identify\nconstitutive parameters of the incompressible Arruda-Boyce model for samples\nwith intricate geometries, maintaining an error below 5%, even with an\nexperimental noise level of 5%. We believe our framework sets the stage for a\ntransformative approach in modulus identification for complex solids,\nespecially for those with geometrical and constitutive intricate.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:25:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Song","Siyuan",""],["Jin","Hanxun",""]]}
{"id":"2308.15641","submitter":"Arthur Loison","authors":"Arthur Loison, Teddy Pichard, Samuel Kokh and Marc Massot","title":"Two-scale modelling of two-phase flows based on the Stationary Action\n  Principle and a Geometric Method Of Moments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this contribution, we introduce a versatile formalism to derive unified\ntwo-phase models describing both the separated and disperse regimes. It relies\non the stationary action principle and interface geometric variables. The main\nideas are introduced on a simplified case where all the scales and phases have\nthe same velocity and that does not take into account large-scale capillary\nforces. The derivation tools yield a proper mathematical framework through\nhyperbolicity and signed entropy evolution. The formalism encompasses a\nhierarchy of small-scale reduced-order models based on a statistical\ndescription at a mesoscopic kinetic level and is naturally able to include the\ndescription of a disperse phase with polydispersity in size. This hierarchy\nincludes both a cloud of spherical droplets and non-spherical droplets\nexperiencing a dynamical behaviour through incompressible oscillations. The\nassociated small-scale variables are moments of a number density function\nresulting from the Geometric Method Of Moments (GeoMOM). This method selects\nmoments as small-scale geometric variables compatible with the structure and\ndynamics of the interface; they are defined independently of the flow topology\nand, therefore, this model pursues the goal of unifying the modelling of a\nfully-coupled two-scale flow. It is particularly showed that the resulting\ndynamics provides closures for the interface area density equation obtained\nfrom the averaging approach. The extension to mass transfer from one scale to\nthe other including capillary phenomena, as well as the extension to multiple\nvelocities are possible and proposed in complementary works.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:26:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Loison","Arthur",""],["Pichard","Teddy",""],["Kokh","Samuel",""],["Massot","Marc",""]]}
{"id":"2308.15642","submitter":"Matthew Zurek","authors":"Matthew Zurek and Yudong Chen","title":"Clustering Without an Eigengap","comments":"68 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DS cs.IT math.IT math.OC stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study graph clustering in the Stochastic Block Model (SBM) in the presence\nof both large clusters and small, unrecoverable clusters. Previous approaches\nachieving exact recovery do not allow any small clusters of size $o(\\sqrt{n})$,\nor require a size gap between the smallest recovered cluster and the largest\nnon-recovered cluster. We provide an algorithm based on semidefinite\nprogramming (SDP) which removes these requirements and provably recovers large\nclusters regardless of the remaining cluster sizes. Mid-sized clusters pose\nunique challenges to the analysis, since their proximity to the recovery\nthreshold makes them highly sensitive to small noise perturbations and\nprecludes a closed-form candidate solution. We develop novel techniques,\nincluding a leave-one-out-style argument which controls the correlation between\nSDP solutions and noise vectors even when the removal of one row of noise can\ndrastically change the SDP solution. We also develop improved eigenvalue\nperturbation bounds of potential independent interest. Using our gap-free\nclustering procedure, we obtain efficient algorithms for the problem of\nclustering with a faulty oracle with superior query complexities, notably\nachieving $o(n^2)$ sample complexity even in the presence of a large number of\nsmall clusters. Our gap-free clustering procedure also leads to improved\nalgorithms for recursive clustering. Our results extend to certain\nheterogeneous probability settings that are challenging for alternative\nalgorithms.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:27:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zurek","Matthew",""],["Chen","Yudong",""]]}
{"id":"2308.15643","submitter":"Priyadarshini Bangale","authors":"P. Bangale (for the VERITAS Collaboration) and X. Wang (for the HAWC\n  Collaboration)","title":"Searching for TeV emission from LHAASO J0341+5258 with VERITAS and HAWC","comments":"Proceedings for the 38th International Cosmic Ray Conference\n  (ICRC2023) in Nagoya Japan, Jul 26 - Aug 3, 2023","journal-ref":null,"doi":"10.22323/1.444.0706","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Galactic PeVatrons are astrophysical sources accelerating particles up to a\nfew PeV ($\\sim$10$^{15}$ eV) energies. The primary signature of 100 TeV\n$\\gamma$ rays may come from PeV protons or multi-hundred TeV (not PeV)\nelectrons. The search for PeVatrons has been one of the key science topics for\nVERITAS and HAWC. In 2021, LHAASO detected 14 steady $\\gamma$-ray sources with\nphoton energies above 100 TeV, up to 1.4 PeV. This provides a clear list of\nPeVatron candidates for further study with VERITAS and HAWC. Most of these\nsources contain possible source associations, such as supernova remnants,\npulsar wind nebulae, and stellar clusters. However, two sources: LHAASO\nJ2108+5157 and LHAASO J0341+5258, do not have any such counterparts. Therefore,\nmultiwavelength observations are required to identify the objects responsible\nfor the UHE $\\gamma$ rays, to understand the source morphology and association,\nand to shed light on the emission processes. Here, we will present the status\nof VERITAS/HAWC observations and results for the LHAASO PeVatron candidate\nJ0341+5258, and also discuss the VERITAS PeVatron search in general.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:29:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bangale","P.","","for the VERITAS Collaboration"],["Wang","X.","","for the HAWC\n  Collaboration"]]}
{"id":"2308.15644","submitter":"Andreas Tittl","authors":"Martin Barkey, Rebecca B\\\"uchner, Alwin Wester, Stefanie D. Pritzl,\n  Maksim Makarenko, Qizhou Wang, Thomas Weber, Dirk Trauner, Stefan A. Maier,\n  Andrea Fratalocchi, Theobald Lohm\\\"uller, Andreas Tittl","title":"Pixelated high-Q metasurfaces for in-situ biospectroscopy and AI-enabled\n  classification of lipid membrane photoswitching dynamics","comments":"22 pages, 5 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall physics.app-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Nanophotonic devices excel at confining light into intense hot spots of the\nelectromagnetic near fields, creating unprecedented opportunities for\nlight-matter coupling and surface-enhanced sensing. Recently, all-dielectric\nmetasurfaces with ultrasharp resonances enabled by photonic bound states in the\ncontinuum have unlocked new functionalities for surface-enhanced\nbiospectroscopy by precisely targeting and reading out molecular absorption\nsignatures of diverse molecular systems. However, BIC-driven molecular\nspectroscopy has so far focused on endpoint measurements in dry conditions,\nneglecting the crucial interaction dynamics of biological systems. Here, we\ncombine the advantages of pixelated all-dielectric metasurfaces with deep\nlearning-enabled feature extraction and prediction to realize an integrated\noptofluidic platform for time-resolved in-situ biospectroscopy. Our approach\nharnesses high-Q metasurfaces specifically designed for operation in a lossy\naqueous environment together with advanced spectral sampling techniques to\ntemporally resolve the dynamic behavior of photoswitchable lipid membranes.\nEnabled by a software convolutional neural network, we further demonstrate the\nreal-time classification of the characteristic cis and trans membrane\nconformations with 98% accuracy. Our synergistic sensing platform incorporating\nmetasurfaces, optofluidics, and deep learning opens exciting possibilities for\nstudying multi-molecular biological systems, ranging from the behavior of\ntransmembrane proteins to the dynamic processes associated with cellular\ncommunication.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:31:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Barkey","Martin",""],["B\u00fcchner","Rebecca",""],["Wester","Alwin",""],["Pritzl","Stefanie D.",""],["Makarenko","Maksim",""],["Wang","Qizhou",""],["Weber","Thomas",""],["Trauner","Dirk",""],["Maier","Stefan A.",""],["Fratalocchi","Andrea",""],["Lohm\u00fcller","Theobald",""],["Tittl","Andreas",""]]}
{"id":"2308.15645","submitter":"Katsumi Okuda","authors":"Katsumi Okuda, Saman Amarasinghe","title":"AskIt: Unified Programming Interface for Programming with Large Language\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL cs.AI cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the evolving landscape of software development, Large Language Models\n(LLMs) exhibit a unique phenomenon known as emergent abilities, demonstrating\nadeptness across numerous tasks, from text summarization to code generation.\nWhile these abilities open up novel avenues in software design and crafting,\ntheir incorporation presents substantial challenges. Developers grapple with\ndecisions surrounding the direct embedding of LLMs within applications versus\nemploying them for code generation. Moreover, effective prompt design becomes a\ncritical concern, given the necessity of data extraction from natural language\noutputs. To address these intricacies, this paper introduces AskIt, a\ndomain-specific language (DSL) specifically designed for LLMs. AskIt simplifies\nLLM integration, offering type-guided output control, template-based function\ndefinitions, and a unified interface that diminishes the distinction between\nLLM-based code generation and application integration. Furthermore, through\nProgramming by Example (PBE), AskIt harnesses the power of few-shot learning at\nthe programming language level. Our evaluations underscore AskIt's potency.\nAcross 50 tasks, AskIt generated concise prompts for the given tasks, achieving\na 16.14% reduction in prompt length relative to benchmarks. Additionally, by\nenabling the transition from direct LLM application usage to function\ngeneration, AskIt achieved significant speedups, as observed in our GSM8K\nbenchmark experiments. Through these advancements, AskIt streamlines the\nintegration of LLMs in software development, offering a more efficient,\nversatile approach for leveraging emergent abilities. The implementations of\nAskIt in TypeScript and Python are available at\nhttps://github.com/katsumiok/ts-askit and https://github.com/katsumiok/pyaskit,\nrespectively.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:44:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Okuda","Katsumi",""],["Amarasinghe","Saman",""]]}
{"id":"2308.15646","submitter":"Lucas Madeira","authors":"L. Madeira, A.D. Garc\\'ia-Orozco, M.A. Moreno-Armijos, A.R. Fritsch,\n  V.S. Bagnato","title":"A differential approach to investigate universal scaling in\n  far-from-equilibrium quantum systems","comments":"6+2 pages, 3+2 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":"  Recent progress in out-of-equilibrium closed quantum systems has\nsignificantly advanced the understanding of mechanisms behind their evolution\ntowards thermalization. Notably, the concept of non-thermal fixed points\n(NTFPs) - responsible for the emergence of spatio-temporal universal scaling in\nfar-from-equilibrium systems - has played a crucial role in both theoretical\nand experimental investigations. In this work, we introduce a differential\nequation that has the universal scaling associated with NTFPs as a solution.\nThe advantage of working with a differential equation, rather than only with\nits solution, is that we can extract several insightful properties not\nnecessarily present in the solution alone. Employing two limiting cases of the\nequation, we determined the universal exponents related to the scaling using\nthe distributions near just two momentum values. We established a strong\nagreement with previous investigations by validating this approach with three\ndistinct physical systems. This consistency highlights the universal nature of\nscaling due to NTFPs and emphasizes the predictive capabilities of the proposed\ndifferential equation. Moreover, under specific conditions, the equation\npredicts a power-law related to the ratio of the two universal exponents,\nleading to implications concerning particle and energy transport. This suggests\nthat the observed power-laws in far-from-equilibrium turbulent fluids could be\nrelated to the universal scaling due to NTFPs, potentially offering new\ninsights into the study of turbulence.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:48:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Madeira","L.",""],["Garc\u00eda-Orozco","A. D.",""],["Moreno-Armijos","M. A.",""],["Fritsch","A. R.",""],["Bagnato","V. S.",""]]}
{"id":"2308.15647","submitter":"Hernan Ceferino Vazquez PhD","authors":"Hernan Ceferino Vazquez","title":"A General Recipe for Automated Machine Learning in Practice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automated Machine Learning (AutoML) is an area of research that focuses on\ndeveloping methods to generate machine learning models automatically. The idea\nof being able to build machine learning models with very little human\nintervention represents a great opportunity for the practice of applied machine\nlearning. However, there is very little information on how to design an AutoML\nsystem in practice. Most of the research focuses on the problems facing\noptimization algorithms and leaves out the details of how that would be done in\npractice. In this paper, we propose a frame of reference for building general\nAutoML systems. Through a narrative review of the main approaches in the area,\nour main idea is to distill the fundamental concepts in order to support them\nin a single design. Finally, we discuss some open problems related to the\napplication of AutoML for future research.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:49:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Vazquez","Hernan Ceferino",""]]}
{"id":"2308.15648","submitter":"Abhijith Jayakumar","authors":"Abhijith Jayakumar, Stefano Chessa, Carleton Coffrin, Andrey Y.\n  Lokhov, Marc Vuffray, Sidhant Misra","title":"Universal framework for simultaneous tomography of quantum states and\n  SPAM noise","comments":"27 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"LA-UR-23-29891","categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a general denoising algorithm for performing simultaneous\ntomography of quantum states and measurement noise. This algorithm allows us to\nfully characterize state preparation and measurement (SPAM) errors present in\nany quantum system. Our method is based on the analysis of the properties of\nthe linear operator space induced by unitary operations. Given any quantum\nsystem with a noisy measurement apparatus, our method can output the quantum\nstate and the noise matrix of the detector up to a single gauge degree of\nfreedom. We show that this gauge freedom is unavoidable in the general case,\nbut this degeneracy can be generally broken using prior knowledge on the state\nor noise properties, thus fixing the gauge for several types of state-noise\ncombinations with no assumptions about noise strength. Such combinations\ninclude pure quantum states with arbitrarily correlated errors, and arbitrary\nstates with block independent errors. This framework can further use available\nprior information about the setting to systematically reduce the number of\nobservations and measurements required for state and noise detection. Our\nmethod effectively generalizes existing approaches to the problem, and includes\nas special cases common settings considered in the literature requiring an\nuncorrelated or invertible noise matrix, or specific probe states.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:49:28 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 02:36:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jayakumar","Abhijith",""],["Chessa","Stefano",""],["Coffrin","Carleton",""],["Lokhov","Andrey Y.",""],["Vuffray","Marc",""],["Misra","Sidhant",""]]}
{"id":"2308.15649","submitter":"Luan Hoang","authors":"Ciprian Foias, Luan Hoang and Michael S. Jolly","title":"On Galerkin approximations of the Navier-Stokes equations in the limit\n  of large Grashof numbers","comments":"35 pp. Submitted for publication","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 examine how stationary solutions to Galerkin approximations of the\nNavier--Stokes equations behave in the limit as the Grashof number $G$ tends to\n$\\infty$. An appropriate scaling is used to place the Grashof number as a new\ncoefficient of the nonlinear term, while the body force is fixed. A new type of\nasymptotic expansion, as $G\\to\\infty$, for a family of solutions is introduced.\nRelations among the terms in the expansion are obtained by following a\nprocedure that compares and totally orders positive sequences generated by the\nexpansion. The same methodology applies to the case of perturbed body forces\nand similar results are obtained. We demonstrate with a class of forces and\nsolutions that have convergent asymptotic expansions in $G$. All the results\nhold in both two and three dimensions, as well as for both no-slip and periodic\nboundary conditions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:57:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Foias","Ciprian",""],["Hoang","Luan",""],["Jolly","Michael S.",""]]}
{"id":"2308.15650","submitter":"Nariman Torkzaban","authors":"Nariman Torkzaban, Amir Khojastepour, John S. Baras","title":"Blind Cyclic Prefix-based CFO Estimation in MIMO-OFDM Systems","comments":"To Appear in Proceedings of 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":"  Low-complexity estimation and correction of carrier frequency offset (CFO)\nare essential in orthogonal frequency division multiplexing (OFDM). In this\npaper, we propose a low-overhead blind CFO estimation technique based on cyclic\nprefix (CP), in multi-input multi-output (MIMO)-OFDM systems. We propose to use\nantenna diversity for CFO estimation. Given that the RF chains for all antenna\nelements at a communication node share the same clock, the carrier frequency\noffset (CFO) between two points may be estimated by using the combination of\nthe received signal at all antennas. We improve our method by combining the\nantenna diversity with time diversity by considering the CP for multiple OFDM\nsymbols. We provide a closed-form expression for CFO estimation and present\nalgorithms that can considerably improve the CFO estimation performance at the\nexpense of a linear increase in computational complexity. We validate the\neffectiveness of our estimation scheme via extensive numerical analysis.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:02:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Torkzaban","Nariman",""],["Khojastepour","Amir",""],["Baras","John S.",""]]}
{"id":"2308.15651","submitter":"Hyunsik Yoo","authors":"Hyunsik Yoo, Zhichen Zeng, Jian Kang, Zhining Liu, David Zhou, Fei\n  Wang, Eunice Chan, and Hanghang Tong","title":"Ensuring User-side Fairness in Dynamic Recommender Systems","comments":"10 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CY cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  User-side group fairness is crucial for modern recommender systems, as it\naims to alleviate performance disparity between groups of users defined by\nsensitive attributes such as gender, race, or age. We find that the disparity\ntends to persist or even increase over time. This calls for effective ways to\naddress user-side fairness in a dynamic environment, which has been\ninfrequently explored in the literature. However, fairness-constrained\nre-ranking, a typical method to ensure user-side fairness (i.e., reducing\nperformance disparity), faces two fundamental challenges in the dynamic\nsetting: (1) non-differentiability of the ranking-based fairness constraint,\nwhich hinders the end-to-end training paradigm, and (2) time-inefficiency,\nwhich impedes quick adaptation to changes in user preferences. In this paper,\nwe propose FAir Dynamic rEcommender (FADE), an end-to-end framework with\nfine-tuning strategy to dynamically alleviate performance disparity. To tackle\nthe above challenges, FADE uses a novel fairness loss designed to be\ndifferentiable and lightweight to fine-tune model parameters to ensure both\nuser-side fairness and high-quality recommendations. Via extensive experiments\non the real-world dataset, we empirically demonstrate that FADE effectively and\nefficiently reduces performance disparity, and furthermore, FADE improves\noverall recommendation quality over time compared to not using any new data.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:03:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yoo","Hyunsik",""],["Zeng","Zhichen",""],["Kang","Jian",""],["Liu","Zhining",""],["Zhou","David",""],["Wang","Fei",""],["Chan","Eunice",""],["Tong","Hanghang",""]]}
{"id":"2308.15652","submitter":"Andreas Ekstedt","authors":"Andreas Ekstedt, Oliver Gould, and Joonas Hirvonen","title":"BubbleDet: A Python package to compute functional determinants for\n  bubble nucleation","comments":"40 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a Python package, BubbleDet, for computing one-loop functional\ndeterminants around spherically symmetric background fields. This gives the\nnext-to-leading order correction to both the vacuum decay rate, at zero\ntemperature, and to the bubble nucleation rate in first-order phase transitions\nat finite temperature. For predictions of gravitational wave signals from\ncosmological phase transitions, this is expected to remove one of the leading\nsources of theoretical uncertainty. BubbleDet is applicable to arbitrary scalar\npotentials and in any dimension up to seven. It has methods for fluctuations of\nscalar fields, including Goldstone bosons, and for gauge fields, but is limited\nto cases where the determinant factorises into a product of separate\ndeterminants, one for each field degree of freedom. To our knowledge, BubbleDet\nis the first package dedicated to calculating functional determinants in\nspherically symmetric background\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:06:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ekstedt","Andreas",""],["Gould","Oliver",""],["Hirvonen","Joonas",""]]}
{"id":"2308.15653","submitter":"Emil Annevelink","authors":"Emil Annevelink, Venkatasubramanian Viswanathan","title":"Statistical methods for resolving poor uncertainty quantification in\n  machine learning interatomic potentials","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":"  Machine learning interatomic potentials (MLIPs) are promising surrogates for\nquantum mechanics evaluations in ab-initio molecular dynamics simulations due\nto their ability to reproduce the energy and force landscape within chemical\naccuracy at four orders of magnitude less cost. While developing uncertainty\nquantification (UQ) tools for MLIPs is critical to build production MLIP\ndatasets using active learning, only limited progress has been made and the\nmost robust method, ensembling, still shows low correlation between high error\nand high uncertainty predictions. Here we develop a rigorous method rooted in\nstatistics for determining an error cutoff that distinguishes regions of high\nand low UQ performance. The statistical cutoff illuminates that a main cause of\nthe poor UQ performance is due to the machine learning model already describing\nthe entire dataset and not having any datapoints with error greater than the\nstatistical error distribution. Second, we extend the statistical analysis to\ncreate an interpretable connection between the error and uncertainty\ndistributions to predict an uncertainty cutoff separating high and low errors.\nWe showcase the statistical cutoff in active learning benchmarks on two\ndatasets of varying chemical complexity for three common UQ methods:\nensembling, sparse Gaussian processes, and latent distance metrics and compare\nthem to the true error and random sampling, showing that the statistical cutoff\nis generalizable to a variety of different UQ methods and protocols and\nperforms similarly to using the true error. Importantly, we conclude that\nutilizing this uncertainty cutoff enables using significantly lower cost\nuncertainty quantification tools such as sparse gaussian processes and latent\ndistances compared to ensembling approaches for generating MLIP datasets at a\nfraction of the cost.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:10:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Annevelink","Emil",""],["Viswanathan","Venkatasubramanian",""]]}
{"id":"2308.15654","submitter":"Peter Bradshaw","authors":"Peter Bradshaw, Alexander Clow, Jingwei Xu","title":"Injective edge colorings of degenerate graphs and the oriented chromatic\n  number","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a graph $G$, an injective edge-coloring of $G$ is a function $\\psi:E(G)\n\\rightarrow \\mathbb N$ such that if $\\psi(e) = \\psi(e')$, then no third edge\njoins an endpoint of $e$ and an endpoint of $e'$. The injective chromatic index\nof a graph $G$, written $\\chi_{inj}'(G)$, is the minimum number of colors\nneeded for an injective edge coloring of $G$. In this paper, we investigate the\ninjective chromatic index of certain classes of degenerate graphs. First, we\nshow that if $G$ is a $d$-degenerate graph of maximum degree $\\Delta$, then\n$\\chi_{inj}'(G) = O(d^3 \\log \\Delta)$. Next, we show that if $G$ is a graph of\nEuler genus $g$, then $\\chi_{inj}'(G) \\leq (3+o(1))g$, which is tight when $G$\nis a clique. Finally, we show that the oriented chromatic number of a graph is\nat most exponential in its injective chromatic index. Using this fact, we prove\nthat the oriented chromatic number of a graph embedded on a surface of Euler\ngenus $g$ has oriented chromatic number at most $O(g^{6400})$, improving the\npreviously known upper bound of $2^{O(g^{\\frac{1}{2} + \\epsilon})}$ and\nresolving a conjecture of Aravind and Subramanian.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:21:10 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bradshaw","Peter",""],["Clow","Alexander",""],["Xu","Jingwei",""]]}
{"id":"2308.15655","submitter":"Juan Bory Reyes","authors":"Jos\\'e Oscar Gonz\\'alez-Cervantes, Juan Adri\\'an Ram\\'irez-Belman,\n  Juan Bory-Reyes","title":"A bicomplex proportional fractional $(\\vartheta,\\varphi)-$weighted\n  Cauchy-Riemann operator using Riemann-Liouville derivatives with respect to\n  an hyperbolic-valued function","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on the Riemann-Liouville derivatives with respect to functions taking\nvalues in the set of hyperbolic numbers, we consider a novel bicomplex\nproportional fractional $(\\vartheta,\\varphi)-$weighted Cauchy-Riemann operator,\ninvolving weights hyperbolic orthogonal bicomplex functions. This operator is\ndefined for the first time here, and its associated fractional Borel-Pompeiu\nformula is proved as the main result.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:22:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gonz\u00e1lez-Cervantes","Jos\u00e9 Oscar",""],["Ram\u00edrez-Belman","Juan Adri\u00e1n",""],["Bory-Reyes","Juan",""]]}
{"id":"2308.15656","submitter":"Sikai Chen","authors":"Jiaming Wang, Jiqian Dong, Sikai Chen, Shreyas Sundaram, Samuel Labi","title":"Deep Reinforcement Learning Based Framework for Mobile Energy\n  Disseminator Dispatching to Charge On-the-Road Electric Vehicles","comments":"Submitted for presentation only at the 2024 Annual Meeting of the\n  Transportation Research Board","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The exponential growth of electric vehicles (EVs) presents novel challenges\nin preserving battery health and in addressing the persistent problem of\nvehicle range anxiety. To address these concerns, wireless charging,\nparticularly, Mobile Energy Disseminators (MEDs) have emerged as a promising\nsolution. The MED is mounted behind a large vehicle and charges all\nparticipating EVs within a radius upstream of it. Unfortuantely, during such\nV2V charging, the MED and EVs inadvertently form platoons, thereby occupying\nmultiple lanes and impairing overall corridor travel efficiency. In addition,\nconstrained budgets for MED deployment necessitate the development of an\neffective dispatching strategy to determine optimal timing and locations for\nintroducing the MEDs into traffic. This paper proposes a deep reinforcement\nlearning (DRL) based methodology to develop a vehicle dispatching framework. In\nthe first component of the framework, we develop a realistic reinforcement\nlearning environment termed \"ChargingEnv\" which incorporates a reliable\ncharging simulation system that accounts for common practical issues in\nwireless charging deployment, specifically, the charging panel misalignment.\nThe second component, the Proximal-Policy Optimization (PPO) agent, is trained\nto control MED dispatching through continuous interactions with ChargingEnv.\nNumerical experiments were carried out to demonstrate the demonstrate the\nefficacy of the proposed MED deployment decision processor. The experiment\nresults suggest that the proposed model can significantly enhance EV travel\nrange while efficiently deploying a optimal number of MEDs. The proposed model\nis found to be not only practical in its applicability but also has promises of\nreal-world effectiveness. The proposed model can help travelers to maximize EV\nrange and help road agencies or private-sector vendors to manage the deployment\nof MEDs efficiently.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:23:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wang","Jiaming",""],["Dong","Jiqian",""],["Chen","Sikai",""],["Sundaram","Shreyas",""],["Labi","Samuel",""]]}
{"id":"2308.15657","submitter":"Nicole Ford","authors":"N. M. Ford, Nicholas Vieira, John J. Ruan, Daryl Haggard","title":"KilonovAE: Exploring Kilonova Spectral Features with Autoencoders","comments":"23 pages, 13 figures, 4 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":"  Kilonovae are likely a key site of heavy r-process element production in the\nUniverse, and their optical/infrared spectra contain insights into both the\nproperties of the ejecta and the conditions of the r-process. However, the\nevent GW170817/AT2017gfo is the only kilonova so far with well-observed\nspectra. To understand the diversity of absorption features that might be\nobserved in future kilonovae spectra, we use the TARDIS Monte Carlo radiative\ntransfer code to simulate a suite of optical spectra spanning a wide range of\nkilonova ejecta properties and r-process abundance patterns. To identify the\nmost common and prominent absorption lines, we perform dimensionality reduction\nusing an autoencoder, and we find spectra clusters in the latent space\nrepresentation using a Bayesian Gaussian Mixture model. Our synthetic kilonovae\nspectra commonly display strong absorption by strontium Sr II, yttrium Y II,\nand zirconium Zr I - II, with strong lanthanide contributions at low electron\nfractions (Ye < 0.25). When a new kilonova is observed, our machine learning\nframework will provide context on the dominant absorption lines and key ejecta\nproperties, helping to determine where this event falls within the larger 'zoo'\nof kilonovae spectra.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:27:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ford","N. M.",""],["Vieira","Nicholas",""],["Ruan","John J.",""],["Haggard","Daryl",""]]}
{"id":"2308.15658","submitter":"Ian Zemke","authors":"Ian Zemke","title":"A general Heegaard Floer surgery formula","comments":"91 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give several new perspectives on the Heegaard Floer Dehn surgery formulas\nof Manolescu, Ozsv\\'{a}th and Szab\\'{o}. Our main result is a new exact\ntriangle in the Fukaya category of the torus which gives a new proof of these\nformulas. This exact triangle is different from the one which appeared in\nOzsv\\'{a}th and Szab\\'{o}'s original proof. This exact triangle simplifies a\nnumber of technical aspects in their proofs and also allows us to prove several\nnew results. A first application is an extensions of the link surgery formula\nto arbitrary links in closed 3-manifolds, with no restrictions on the link\nbeing null-homologous. A second application is a proof that the modules for\nbordered manifolds with torus boundaries, defined by the author in a previous\npaper, are invariants. Another application is a simple proof of a version of\nthe surgery formula which computes knot and link Floer complexes in terms of\nsubcubes of the link surgery hypercube. As a final application, we show that\nthe knot surgery algebra is homotopy equivalent to an endomorphism algebra of a\nsum of two decorated Lagrangians in the torus, mirroring a result of Auroux\nconcerning the algebras of Lipshitz, Ozsv\\'{a}th and Thurston.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:40:29 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zemke","Ian",""]]}
{"id":"2308.15659","submitter":"Nariman Torkzaban","authors":"Nariman Torkzaban, Amir Khojastepour, John S. Baras","title":"Enabling Cooperative Hybrid Beamforming in TDD-based Distributed MIMO\n  Systems","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":"  Distributed massive MIMO networks are envisioned to realize cooperative\nmulti-point transmission in next-generation wireless systems. For efficient\ncooperative hybrid beamforming, the cluster of access points (APs) needs to\nobtain precise estimates of the uplink channel to perform reliable downlink\nprecoding. However, due to the radio frequency (RF) impairments between the\ntransceivers at the two en-points of the wireless channel, full channel\nreciprocity does not hold which results in performance degradation in the\ncooperative hybrid beamforming (CHBF) unless a suitable reciprocity calibration\nmechanism is in place. We propose a two-step approach to calibrate any two\nhybrid nodes in the distributed MIMO system. We then present and utilize the\nnovel concept of reciprocal tandem to propose a low-complexity approach for\njointly calibrating the cluster of APs and estimating the downlink channel.\nFinally, we validate our calibration technique's effectiveness through\nnumerical simulation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:43:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Torkzaban","Nariman",""],["Khojastepour","Amir",""],["Baras","John S.",""]]}
{"id":"2308.15660","submitter":"Minh-Quan Le","authors":"Minh-Quan Le, Minh-Triet Tran, Trung-Nghia Le, Tam V. Nguyen,\n  Thanh-Toan Do","title":"Unveiling Camouflage: A Learnable Fourier-based Augmentation for\n  Camouflaged Object Detection and Instance Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Camouflaged object detection (COD) and camouflaged instance segmentation\n(CIS) aim to recognize and segment objects that are blended into their\nsurroundings, respectively. While several deep neural network models have been\nproposed to tackle those tasks, augmentation methods for COD and CIS have not\nbeen thoroughly explored. Augmentation strategies can help improve the\nperformance of models by increasing the size and diversity of the training data\nand exposing the model to a wider range of variations in the data. Besides, we\naim to automatically learn transformations that help to reveal the underlying\nstructure of camouflaged objects and allow the model to learn to better\nidentify and segment camouflaged objects. To achieve this, we propose a\nlearnable augmentation method in the frequency domain for COD and CIS via\nFourier transform approach, dubbed CamoFourier. Our method leverages a\nconditional generative adversarial network and cross-attention mechanism to\ngenerate a reference image and an adaptive hybrid swapping with parameters to\nmix the low-frequency component of the reference image and the high-frequency\ncomponent of the input image. This approach aims to make camouflaged objects\nmore visible for detection and segmentation models. Without bells and whistles,\nour proposed augmentation method boosts the performance of camouflaged object\ndetectors and camouflaged instance segmenters by large margins.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:43:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Le","Minh-Quan",""],["Tran","Minh-Triet",""],["Le","Trung-Nghia",""],["Nguyen","Tam V.",""],["Do","Thanh-Toan",""]]}
{"id":"2308.15661","submitter":"Abootaleb Shirvani","authors":"Thisari K. Mahanama, Abootaleb Shirvani, Svetlozar Rachev, Frank J.\n  Fabozzi","title":"The Financial Market of Environmental Indices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.CP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces the concept of a global financial market for\nenvironmental indices, addressing sustainability concerns and aiming to attract\ninstitutional investors. Risk mitigation measures are implemented to manage\ninherent risks associated with investments in this new financial market. We\nmonetize the environmental indices using quantitative measures and construct\ncountry-specific environmental indices, enabling them to be viewed as\ndollar-denominated assets. Our primary goal is to encourage the active\nengagement of institutional investors in portfolio analysis and trading within\nthis emerging financial market. To evaluate and manage investment risks, our\napproach incorporates financial econometric theory and dynamic asset pricing\ntools. We provide an econometric analysis that reveals the relationships\nbetween environmental and economic indicators in this market. Additionally, we\nderive financial put options as insurance instruments that can be employed to\nmanage investment risks. Our factor analysis identifies key drivers in the\nglobal financial market for environmental indices. To further evaluate the\nmarket's performance, we employ pricing options, efficient frontier analysis,\nand regression analysis. These tools help us assess the efficiency and\neffectiveness of the market. Overall, our research contributes to the\nunderstanding and development of the global financial market for environmental\nindices.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:50:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mahanama","Thisari K.",""],["Shirvani","Abootaleb",""],["Rachev","Svetlozar",""],["Fabozzi","Frank J.",""]]}
{"id":"2308.15662","submitter":"Krzysztof D\\k{e}bicki","authors":"Krzysztof D\\c{e}bicki, Enkelejd Hashorva, Peng Liu","title":"Sojourns of fractional Brownian motion queues: transient asymptotics","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the asymptotics of sojourn time of the stationary queueing process\n$Q(t),t\\ge0$ fed by a fractional Brownian motion with Hurst parameter\n$H\\in(0,1)$ above a high threshold $u$. For the Brownian motion case $H=1/2$,\nwe derive the exact asymptotics of\n  \\[\n  P\\left(\\int_{T_1}^{T_2} 1(Q(t)>u+h(u))d t>x \\Big{|}Q(0) >u \\right)\n  \\]\n  as $u\\to\\infty$, {where $T_1,T_2, x\\geq 0$ and $T_2-T_1>x$}, whereas for all\n$H\\in(0,1)$, we obtain sharp asymptotic approximations of\n  \\[\n  P\\left( \\frac 1 {v(u)} \\int_{[T_2(u),T_3(u)]}1(Q(t)>u+h(u))dt>y \\Bigl \\lvert\n\\frac 1 {v(u)} \\int_{[0,T_1(u)]}1(Q(t)>u)dt>x\\right), \\quad x,y >0\n  \\]\n  as $u\\to\\infty$, for appropriately chosen $T_i$'s and $v$. Two regimes of the\nratio between $u$ and $h(u)$, that lead to qualitatively different\napproximations, are considered.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 22:53:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["D\u0229bicki","Krzysztof",""],["Hashorva","Enkelejd",""],["Liu","Peng",""]]}
{"id":"2308.15663","submitter":"Atefeh Mahdavi","authors":"Atefeh Mahdavi, Neda Keivandarian, Marco Carvalho","title":"Adaptive Attack Detection in Text Classification: Leveraging Space\n  Exploration Features for Text Sentiment Classification","comments":"Presented at 2nd International Workshop on Adaptive Cyber Defense,\n  2023 (arXiv:2308.09520)","journal-ref":null,"doi":null,"report-no":"ACD/2023/108","categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adversarial example detection plays a vital role in adaptive cyber defense,\nespecially in the face of rapidly evolving attacks. In adaptive cyber defense,\nthe nature and characteristics of attacks continuously change, making it\ncrucial to have robust mechanisms in place to detect and counter these threats\neffectively. By incorporating adversarial example detection techniques,\nadaptive cyber defense systems can enhance their ability to identify and\nmitigate attacks that attempt to exploit vulnerabilities in machine learning\nmodels or other systems. Adversarial examples are inputs that are crafted by\napplying intentional perturbations to natural inputs that result in incorrect\nclassification. In this paper, we propose a novel approach that leverages the\npower of BERT (Bidirectional Encoder Representations from Transformers) and\nintroduces the concept of Space Exploration Features. We utilize the feature\nvectors obtained from the BERT model's output to capture a new representation\nof feature space to improve the density estimation method.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 23:02:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mahdavi","Atefeh",""],["Keivandarian","Neda",""],["Carvalho","Marco",""]]}
{"id":"2308.15664","submitter":"Brahim Ait Ouazghour","authors":"Brahim Ait Ouazghour, Abdesslam Arhrib, Kingman Cheung, Es-said\n  Ghourmin, Larbi Rahili","title":"Charged Higgs production at the Muon Collider in the 2HDM","comments":"41 pages, 11 figures, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the phenomenology of the charged Higgs boson at future muon\ncolliders. We investigate both the pair production $\\mu^+ \\mu^- \\to H^+ H^-$,\nas well as the single production $\\mu^+ \\mu^- \\to W^\\pm H^\\mp$. We show that\nthe neutral Higgs exchange diagrams can lead to a significant boost in\nproduction cross sections either through their Yukawa couplings or the\nresonance effect when the neutral Higgs mass is near the center of mass energy.\nOur results for the muon collider are systematically compared to the\ncorresponding ones at $e^+e^-$ machines. We select benchmark points and perform\nsignal-background analyses, taking into account detector simulations. We\ndemonstrate the discovery region at $5\\sigma$ and the excluded region at\n$2\\sigma$ levels at a 500~GeV muon collider.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 23:11:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ouazghour","Brahim Ait",""],["Arhrib","Abdesslam",""],["Cheung","Kingman",""],["Ghourmin","Es-said",""],["Rahili","Larbi",""]]}
{"id":"2308.15665","submitter":"Dong-Xia Qu","authors":"Luis A. Martinez, Gang Qiu, Peng Deng, Peng Zhang, Keith G. Ray,\n  Lixuan Tai, Ming-Tso Wei, Haoran He, Kang L. Wang, Jonathan L DuBois, and\n  Dong-Xia Qu","title":"Edge Magnetoplasmon Dispersion and Time-Resolved Plasmon Transport in a\n  Quantum Anomalous Hall Insulator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A quantum anomalous Hall (QAH) insulator breaks reciprocity by combining\nmagnetic polarization and spin-orbit coupling to generate a unidirectional\ntransmission of signals in the absence of an external magnetic field. Such\nbehavior makes QAH materials a good platform for the innovation of circulator\ntechnologies. However, it remains elusive as to how the wavelength of the\nchiral edge plasmon relates to its frequency and how the plasmon wave packet is\nexcited in the time domain in a QAH insulator. Here, we investigate the edge\nmagnetoplasmon (EMP) resonances in Cr-(Bi,Sb)$_2$Te$_3$ by frequency and time\ndomain measurements. From disk shaped samples with various dimensions, we\nobtain the dispersion relation of EMPs and extract the drift velocity of the\nchiral edge state. From the time-resolved transport measurements, we identify\nthe velocity of the plasmon wave packet and observe a transition from the edge\nto bulk transport at an elevated temperature. We show that the frequency and\ntime domain measurements are well modeled by loss from the microwave induced\ndissipative channels in the bulk area. Our results demonstrate that the EMP\ndecay rate can be significantly reduced by applying a low microwave power and\nfabricating devices of larger diameter $\\ge100~\\mu$m. In a $R=125~\\mu$m sample,\na non-reciprocity of 20 dB has been realized at 1.3 GHz, shining light on using\nQAH insulators to develop on-chip non-reciprocal devices.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 23:32:09 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Martinez","Luis A.",""],["Qiu","Gang",""],["Deng","Peng",""],["Zhang","Peng",""],["Ray","Keith G.",""],["Tai","Lixuan",""],["Wei","Ming-Tso",""],["He","Haoran",""],["Wang","Kang L.",""],["DuBois","Jonathan L",""],["Qu","Dong-Xia",""]]}
{"id":"2308.15666","submitter":"Markus Haltmeier","authors":"Andrea Ebner and Markus Haltmeier","title":"Convergence of non-linear diagonal frame filtering for regularizing\n  inverse problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inverse problems are core issues in several scientific areas, including\nsignal processing and medical imaging. As inverse problems typically suffer\nfrom instability with respect to data perturbations, a variety of\nregularization techniques have been proposed. In particular, the use of\nfiltered diagonal frame decompositions has proven to be effective and\ncomputationally efficient. However, the existing convergence analysis applies\nonly to linear filters and a few non-linear filters such as soft thresholding.\nIn this paper, we analyze the filtered diagonal frame decomposition with\ngeneral non-linear filters. In particular, our results generalize SVD-based\nspectral filtering from linear to non-linear filters as a special case. We\npresent three strategies to demonstrate convergence. The first two strategies\nrelate non-linear diagonal frame filtering to variational regularization and\nplug-and-play regularization, respectively. The third strategy allows us to\nrelax the assumptions involved and still obtain a full convergence analysis.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 23:32:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ebner","Andrea",""],["Haltmeier","Markus",""]]}
{"id":"2308.15667","submitter":"Guanfang Dong","authors":"Guanfang Dong, Chenqiu Zhao, Anup Basu","title":"Bridging Distribution Learning and Image Clustering in High-dimensional\n  Space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Distribution learning focuses on learning the probability density function\nfrom a set of data samples. In contrast, clustering aims to group similar\nobjects together in an unsupervised manner. Usually, these two tasks are\nconsidered unrelated. However, the relationship between the two may be\nindirectly correlated, with Gaussian Mixture Models (GMM) acting as a bridge.\nIn this paper, we focus on exploring the correlation between distribution\nlearning and clustering, with the motivation to fill the gap between these two\nfields, utilizing an autoencoder (AE) to encode images into a high-dimensional\nlatent space. Then, Monte-Carlo Marginalization (MCMarg) and Kullback-Leibler\n(KL) divergence loss are used to fit the Gaussian components of the GMM and\nlearn the data distribution. Finally, image clustering is achieved through each\nGaussian component of GMM. Yet, the \"curse of dimensionality\" poses severe\nchallenges for most clustering algorithms. Compared with the classic\nExpectation-Maximization (EM) Algorithm, experimental results show that MCMarg\nand KL divergence can greatly alleviate the difficulty. Based on the\nexperimental results, we believe distribution learning can exploit the\npotential of GMM in image clustering within high-dimensional space.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 23:35:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dong","Guanfang",""],["Zhao","Chenqiu",""],["Basu","Anup",""]]}
{"id":"2308.15668","submitter":"Liam Magee","authors":"Shanthi Robertson, Liam Magee, and Karen Soldati\\'c","title":"Intersectional Inquiry, on the Ground and in the Algorithm","comments":null,"journal-ref":"Qualitative Inquiry, 28(7), 814-826 (2022)","doi":"10.1177/10778004221099560","report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This article makes two key contributions to methodological debates in\nautomation research. First, we argue for and demonstrate how methods in this\nfield must account for intersections of social difference, such as race, class,\nethnicity, culture, and disability, in more nuanced ways. Second, we consider\nthe complexities of bringing together computational and qualitative methods in\nan intersectional methodological approach while also arguing that in their\nrespective subjects (machines and human subjects) and conceptual scope they\nenable a specific dialogue on intersectionality and automation to be\narticulated. We draw on field reflections from a project that combines an\nanalysis of intersectional bias in language models with findings from a\ncommunity workshop on the frustrations and aspirations produced through\nengagement with everyday AI-driven technologies in the context of care.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 23:43:58 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Robertson","Shanthi",""],["Magee","Liam",""],["Soldati\u0107","Karen",""]]}
{"id":"2308.15669","submitter":"Andrew Chen","authors":"Andrew Chen, Yanfu Yan, Denys Poshyvanyk","title":"ACER: An AST-based Call Graph Generator Framework","comments":"6 pages, 3 tables, 4 figures, 1 algorithm, accepted by SCAM'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We introduce ACER, an AST-based call graph generator framework. ACER\nleverages tree-sitter to interface with any language. We opted to focus on\ngenerators that operate on abstract syntax trees (ASTs) due to their speed and\nsimplicitly in certain scenarios; however, a fully quantified intermediate\nrepresentation usually provides far better information at the cost of requiring\ncompilation. To evaluate our framework, we created two context-insensitive Java\ngenerators and compared them to existing open-source Java generators.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 23:44:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Andrew",""],["Yan","Yanfu",""],["Poshyvanyk","Denys",""]]}
{"id":"2308.15670","submitter":"David Ouyang","authors":"Matthew Christensen, Milos Vukadinovic, Neal Yuan, David Ouyang","title":"Multimodal Foundation Models For Echocardiogram Interpretation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Multimodal deep learning foundation models can learn the relationship between\nimages and text. In the context of medical imaging, mapping images to language\nconcepts reflects the clinical task of diagnostic image interpretation, however\ncurrent general-purpose foundation models do not perform well in this context\nbecause their training corpus have limited medical text and images. To address\nthis challenge and account for the range of cardiac physiology, we leverage\n1,032,975 cardiac ultrasound videos and corresponding expert interpretations to\ndevelop EchoCLIP, a multimodal foundation model for echocardiography. EchoCLIP\ndisplays strong zero-shot (not explicitly trained) performance in cardiac\nfunction assessment (external validation left ventricular ejection fraction\nmean absolute error (MAE) of 7.1%) and identification of implanted intracardiac\ndevices (areas under the curve (AUC) between 0.84 and 0.98 for pacemakers and\nartificial heart valves). We also developed a long-context variant (EchoCLIP-R)\nwith a custom echocardiography report text tokenizer which can accurately\nidentify unique patients across multiple videos (AUC of 0.86), identify\nclinical changes such as orthotopic heart transplants (AUC of 0.79) or cardiac\nsurgery (AUC 0.77), and enable robust image-to-text search (mean cross-modal\nretrieval rank in the top 1% of candidate text reports). These emergent\ncapabilities can be used for preliminary assessment and summarization of\nechocardiographic findings.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 23:45:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Christensen","Matthew",""],["Vukadinovic","Milos",""],["Yuan","Neal",""],["Ouyang","David",""]]}
{"id":"2308.15671","submitter":"Michael Kuhn","authors":"Michael Kuhn, Daniel Lokshtanov, Zachary Miller","title":"Lower Bound for Independence Covering in $C_4$-Free Graphs","comments":"8 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An independent set in a graph $G$ is a set $S$ of pairwise non-adjacent\nvertices in $G$. A family $\\mathcal{F}$ of independent sets in $G$ is called a\n$k$-independence covering family if for every independent set $I$ in $G$ of\nsize at most $k$, there exists an $S \\in \\mathcal{F}$ such that $I \\subseteq\nS$.\n  Lokshtanov et al. [ACM Transactions on Algorithms, 2018] showed that graphs\nof degeneracy $d$ admit $k$-independence covering families of size\n$\\binom{k(d+1)}{k} \\cdot 2^{o(kd)} \\cdot \\log n$, and used this result to\ndesign efficient parameterized algorithms for a number of problems, including\nSTABLE ODD CYCLE TRANSVERSAL and STABLE MULTICUT.\n  In light of the results of Lokshtanov et al. it is quite natural to ask\nwhether even more general families of graphs admit $k$-independence covering\nfamilies of size $f(k)n^{O(1)}$.\n  Graphs that exclude a complete bipartite graph $K_{d+1,d+1}$ with $d+1$\nvertices on both sides as a subgraph, called $K_{d+1,d+1}$-free graphs, are a\nfrequently considered generalization of $d$-degenerate graphs.\n  This motivates the question whether $K_{d,d}$-free graphs admit\n$k$-independence covering families of size $f(k,d)n^{O(1)}$. Our main result is\na resounding \"no\" to this question -- specifically we prove that even\n$K_{2,2}$-free graphs (or equivalently $C_4$-free graphs) do not admit\n$k$-independence covering families of size $f(k)n^{\\frac{k}{4}-\\epsilon}$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 23:46:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kuhn","Michael",""],["Lokshtanov","Daniel",""],["Miller","Zachary",""]]}
{"id":"2308.15672","submitter":"Lingjiong Zhu","authors":"Dan Pirjol, Lingjiong Zhu","title":"Asymptotics for Short Maturity Asian Options in a Jump-Diffusion model\n  with Local Volatility","comments":"28 pages, 3 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a study of the short maturity asymptotics for Asian options in a\njump-diffusion model with a local volatility component, where the jumps are\nmodeled as a compound Poisson process which are later extended to L\\'evy jumps,\nthat includes the exponential L\\'{e}vy model as a special case. Both fixed and\nfloating strike Asian options are considered. Explicit results are obtained for\nthe first-order asymptotics of the Asian options prices for a few popular\nmodels in the literature: the Merton jump-diffusion model, the\ndouble-exponential jump model, and the Variance Gamma model. We propose an\nanalytical approximation for Asian option prices which satisfies the\nconstraints from the short-maturity asymptotics, and test it against Monte\nCarlo simulations. The asymptotic results are in good agreement with numerical\nsimulations for sufficiently small maturity.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:00:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pirjol","Dan",""],["Zhu","Lingjiong",""]]}
{"id":"2308.15673","submitter":"Bhaskar Ramasubramanian","authors":"Arezoo Rajabi, Surudhi Asokraj, Fengqing Jiang, Luyao Niu, Bhaskar\n  Ramasubramanian, Jim Ritcey, Radha Poovendran","title":"MDTD: A Multi Domain Trojan Detector for Deep Neural Networks","comments":"Accepted to ACM Conference on Computer and Communications Security\n  (ACM CCS) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning models that use deep neural networks (DNNs) are vulnerable\nto backdoor attacks. An adversary carrying out a backdoor attack embeds a\npredefined perturbation called a trigger into a small subset of input samples\nand trains the DNN such that the presence of the trigger in the input results\nin an adversary-desired output class. Such adversarial retraining however needs\nto ensure that outputs for inputs without the trigger remain unaffected and\nprovide high classification accuracy on clean samples. In this paper, we\npropose MDTD, a Multi-Domain Trojan Detector for DNNs, which detects inputs\ncontaining a Trojan trigger at testing time. MDTD does not require knowledge of\ntrigger-embedding strategy of the attacker and can be applied to a pre-trained\nDNN model with image, audio, or graph-based inputs. MDTD leverages an insight\nthat input samples containing a Trojan trigger are located relatively farther\naway from a decision boundary than clean samples. MDTD estimates the distance\nto a decision boundary using adversarial learning methods and uses this\ndistance to infer whether a test-time input sample is Trojaned or not. We\nevaluate MDTD against state-of-the-art Trojan detection methods across five\nwidely used image-based datasets: CIFAR100, CIFAR10, GTSRB, SVHN, and\nFlowers102; four graph-based datasets: AIDS, WinMal, Toxicant, and COLLAB; and\nthe SpeechCommand audio dataset. MDTD effectively identifies samples that\ncontain different types of Trojan triggers. We evaluate MDTD against adaptive\nattacks where an adversary trains a robust DNN to increase (decrease) distance\nof benign (Trojan) inputs from a decision boundary.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:03:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rajabi","Arezoo",""],["Asokraj","Surudhi",""],["Jiang","Fengqing",""],["Niu","Luyao",""],["Ramasubramanian","Bhaskar",""],["Ritcey","Jim",""],["Poovendran","Radha",""]]}
{"id":"2308.15674","submitter":"Azadeh Golduzian","authors":"Azadeh Golduzian","title":"Predict And Prevent DDOS Attacks Using Machine Learning and Statistical\n  Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A malicious attempt to exhaust a victim's resources to cause it to crash or\nhalt its services is known as a distributed denial-of-service (DDoS) attack.\nDDOS attacks stop authorized users from accessing specific services available\non the Internet. It targets varying components of a network layer and it is\nbetter to stop into layer 4 (transport layer) of the network before approaching\na higher layer. This study uses several machine learning and statistical models\nto detect DDoS attacks from traces of traffic flow and suggests a method to\nprevent DDOS attacks. For this purpose, we used logistic regression, CNN,\nXGBoost, naive Bayes, AdaBoostClassifier, KNN, and random forest ML algorithms.\nIn addition, data preprocessing was performed using three methods to identify\nthe most relevant features. This paper explores the issue of improving the DDOS\nattack detection accuracy using the latest dataset named CICDDoS2019, which has\nover 50 million records. Because we employed an extensive dataset for this\ninvestigation, our findings are trustworthy and practical. Our target class\n(attack class) was imbalanced. Therefore, we used two techniques to deal with\nimbalanced data in machine learning. The XGboost machine learning model\nprovided the best detection accuracy of (99.9999%) after applying the SMOTE\napproach to the target class, outperforming recently developed DDoS detection\nsystems. To the best of our knowledge, no other research has worked on the most\nrecent dataset with over 50 million records, addresses the statistical\ntechnique to select the most significant feature, has this high accuracy, and\nsuggests ways to avoid DDOS attackI.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:03:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Golduzian","Azadeh",""]]}
{"id":"2308.15675","submitter":"Aaron Goodwin-Jones","authors":"Aaron W. Goodwin-Jones and Haochen Zhu and Carl Blair and Daniel D.\n  Brown and Joris van Heijningen and Li Ju and Chunnong Zhao","title":"Single and coupled cavity mode sensing schemes using a diagnostic field","comments":null,"journal-ref":null,"doi":null,"report-no":"LIGO-P2300010","categories":"physics.optics astro-ph.IM quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Precise optical mode matching is of critical importance in experiments using\nsqueezed-vacuum states. Automatic spatial-mode matching schemes have the\npotential to reduce losses and improve loss stability. However, in\nquantum-enhanced coupled-cavity experiments, such as gravitational-wave\ndetectors, one must also ensure that the sub-cavities are also mode matched. We\npropose a new mode sensing scheme, which works for simple and coupled cavities.\nThe scheme requires no moving parts, nor tuning of Gouy phases. Instead a\ndiagnostic field tuned to the HG20/LG10 mode frequency is used. The error\nsignals are derived to be proportional to the difference in waist position, and\ndifference in Rayleigh ranges, between the sub-cavity eigenmodes. The two error\nsignals are separable by 90 degrees of demodulation phase. We demonstrate\nreasonable error signals for a simplified Einstein Telescope optical design.\nThis work will facilitate routine use of extremely high levels of squeezing in\ncurrent and future gravitational-wave detectors.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:07:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Goodwin-Jones","Aaron W.",""],["Zhu","Haochen",""],["Blair","Carl",""],["Brown","Daniel D.",""],["van Heijningen","Joris",""],["Ju","Li",""],["Zhao","Chunnong",""]]}
{"id":"2308.15676","submitter":"Zhiyan Ding","authors":"Zhiyan Ding and Chi-Fang (Anthony) Chen and Lin Lin","title":"Single-ancilla ground state preparation via Lindbladians","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We design an early fault-tolerant quantum algorithm for ground state\npreparation. As a Monte Carlo-style quantum algorithm, our method features a\nLindbladian where the target state is stationary, and its evolution can be\nefficiently implemented using just one ancilla qubit. Our algorithm can prepare\nthe ground state even when the initial state has zero overlap with the ground\nstate, bypassing the most significant limitation of methods like quantum phase\nestimation. As a variant, we also propose a discrete-time algorithm, which\ndemonstrates even better efficiency, providing a near-optimal simulation cost\nfor the simulation time and precision. Numerical simulation using Ising models\nand Hubbard models demonstrates the efficacy and applicability of our method.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:11:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ding","Zhiyan","","Anthony"],["Chi-Fang","","","Anthony"],["Chen","",""],["Lin","Lin",""]]}
{"id":"2308.15677","submitter":"Hyosun Kim Dr.","authors":"Hyosun Kim (Korea Astronomy and Space Science Institute)","title":"Transverse Wind Velocity Recorded in Spiral-Shell Pattern","comments":"9 pages, 8 figures, Published in JKAS","journal-ref":"Journal of Korean Astronomical Society, 56, 149 (2023)","doi":"10.5303/JKAS.2023.56.2.149","report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The propagation speed of a circumstellar pattern revealed in the plane of the\nsky is often assumed to represent the expansion speed of the wind matter\nejected from a post-main-sequence star at the center. We point out that the\noften-adopted isotropic wind assumption and the binary hypothesis as the\nunderlying origin for the circumstellar pattern in the shape of multilayered\nshells are, however, mutually incompatible. We revisit the hydrodynamic models\nfor spiral-shell patterns induced by the orbital motion of a hypothesized\nbinary, of which one star is losing mass at a high rate. The distributions of\ntransverse wind velocities as a function of position angle in the plane of the\nsky are explored along viewing directions. The variation of the transverse wind\nvelocity is as large as half the average wind velocity over the entire three\ndimensional domain in the simulated models investigated in this work. The\ndirectional dependence of the wind velocity is indicative of the overall\nmorphology of the circumstellar material, implying that kinematic information\nis an important ingredient in modeling the snapshot monitoring (often in the\noptical and near-infrared) or the spectral imaging observations for molecular\nline emissions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:15:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kim","Hyosun","","Korea Astronomy and Space Science Institute"]]}
{"id":"2308.15678","submitter":"Th\\'eo Michelot","authors":"Th\\'eo Michelot, Natasha J. Klappstein, Jonathan R. Potts, John\n  Fieberg","title":"Understanding step selection analysis through numerical integration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Step selection functions (SSFs) are flexible models to jointly describe\nanimals' movement and habitat preferences. Their popularity has grown rapidly\nand extensions have been developed to increase their utility, including various\ndistributions to describe movement constraints, interactions to allow movements\nto depend on local environmental features, and random effects and latent states\nto account for within- and among-individual variability. Although the SSF is a\nrelatively simple statistical model, its presentation has not been consistent\nin the literature, leading to confusion about model flexibility and\ninterpretation. We believe that part of the confusion has arisen from the\nconflation of the SSF model with the methods used for parameter estimation.\nNotably, conditional logistic regression can be used to fit SSFs in exponential\nform, and this approach is often presented interchangeably with the actual\nmodel (the SSF itself). However, reliance on conditional logistic regression\nreduces model flexibility, and suggests a misleading interpretation of step\nselection analysis as being equivalent to a case-control study. In this review,\nwe explicitly distinguish between model formulation and inference technique,\npresenting a coherent framework to fit SSFs based on numerical integration and\nmaximum likelihood estimation. We provide an overview of common numerical\nintegration techniques, and explain how they relate to step selection analyses.\nThis framework unifies different model fitting techniques for SSFs, and opens\nthe way for improved inference. In particular, it makes it straightforward to\nmodel movement with distributions outside the exponential family, and to apply\ndifferent SSF formulations to a data set and compare them with AIC. By\nseparating the model formulation from the inference technique, we hope to\nclarify many important concepts in step selection analysis.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:26:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Michelot","Th\u00e9o",""],["Klappstein","Natasha J.",""],["Potts","Jonathan R.",""],["Fieberg","John",""]]}
{"id":"2308.15679","submitter":"Hyosun Kim Dr.","authors":"Hyosun Kim, Ho-Gyu Lee, Youichi Ohyama, Ji Hoon Kim, Peter Scicluna,\n  You-Hua Chu, Nicolas Mauron and Toshiya Ueta","title":"The porous envelope and circumstellar wind matter of the closest carbon\n  star, CW Leonis","comments":"6 pages, 4 figures, Winds of Stars and Exoplanets. Proceedings of the\n  International Astronomical Union, Volume 370, pp. 78-83","journal-ref":"Proceedings of the International Astronomical Union, 17(S370),\n  78-83 (2023)","doi":"10.1017/S1743921322004604","report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Recent abrupt changes of CW Leonis may indicate that we are witnessing the\nmoment that the central carbon star is evolving off the Asymptotic Giant Branch\n(AGB) and entering into the pre-planetary nebula (PPN) phase. The recent\nappearance of a red compact peak at the predicted stellar position is possibly\nan unveiling event of the star, and the radial beams emerging from the stellar\nposition resemble the feature of the PPN Egg Nebula. The increase of light\ncurve over two decades is also extraordinary, and it is possibly related to the\nphase transition. Decadal-period variations are further found in the residuals\nof light curves, in the relative brightness of radial beams, and in the\nextended halo brightness distribution. Further monitoring of the recent\ndramatic and decadal-scale changes of this most well-known carbon star CW\nLeonis at the tip of AGB is still highly essential, and will help us gain a\nmore concrete understanding on the conditions for transition between the late\nstellar evolutionary phases.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:31:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kim","Hyosun",""],["Lee","Ho-Gyu",""],["Ohyama","Youichi",""],["Kim","Ji Hoon",""],["Scicluna","Peter",""],["Chu","You-Hua",""],["Mauron","Nicolas",""],["Ueta","Toshiya",""]]}
{"id":"2308.15680","submitter":"Motohiro Sobajima","authors":"Motohiro Sobajima","title":"Optimal decay for one-dimensional damped wave equations with potentials\n  via a variant of Nash inequality","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The optimality of decay properties of the one-dimensional damped wave\nequations with potentials belonging to a certain class is discussed. The\ntypical ingredient is a variant of Nash inequality which involves an invariant\nmeasure for the corresponding Schr\\\"odinger semigroup. This enables us to find\na sharp decay estimate from above. Moreover, the use of a test function method\nwith the Nash-type inequality provides the decay estimate from below. The\ndiffusion phenomena for the damped wave equations with potentials are also\nconsidered.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:34:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sobajima","Motohiro",""]]}
{"id":"2308.15681","submitter":"Art Owen","authors":"Ruggero Bellio, Swarnadip Ghosh, Art B. Owen, Cristiano Varin","title":"Scalable Estimation of Probit Models with Crossed Random Effects","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":"  Crossed random effects structures arise in many scientific contexts. They\nraise severe computational problems with likelihood and Bayesian computations\nscaling like $N^{3/2}$ or worse for $N$ data points. In this paper we develop a\ncomposite likelihood approach for crossed random effects probit models. For\ndata arranged in rows and columns, one likelihood uses marginal distributions\nof the responses as if they were independent, another uses a hierarchical model\ncapturing all within row dependence as if the rows were independent and the\nthird model reverses the roles of rows and columns. We find that this method\nhas a cost that grows as $\\mathrm{O}(N)$ in crossed random effects settings\nwhere using the Laplace approximation has cost that grows superlinearly. We\nshow how to get consistent estimates of the probit slope and variance\ncomponents by maximizing those three likelihoods. The algorithm scales readily\nto a data set of five million observations from Stitch Fix.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:40:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bellio","Ruggero",""],["Ghosh","Swarnadip",""],["Owen","Art B.",""],["Varin","Cristiano",""]]}
{"id":"2308.15682","submitter":"Ramin G. Daghigh","authors":"Ramin G. Daghigh and Gabor Kunstatter","title":"The effect of dark matter spikes on galactic black hole ringdown\n  waveforms and shadows","comments":"18 pages, 7 figures, regular article","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the effect of dark matter spikes on the ringdown waveforms and\nshadows of the supermassive black holes at the core of the Milky Way and M87.\nThe dominant effect comes in the form of a redshift factor due to the mass of\nthe spike and is significant for large supermassive black holes such as M87*.\nThe subdominant contributions, recently calculated in {\\it ApJ} {\\bf 940} 33\n(2022), give information about the distribution of matter in the spike. We show\nthat these subdominant contributions are small as compared to the redshift\nfactor and likely difficult to detect except perhaps for very large black\nholes. We also show that the effect of a dark matter spike, with density near\nthe observational upper bounds, on the shadow radius of M87* is only an order\nof magnitude smaller than is currently accessible with Event Horizon Telescope\ndata.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:43:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Daghigh","Ramin G.",""],["Kunstatter","Gabor",""]]}
{"id":"2308.15683","submitter":"Tyler Chen","authors":"Tyler Chen","title":"A spectrum adaptive kernel polynomial method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The kernel polynomial method (KPM) is a powerful numerical method for\napproximating spectral densities. Typical implementations of the KPM require an\na prior estimate for an interval containing the support of the target spectral\ndensity, and while such estimates can be obtained by classical techniques, this\nincurs addition computational costs. We propose an spectrum adaptive KPM based\non the Lanczos algorithm without reorthogonalization which allows the selection\nof KPM parameters to be deferred to after the expensive computation is\nfinished. Theoretical results from numerical analysis are given to justify the\nsuitability of the Lanczos algorithm for our approach, even in finite precision\narithmetic. While conceptually simple, the paradigm of decoupling computation\nfrom approximation has a number of practical and pedagogical benefits which we\nhighlight with numerical examples.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:52:33 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Tyler",""]]}
{"id":"2308.15684","submitter":"Kanata Suzuki","authors":"Kazuki Hori, Kanata Suzuki, Tetsuya Ogata","title":"Interactively Robot Action Planning with Uncertainty Analysis and Active\n  Questioning by Large Language Model","comments":"7 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The application of the Large Language Model (LLM) to robot action planning\nhas been actively studied. The instructions given to the LLM by natural\nlanguage may include ambiguity and lack of information depending on the task\ncontext. It is possible to adjust the output of LLM by making the instruction\ninput more detailed; however, the design cost is high. In this paper, we\npropose the interactive robot action planning method that allows the LLM to\nanalyze and gather missing information by asking questions to humans. The\nmethod can minimize the design cost of generating precise robot instructions.\nWe demonstrated the effectiveness of our method through concrete examples in\ncooking tasks. However, our experiments also revealed challenges in robot\naction planning with LLM, such as asking unimportant questions and assuming\ncrucial information without asking. Shedding light on these issues provides\nvaluable insights for future research on utilizing LLM for robotics.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:54:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hori","Kazuki",""],["Suzuki","Kanata",""],["Ogata","Tetsuya",""]]}
{"id":"2308.15685","submitter":"Jeyson T\\'amara-Isaza","authors":"Jeyson T\\'amara-Isaza, Pablo Burset and William J. Herrera","title":"Microscopic Green's function approach for generalized Dirac Hamiltonians","comments":"17 pages, 15 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":"  The rising interest in Dirac materials, condensed matter systems where\nlow-energy electronic excitations are described by the relativistic Dirac\nHamiltonian, entails a need for microscopic effective models to analytically\ndescribe their transport properties. Specifically, for the study of quantum\ntransport, these effective models must take into account the effect of\natomic-scale interfaces and the presence of well-defined edges while\nreproducing the correct band structure. We develop a general method to\nanalytically compute the microscopic Green's function of Dirac materials valid\nfor infinite, semi-infinite, and finite two-dimensional layers with zigzag or\narmchair edge orientations. We test our method by computing the density of\nstates and scattering probabilities of germanene and some transition metal\ndichalcogenides, obtaining simple analytical formulas. Our results provide a\nuseful analytical tool for the interpretation of transport experiments on Dirac\nmaterials and could be extended to describe additional degrees of freedom like\nextra layers, superconductivity, etc.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 00:59:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["T\u00e1mara-Isaza","Jeyson",""],["Burset","Pablo",""],["Herrera","William J.",""]]}
{"id":"2308.15686","submitter":"Jhon W. Gonz\\'alez","authors":"J. W. Gonz\\'alez, E. Fl\\'orez, J. D. Correa","title":"MoS$_2$ 2D-polymorphs as a Li-/Na-ion batteries: 1T' vs 2H phases","comments":"23 pages 6 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":"  In this study, we compare the performance of two phases of MoS$_2$\nmonolayers: 1T' and 2H, about their ability to adsorb lithium and sodium ions.\nEmploying the density functional theory and molecular dynamics, we include the\nion concentration to analyze the electronic structure, ion kinetics, and\nbattery performance. The pristine 2H-MoS$_2$ monolayer is the ground state.\nHowever, the charge transfer effects above a critical ion concentration yields\na stability change, where the 1T'-MoS$_2$ monolayer with adsorbed ions becomes\nmore stable thanthe 2H counterpart. The diffusion of ions onto the 1T'\nmonolayer is anisotropic, being more efficient at ion adsorption than the 2H\nphase. Finally, we calculate the open circuit voltage and specific capacity,\nconfirming that the 1T'-MoS$_2$ phase has great potential for developing\nlithium/sodium ion batteries.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:03:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gonz\u00e1lez","J. W.",""],["Fl\u00f3rez","E.",""],["Correa","J. D.",""]]}
{"id":"2308.15687","submitter":"Dongxiang Shen","authors":"Dong-Xiang Shen, Gang Li, Iskandar Abdusamatjan, Jian-Ning Fu,\n  Chun-Hua Zhu, Jin-Long Yu, Yu Zhang, Guo-Liang Lv, Nan-Nan Zhai, and\n  Jin-Zhong Liu","title":"Variability of magnetic hot stars from the TESS observations","comments":"46 pages, 25 figures, Accepted by ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Magnetic hot stars refer to the stars, which effective temperatures\napproximately in the range from 7,000 to 50,000 K, and with large-scale\nglobally organized magnetic fields. These magnetic fields exhibit strengths\nranging from tens of Gauss to tens of kilo-Gauss. They are key in understanding\nthe effects caused by magnetic fields in the stellar evolution. However, there\nare only three magnetic hot stars studied via a combination of\nspectropolarimetric and asteroseismic modeling. Combined with\n$Transiting\\;Exoplanet\\;Survey\\;Satellite\\;(TESS)$ 1-56 sectors data sets, we\nprovided a photometric variability and stochastic low frequency (SLF)\nvariability study of 118 magnetic hot stars. 9 new rotating variable stars are\nidentified. Using the Bayesian Markov Chain Monte Carlo (MCMC) framework, we\nfitted the morphologies of SLF variability for magnetic hot stars. Our analysis\nreveals that the magnetic hot stars in our sample have $\\gamma < 5.5$ with the\nvast majority having $1 \\leq \\gamma \\leq 3$. The $\\nu_{\\rm char}$ is primarily\nin the ranges of $0\\;\\text{d}^{-1} < \\nu_{\\rm char} < 6.3\\;\\text{d}^{-1}$. The\namplitude of SLF variability, log$\\alpha_{\\rm 0}$, shows a dominant\ndistribution ranging from 0.8 to 3. No significant correlations are observed\nbetween the luminosity and fitting parameters, suggesting no clear dependence\nof SLF variability on stellar mass for our sample of magnetic hot stars with\nmasses between approximately $1.5 M_{\\odot}< M < 20 M_{\\odot}$. We found a\nsignificant negative correlation between the $B_{\\rm p}$ and $\\nu_{char}$. This\nsuppression effect of magnetic fields on $\\nu_{\\rm char}$ may be a result of\ntheir inhibition of macroturbulence.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:03:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Shen","Dong-Xiang",""],["Li","Gang",""],["Abdusamatjan","Iskandar",""],["Fu","Jian-Ning",""],["Zhu","Chun-Hua",""],["Yu","Jin-Long",""],["Zhang","Yu",""],["Lv","Guo-Liang",""],["Zhai","Nan-Nan",""],["Liu","Jin-Zhong",""]]}
{"id":"2308.15688","submitter":"Jialuo Liu","authors":"Jialuo Liu and Dong Xi","title":"Covariate adjustment and estimation of difference in proportions in\n  randomized clinical trials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Difference in proportions is frequently used to measure treatment effect for\nbinary outcomes in randomized clinical trials. The estimation of difference in\nproportions can be assisted by adjusting for prognostic baseline covariates to\nenhance precision and bolster statistical power. Standardization or\nG-computation is a widely used method for covariate adjustment in estimating\nunconditional difference in proportions, because of its robustness to model\nmisspecification. Various inference methods have been proposed to quantify the\nuncertainty and confidence intervals based on large-sample theories. However,\ntheir performances under small sample sizes and model misspecification have not\nbeen comprehensively evaluated. We propose an alternative approach to estimate\nthe unconditional variance of the standardization estimator based on the robust\nsandwich estimator to further enhance the finite sample performance. Extensive\nsimulations are provided to demonstrate the performances of the proposed\nmethod, spanning a wide range of sample sizes, randomization ratios, and model\nmisspecification. We apply the proposed method in a real data example to\nillustrate the practical utility.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:09:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Jialuo",""],["Xi","Dong",""]]}
{"id":"2308.15689","submitter":"Zhong-Wen Feng","authors":"Zhong-Wen Feng, Yi Ling, Xiao-Ning Wu","title":"New black-to-white hole solutions by surgery","comments":"28 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct new black-to-white hole solutions by surgery which connects the\ngeometry of space time at some cut-off inside the horizon. The continuity of\nthe metric can be guaranteed up to the arbitrary order which is controlled by\nthe power factor $n$. This sort of black-to-white holes is characterized by the\nsub-Planckian scalar curvature, independent of the mass of black-to-white\nholes. More importantly, we show that the energy condition is only violated\nwithin a small region near the cut-off. The geodesics of particles within the\nregion from black hole to white hole is also analyzed. It turns out that the\nmatter falling into the black hole may pass through the center without\nsingularity and come out from the white hole. This scenario provides novel\nideas for understanding the information loss paradox in traditional black hole\nphysics.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:11:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Feng","Zhong-Wen",""],["Ling","Yi",""],["Wu","Xiao-Ning",""]]}
{"id":"2308.15690","submitter":"Byunghyun Ban","authors":"Byunghyun Ban, Donghun Ryu, Su-won Hwang","title":"CongNaMul: A Dataset for Advanced Image Processing of Soybean Sprouts","comments":"Accepted to International Conference on ICT Convergence 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present 'CongNaMul', a comprehensive dataset designed for various tasks in\nsoybean sprouts image analysis. The CongNaMul dataset is curated to facilitate\ntasks such as image classification, semantic segmentation, decomposition, and\nmeasurement of length and weight. The classification task provides four classes\nto determine the quality of soybean sprouts: normal, broken, spotted, and\nbroken and spotted, for the development of AI-aided automatic quality\ninspection technology. For semantic segmentation, images with varying\ncomplexity, from single sprout images to images with multiple sprouts, along\nwith human-labelled mask images, are included. The label has 4 different\nclasses: background, head, body, tail. The dataset also provides images and\nmasks for the image decomposition task, including two separate sprout images\nand their combined form. Lastly, 5 physical features of sprouts (head length,\nbody length, body thickness, tail length, weight) are provided for image-based\nmeasurement tasks. This dataset is expected to be a valuable resource for a\nwide range of research and applications in the advanced analysis of images of\nsoybean sprouts. Also, we hope that this dataset can assist researchers\nstudying classification, semantic segmentation, decomposition, and physical\nfeature measurement in other industrial fields, in evaluating their models. The\ndataset is available at the authors' repository. (https://bhban.kr/data)\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:14:32 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 02:21:20 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ban","Byunghyun",""],["Ryu","Donghun",""],["Hwang","Su-won",""]]}
{"id":"2308.15691","submitter":"Arjun Raghavan","authors":"Arjun Raghavan, Marisa Romanelli, Julian May-Mann, Anuva Aishwarya,\n  Leena Aggarwal, Anisha G. Singh, Maja D. Bachmann, Leslie M. Schoop, Eduardo\n  Fradkin, Ian R. Fisher, and Vidya Madhavan","title":"Atomic-Scale Visualization of a Cascade of Magnetic Orders in the\n  Layered Antiferromagnet $GdTe_{3}$","comments":"35 pgs.; 4 main figures, 11 supplementary figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  $GdTe_{3}$ is a layered antiferromagnet belonging to the family of rare-earth\nsquare net tritellurides which has recently attracted much attention due to its\nexceptionally high mobility, the presence of a novel unidirectional\nincommensurate charge density wave (CDW) state, superconductivity under\npressure, and a cascade of magnetic transitions between 12 and 7 K, whose order\nparameters are as yet unknown. Since the itinerant electrons and localized\nmoments reside on different crystalline planes in this family of compounds,\nspin-charge interactions could potentially result in unexpected phases in this\nsystem. In this work, we use spin-polarized scanning tunneling microscopy to\ndirectly image the charge and magnetic orders in $GdTe_{3}$. Below 7 K, we find\na striped antiferromagnetic phase with twice the periodicity of the Gd lattice\nand perpendicular to the CDW order. Intriguingly, between 7 and 12 K, we\ndiscover a spin density wave which has the same periodicity as the CDW. Using a\nminimal Landau free energy model we show that the spin density wave can arise\nfrom a bulk incipient antiferromagnetic order oriented along the\n$\\textit{c}$-axis that couples to the CDW order. Our work reveals the order\nparameters of the cascade of low temperature magnetic phases in $GdTe_{3}$ and\nshows how the interplay between the charge and spin sectors can generate\nmultiple coexisting magnetic orders in this class of materials.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:15:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Raghavan","Arjun",""],["Romanelli","Marisa",""],["May-Mann","Julian",""],["Aishwarya","Anuva",""],["Aggarwal","Leena",""],["Singh","Anisha G.",""],["Bachmann","Maja D.",""],["Schoop","Leslie M.",""],["Fradkin","Eduardo",""],["Fisher","Ian R.",""],["Madhavan","Vidya",""]]}
{"id":"2308.15692","submitter":"Takami Sato","authors":"Takami Sato, Justin Yue, Nanze Chen, Ningfei Wang, Qi Alfred Chen","title":"Intriguing Properties of Diffusion Models: A Large-Scale Dataset for\n  Evaluating Natural Attack Capability in Text-to-Image Generative Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Denoising probabilistic diffusion models have shown breakthrough performance\nthat can generate more photo-realistic images or human-level illustrations than\nthe prior models such as GANs. This high image-generation capability has\nstimulated the creation of many downstream applications in various areas.\nHowever, we find that this technology is indeed a double-edged sword: We\nidentify a new type of attack, called the Natural Denoising Diffusion (NDD)\nattack based on the finding that state-of-the-art deep neural network (DNN)\nmodels still hold their prediction even if we intentionally remove their robust\nfeatures, which are essential to the human visual system (HVS), by text\nprompts. The NDD attack can generate low-cost, model-agnostic, and\ntransferrable adversarial attacks by exploiting the natural attack capability\nin diffusion models. Motivated by the finding, we construct a large-scale\ndataset, Natural Denoising Diffusion Attack (NDDA) dataset, to systematically\nevaluate the risk of the natural attack capability of diffusion models with\nstate-of-the-art text-to-image diffusion models. We evaluate the natural attack\ncapability by answering 6 research questions. Through a user study to confirm\nthe validity of the NDD attack, we find that the NDD attack can achieve an 88%\ndetection rate while being stealthy to 93% of human subjects. We also find that\nthe non-robust features embedded by diffusion models contribute to the natural\nattack capability. To confirm the model-agnostic and transferrable attack\ncapability, we perform the NDD attack against an AD vehicle and find that 73%\nof the physically printed attacks can be detected as a stop sign. We hope that\nour study and dataset can help our community to be aware of the risk of\ndiffusion models and facilitate further research toward robust DNN models.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:21:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sato","Takami",""],["Yue","Justin",""],["Chen","Nanze",""],["Wang","Ningfei",""],["Chen","Qi Alfred",""]]}
{"id":"2308.15693","submitter":"Johannes Eser","authors":"Johannes Eser and Angela V. Olinto and Lawrence Wiencke (for the\n  JEM-EUSO Collaboration)","title":"Overview and First Results of EUSO-SPB2","comments":"Proceeding 38th ICRC 2023 Nagoya, Japan","journal-ref":null,"doi":"10.22323/1.444.0397","report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Observing ultra-high energy cosmic rays (UHECR) and very high energy (VHE)\nneutrinos from space is a promising way to measure their extremely low fluxes\nby significantly increasing the observed volume. The Extreme Universe Space\nObservatory on a Super Pressure Balloon 2 (EUSO-SPB2), the next, most advanced\npathfinder for such a mission, was launched May 13th 2023 from Wanaka New\nZealand. The pioneering EUSO-SPB2 payload flew a Fluorescence Telescope (FT)\nwith a PMT camera pointed in nadir to record fluorescence light from cosmic ray\nextensive air shower (EAS) with energies above 1 EeV, and a Cherenkov telescope\n(CT) with a silicon photomultiplier focal surface for observing Cherenkov\nemission of cosmic ray EAS with energies above 1 PeV with an above-the-limb\ngeometry and of PeV-scale EAS initiated by neutrino-sourced tau decay. As the\nCT is a novel instrument, optical background measurements for space neutrino\nobservation are an important goal of the mission. Any data collected during the\nmission will influence and improve the development of a space-based\nmulti-messenger observatory such as the Probe of Extreme Multi-Messenger\nAstrophysics (POEMMA). We present an overview of the EUSO-SPB2 mission and its\nscience goals and summarize results as available, from the 2023 flight.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:21:49 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 03:23:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Eser","Johannes","","for the\n  JEM-EUSO Collaboration"],["Olinto","Angela V.","","for the\n  JEM-EUSO Collaboration"],["Wiencke","Lawrence","","for the\n  JEM-EUSO Collaboration"]]}
{"id":"2308.15694","submitter":"Jin-Xin Zhou","authors":"Jiangmin Pan, Fu-Gang Yin, Jin-Xin Zhou","title":"Quasiprimitive groups with a biregular dihedral subgroup,and\n  arc-transitive bidihedrants","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A semiregular permutation group on a set $\\Ome$ is called {\\em bi-regular} if\nit has two orbits. A classification is given of quasiprimitive permutation\ngroups with a biregular dihedral subgroup. This is then used to characterize\nthe family of arc-transitive graphs whose automorphism groups containing a\nbi-regular dihedral subgroup. We first show that every such graph is a normal\n$r$-cover of an arc-transitive graph whose automorphism group is either\nquasiprimitive or bi-quasiprimitive on its vertices, and then classify all such\nquasiprimitive or bi-quasiprimitive arc-transitive graphs.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:24:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pan","Jiangmin",""],["Yin","Fu-Gang",""],["Zhou","Jin-Xin",""]]}
{"id":"2308.15695","submitter":"Kevin Cong","authors":"Kevin Cong","title":"On Integer Sets Excluding Permutation Pattern Waves","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study Ramsey-type problems on sets avoiding sequences whose consecutive\ndifferences have a fixed relative order. For a given permutation $\\pi \\in S_k$,\na $\\pi$-wave is a sequence $x_1 < \\cdots < x_{k+1}$ such that $x_{i+1} - x_i >\nx_{j+1} - x_j$ if and only if $\\pi(i) > \\pi(j)$. A subset of $[n] =\n\\{1,\\ldots,n\\}$ is $\\pi$-wave-free if it does not contain any $\\pi$-wave. Our\nfirst main result shows that the size of the largest $\\pi$-wave-free subset of\n$[n]$ is $O\\left((\\log n)^{k-1}\\right)$. We then classify all permutations for\nwhich this bound is tight. In the cases where it is not tight, we prove\nstronger polylogarithmic upper bounds. We then apply these bounds to a closely\nrelated coloring problem studied by Landman and Robertson.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:33:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cong","Kevin",""]]}
{"id":"2308.15696","submitter":"Dongyang Xu","authors":"Yingying Hu, Dongyang Xu, Tiantian Zhang","title":"Implementation and Evaluation of Physical Layer Key Generation on SDR\n  based LoRa Platform","comments":"Submitted to IEEE VTC2023 Fall","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Physical layer key generation technology which leverages channel randomness\nto generate secret keys has attracted extensive attentions in long range\n(LoRa)-based networks recently. We in this paper develop a software-defined\nradio (SDR) based LoRa communications platform using GNU Radio on universal\nsoftware radio peripheral (USRP) to implement and evaluate typical physical\nlayer key generation schemes. Thanks to the flexibility and configurability of\nGNU Radio to extract LoRa packets, we are able to obtain the fine-grained\nchannel frequency response (CFR) through LoRa preamble based channel estimation\nfor key generation. Besides, we propose a lowcomplexity preprocessing method to\nenhance the randomness of quantization while reducing the secret key\ndisagreement ratio. The results indicate that we can achieve 367 key bits with\na high level of randomness through just a single effective channel probing in\nan indoor environment at a distance of 2 meters under the circumstance of a\nspreading factor (SF) of 7, a preamble length of 8, a signal bandwidth of 250\nkHz, and a sampling rate of 1 MHz.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:38:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hu","Yingying",""],["Xu","Dongyang",""],["Zhang","Tiantian",""]]}
{"id":"2308.15697","submitter":"Quan Nguyen","authors":"Quan Nguyen, Emma Lejeune","title":"Segmenting mechanically heterogeneous domains via unsupervised learning","comments":"26 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.data-an q-bio.TO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  From biological organs to soft robotics, highly deformable materials are\nessential components of natural and engineered systems. These highly deformable\nmaterials can have heterogeneous material properties, and can experience\nheterogeneous deformations with or without underlying material heterogeneity.\nMany recent works have established that computational modeling approaches are\nwell suited for understanding and predicting the consequences of material\nheterogeneity and for interpreting observed heterogeneous strain fields. In\nparticular, there has been significant work towards developing inverse analysis\napproaches that can convert observed kinematic quantities (e.g., displacement,\nstrain) to material properties and mechanical state. Despite the success of\nthese approaches, they are not necessarily generalizable and often rely on\ntight control and knowledge of boundary conditions. Here, we will build on the\nrecent advances (and ubiquity) of machine learning approaches to explore\nalternative approaches to detect patterns in heterogeneous material properties\nand mechanical behavior. Specifically, we will explore unsupervised learning\napproaches to clustering and ensemble clutering to identify heterogeneous\nregions. Overall, we find that these approaches are effective, yet limited in\ntheir abilities. Through this initial exploration (where all data and code is\npublished alongside this manuscript), we set the stage for future studies that\nmore specifically adapt these methods to mechanical data.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:40:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Nguyen","Quan",""],["Lejeune","Emma",""]]}
{"id":"2308.15698","submitter":"Zuodong Zhang","authors":"Zuodong Zhang, Renjie Wei, Meng Li, Yibo Lin, Runsheng Wang, Ru Huang","title":"READ: Reliability-Enhanced Accelerator Dataflow Optimization using\n  Critical Input Pattern Reduction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the rapid advancements of deep learning in recent years, hardware\naccelerators are continuously deployed in more and more safety-critical\napplications such as autonomous driving and robotics. While the accelerators\nare usually fabricated with advanced technology nodes for high performance and\nenergy efficiency, they are also more prone to timing errors under process,\nvoltage, temperature, and aging (PVTA) variations. By revisiting the physical\nsources of timing errors, we show that most of the timing errors in the\naccelerator are caused by a specific subset of input patterns, defined as\ncritical input patterns. To improve the timing error resilience of the\naccelerator, in this paper, we propose READ, a reliability-enhanced accelerator\ndataflow optimization technique that can effectively reduce timing errors. READ\nreduces the occurrence of critical input patterns by exploring the optimal\ncomputing sequence when mapping a trained deep neural network to accelerators.\nREAD only changes the order of multiply-accumulate operations in a convolution,\nwhich introduces negligible hardware overhead and no impact on accuracy. The\nexperimental results on VGG and ResNet demonstrate on average 7.8X timing error\nrate (TER) reduction and up to 37.9X TER reduction for certain layers. The\nresults also show that READ enables the accelerator to maintain accuracy over a\nwide range of PVTA variations, making it a promising approach for robust\ndeep-learning design\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:43:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Zuodong",""],["Wei","Renjie",""],["Li","Meng",""],["Lin","Yibo",""],["Wang","Runsheng",""],["Huang","Ru",""]]}
{"id":"2308.15699","submitter":"Fujio Toriumi","authors":"Tomoki Fukuma, Koki Noda, Yuta Yamamoto, Takaya Hoshi, Yoshiharu\n  Ichikawa, Kyosuke Kambe, Yu Masubuchi, Fujio Toriumi","title":"Investigating Quantitative-Qualitative Topical Preference: A Comparative\n  Study of Early and Late Engagers in Japanese ChatGPT Conversations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study investigates engagement patterns related to OpenAI's ChatGPT on\nJapanese Twitter, focusing on two distinct user groups - early and late\nengagers, inspired by the Innovation Theory. Early engagers are defined as\nindividuals who initiated conversations about ChatGPT during its early stages,\nwhereas late engagers are those who began participating at a later date. To\nexamine the nature of the conversations, we employ a dual methodology,\nencompassing both quantitative and qualitative analyses. The quantitative\nanalysis reveals that early engagers often engage with more forward-looking and\nspeculative topics, emphasizing the technological advancements and potential\ntransformative impact of ChatGPT. Conversely, the late engagers intereact more\nwith contemporary topics, focusing on the optimization of existing AI\ncapabilities and considering their inherent limitations. Through our\nqualitative analysis, we propose a method to measure the proportion of shared\nor unique viewpoints within topics across both groups. We found that early\nengagers generally concentrate on a more limited range of perspectives, whereas\nlate engagers exhibit a wider range of viewpoints. Interestingly, a weak\ncorrelation was found between the volume of tweets and the diversity of\ndiscussed topics in both groups. These findings underscore the importance of\nidentifying semantic bias, rather than relying solely on the volume of tweets,\nfor understanding differences in communication styles between groups within a\ngiven topic. Moreover, our versatile dual methodology holds potential for\nbroader applications, such as studying engagement patterns within different\nuser groups, or in contexts beyond ChatGPT.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:51:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fukuma","Tomoki",""],["Noda","Koki",""],["Yamamoto","Yuta",""],["Hoshi","Takaya",""],["Ichikawa","Yoshiharu",""],["Kambe","Kyosuke",""],["Masubuchi","Yu",""],["Toriumi","Fujio",""]]}
{"id":"2308.15700","submitter":"Anna Kawakami","authors":"Anna Kawakami, Luke Guerdan, Yanghuidi Cheng, Matthew Lee, Scott\n  Carter, Nikos Arechiga, Kate Glazko, Haiyi Zhu, Kenneth Holstein","title":"Training Towards Critical Use: Learning to Situate AI Predictions\n  Relative to Human Knowledge","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A growing body of research has explored how to support humans in making\nbetter use of AI-based decision support, including via training and onboarding.\nExisting research has focused on decision-making tasks where it is possible to\nevaluate \"appropriate reliance\" by comparing each decision against a ground\ntruth label that cleanly maps to both the AI's predictive target and the human\ndecision-maker's goals. However, this assumption does not hold in many\nreal-world settings where AI tools are deployed today (e.g., social work,\ncriminal justice, and healthcare). In this paper, we introduce a\nprocess-oriented notion of appropriate reliance called critical use that\ncenters the human's ability to situate AI predictions against knowledge that is\nuniquely available to them but unavailable to the AI model. To explore how\ntraining can support critical use, we conduct a randomized online experiment in\na complex social decision-making setting: child maltreatment screening. We find\nthat, by providing participants with accelerated, low-stakes opportunities to\npractice AI-assisted decision-making in this setting, novices came to exhibit\npatterns of disagreement with AI that resemble those of experienced workers. A\nqualitative examination of participants' explanations for their AI-assisted\ndecisions revealed that they drew upon qualitative case narratives, to which\nthe AI model did not have access, to learn when (not) to rely on AI\npredictions. Our findings open new questions for the study and design of\ntraining for real-world AI-assisted decision-making.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:54:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kawakami","Anna",""],["Guerdan","Luke",""],["Cheng","Yanghuidi",""],["Lee","Matthew",""],["Carter","Scott",""],["Arechiga","Nikos",""],["Glazko","Kate",""],["Zhu","Haiyi",""],["Holstein","Kenneth",""]]}
{"id":"2308.15701","submitter":"Xiaoqing Chen","authors":"Xiaoqing Chen, Zhitao Li, Weike Pan and Zhong Ming","title":"A Survey on Multi-Behavior Sequential Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommender systems is set up to address the issue of information overload in\ntraditional information retrieval systems, which is focused on recommending\ninformation that is of most interest to users from massive information.\nGenerally, there is a sequential nature and heterogeneity to the behavior of a\nperson interacting with a system, leading to the proposal of multi-behavior\nsequential recommendation (MBSR). MBSR is a relatively new and worthy direction\nfor in-depth research, which can achieve state-of-the-art recommendation\nthrough suitable modeling, and some related works have been proposed. This\nsurvey aims to shed light on the MBSR problem. Firstly, we introduce MBSR in\ndetail, including its problem definition, application scenarios and challenges\nfaced. Secondly, we detail the classification of MBSR, including\nneighborhood-based methods, matrix factorization-based methods and deep\nlearning-based methods, where we further classify the deep learning-based\nmethods into different learning architectures based on RNN, GNN, Transformer,\nand generic architectures as well as architectures that integrate hybrid\ntechniques. In each method, we present related works based on the data\nperspective and the modeling perspective, as well as analyze the strengths,\nweaknesses and features of these works. Finally, we discuss some promising\nfuture research directions to address the challenges and improve the current\nstatus of MBSR.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:54:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Xiaoqing",""],["Li","Zhitao",""],["Pan","Weike",""],["Ming","Zhong",""]]}
{"id":"2308.15702","submitter":"Carlos Gabriel Valenzuela Ruiz","authors":"Carlos Gabriel Valenzuela Ruiz, Donald Stanley","title":"Double homology and wedge-decomposable simplicial complexes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show a wedge-decomposable simplicial complex has associated double\nhomology $\\mathbb{Z}\\oplus\\mathbb{Z}$ in bidegrees $(0,0)$, $(-1,4)$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:55:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ruiz","Carlos Gabriel Valenzuela",""],["Stanley","Donald",""]]}
{"id":"2308.15703","submitter":"Jun Li","authors":"Jun Li, Jingjian Wang, Hongwei Wang, Xing Deng, Jielong Chen, Bing\n  Cao, Zekun Wang, Guanjie Xu, Ge Zhang, Feng Shi, Hualei Liu","title":"Fragment and Integrate Network (FIN): A Novel Spatial-Temporal Modeling\n  Based on Long Sequential Behavior for Online Food Ordering Click-Through Rate\n  Prediction","comments":"Accepted by CIKM 2023 Applied Research Paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spatial-temporal information has been proven to be of great significance for\nclick-through rate prediction tasks in online Location-Based Services (LBS),\nespecially in mainstream food ordering platforms such as DoorDash, Uber Eats,\nMeituan, and Ele.me. Modeling user spatial-temporal preferences with sequential\nbehavior data has become a hot topic in recommendation systems and online\nadvertising. However, most of existing methods either lack the representation\nof rich spatial-temporal information or only handle user behaviors with limited\nlength, e.g. 100. In this paper, we tackle these problems by designing a new\nspatial-temporal modeling paradigm named Fragment and Integrate Network (FIN).\nFIN consists of two networks: (i) Fragment Network (FN) extracts Multiple\nSub-Sequences (MSS) from lifelong sequential behavior data, and captures the\nspecific spatial-temporal representation by modeling each MSS respectively.\nHere both a simplified attention and a complicated attention are adopted to\nbalance the performance gain and resource consumption. (ii) Integrate Network\n(IN) builds a new integrated sequence by utilizing spatial-temporal interaction\non MSS and captures the comprehensive spatial-temporal representation by\nmodeling the integrated sequence with a complicated attention. Both public\ndatasets and production datasets have demonstrated the accuracy and scalability\nof FIN. Since 2022, FIN has been fully deployed in the recommendation\nadvertising system of Ele.me, one of the most popular online food ordering\nplatforms in China, obtaining 5.7% improvement on Click-Through Rate (CTR) and\n7.3% increase on Revenue Per Mille (RPM).\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:56:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Jun",""],["Wang","Jingjian",""],["Wang","Hongwei",""],["Deng","Xing",""],["Chen","Jielong",""],["Cao","Bing",""],["Wang","Zekun",""],["Xu","Guanjie",""],["Zhang","Ge",""],["Shi","Feng",""],["Liu","Hualei",""]]}
{"id":"2308.15704","submitter":"Kyungeun Lee","authors":"Kyungeun Lee, Jaeill Kim, Suhyun Kang, Wonjong Rhee","title":"Towards a Rigorous Analysis of Mutual Information in Contrastive\n  Learning","comments":"18 pages, 7 figures, Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Contrastive learning has emerged as a cornerstone in recent achievements of\nunsupervised representation learning. Its primary paradigm involves an instance\ndiscrimination task with a mutual information loss. The loss is known as\nInfoNCE and it has yielded vital insights into contrastive learning through the\nlens of mutual information analysis. However, the estimation of mutual\ninformation can prove challenging, creating a gap between the elegance of its\nmathematical foundation and the complexity of its estimation. As a result,\ndrawing rigorous insights or conclusions from mutual information analysis\nbecomes intricate. In this study, we introduce three novel methods and a few\nrelated theorems, aimed at enhancing the rigor of mutual information analysis.\nDespite their simplicity, these methods can carry substantial utility.\nLeveraging these approaches, we reassess three instances of contrastive\nlearning analysis, illustrating their capacity to facilitate deeper\ncomprehension or to rectify pre-existing misconceptions. Specifically, we\ninvestigate small batch size, mutual information as a measure, and the InfoMin\nprinciple.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 01:59:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lee","Kyungeun",""],["Kim","Jaeill",""],["Kang","Suhyun",""],["Rhee","Wonjong",""]]}
{"id":"2308.15705","submitter":"Ayush Garg","authors":"Ayush Garg, Julia Lu, and Anika Maji","title":"Towards Earlier Detection of Oral Diseases On Smartphones Using Oral and\n  Dental RGB Images","comments":"10 pages, 6 figures, 1 formula. This research was conducted as a\n  mentored project performed for a college course and research program at the\n  University of California Santa Barbara's Summer Research Academies program","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Oral diseases such as periodontal (gum) diseases and dental caries (cavities)\naffect billions of people across the world today. However, previous\nstate-of-the-art models have relied on X-ray images to detect oral diseases,\nmaking them inaccessible to remote monitoring, developing countries, and\ntelemedicine. To combat this overuse of X-ray imagery, we propose a lightweight\nmachine learning model capable of detecting calculus (also known as hardened\nplaque or tartar) in RGB images while running efficiently on low-end devices.\nThe model, a modified MobileNetV3-Small neural network transfer learned from\nImageNet, achieved an accuracy of 72.73% (which is comparable to\nstate-of-the-art solutions) while still being able to run on mobile devices due\nto its reduced memory requirements and processing times. A ResNet34-based model\nwas also constructed and achieved an accuracy of 81.82%. Both of these models\nwere tested on a mobile app, demonstrating their potential to limit the number\nof serious oral disease cases as their predictions can help patients schedule\nappointments earlier without the need to go to the clinic.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:01:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Garg","Ayush",""],["Lu","Julia",""],["Maji","Anika",""]]}
{"id":"2308.15706","submitter":"Isabel Constantino","authors":"Isabel Constantino, Sadamori Kojaku, Santo Fortunato, Yong-Yeol Ahn","title":"Representing the Disciplinary Structure of Physics: A Comparative\n  Evaluation of Graph and Text Embedding Methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advances in machine learning offer new ways to represent and study\nscholarly works and the space of knowledge. Graph and text embeddings provide a\nconvenient vector representation of scholarly works based on citations and\ntext. Yet, it is unclear whether their representations are consistent or\nprovide different views of the structure of science. Here, we compare graph and\ntext embedding by testing their ability to capture the hierarchical structure\nof the Physics and Astronomy Classification Scheme (PACS) of papers published\nby the American Physical Society (APS). We also provide a qualitative\ncomparison of the overall structure of the graph and text embeddings for\nreference. We find that neural network-based methods outperform traditional\nmethods and graph embedding methods such as node2vec are better than other\nmethods at capturing the PACS structure. Our results call for further\ninvestigations into how different contexts of scientific papers are captured by\ndifferent methods, and how we can combine and leverage such information in an\ninterpretable manner.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:08:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Constantino","Isabel",""],["Kojaku","Sadamori",""],["Fortunato","Santo",""],["Ahn","Yong-Yeol",""]]}
{"id":"2308.15707","submitter":"Yongyun Chen","authors":"Chen Yongyun, Gu Qiusheng, Fan Junhui, Yu Xiaoling, Ding Nan, Guo\n  Xiaotong, Xiong Dingrong","title":"Jet power extracted from ADAFs and the application to Fermi BL Lacertae\n  objects","comments":"15 pages, 6 figures, accept for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We calculate the jet power of the Blandford-Znajek (BZ) model and the hybrid\nmodel based on the self-similar solution of advection-dominated accretion flows\n(ADAFs). We study the formation mechanism of the jets of BL Lacs with known\nredshifts detected by the Fermi satellite after 10 yr of data (4FGL-DR2). The\nkinetic power of the jets of Fermi BL Lacs is estimated through radio\nluminosity. The main results are as follows. (1) We find that the jet kinetic\npower of about 72\\% intermediate peak frequency BL Lacs (IBL) and 94\\%\nhigh-frequency peak BL Lacs (HBL) can be explained by the hybrid jet model\nbased on ADAFs surrounding Kerr black holes. However, the jet kinetic power of\nabout 74\\% LBL cannot be explained by the BZ jet model or the hybrid model. (2)\nThe LBL has a higher accretion rate than IBL and HBL. About 14\\% IBL and 62\\%\nHBL have pure optically thin ADAFs. However, 7\\% LBL may have a hybrid\nstructure consisting of an standard thin disk (SS) plus optically thin ADAFs.\n(3) After excluding the redshift dependence, there is a weak correlation\nbetween the jet kinetic power and the accretion disk luminosity for Fermi BL\nLacs. (4) There is a significant correlation between inverse Compton luminosity\nand synchrotron luminosity for Fermi BL Lacs. The slope of the relation between\ninverse Compton luminosity and synchrotron luminosity for Fermi BL Lacs is\nconsistent with the synchrotron self-Compton (SSC) process. The result may\nsuggest that the high-energy components of Fermi BL Lacs are dominated by the\nSSC process.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:09:33 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yongyun","Chen",""],["Qiusheng","Gu",""],["Junhui","Fan",""],["Xiaoling","Yu",""],["Nan","Ding",""],["Xiaotong","Guo",""],["Dingrong","Xiong",""]]}
{"id":"2308.15708","submitter":"Bingquan Peng","authors":"Bingquan Peng, Jie jiang, Fangfang Dai, Liang Chen, and Lei Zhang","title":"2D Single Crystal of High-Temperature Phase Cuprous Iodide under Ambient\n  Conditions","comments":"17 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Two-dimensional (2D) materials, with their structural uniqueness, exceptional\nproperties, and wide-ranging applications, show unprecedented prospects in\nfundamental physics research and industrial applications. 2D \\b{eta}-phase\ncuprous iodide (\\b{eta}-CuI) is a promising candidate for overcoming the\nchallenges of insufficient P-type transparent conductive materials, with\nmultiple predicted unique properties. Previous experimental results show that\n\\b{eta}-CuI only occurs at elevated temperatures between 645 and 675 K. Many\nefforts are made to stabilize \\b{eta}-CuI at room temperature through\nsurface/interface engineering. However, the resulting composites limit the\nperformance and application of pure 2D \\b{eta}-CuI. Here, we demonstrate\nexperimentally that isolated 2D \\b{eta}-CuI single crystals can exist stably\nunder ambient conditions, a high-temperature phase CuI found at room\ntemperature. We validate the simultaneous existence of {\\gamma}-CuI and\n\\b{eta}-CuI in the synthesized CuI. The previous neglect of \\b{eta}-CuI\ncrystals can be ascribed to factors including their low content, small\ndimensions, and lack of ingenious experimental characterization. Moreover, the\ntheoretical calculation further confirms dynamically and thermally stable of\nthe monolayer \\b{eta}-CuI, which has an ultra-wide direct band-gap (3.66 eV).\nOur findings challenge the traditional understanding of \\b{eta}-CuI as a\nhigh-temperature phase of CuI, instead providing a new definition that 2D\n\\b{eta}-CuI exhibits remarkable stability under ambient conditions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:09:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Peng","Bingquan",""],["jiang","Jie",""],["Dai","Fangfang",""],["Chen","Liang",""],["Zhang","Lei",""]]}
{"id":"2308.15709","submitter":"Jiachen T. Wang","authors":"Jiachen T. Wang, Yuqing Zhu, Yu-Xiang Wang, Ruoxi Jia, Prateek Mittal","title":"Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to\n  Data Valuation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.GT stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Data valuation, a critical aspect of data-centric ML research, aims to\nquantify the usefulness of individual data sources in training machine learning\n(ML) models. However, data valuation faces significant yet frequently\noverlooked privacy challenges despite its importance. This paper studies these\nchallenges with a focus on KNN-Shapley, one of the most practical data\nvaluation methods nowadays. We first emphasize the inherent privacy risks of\nKNN-Shapley, and demonstrate the significant technical difficulties in adapting\nKNN-Shapley to accommodate differential privacy (DP). To overcome these\nchallenges, we introduce TKNN-Shapley, a refined variant of KNN-Shapley that is\nprivacy-friendly, allowing for straightforward modifications to incorporate DP\nguarantee (DP-TKNN-Shapley). We show that DP-TKNN-Shapley has several\nadvantages and offers a superior privacy-utility tradeoff compared to naively\nprivatized KNN-Shapley in discerning data quality. Moreover, even non-private\nTKNN-Shapley achieves comparable performance as KNN-Shapley. Overall, our\nfindings suggest that TKNN-Shapley is a promising alternative to KNN-Shapley,\nparticularly for real-world applications involving sensitive data.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:12:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wang","Jiachen T.",""],["Zhu","Yuqing",""],["Wang","Yu-Xiang",""],["Jia","Ruoxi",""],["Mittal","Prateek",""]]}
{"id":"2308.15710","submitter":"Rafael Mosquera","authors":"Rafael Mosquera G\\'omez, Juli\\'an Eusse, Juan Ciro, Daniel Galvez,\n  Ryan Hileman, Kurt Bollacker, David Kanter","title":"Speech Wikimedia: A 77 Language Multilingual Speech Dataset","comments":"Data-Centric Machine Learning Workshop at the International Machine\n  Learning Conference 2023 (ICML)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Speech Wikimedia Dataset is a publicly available compilation of audio\nwith transcriptions extracted from Wikimedia Commons. It includes 1780 hours\n(195 GB) of CC-BY-SA licensed transcribed speech from a diverse set of\nscenarios and speakers, in 77 different languages. Each audio file has one or\nmore transcriptions in different languages, making this dataset suitable for\ntraining speech recognition, speech translation, and machine translation\nmodels.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:14:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["G\u00f3mez","Rafael Mosquera",""],["Eusse","Juli\u00e1n",""],["Ciro","Juan",""],["Galvez","Daniel",""],["Hileman","Ryan",""],["Bollacker","Kurt",""],["Kanter","David",""]]}
{"id":"2308.15711","submitter":"Hongjin Qian","authors":"Hongjin Qian, Zhicheng Dou, Jiejun Tan, Haonan Chen, Haoqi Gu, Ruofei\n  Lai, Xinyu Zhang, Zhao Cao, Ji-Rong Wen","title":"Optimizing Factual Accuracy in Text Generation through Dynamic Knowledge\n  Selection","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Language models (LMs) have revolutionized the way we interact with\ninformation, but they often generate nonfactual text, raising concerns about\ntheir reliability. Previous methods use external knowledge as references for\ntext generation to enhance factuality but often struggle with the knowledge\nmix-up(e.g., entity mismatch) of irrelevant references. Besides,as the length\nof the output text grows, the randomness of sampling can escalate,\ndetrimentally impacting the factual accuracy of the generated text. In this\npaper, we present DKGen, which divide the text generation process into an\niterative process. In each iteration, DKGen takes the input query, the\npreviously generated text and a subset of the reference passages as input to\ngenerate short text. During the process, the subset is dynamically selected\nfrom the full passage set based on their relevance to the previously generated\ntext and the query, largely eliminating the irrelevant references from input.\nTo further enhance DKGen's ability to correctly use these external knowledge,\nDKGen distills the relevance order of reference passages to the cross-attention\ndistribution of decoder. We train and evaluate DKGen on a large-scale benchmark\ndataset. Experiment results show that DKGen outperforms all baseline models.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:22:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Qian","Hongjin",""],["Dou","Zhicheng",""],["Tan","Jiejun",""],["Chen","Haonan",""],["Gu","Haoqi",""],["Lai","Ruofei",""],["Zhang","Xinyu",""],["Cao","Zhao",""],["Wen","Ji-Rong",""]]}
{"id":"2308.15712","submitter":"Chetraj Pandey","authors":"Chetraj Pandey, Anli Ji, Trisha Nandakumar, Rafal A. Angryk, Berkay\n  Aydin","title":"Exploring Deep Learning for Full-disk Solar Flare Prediction with\n  Empirical Insights from Guided Grad-CAM Explanations","comments":"This is a preprint accepted at the 10th IEEE International Conference\n  On Data Science And Advanced Analytics (DSAA 2023). The conference\n  proceedings will be published by the IEEE Xplore Digital Library with ISBN:\n  979-8-3503-4503-2. 10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.IM cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study progresses solar flare prediction research by presenting a\nfull-disk deep-learning model to forecast $\\geq$M-class solar flares and\nevaluating its efficacy on both central (within $\\pm$70$^\\circ$) and near-limb\n(beyond $\\pm$70$^\\circ$) events, showcasing qualitative assessment of post hoc\nexplanations for the model's predictions, and providing empirical findings from\nhuman-centered quantitative assessments of these explanations. Our model is\ntrained using hourly full-disk line-of-sight magnetogram images to predict\n$\\geq$M-class solar flares within the subsequent 24-hour prediction window.\nAdditionally, we apply the Guided Gradient-weighted Class Activation Mapping\n(Guided Grad-CAM) attribution method to interpret our model's predictions and\nevaluate the explanations. Our analysis unveils that full-disk solar flare\npredictions correspond with active region characteristics. The following points\nrepresent the most important findings of our study: (1) Our deep learning\nmodels achieved an average true skill statistic (TSS) of $\\sim$0.51 and a\nHeidke skill score (HSS) of $\\sim$0.38, exhibiting skill to predict solar\nflares where for central locations the average recall is $\\sim$0.75 (recall\nvalues for X- and M-class are 0.95 and 0.73 respectively) and for the near-limb\nflares the average recall is $\\sim$0.52 (recall values for X- and M-class are\n0.74 and 0.50 respectively); (2) qualitative examination of the model's\nexplanations reveals that it discerns and leverages features linked to active\nregions in both central and near-limb locations within full-disk magnetograms\nto produce respective predictions. In essence, our models grasp the shape and\ntexture-based properties of flaring active regions, even in proximity to limb\nareas -- a novel and essential capability with considerable significance for\noperational forecasting systems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:24:09 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pandey","Chetraj",""],["Ji","Anli",""],["Nandakumar","Trisha",""],["Angryk","Rafal A.",""],["Aydin","Berkay",""]]}
{"id":"2308.15713","submitter":"Toshiki Kinoshita","authors":"T. Kinoshita, K. Tanaka, H. Sakai, R. Yanai, M. Nunami, C. A. Michael","title":"Absolute value measurement of ion-scale turbulence by two-dimensional\n  phase contrast imaging in Large Helical Device","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":"  Absolute value measurements of turbulence amplitude in magnetically confined\nhigh-temperature plasmas can effectively explain turbulence-driven transport\ncharacteristics and their role in plasma confinements. Two-dimensional phase\ncontrast imaging (2D-PCI) is a promising technique used to evaluate the\ntemporal evolution of the radial profile of ion-scale turbulence. However,\nabsolute value measurement of turbulence amplitude has not been conducted owing\nto the nonlinearity of the detector. In this study, the absolute measurement\nmethod proposed in the previous study is applied to turbulence measurement\nresults from the large helical device. As a result, the localized turbulence\namplitude at $n_e=1.5\\times 10^{19}$m$^{-3}$ is approximately $3.5\\times\n10^{15}$m$^{-3}$, which is 0.02\\% of the electron density. In addition, the\nevaluated poloidal wavenumber spectrum is almost consistent, within a certain\nerror range, the spectrum being calculated using a nonlinear gyrokinetic\nsimulation. This study is the first to the best of our knowledge to\nquantitatively evaluate turbulence amplitudes measured by 2D-PCI and compare\nwith simulations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:24:45 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kinoshita","T.",""],["Tanaka","K.",""],["Sakai","H.",""],["Yanai","R.",""],["Nunami","M.",""],["Michael","C. A.",""]]}
{"id":"2308.15714","submitter":"Ishan Bansal","authors":"Ishan Bansal","title":"A constant factor approximation for the (p,3)-flexible graph\n  connectivity problem","comments":"First draft. Will improve readability and exposition","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this article we provide a constant factor approximation for the\n$(p,3)$-flexible graph connectivity problem, improving on the previous best\nknown $O(p)$-approximation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:31:33 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bansal","Ishan",""]]}
{"id":"2308.15715","submitter":"Kalyana Babu Nakshatrala","authors":"K. B. Nakshatrala","title":"Dynamic properties of double porosity/permeability model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math-ph math.AP math.MP physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding fluid movement in multi-pored materials is vital for energy\nsecurity and physiology. For instance, shale (a geological material) and bone\n(a biological material) exhibit multiple pore networks. Double\nporosity/permeability models provide a mechanics-based approach to describe\nhydrodynamics in aforesaid porous materials. However, current theoretical\nresults primarily address state-state response, and their counterparts in the\ntransient regime are still wanting. The primary aim of this paper is to fill\nthis knowledge gap. We present three principal properties -- with rigorous\nmathematical arguments -- that the solutions under the double\nporosity/permeability model satisfy in the transient regime: backward-in-time\nuniqueness, reciprocity, and a variational principle. We employ the ``energy\nmethod\" -- by exploiting the physical total kinetic energy of the flowing fluid\n-- to establish the first property and Cauchy-Riemann convolutions to prove the\nnext two. The results reported in this paper -- that qualitatively describe the\ndynamics of fluid flow in double-pored media -- have (a) theoretical\nsignificance, (b) practical applications, and (c) considerable pedagogical\nvalue. In particular, these results will benefit practitioners and\ncomputational scientists in checking the accuracy of numerical simulators. The\nbackward-in-time uniqueness lays a firm theoretical foundation for pursuing\ninverse problems in which one predicts the prescribed initial conditions based\non data available about the solution at a later instance.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:32:29 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Nakshatrala","K. B.",""]]}
{"id":"2308.15716","submitter":"Huan Huang Mr.","authors":"Huan Huang, Lipeng Dai, Hongliang Zhang, Zhongxing Tian, Yi Cai,\n  Chongfu Zhang, A. Lee Swindlehurst, and Zhu Han","title":"Anti-Jamming Precoding Against Disco Intelligent Reflecting Surfaces\n  Based Fully-Passive Jamming Attacks","comments":"This paper has been submitted for possible publication","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Emerging intelligent reflecting surfaces (IRSs) significantly improve system\nperformance, but also pose a huge risk for physical layer security. Existing\nworks have illustrated that a disco IRS (DIRS), i.e., an illegitimate IRS with\nrandom time-varying reflection properties (like a \"disco ball\"), can be\nemployed by an attacker to actively age the channels of legitimate users (LUs).\nSuch active channel aging (ACA) generated by the DIRS can be employed to jam\nmulti-user multiple-input single-output (MU-MISO) systems without relying on\neither jamming power or LU channel state information (CSI). To address the\nsignificant threats posed by DIRS-based fully-passive jammers (FPJs), an\nanti-jamming precoder is proposed that requires only the statistical\ncharacteristics of the DIRS-based ACA channels instead of their CSI. The\nstatistical characteristics of DIRS-jammed channels are first derived, and then\nthe anti-jamming precoder is derived based on the statistical characteristics.\nFurthermore, we prove that the anti-jamming precoder can achieve the maximum\nsignal-to-jamming-plus-noise ratio (SJNR). To acquire the ACA statistics\nwithout changing the system architecture or cooperating with the illegitimate\nDIRS, we design a data frame structure that the legitimate access point (AP)\ncan use to estimate the statistical characteristics. During the designed data\nframe, the LUs only need to feed back their received power to the legitimate AP\nwhen they detect jamming attacks. Numerical results are also presented to\nevaluate the effectiveness of the proposed anti-jamming precoder against the\nDIRS-based FPJs and the feasibility of the designed data frame used by the\nlegitimate AP to estimate the statistical characteristics.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:37:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Huang","Huan",""],["Dai","Lipeng",""],["Zhang","Hongliang",""],["Tian","Zhongxing",""],["Cai","Yi",""],["Zhang","Chongfu",""],["Swindlehurst","A. Lee",""],["Han","Zhu",""]]}
{"id":"2308.15717","submitter":"Zelong Lu","authors":"Zelong Lu (1), Jianxue Wang (1), Mohammad Shahidehpour (2), Linquan\n  Bai (3), Zuyi Li (2), Lei Yan (2), Xianlong Chen (1) ((1) Xian Jiaotong\n  University, School of Electrical Engineering, (2) Illinois Institute of\n  Technology, ECE Department, (3) UNC, ECE)","title":"Risk-aware Flexible Resource Utilization in an Unbalanced Three-Phase\n  Distribution Network using SDP-based Distributionally Robust Optimal Power\n  Flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.OC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The variability caused by the proliferation of distributed energy resources\n(DERs) and the significant growth in unbalanced three-phase loads pose\nunprecedented challenges to distribution network operations. This paper focuses\non how a distribution system operator (DSO), taking over the distribution grid\nand market operations, would develop a risk-aware flexibility market to\nmitigate uncertainties in an unbalanced three-phase power distribution network.\nFirst, a distributionally robust chance constraint (DRCC) method is devised to\nsolve the unbalanced three-phase optimal power flow using a semidefinite\nprogramming (SDP) model. The DSO can apply the proposed solution to jointly\nclear energy and flexibility markets. Then, the DRCC model accuracy is improved\nby an information-sharing mechanism characterized by spatially-correlated\nuncertainties in the distribution grid. Further, a novel system-wide response\nfunction is derived to make the DRCC model tractable. Using the duality theory,\nthe paper further investigates the physical composition of the DSO's cleared\nflexibility prices to guide the unbalanced distribution network operation.\nFinally, the effectiveness of the risk-aware flexibility market is verified in\na modified three-phase IEEE 34-node system. Results demonstrate that the\nflexibility market can quantify the impact of spatially correlated\nuncertainties and facilitate the utilization of flexible resources to mitigate\nuncertainties across the network.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:41:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lu","Zelong",""],["Wang","Jianxue",""],["Shahidehpour","Mohammad",""],["Bai","Linquan",""],["Li","Zuyi",""],["Yan","Lei",""],["Chen","Xianlong",""]]}
{"id":"2308.15718","submitter":"Masayuki Hojo","authors":"Masayuki Hojo and KoichiroTanaka","title":"Single-pass generation of widely-tunable frequency-domain entangled\n  photon pairs","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate a technique that generates frequency-entangled photon pairs\nwith high polarization definition by using a single-period nonlinear crystal\nand single pass configuration. The technique is based on the simultaneous\noccurrence of two spontaneous parametric down-conversion processes satisfying\nindependent type-II collinear pseudo-phase matching conditions in periodically\npoled stoichiometric lithium tantalate. The generated photon pairs exhibit\nnon-degenerate Hong-Ou-Mandel interference, indicating the presence of quantum\nentanglement in the frequency domain. This method provides a light source\ncapable of wide-range quantum sensing and quantum imaging or high-dimensional\nquantum processing.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:43:33 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hojo","Masayuki",""],["KoichiroTanaka","",""]]}
{"id":"2308.15719","submitter":"Robert M. Ziff","authors":"Zhipeng Xun, Dapeng Hao, and Robert M. Ziff","title":"Extended-range percolation in five dimensions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Percolation on a five-dimensional simple hypercubic (sc(5)) lattice with\nextended neighborhoods is investigated by means of extensive Monte Carlo\nsimulations, using an effective single-cluster growth algorithm. The critical\nexponents, including $\\tau$ and $\\Omega$, the asymptotic behavior of the\nthreshold $p_c$ and its dependence on coordination number $z$ are investigated.\nUsing the bond and site percolation thresholds $p_c = 0.11817145(3)$ and\n$0.14079633(4)$ respectively given by Mertens and Moore [Phys. Rev. E 98,\n022120 (2018)], we find critical exponents of $\\tau = 2.4177(3)$, $\\Omega =\n0.27(2)$ through a self-consistent process. The value of $\\tau$ compares\nfavorably with a recent five-loop renormalization predictions $2.4175(2)$ by\nBorinsky et al. [Phys. Rev. D 103, 116024 (2021)], the value 2.4180(6) that\nfollows from the work of Zhang et al. [Physica A 580, 126124 (2021)], and the\nmeasurement of $2.419(1)$ by Mertens and Moore. We also confirmed the bond\nthreshold, finding $p_c = 0.11817150(5)$. sc(5) lattices with extended\nneighborhoods up to 7th nearest neighbors are studied for both bond and site\npercolation. Employing the values of $\\tau$ and $\\Omega$ mentioned above,\nthresholds are found to high precision. For bond percolation, the asymptotic\nvalue of $zp_c$ tends to Bethe-lattice behavior ($z p_c \\sim 1$), and the\nfinite-$z$ correction is found to be consistent with both and $zp_{c} - 1 \\sim\na_1 z^{-0.88}$ and $zp_{c} - 1 \\sim a_0(3 + \\ln z)/z$. For site percolation,\nthe asymptotic analysis is close to the predicted behavior $zp_c \\sim 32\\eta_c\n= 1.742(2)$ for large $z$, where $\\eta_c = 0.05443(7)$ is the continuum\npercolation threshold of five-dimensional hyperspheres given by Torquato and\nJiao [J. Chem. Phys 137, 074106 (2015)]; finite-$z$ corrections are accounted\nfor by taking $p_c \\approx c/(z + b)$ with $c=1.722(7)$ and $b=1$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:48:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xun","Zhipeng",""],["Hao","Dapeng",""],["Ziff","Robert M.",""]]}
{"id":"2308.15720","submitter":"Younghyun Cho","authors":"Younghyun Cho, James W. Demmel, Micha{\\l} Derezi\\'nski, Haoyun Li,\n  Hengrui Luo, Michael W. Mahoney, Riley J. Murray","title":"Surrogate-based Autotuning for Randomized Sketching Algorithms in\n  Regression Problems","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":"  Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be\neffective in handling high-dimensional computational problems, providing\nhigh-quality empirical performance as well as strong probabilistic guarantees.\nHowever, their practical application is complicated by the fact that the user\nneeds to set various algorithm-specific tuning parameters which are different\nthan those used in traditional NLA. This paper demonstrates how a\nsurrogate-based autotuning approach can be used to address fundamental problems\nof parameter selection in RandNLA algorithms. In particular, we provide a\ndetailed investigation of surrogate-based autotuning for\nsketch-and-precondition (SAP) based randomized least squares methods, which\nhave been one of the great success stories in modern RandNLA. Empirical results\nshow that our surrogate-based autotuning approach can achieve near-optimal\nperformance with much less tuning cost than a random search (up to about 4x\nfewer trials of different parameter configurations). Moreover, while our\nexperiments focus on least squares, our results demonstrate a general-purpose\nautotuning pipeline applicable to any kind of RandNLA algorithm.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:50:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cho","Younghyun",""],["Demmel","James W.",""],["Derezi\u0144ski","Micha\u0142",""],["Li","Haoyun",""],["Luo","Hengrui",""],["Mahoney","Michael W.",""],["Murray","Riley J.",""]]}
{"id":"2308.15721","submitter":"Robert Hickingbotham","authors":"Robert Hickingbotham, Raphael Steiner, David R. Wood","title":"Clustered Colouring of Odd-$H$-Minor-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":"  The clustered chromatic number of a graph class $\\mathcal{G}$ is the minimum\ninteger $c$ such that every graph $G\\in\\mathcal{G}$ has a $c$-colouring where\neach monochromatic component in $G$ has bounded size. We study the clustered\nchromatic number of graph classes $\\mathcal{G}_H^{\\text{odd}}$ defined by\nexcluding a graph $H$ as an odd-minor. How does the structure of $H$ relate to\nthe clustered chromatic number of $\\mathcal{G}_H^{\\text{odd}}$? Using a proof\nmethod by Norin, Scott, Seymour and Wood (2019), we show that the clustered\nchromatic number of $\\mathcal{G}_H^{\\text{odd}}$ is tied to the tree-depth of\n$H$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:53:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hickingbotham","Robert",""],["Steiner","Raphael",""],["Wood","David R.",""]]}
{"id":"2308.15722","submitter":"Shao-Chun Li","authors":"Cheng-Long Xue, Qian-Qian Yuan, Yong-Jie Xu, Qi-Yuan Li, Li-Guo Dou,\n  Zhen-Yu Jia and Shao-Chun Li","title":"Checkerboard order state in superconducting FeSe/SrTiO3(001) monolayer","comments":"22 pages, 4 figures","journal-ref":"Phys. Rev. B 107, 134516 (2023)","doi":"10.1103/PhysRevB.107.134516","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":"  Ordered electronic states have been extensively explored in cuprates and\niron-based unconventional superconductors, but seldom observed in the epitaxial\nFeSe/SrTiO3(001) monolayer (FeSe/STO) with an enhanced superconducting\ntransition temperature (Tc). Here, by using scanning tunneling microscopy/\nspectroscopy (STM/STS), we reveal a checkerboard charge order in the epitaxial\nFeSe/STO monolayer, with a period of four times the inter-Fe-atom distance\nalong two perpendicular directions of the Fe lattice. This ordered state is\nuniquely present in the superconducting FeSe/STO monolayer, even at liquid\nnitrogen temperature, but absent in the non-superconducting FeSe monolayer or\nbilayer. Quasiparticle interference (QPI) measurements further confirm it as a\nstatic order without an energy-dependent dispersion and gapped out within the\nsuperconductivity gap. The intensity of the charge order shows an enhancement\nnear the superconducting transition temperature, thus implying a correlation\nwith the high-Tc superconductivity in the FeSe/STO monolayer. This study\nprovides a new basis for exploring the ordered electronic states and their\ninterplay with high-Tc superconductivity in the FeSe monolayer.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:53:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xue","Cheng-Long",""],["Yuan","Qian-Qian",""],["Xu","Yong-Jie",""],["Li","Qi-Yuan",""],["Dou","Li-Guo",""],["Jia","Zhen-Yu",""],["Li","Shao-Chun",""]]}
{"id":"2308.15723","submitter":"Maoliang Wei","authors":"Maoliang Wei, Kai Xu, Bo Tang, Junying Li, Yiting Yun, Peng Zhang,\n  Yingchun Wu, Kangjian Bao, Kunhao Lei, Zequn Chen, Hui Ma, Chunlei Sun,\n  Ruonan Liu, Ming Li, Lan Li, Hongtao Lin","title":"\"Zero change\" platform for monolithic back-end-of-line integration of\n  phase change materials in silicon photonics","comments":"20 pages, 4 figures, submitted to Nature Photonics","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Monolithic integration of novel materials for unprecedented device functions\nwithout modifying the existing photonic component library is the key to\nadvancing heterogeneous silicon photonic integrated circuits. To achieve this,\nthe introduction of a silicon nitride etching stop layer at selective area,\ncoupled with low-loss oxide trench to waveguide surface, enables the\nincorporation of various functional materials without disrupting the\nreliability of foundry-verified devices. As an illustration, two distinct\nchalcogenide phase change materials (PCM) with remarkable nonvolatile\nmodulation capabilities, namely Sb2Se3 and Ge2Sb2Se4Te1, were monolithic\nback-end-of-line integrated into silicon photonics. The PCM enables compact\nphase and intensity tuning units with zero-static power consumption. Taking\nadvantage of these building blocks, the phase error of a push-pull Mach-Zehnder\ninterferometer optical switch could be trimmed by a nonvolatile phase shifter\nwith a 48% peak power consumption reduction. Mirco-ring filters with a\nrejection ratio >25dB could be applied for >5-bit wavelength selective\nintensity modulation, and waveguide-based >7-bit intensity-modulation photonic\nattenuators could achieve >39dB broadband attenuation. The advanced \"Zero\nchange\" back-end-of-line integration platform could not only facilitate the\nintegration of PCMs for integrated reconfigurable photonics but also open up\nthe possibilities for integrating other excellent optoelectronic materials in\nthe future silicon photonic process design kits.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:56:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wei","Maoliang",""],["Xu","Kai",""],["Tang","Bo",""],["Li","Junying",""],["Yun","Yiting",""],["Zhang","Peng",""],["Wu","Yingchun",""],["Bao","Kangjian",""],["Lei","Kunhao",""],["Chen","Zequn",""],["Ma","Hui",""],["Sun","Chunlei",""],["Liu","Ruonan",""],["Li","Ming",""],["Li","Lan",""],["Lin","Hongtao",""]]}
{"id":"2308.15724","submitter":"Hongwei Dong","authors":"Hongwei Dong and Fangzhou Han and Lingyu Si and Wenwen Qiang and Lamei\n  Zhang","title":"Background Debiased SAR Target Recognition via Causal Interventional\n  Regularizer","comments":"38 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent studies have utilized deep learning (DL) techniques to automatically\nextract features from synthetic aperture radar (SAR) images, which shows great\npromise for enhancing the performance of SAR automatic target recognition\n(ATR). However, our research reveals a previously overlooked issue: SAR images\nto be recognized include not only the foreground (i.e., the target), but also a\ncertain size of the background area. When a DL-model is trained exclusively on\nforeground data, its recognition performance is significantly superior to a\nmodel trained on original data that includes both foreground and background.\nThis suggests that the presence of background impedes the ability of the\nDL-model to learn additional semantic information about the target. To address\nthis issue, we construct a structural causal model (SCM) that incorporates the\nbackground as a confounder. Based on the constructed SCM, we propose a causal\nintervention based regularization method to eliminate the negative impact of\nbackground on feature semantic learning and achieve background debiased\nSAR-ATR. The proposed causal interventional regularizer can be integrated into\nany existing DL-based SAR-ATR models to mitigate the impact of background\ninterference on the feature extraction and recognition accuracy. Experimental\nresults on the Moving and Stationary Target Acquisition and Recognition (MSTAR)\ndataset indicate that the proposed method can enhance the efficiency of\nexisting DL-based methods in a plug-and-play manner.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:56:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dong","Hongwei",""],["Han","Fangzhou",""],["Si","Lingyu",""],["Qiang","Wenwen",""],["Zhang","Lamei",""]]}
{"id":"2308.15725","submitter":"Zhiqiang Tan","authors":"Zhiqiang Tan","title":"Sensitivity models and bounds under sequential unmeasured confounding in\n  longitudinal studies","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":"  Consider sensitivity analysis to assess the worst-case possible values of\ncounterfactual outcome means and average treatment effects under sequential\nunmeasured confounding in a longitudinal study with time-varying treatments and\ncovariates. We formulate several multi-period sensitivity models to relax the\ncorresponding versions of the assumption of sequential unconfounding. The\nprimary sensitivity model involves only counterfactual outcomes, whereas the\njoint and product sensitivity models involve both counterfactual covariates and\noutcomes. We establish and compare explicit representations for the sharp and\nconservative bounds at the population level through convex optimization,\ndepending only on the observed data. These results provide for the first time a\nsatisfactory generalization from the marginal sensitivity model in the\ncross-sectional setting.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:57:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Tan","Zhiqiang",""]]}
{"id":"2308.15726","submitter":"Fei Yu","authors":"Nan Che and Chenrui Liu and Fei Yu","title":"AGS: An Dataset and Taxonomy for Domestic Scene Sound Event Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Environmental sound scene and sound event recognition is important for the\nrecognition of suspicious events in indoor and outdoor environments (such as\nnurseries, smart homes, nursing homes, etc.) and is a fundamental task involved\nin many audio surveillance applications. In particular, there is no public\ncommon data set for the research field of sound event recognition for the data\nset of the indoor environmental sound scene. Therefore, this paper proposes a\ndata set (called as AGS) for the home environment sound. This data set\nconsiders various types of overlapping audio in the scene, background noise.\nMoreover, based on the proposed data set, this paper compares and analyzes the\nadvanced methods for sound event recognition, and then illustrates the\nreliability of the data set proposed in this paper, and studies the challenges\nraised by the new data set. Our proposed AGS and the source code of the\ncorresponding baselines at https://github.com/taolunzu11/AGS .\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:03:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Che","Nan",""],["Liu","Chenrui",""],["Yu","Fei",""]]}
{"id":"2308.15727","submitter":"Jiuyang Xiang","authors":"Zhenhong Zhou, Jiuyang Xiang, Chaomeng Chen, Sen Su","title":"Quantifying and Analyzing Entity-level Memorization in Large Language\n  Models","comments":"9 pages, 7 figures","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 been proven capable of memorizing their\ntraining data, which can be extracted through specifically designed prompts. As\nthe scale of datasets continues to grow, privacy risks arising from\nmemorization have attracted increasing attention. Quantifying language model\nmemorization helps evaluate potential privacy risks. However, prior works on\nquantifying memorization require access to the precise original data or incur\nsubstantial computational overhead, making it difficult for applications in\nreal-world language models. To this end, we propose a fine-grained,\nentity-level definition to quantify memorization with conditions and metrics\ncloser to real-world scenarios. In addition, we also present an approach for\nefficiently extracting sensitive entities from autoregressive language models.\nWe conduct extensive experiments based on the proposed, probing language\nmodels' ability to reconstruct sensitive entities under different settings. We\nfind that language models have strong memorization at the entity level and are\nable to reproduce the training data even with partial leakages. The results\ndemonstrate that LLMs not only memorize their training data but also understand\nassociations between entities. These findings necessitate that trainers of LLMs\nexercise greater prudence regarding model memorization, adopting memorization\nmitigation techniques to preclude privacy violations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:06:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhou","Zhenhong",""],["Xiang","Jiuyang",""],["Chen","Chaomeng",""],["Su","Sen",""]]}
{"id":"2308.15728","submitter":"Chao Gao","authors":"Yuetian Luo and Chao Gao","title":"Computational Lower Bounds for Graphon Estimation via Low-degree\n  Polynomials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST cs.CC cs.DS stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graphon estimation has been one of the most fundamental problems in network\nanalysis and has received considerable attention in the past decade. From the\nstatistical perspective, the minimax error rate of graphon estimation has been\nestablished by Gao et al (2015) for both stochastic block model (SBM) and\nnonparametric graphon estimation. The statistical optimal estimators are based\non constrained least squares and have computational complexity exponential in\nthe dimension. From the computational perspective, the best-known\npolynomial-time estimator is based on universal singular value thresholding\n(USVT), but it can only achieve a much slower estimation error rate than the\nminimax one. It is natural to wonder if such a gap is essential. The\ncomputational optimality of the USVT or the existence of a computational\nbarrier in graphon estimation has been a long-standing open problem. In this\nwork, we take the first step towards it and provide rigorous evidence for the\ncomputational barrier in graphon estimation via low-degree polynomials.\nSpecifically, in both SBM and nonparametric graphon estimation, we show that\nfor low-degree polynomial estimators, their estimation error rates cannot be\nsignificantly better than that of the USVT under a wide range of parameter\nregimes. Our results are proved based on the recent development of low-degree\npolynomials by Schramm and Wein (2022), while we overcome a few key challenges\nin applying it to the general graphon estimation problem. By leveraging our\nmain results, we also provide a computational lower bound on the clustering\nerror for community detection in SBM with a growing number of communities and\nthis yields a new piece of evidence for the conjectured Kesten-Stigum threshold\nfor efficient community recovery.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:11:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Luo","Yuetian",""],["Gao","Chao",""]]}
{"id":"2308.15729","submitter":"Da Chen","authors":"Da Chen and Jean-Marie Mirebeau and Minglei Shu and Laurent D. Cohen","title":"Computing Geodesic Paths Encoding a Curvature Prior","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we introduce an efficient method for computing curves\nminimizing a variant of the Euler-Mumford elastica energy, with fixed endpoints\nand tangents at these endpoints, where the bending energy is enhanced with a\nuser defined and data-driven scalar-valued term referred to as the curvature\nprior. In order to guarantee that the globally optimal curve is extracted, the\nproposed method involves the numerical computation of the viscosity solution to\na specific static Hamilton-Jacobi-Bellman (HJB) partial differential equation\n(PDE). For that purpose, we derive the explicit Hamiltonian associated to this\nvariant model equipped with a curvature prior, discretize the resulting HJB PDE\nusing an adaptive finite difference scheme, and solve it in a single pass using\na generalized Fast-Marching method. In addition, we also present a practical\nmethod for estimating the curvature prior values from image data, designed for\nthe task of accurately tracking curvilinear structure centerlines. Numerical\nexperiments on synthetic and real image data illustrate the advantages of the\nconsidered variant of the elastica model with a prior curvature enhancement in\ncomplex scenarios where challenging geometric structures appear.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:11:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Da",""],["Mirebeau","Jean-Marie",""],["Shu","Minglei",""],["Cohen","Laurent D.",""]]}
{"id":"2308.15730","submitter":"Joe Beck","authors":"Joe Beck, Subhadeep Chakraborty","title":"Fully Embedded Time-Series Generative Adversarial Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative Adversarial Networks (GANs) should produce synthetic data that\nfits the underlying distribution of the data being modeled. For real valued\ntime-series data, this implies the need to simultaneously capture the static\ndistribution of the data, but also the full temporal distribution of the data\nfor any potential time horizon. This temporal element produces a more complex\nproblem that can potentially leave current solutions under-constrained,\nunstable during training, or prone to varying degrees of mode collapse. In\nFETSGAN, entire sequences are translated directly to the generator's sampling\nspace using a seq2seq style adversarial auto encoder (AAE), where adversarial\ntraining is used to match the training distribution in both the feature space\nand the lower dimensional sampling space. This additional constraint provides a\nloose assurance that the temporal distribution of the synthetic samples will\nnot collapse. In addition, the First Above Threshold (FAT) operator is\nintroduced to supplement the reconstruction of encoded sequences, which\nimproves training stability and the overall quality of the synthetic data being\ngenerated. These novel contributions demonstrate a significant improvement to\nthe current state of the art for adversarial learners in qualitative measures\nof temporal similarity and quantitative predictive ability of data generated\nthrough FETSGAN.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:14:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Beck","Joe",""],["Chakraborty","Subhadeep",""]]}
{"id":"2308.15731","submitter":"Liu Tonghua","authors":"Tonghua Liu, Xiyan Yang, Zisheng Zhang, Jieci Wang, Marek Biesiada","title":"Measurements of the Hubble constant from combinations of supernovae and\n  radio quasars","comments":"20 pages, 5 figures, accepted for publication in Physics Letters B","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this letter, we propose an improved cosmological model independent method\nof determining the value of the Hubble constant $H_0$. The method uses\nunanchored luminosity distances $H_0d_L(z)$ from SN Ia Pantheon data combined\nwith angular diameter distances $d_A(z)$ from a sample of intermediate\nluminosity radio quasars calibrated as standard rulers. The distance duality\nrelation between $d_L(z)$ and $d_A(z)$, which is robust and independent of any\ncosmological model, allows to disentangle $H_0$ from such combination. However,\nthe number of redshift matched quasars and SN Ia pairs is small (37\ndata-points). Hence, we take an advantage from the Artificial Neural Network\n(ANN) method to recover the $d_A(z)$ relation from a network trained on full\n120 radio quasar sample. In this case, the result is unambiguously consistent\nwith values of $H_0$ obtained from local probes by SH0ES and H0LiCOW\ncollaborations. Three statistical summary measures: weighted mean\n$\\widetilde{H}_0=73.51(\\pm0.67) {~km~s^{-1}~Mpc^{-1}}$, median\n$Med(H_0)=74.71(\\pm4.08) {~km~s^{-1}~Mpc^{-1}}$ and MCMC simulated posterior\ndistribution $H_0=73.52^{+0.66}_{-0.68} {~km~s^{-1}~Mpc^{-1}}$ are fully\nconsistent with each other and the precision reached $1\\%$ level. This is\nencouraging for the future applications of our method. Because individual\nmeasurements of $H_0$ are related to different redshifts spanning the range\n$z=0.5 - 2.0$, we take advantage of this fact to check if there is any\nnoticeable trend in $H_0$ measurements with redshift of objects used for this\npurpose. However, our result is that the data we used strongly support the lack\nof such systematic effects.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:15:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Tonghua",""],["Yang","Xiyan",""],["Zhang","Zisheng",""],["Wang","Jieci",""],["Biesiada","Marek",""]]}
{"id":"2308.15732","submitter":"Mahmoud Abdelgalil","authors":"Mahmoud Abdelgalil and Jorge I. Poveda","title":"On Lie-Bracket Averaging for a Class of Hybrid Dynamical Systems with\n  Applications to Model-Free Control and Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dynamical systems characterized by oscillatory behaviors and well-defined\naverage vector fields have traditionally been subjects of stability analysis\nthrough methodologies rooted in averaging theory. Such tools have also found\napplication in the stability analysis of systems that combine continuous-time\ndynamics and discrete-time dynamics, referred to as hybrid dynamical systems.\nHowever, in contrast to the existing results available in the literature for\ncontinuous-time systems, averaging results for hybrid systems have mostly been\nlimited to first-order averaging methods. This limitation prevents their direct\napplication for the analysis and design of systems and algorithms requiring\nhigh-order averaging techniques. Among other applications, such techniques are\nnecessary to analyze hybrid Lie-bracket-based extremum seeking algorithms and\nhybrid vibrational controllers. To address this gap, this paper introduces a\nnovel high-order averaging theorem for the stability analysis of hybrid\ndynamical systems with high-frequency periodic flow maps. The considered\nsystems allow for the incorporation of set-valued flow maps and jump maps,\neffectively modeling well-posed differential and difference inclusions. By\nimposing appropriate regularity conditions on the hybrid system's data, results\non $(T,\\varepsilon)$-closeness of solutions and semi-global practical\nasymptotic stability for sets are established. In this way, our findings yield\nhybrid Lie-bracket averaging tools that extend those found in the literature on\nordinary differential equations. These theoretical results are then applied to\nthe study of three distinct applications in the context of model-free control\nand optimization.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:16:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Abdelgalil","Mahmoud",""],["Poveda","Jorge I.",""]]}
{"id":"2308.15733","submitter":"Changhao Chen","authors":"Zhihao Jia, Bing Wang, Changhao Chen","title":"Drone-NeRF: Efficient NeRF Based 3D Scene Reconstruction for Large-Scale\n  Drone Survey","comments":"15 pages, 7 figures, in submission","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural rendering has garnered substantial attention owing to its capacity for\ncreating realistic 3D scenes. However, its applicability to extensive scenes\nremains challenging, with limitations in effectiveness. In this work, we\npropose the Drone-NeRF framework to enhance the efficient reconstruction of\nunbounded large-scale scenes suited for drone oblique photography using Neural\nRadiance Fields (NeRF). Our approach involves dividing the scene into uniform\nsub-blocks based on camera position and depth visibility. Sub-scenes are\ntrained in parallel using NeRF, then merged for a complete scene. We refine the\nmodel by optimizing camera poses and guiding NeRF with a uniform sampler.\nIntegrating chosen samples enhances accuracy. A hash-coded fusion MLP\naccelerates density representation, yielding RGB and Depth outputs. Our\nframework accounts for sub-scene constraints, reduces parallel-training noise,\nhandles shadow occlusion, and merges sub-regions for a polished rendering\nresult. This Drone-NeRF framework demonstrates promising capabilities in\naddressing challenges related to scene complexity, rendering efficiency, and\naccuracy in drone-obtained imagery.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:17:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Jia","Zhihao",""],["Wang","Bing",""],["Chen","Changhao",""]]}
{"id":"2308.15734","submitter":"Yuya Sasaki","authors":"Yuya Sasaki","title":"Efficient and Explainable Graph Neural Architecture Search via\n  Monte-Carlo Tree Search","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph neural networks (GNNs) are powerful tools for performing data science\ntasks in various domains. Although we use GNNs in wide application scenarios,\nit is a laborious task for researchers and practitioners to design/select\noptimal GNN rchitectures in diverse graphs. To save human efforts and\ncomputational costs, graph neural architecture search (Graph NAS) has been used\nto search for a sub-optimal GNN architecture that combines existing components.\nHowever, there are no existing Graph NAS methods that satisfy explainability,\nefficiency, and adaptability to various graphs. Therefore, we propose an\nefficient and explainable Graph NAS method, called ExGNAS, which consists of\n(i) a simple search space that can adapt to various graphs and (ii) a search\nalgorithm that makes the decision process explainable. The search space\nincludes only fundamental functions that can handle homophilic and heterophilic\ngraphs. The search algorithm efficiently searches for the best GNN architecture\nvia Monte-Carlo tree search without neural models. The combination of our\nsearch space and algorithm achieves finding accurate GNN models and the\nimportant functions within the search space. We comprehensively evaluate our\nmethod compared with twelve hand-crafted GNN architectures and three Graph NAS\nmethods in four graphs. Our experimental results show that ExGNAS increases AUC\nup to 3.6 and reduces run time up to 78\\% compared with the state-of-the-art\nGraph NAS methods. Furthermore, we show ExGNAS is effective in analyzing the\ndifference between GNN architectures in homophilic and heterophilic graphs.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:21:45 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sasaki","Yuya",""]]}
{"id":"2308.15735","submitter":"Chris Blake","authors":"Chris Blake, Ryan J. Turner","title":"On the correlations of galaxy peculiar velocities and their covariance","comments":"20 pages, 9 figures, submitted to MNRAS, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Measurements of the peculiar velocities of large samples of galaxies enable\nnew tests of the standard cosmological model, including determination of the\ngrowth rate of cosmic structure that encodes gravitational physics. With the\nsize of such samples now approaching hundreds of thousands of galaxies, complex\nstatistical analysis techniques and models are required to extract cosmological\ninformation. In this paper we summarise how correlation functions between\ngalaxy velocities, and with the surrounding large-scale structure, may be\nutilised to test cosmological models. We present new determinations of the\nanalytical covariance between such correlation functions, which may be useful\nfor cosmological likelihood analyses. The statistical model we use to determine\nthese covariances includes the sample selection functions, observational noise,\ncurved-sky effects and redshift-space distortions. By comparing these\ncovariance determinations with corresponding estimates from large suites of\ncosmological simulations, we demonstrate that these analytical models recover\nthe key features of the covariance between different statistics and\nseparations, and produce similar measurements of the growth rate of structure.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:25:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Blake","Chris",""],["Turner","Ryan J.",""]]}
{"id":"2308.15736","submitter":"Zhenyong Zhang","authors":"Zhenyong Zhang and Mengxiang Liu and Mingyang Sun and Ruilong Deng and\n  Peng Cheng and Dusit Niyato and Mo-Yuen Chow and Jiming Chen","title":"Vulnerability of Machine Learning Approaches Applied in IoT-based Smart\n  Grid: A Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The machine learning (ML) sees an increasing prevalence of being used in the\ninternet-of-things enabled smart grid. However, the trustworthiness of ML is a\nsevere issue that must be addressed to accommodate the trend of ML-based smart\ngrid applications (MLsgAPPs). The adversarial distortion injected into the\npower signal will greatly affect the system's normal control and operation.\nTherefore, it is imperative to conduct vulnerability assessment for MLsgAPPs\napplied in the context of safety-critical power systems. In this paper, we\nprovide a comprehensive review of the recent progress in designing attack and\ndefense methods for MLsgAPPs. Unlike the traditional survey about ML security,\nthis is the first review work about the security of MLsgAPPs that focuses on\nthe characteristics of power systems. The survey is organized from the aspects\nof adversarial assumptions, targeted applications, evaluation metrics,\ndefending approaches, physics-related constraints, and applied datasets. We\nalso highlight future directions on this topic to encourage more researchers to\nconduct further research on adversarial attacks and defending approaches for\nMLsgAPPs.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:29:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Zhenyong",""],["Liu","Mengxiang",""],["Sun","Mingyang",""],["Deng","Ruilong",""],["Cheng","Peng",""],["Niyato","Dusit",""],["Chow","Mo-Yuen",""],["Chen","Jiming",""]]}
{"id":"2308.15737","submitter":"Seonmi Choi","authors":"Seonmi Choi, Jieon Kim","title":"Mosaics for immersed surface-links","comments":"13 pages, 25 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The concept of a knot mosaic was introduced by Lomonaco and Kauffman as a\nmeans to construct a quantum knot system. The mosaic number of a given knot $K$\nis defined as the minimum integer $n$ that allows the representation of $K$ on\nan $n \\times n$ mosaic board. Building upon this, the first author and Nelson\nextended the knot mosaic system to encompass surface-links through the\nutilization of marked graph diagrams and established both lower and upper\nbounds for the mosaic number of the surface-links presented in Yoshikawa's\ntable. In this paper, we establish a mosaic system for immersed surface-links\nby using singular marked graph diagrams. We also provide the definition and\ndiscussion on the mosaic number for immersed surface-links.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:30:59 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Choi","Seonmi",""],["Kim","Jieon",""]]}
{"id":"2308.15738","submitter":"Yasuhiro Tokura Prof.","authors":"Daigo Yoshino and Yasuhiro Tokura","title":"Thermodynamics of Computation for CMOS NAND Gate","comments":"10 pages6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding how much energy is needed and dissipated as heat for a given\ncomputational system and for a given program is a physically interesting and\npractically important problem. However, the thermodynamic costs of\ncomputational systems are only partially understood. In this paper, we focus on\na specific logic gate, the CMOS NAND gate, operating in the sub-threshold\nregion and analyze the dissipated heat from two aspects. One is the general\nLandauer bound, which is the change in entropy of the computational system, and\nthe other is a cost that depends on the difference between the initial and\nsteady-state distributions of the system. We find that the general Landauer\nbound is the same order for different inputs to the gate, but that the another\ncost has partially different order due to the difference between the initial\nand steady-state distributions over output logical states. We also investigate\nthe interplay between the costs, time scale, and reliability of the process and\nfind that for different inputs, there is not always a trade-off between\nreliability and dissipation of computations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:33:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yoshino","Daigo",""],["Tokura","Yasuhiro",""]]}
{"id":"2308.15739","submitter":"Michel Alexis","authors":"Michel Alexis, Jos\\'e Luis Luna-Garcia, Eric Sawyer, Ignacio\n  Uriarte-Tuero","title":"The scalar $T1$ theorem for pairs of doubling measures fails for Riesz\n  transforms when $p>2$ is an even integer","comments":"43 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For $p \\in \\{ 2m ~:~ m \\geq 2 \\} \\cup \\{\\frac{2m}{2m-1} ~:~ m \\geq 2 \\}$, we\nshow that on $L^p$, the scalar $T1$ theorem for doubling measures fails for a\nRiesz transform in $\\mathbb{R}^2$, despite holding for $p=2$, as shown by\nAlexis-Sawyer-Uriarte-Tuero. More precisely, we construct a pair of doubling\nmeasures $(\\sigma, \\omega)$ that satisfy the scalar $A_p$ condition and the\nscalar $L^p$-testing conditions for an individual Riesz transform $R_j$, and\nyet $\\left ( R_j \\right )_{\\sigma} : L^p (\\sigma) \\not \\to L^p (\\omega)$. On\nthe other hand, we provide an improvement of the positive result of Sawyer-Wick\nfor all $p \\neq 2$ by removing the vector-valued, or quadratic,\nweak-boundedness property, showing that if a pair of doubling measures\nsatisfies scalar testing and a vector-valued, or quadratic, Muckenhoupt\ncondition $A_{p} ^{\\ell^2, \\operatorname{local}}$, then the norm inequality\nholds.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:33:33 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Alexis","Michel",""],["Luna-Garcia","Jos\u00e9 Luis",""],["Sawyer","Eric",""],["Uriarte-Tuero","Ignacio",""]]}
{"id":"2308.15740","submitter":"Kagan Ozturk","authors":"Kagan Ozturk, Grace Bezold, Aman Bhatta, Haiyu Wu, Kevin Bowyer","title":"Beard Segmentation and Recognition Bias","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A person's facial hairstyle, such as presence and size of beard, can\nsignificantly impact face recognition accuracy. There are publicly-available\ndeep networks that achieve reasonable accuracy at binary attribute\nclassification, such as beard / no beard, but few if any that segment the\nfacial hair region. To investigate the effect of facial hair in a rigorous\nmanner, we first created a set of fine-grained facial hair annotations to train\na segmentation model and evaluate its accuracy across African-American and\nCaucasian face images. We then use our facial hair segmentations to categorize\nimage pairs according to the degree of difference or similarity in the facial\nhairstyle. We find that the False Match Rate (FMR) for image pairs with\ndifferent categories of facial hairstyle varies by a factor of over 10 for\nAfrican-American males and over 25 for Caucasian males. To reduce the bias\nacross image pairs with different facial hairstyles, we propose a scheme for\nadaptive thresholding based on facial hairstyle similarity. Evaluation on a\nsubject-disjoint set of images shows that adaptive similarity thresholding\nbased on facial hairstyles of the image pair reduces the ratio between the\nhighest and lowest FMR across facial hairstyle categories for African-American\nfrom 10.7 to 1.8 and for Caucasians from 25.9 to 1.3. Facial hair annotations\nand facial hair segmentation model will be publicly available.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:35:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ozturk","Kagan",""],["Bezold","Grace",""],["Bhatta","Aman",""],["Wu","Haiyu",""],["Bowyer","Kevin",""]]}
{"id":"2308.15741","submitter":"Fangfang Dou","authors":"Fangfang Dou and Peimin L\\\"u","title":"Stability and regularization for ill-posed Cauchy problem of a\n  stochastic parabolic differential equation","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 investigate an ill-posed Cauchy problem involving a\nstochastic parabolic equation. We first establish a Carleman estimate for this\nequation. Leveraging this estimate, we are able to derive the conditional\nstability and convergence rate of the Tikhonov regularization method for the\naforementioned ill-posed Cauchy problem. To complement our theoretical\nanalysis, we employ kernel-based learning theory to implement the completed\nTikhonov regularization method for several numerical examples.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:39:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dou","Fangfang",""],["L\u00fc","Peimin",""]]}
{"id":"2308.15742","submitter":"Yi Liu","authors":"Yi Liu, Yuekang Li, Gelei Deng, Felix Juefei-Xu, Yao Du, Cen Zhang,\n  Chengwei Liu, Yeting Li, Lei Ma and Yang Liu","title":"ASTER: Automatic Speech Recognition System Accessibility Testing for\n  Stutterers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.SE eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The popularity of automatic speech recognition (ASR) systems nowadays leads\nto an increasing need for improving their accessibility. Handling stuttering\nspeech is an important feature for accessible ASR systems. To improve the\naccessibility of ASR systems for stutterers, we need to expose and analyze the\nfailures of ASR systems on stuttering speech. The speech datasets recorded from\nstutterers are not diverse enough to expose most of the failures. Furthermore,\nthese datasets lack ground truth information about the non-stuttered text,\nrendering them unsuitable as comprehensive test suites. Therefore, a\nmethodology for generating stuttering speech as test inputs to test and analyze\nthe performance of ASR systems is needed. However, generating valid test inputs\nin this scenario is challenging. The reason is that although the generated test\ninputs should mimic how stutterers speak, they should also be diverse enough to\ntrigger more failures. To address the challenge, we propose ASTER, a technique\nfor automatically testing the accessibility of ASR systems. ASTER can generate\nvalid test cases by injecting five different types of stuttering. The generated\ntest cases can both simulate realistic stuttering speech and expose failures in\nASR systems. Moreover, ASTER can further enhance the quality of the test cases\nwith a multi-objective optimization-based seed updating algorithm. We\nimplemented ASTER as a framework and evaluated it on four open-source ASR\nmodels and three commercial ASR systems. We conduct a comprehensive evaluation\nof ASTER and find that it significantly increases the word error rate, match\nerror rate, and word information loss in the evaluated ASR systems.\nAdditionally, our user study demonstrates that the generated stuttering audio\nis indistinguishable from real-world stuttering audio clips.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:46:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Yi",""],["Li","Yuekang",""],["Deng","Gelei",""],["Juefei-Xu","Felix",""],["Du","Yao",""],["Zhang","Cen",""],["Liu","Chengwei",""],["Li","Yeting",""],["Ma","Lei",""],["Liu","Yang",""]]}
{"id":"2308.15743","submitter":"Wei Fan","authors":"Wei Fan","title":"Nontrivial zeros of the Riemann zeta function on the celestial circle","comments":null,"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":"  In this short letter, we reformulate the Riemann zeta function using the\nholographic framework of the celestial conformal field theory. For spacetime\ndimension larger than our Minkowski spacetime $M^4$, the Riemann zeta function\nis connected with the sum of the conformal primary wavefunctions evaluated over\na chain of points on the holographic boundary. Using analytic continuation, it\nfollows that the nontrivial zeros of the Riemann zeta function is connected\nwith the scaling dimension of conformal operators on the celestial circle. We\ndiscuss possible considerations with the spectrum of the celestial conformal\nfield theory, number theory and topology.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:49:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fan","Wei",""]]}
{"id":"2308.15744","submitter":"Timothy Rupert","authors":"Divya Singh, Daniel S. Gianola, Timothy J. Rupert","title":"Dislocation breakaway from nanoparticle array linear complexions:\n  Plasticity mechanisms and strength scaling laws","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":"  Linear complexions are stable defect states, where the stress field\nassociated with a dislocation induces a local phase transformation that remains\nrestricted to nanoscale dimensions. As these complexions are born at the\ndefects which control plasticity in metals, it is crucial to understand their\nimpact on subsequent mechanical properties. In this work, atomistic modeling is\nused to understand how dislocation mechanics are altered by the presence of\nnanoparticle array linear complexions in a Ni-Al alloy. Molecular dynamics\nsimulations are used to identify the critical shear stress needed to drive\ndislocation breakaway, first for nanoparticle arrays formed by Monte\nCarlo/molecular dynamics methods to represent realistic configurations and\nsubsequently for simplified models that allow the effects of particle spacing\nand size to be varied in a controlled manner. A combined bowing and progressive\nunpinning mechanism is uncovered, leading to the demonstration of a new\nstrength scaling law that differs in keys ways from classical Orowan bowing.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:52:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Singh","Divya",""],["Gianola","Daniel S.",""],["Rupert","Timothy J.",""]]}
{"id":"2308.15745","submitter":"Tanjim Mahmud","authors":"Tanjim Mahmud, Michal Ptaszynski, Juuso Eronen and Fumito Masui","title":"Cyberbullying Detection for Low-resource Languages and Dialects: Review\n  of the State of the Art","comments":"52 Pages","journal-ref":"Information Processing & Management 2023","doi":"10.1016/j.ipm.2023.103454","report-no":"Volume 60, Issue 5, September 2023, 103454","categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The struggle of social media platforms to moderate content in a timely\nmanner, encourages users to abuse such platforms to spread vulgar or abusive\nlanguage, which, when performed repeatedly becomes cyberbullying a social\nproblem taking place in virtual environments, yet with real-world consequences,\nsuch as depression, withdrawal, or even suicide attempts of its victims.\nSystems for the automatic detection and mitigation of cyberbullying have been\ndeveloped but, unfortunately, the vast majority of them are for the English\nlanguage, with only a handful available for low-resource languages. To estimate\nthe present state of research and recognize the needs for further development,\nin this paper we present a comprehensive systematic survey of studies done so\nfar for automatic cyberbullying detection in low-resource languages. We\nanalyzed all studies on this topic that were available. We investigated more\nthan seventy published studies on automatic detection of cyberbullying or\nrelated language in low-resource languages and dialects that were published\nbetween around 2017 and January 2023. There are 23 low-resource languages and\ndialects covered by this paper, including Bangla, Hindi, Dravidian languages\nand others. In the survey, we identify some of the research gaps of previous\nstudies, which include the lack of reliable definitions of cyberbullying and\nits relevant subcategories, biases in the acquisition, and annotation of data.\nBased on recognizing those research gaps, we provide some suggestions for\nimproving the general research conduct in cyberbullying detection, with a\nprimary focus on low-resource languages. Based on those proposed suggestions,\nwe collect and release a cyberbullying dataset in the Chittagonian dialect of\nBangla and propose a number of initial ML solutions trained on that dataset. In\naddition, pre-trained transformer-based the BanglaBERT model was also\nattempted.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 03:52:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mahmud","Tanjim",""],["Ptaszynski","Michal",""],["Eronen","Juuso",""],["Masui","Fumito",""]]}
{"id":"2308.15746","submitter":"Songtao Mao","authors":"Xue Chen, Kuan Cheng, Xin Li and Songtao Mao","title":"Random Shortening of Linear Codes and Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.CO math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Random linear codes (RLCs) are well known to have nice combinatorial\nproperties and near-optimal parameters in many different settings. However,\ngetting explicit constructions matching the parameters of RLCs is challenging,\nand RLCs are hard to decode efficiently. This motivated several previous works\nto study the problem of partially derandomizing RLCs, by applying certain\noperations to an explicit mother code. Among them, one of the most well studied\noperations is random puncturing, where a series of works culminated in the work\nof Guruswami and Mosheiff (FOCS' 22), which showed that a random puncturing of\na low-biased code is likely to possess almost all interesting local properties\nof RLCs.\n  In this work, we provide an in-depth study of another, dual operation of\nrandom puncturing, known as random shortening, which can be viewed equivalently\nas random puncturing on the dual code. Our main results show that for any small\n$\\varepsilon$, by starting from a mother code with certain weaker conditions\n(e.g., having a large distance) and performing a random (or even pseudorandom)\nshortening, the new code is $\\varepsilon$-biased with high probability. Our\nresults hold for any field size and yield a shortened code with constant rate.\nThis can be viewed as a complement to random puncturing, and together, we can\nobtain codes with properties like RLCs from weaker initial conditions.\n  Our proofs involve several non-trivial methods of estimating the weight\ndistribution of codewords, which may be of independent interest.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:00:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Xue",""],["Cheng","Kuan",""],["Li","Xin",""],["Mao","Songtao",""]]}
{"id":"2308.15747","submitter":"Hengyuan Wei","authors":"Hengyuan Wei, Zhenghua Huang, Chuan Li, Zhenyong Hou, Ye Qiu, Hui Fu,\n  Xianyong Bai and Lidong Xia","title":"Internal activities in a solar filament and heating to its threads","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Filaments are one of the most common features in the solar atmosphere, and\nare of significance in solar, stellar and laboratory plasma physics. Using data\nfrom the Chinese H$\\alpha$ Solar Explorer, the Solar Upper Transition Region\nImager and the Solar Dynamics Observatory, we report on multiwavelength imaging\nand spectral observations of the activation of a small filament. The filament\nactivation produces several localized dynamic brightenings, which are probably\nproduced by internal reconnections of the braided magnetic fields in the\nfilament. The filament expands during the activation and its threads reconnect\nwith the ambient magnetic fields, which leads to the formation of hot arcades\nor loops overlying the filament. The thermal energy of each of these localized\nbrightenings is estimated in the order of $10^{25}-10^{27} erg$ and the total\nenergy is estimated to be $\\sim1.77 \\times 10^{28} erg$. Our observations\ndemonstrate that the internal magnetic reconnections in the filament can lead\nto localized heating to the filament threads and prompt external reconnections\nwith ambient corona structures, and thus could contribute to the energy and\nmass transferring into the corona.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:01:51 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wei","Hengyuan",""],["Huang","Zhenghua",""],["Li","Chuan",""],["Hou","Zhenyong",""],["Qiu","Ye",""],["Fu","Hui",""],["Bai","Xianyong",""],["Xia","Lidong",""]]}
{"id":"2308.15748","submitter":"Nikita Slavnov A","authors":"G. Kulkarni, N. A. Slavnov","title":"Form factor of local operators in the generalized algebraic Bethe ansatz","comments":"20 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.other math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider an $XYZ$ spin chain within the framework of the generalized\nalgebraic Bethe ansatz. We study form factors of local operators corresponding\nto the singlet states in the limit of free fermions. We obtain explicit\nrepresentations for these form factors.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:13:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kulkarni","G.",""],["Slavnov","N. A.",""]]}
{"id":"2308.15749","submitter":"Yoshinori Sueno","authors":"Y. Sueno, J.J.A. Baselmans, A.H.M. Coppens, R.T G\\'enova-Santos, M.\n  Hattori, S. Honda, K. Karatsu, H. Kutsuma, K. Lee, T. Nagasaki, S. Oguri, C.\n  Otani, M. Peel, J. Suzuki, O. Tajima, T. Tanaka, M. Tsujii, D.J. Thoen, E.\n  Won","title":"Pointing calibration of GroundBIRD telescope using Moon observation data","comments":"17 pages, 17 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Understanding telescope pointing (i.e., line of sight) is important for\nobserving the cosmic microwave background (CMB) and astronomical objects. The\nMoon is a candidate astronomical source for pointing calibration. Although the\nvisible size of the Moon ($\\ang{;30}$) is larger than that of the planets, we\ncan frequently observe the Moon once a month with a high signal-to-noise ratio.\nWe developed a method for performing pointing calibration using observational\ndata from the Moon. We considered the tilts of the telescope axes as well as\nthe encoder and collimation offsets for pointing calibration. In addition, we\nevaluated the effects of the nonuniformity of the brightness temperature of the\nMoon, which is a dominant systematic error. As a result, we successfully\nachieved a pointing accuracy of $\\ang{;3.3}$ compared with an angular\nresolution of $\\ang{;36}$ (i.e., 9\\% uncertainty in the angular resolution).\nThis level of accuracy competes with past achievements in other ground-based\nCMB experiments using observational data from the planets.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:24:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sueno","Y.",""],["Baselmans","J. J. A.",""],["Coppens","A. H. M.",""],["G\u00e9nova-Santos","R. T",""],["Hattori","M.",""],["Honda","S.",""],["Karatsu","K.",""],["Kutsuma","H.",""],["Lee","K.",""],["Nagasaki","T.",""],["Oguri","S.",""],["Otani","C.",""],["Peel","M.",""],["Suzuki","J.",""],["Tajima","O.",""],["Tanaka","T.",""],["Tsujii","M.",""],["Thoen","D. J.",""],["Won","E.",""]]}
{"id":"2308.15750","submitter":"Yu Mei","authors":"Yeping Li, Yu Mei, Yuan Yuan","title":"Asymptotic stability of shock profiles and rarefaction waves to the\n  Navier-Stokes-Poisson system under space-periodic perturbations","comments":"40 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper concerns with the large-time behaviors of the viscous shock\nprofile and rarefaction wave under initial perturbations which tend to\nspace-periodic functions at infinities for the one-dimensional compressible\nNavier-Stokes-Poisson equations. It is proved that: (1) for the viscous shock\nwith small strength, if the initial perturbation is suitably small and\nsatisfies a zero-mass type condition, then the solution tends to background\nviscous shock with a constant shift as time tends to the infinity, and the\nshift depends on both the mass of the localized perturbation, and the\nspace-periodic perturbation; (2) for the rarefaction wave, if the initial\nperturbation is suitably small, then the solution tends to background\nrarefaction wave as time tends to infinity. The proof is based on the delicate\nconstructions of the quadratic ansatzes, which capture the infinitely many\ninteractions between the background waves and the periodic perturbations, and\nthe energy method in Eulerian coordinates involving the effect of\nself-consistent electric field. Moreover, an abstract lemma is established to\ndistinguish the non-decaying terms and good-decaying terms from the error terms\nof the equations of the quadratic ansatzes, which will be benefit to\nconstructing the ansatzes and simplifying calculations for other non-localized\nperturbation problems, especially those with complicatedly coupling physical\neffects.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:28:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Yeping",""],["Mei","Yu",""],["Yuan","Yuan",""]]}
{"id":"2308.15751","submitter":"Yilong Zhang","authors":"Yilong Zhang","title":"Extension of the Topological Abel-Jacobi Map for Cubic Threefolds","comments":"34 pages, this is the second half of the paper split from\n  arXiv:2010.11622v3","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The difference $[L_1]-[L_2]$ of a pair of skew lines on a cubic threefold\ndefines a vanishing cycle on the cubic surface as the hyperplane section\nspanned by the two lines. By deforming the hyperplane, the flat translation of\nsuch vanishing cycle forms a 72-to-1 covering space $T_v$ of a Zariski open\nsubspace of $(\\mathbb P^4)^*$. Based on a lemma of Stein on the\ncompactification of finite analytic covers, we found a compactification of\n$T_v$ to which the topological Abel-Jacobi map extends. Moreover, the boundary\npoints of the compactification can be interpreted in terms of local monodromy\nand the singularities on cubic surfaces. We prove the associated map on\nfundamental groups of topological Abel-Jacobi map is surjective.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:29:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Yilong",""]]}
{"id":"2308.15752","submitter":"Marek Rychlik","authors":"Marek Rychlik and Bekir Tanriover and Yan Han","title":"Large-scale data extraction from the UNOS organ donor documents","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":"  The scope of our study is all UNOS data of the USA organ donors since 2008.\nThe data is not analyzable in a large scale in the past because it was captured\nin PDF documents known as \"Attachments\", whereby every donor is represented by\ndozens of PDF documents in heterogenous formats. To make the data analyzable,\none needs to convert the content inside these PDFs to an analyzable data\nformat, such as a standard SQL database. In this paper we will focus on 2022\nUNOS data comprised of $\\approx 400,000$ PDF documents spanning millions of\npages. The totality of UNOS data covers 15 years (2008--20022) and our results\nwill be quickly extended to the entire data. Our method captures a portion of\nthe data in DCD flowsheets, kidney perfusion data, and data captured during\npatient hospital stay (e.g. vital signs, ventilator settings, etc.). The\ncurrent paper assumes that the reader is familiar with the content of the UNOS\ndata. The overview of the types of data and challenges they present is a\nsubject of another paper. Here we focus on demonstrating that the goal of\nbuilding a comprehensive, analyzable database from UNOS documents is an\nattainable task, and we provide an overview of our methodology. The project\nresulted in datasets by far larger than previously available even in this\npreliminary phase.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:29:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rychlik","Marek",""],["Tanriover","Bekir",""],["Han","Yan",""]]}
{"id":"2308.15753","submitter":"Nuwan Janaka","authors":"Nuwan Janaka, Jie Gao, Lin Zhu, Shengdong Zhao, Lan Lyu, Peisen Xu,\n  Maximilian Nabokow, Silang Wang, Yanch Ong","title":"GlassMessaging: Supporting Messaging Needs During Daily Activities Using\n  OST-HMDs","comments":"6 pages, 1 figure, ACM SUI 2023 (Demo)","journal-ref":"SUI 2023","doi":"10.1145/3607822.3618016","report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The act of communicating with others during routine daily tasks is both\ncommon and intuitive for individuals. However, the hands- and eyes-engaged\nnature of present digital messaging applications makes it difficult to message\nsomeone amidst such activities. We introduce GlassMessaging, a messaging\napplication designed for Optical See-Through Head-Mounted Displays (OST-HMDs).\nIt facilitates messaging through both voice and manual inputs, catering to\nsituations where hands and eyes are preoccupied. GlassMessaging was iteratively\ndeveloped through a formative study identifying current messaging behaviors and\nchallenges in common multitasking with messaging scenarios\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:32:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Janaka","Nuwan",""],["Gao","Jie",""],["Zhu","Lin",""],["Zhao","Shengdong",""],["Lyu","Lan",""],["Xu","Peisen",""],["Nabokow","Maximilian",""],["Wang","Silang",""],["Ong","Yanch",""]]}
{"id":"2308.15754","submitter":"Md Mazharul Islam","authors":"Md Mazharul Islam, Shamiul Alam, Catherine D Schuman, Md Shafayat\n  Hossain, Ahmedullah Aziz","title":"A Deep Dive into the Design Space of a Dynamically Reconfigurable\n  Cryogenic Spiking Neuron","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spiking neural network offers the most bio-realistic approach to mimic the\nparallelism and compactness of the human brain. A spiking neuron is the central\ncomponent of an SNN which generates information-encoded spikes. We present a\ncomprehensive design space analysis of the superconducting memristor (SM)-based\nelectrically reconfigurable cryogenic neuron. A superconducting nanowire (SNW)\nconnected in parallel with an SM function as a dual-frequency oscillator and\ntwo of these oscillators can be coupled to design a dynamically tunable spiking\nneuron. The same neuron topology was previously proposed where a fixed\nresistance was used in parallel with the SNW. Replacing the fixed resistance\nwith the SM provides an additional tuning knob with four distinct combinations\nof SM resistances, which improves the reconfigurability by up to ~70%.\nUtilizing an external bias current (Ibias), the spike frequency can be\nmodulated up to ~3.5 times. Two distinct spike amplitudes (~1V and ~1.8 V) are\nalso achieved. Here, we perform a systematic sensitivity analysis and show that\nthe reconfigurability can be further tuned by choosing a higher input current\nstrength. By performing a 500-point Monte Carlo variation analysis, we find\nthat the spike amplitude is more variation robust than spike frequency and the\nvariation robustness can be further improved by choosing a higher Ibias. Our\nstudy provides valuable insights for further exploration of materials and\ncircuit level modification of the neuron that will be useful for system-level\nincorporation of the neuron circuit\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:40:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Islam","Md Mazharul",""],["Alam","Shamiul",""],["Schuman","Catherine D",""],["Hossain","Md Shafayat",""],["Aziz","Ahmedullah",""]]}
{"id":"2308.15755","submitter":"Karthik Elamvazhuthi","authors":"Karthik Elamvazhuthi and Spring Berman","title":"Density Stabilization Strategies for Nonholonomic Agents on Compact\n  Manifolds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we consider the problem of stabilizing a class of degenerate\nstochastic processes, which are constrained to a bounded Euclidean domain or a\ncompact smooth manifold, to a given target probability density. Most existing\nworks on modeling and control of robotic swarms that use partial differential\nequation (PDE) models assume that the robots' dynamics are holonomic, and\nhence, the associated stochastic processes have generators that are elliptic.\nWe relax this assumption on the ellipticity of the generator of the stochastic\nprocesses, and consider the more practical case of the stabilization problem\nfor a swarm of agents whose dynamics are given by a controllable driftless\ncontrol-affine system. We construct state-feedback control laws that\nexponentially stabilize a swarm of nonholonomic agents to a target probability\ndensity that is sufficiently regular. State-feedback laws can stabilize a swarm\nonly to target probability densities that are positive everywhere. To stabilize\nthe swarm to probability densities that possibly have disconnected supports, we\nintroduce a semilinear PDE model of a collection of interacting agents governed\nby a hybrid switching diffusion process. The interaction between the agents is\nmodeled using a (mean-field) feedback law that is a function of the local\ndensity of the swarm, with the switching parameters as the control inputs. We\nshow that under the action of this feedback law, the semilinear PDE system is\nglobally asymptotically stable about the given target probability density. The\nstabilization strategies with and without agent interactions are verified\nnumerically for agents that evolve according to the Brockett integrator; the\nstrategy with interactions is additionally verified for agents that evolve\naccording to an underactuated system on the sphere $S^2$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:45:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Elamvazhuthi","Karthik",""],["Berman","Spring",""]]}
{"id":"2308.15756","submitter":"Md Mazharul Islam","authors":"Md Mazharul Islam, Shamiul Alam, Mohammad Adnan Jahangir, Garrett S.\n  Rose, Suman Datta, Vijaykrishnan Narayanan, Sumeet Kumar Gupta, Ahmedullah\n  Aziz","title":"Reimagining Sense Amplifiers: Harnessing Phase Transition Materials for\n  Current and Voltage Sensing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET cond-mat.str-el eess.SP physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Energy-efficient sense amplifier (SA) circuits are essential for reliable\ndetection of stored memory states in emerging memory systems. In this work, we\npresent four novel sense amplifier (SA) topologies based on phase transition\nmaterial (PTM) tailored for non-volatile memory applications. We utilize the\nabrupt switching and volatile hysteretic characteristics of PTMs which enables\nefficient and fast sensing operation in our proposed SA topologies. We provide\ncomprehensive details of their functionality and assess how process variations\nimpact their performance metrics. Our proposed sense amplifier topologies\nmanifest notable performance enhancement. We achieve a ~67% reduction in\nsensing delay and a ~80% decrease in sensing power for current sensing. For\nvoltage sensing, we achieve a ~75% reduction in sensing delay and a ~33%\ndecrease in sensing power. Moreover, the proposed SA topologies exhibit\nimproved variation robustness compared to conventional SAs. We also scrutinize\nthe dependence of transistor mirroring window and PTM transition voltages on\nseveral device parameters to determine the optimum operating conditions and\nstance of tunability for each of the proposed SA topologies.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:48:10 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Islam","Md Mazharul",""],["Alam","Shamiul",""],["Jahangir","Mohammad Adnan",""],["Rose","Garrett S.",""],["Datta","Suman",""],["Narayanan","Vijaykrishnan",""],["Gupta","Sumeet Kumar",""],["Aziz","Ahmedullah",""]]}
{"id":"2308.15757","submitter":"Emmy Blumenthal","authors":"Emmy Blumenthal, Jason W. Rocks, Pankaj Mehta","title":"Phase transition to chaos in complex ecosystems with non-reciprocal\n  species-resource interactions","comments":"5 pages, 4 figures; SI: 22 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph cond-mat.dis-nn cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-reciprocal interactions between microscopic constituents can profoundly\nshape the large-scale properties of complex systems. Here, we investigate the\neffects of non-reciprocity in the context of theoretical ecology by analyzing a\ngeneralization of MacArthur's consumer-resource model with asymmetric\ninteractions between species and resources. Using a mixture of analytic cavity\ncalculations and numerical simulations, we show that such ecosystems\ngenerically undergo a phase transition to chaotic dynamics as the amount of\nnon-reciprocity is increased. We analytically construct the phase diagram for\nthis model and show that the emergence of chaos is controlled by a single\nquantity: the ratio of surviving species to surviving resources. We also\nnumerically calculate the Lyapunov exponents in the chaotic phase and carefully\nanalyze finite-size effects. Our findings show how non-reciprocal interactions\ncan give rise to complex and unpredictable dynamical behaviors even in the\nsimplest ecological consumer-resource models.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:56:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Blumenthal","Emmy",""],["Rocks","Jason W.",""],["Mehta","Pankaj",""]]}
{"id":"2308.15758","submitter":"Bowen Li","authors":"Brandon Van Over, Bowen Li, Edwin K.P. Chong, Ali Pezeshki","title":"An Improved Greedy Curvature Bound for Finite-Horizon String\n  Optimization in Sensor Coverage Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DM cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the optimization problem of choosing strings of finite length to\nmaximize string submodular functions on string matroids, which is a broader\nclass of problems than maximizing set submodular functions on set matroids. We\nprovide a lower bound for the performance of the greedy algorithm in our\nproblem, and then prove that our bound is superior to the Greedy curvature\nbased bound proposed by Conforti and Cornu\\'ejols. Our bound is also more\ncomputationally feasible than most previously proposed curvature based bounds.\nFinally, we demonstrate the strength of our result on a discrete version sensor\ncoverage problem.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:57:58 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Van Over","Brandon",""],["Li","Bowen",""],["Chong","Edwin K. P.",""],["Pezeshki","Ali",""]]}
{"id":"2308.15759","submitter":"Ivan Stefanov","authors":"Ivan Z. Stefanov","title":"Chi-square test of the relativistic precession model through the neutron\n  star IGR J17511-3057","comments":"13 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aim of the current paper is to apply the method of Bambi (Bambi, 2015) to\na source which contains two or more simultaneous triads of variability\ncomponents. The joint chi-square variable that can be composed in this case,\nunlike some previous studies, allows the goodness of the fit to be tested. It\nappears that a good fit requires one of the observation groups to be\ndisregarded. Even then, the model prediction for the mass of the neutron star\nin the accreting millisecond pulsar IGR J17511-3057 is way too high to be\naccepted.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:58:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Stefanov","Ivan Z.",""]]}
{"id":"2308.15760","submitter":"Xiaoqi Yang Dr","authors":"Minghua Li and Kaiwen Meng and Xiaoqi Yang","title":"Variational Analysis of Kurdyka-Lojasiewicz Property by Way of Outer\n  Limiting Subgradients","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, for a function $f$ locally lower semicontinuous at a\nstationary point $\\bar{x}$, we obtain complete characterizations of the\nKurdyka-{\\L}ojasiewicz (for short, K{\\L}) property and the exact estimate of\nthe K{\\L} modulus via the outer limiting subdifferential of an auxilliary\nfunction, and obtain a sufficient condition for verifying sharpness of the\nK{\\L} exponent. By introducing a $\\frac{1}{1-\\theta}$-th subderivative $h$ for\n$f$ at $\\bar{x}$, we show that the K{\\L} property of $f$ at $\\bar{x}$ with\nexponent $\\theta\\in [0, 1)$ can be inherited by $h$ at $0$ with the same\nexponent $\\theta$, and that the K{\\L} modulus of $f$ at $\\bar{x}$ is bounded\nabove by that of $(1-\\theta)h$ at $0$. When $\\theta=\\frac12$, we obtain the\nreverse results under the strong metrically subregularity of the subgradient\nmapping for the class of prox-regular, twice epi-differentiable and\nsubdifferentially continuous functions by virtue of Moreau envelopes. We apply\nthe obtained results to establish the K{\\L} property with exponent $\\frac12$\nand to provide calculations of the K{\\L} modulus for smooth functions, the\npointwise max of finitely many smooth functions and the $\\ell_p$ ($0<p\\leq 1$)\nregularized functions respectively. It is worth noting that these functions\noften appear in structured optimization problems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:00:07 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Minghua",""],["Meng","Kaiwen",""],["Yang","Xiaoqi",""]]}
{"id":"2308.15761","submitter":"Jiamu Huang","authors":"Jiamu Huang, Douglas N. C. Lin, Gregory Shields","title":"Metal Enrichment due to Embedded Stars in AGN Discs","comments":"17 pages, 8 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 separately assess elemental abundances in AGNs' broad and narrow emission\nline regions (BLR and NLR), based on a critical assessment of published results\ntogether with new photoionization models. We find 1) He/H enhancements in some\nAGN, exceeding what can be explained by normal chemical evolution and confirm\n2) super-solar {\\alpha} abundance, though to a lesser degree than previously\nreported. We also reaffirm 3) a N/O ratio consistent with secondary production;\n4) solar or slightly sub-solar Fe abundance; and 5) red-shift independent\nmetallicity, in contrast with galactic chemical evolution. We interpret 6) the\nlarger metallicity in the BLR than NRL in terms of an in situ stellar evolution\nand pollution in AGN discs (SEPAD) model. We attribute: a) the redshift\nindependence to the heavy element pollutants being disposed into the disc and\naccreted onto the central supermassive black hole (SMBH); b) the limited He\nexcess to the accretion-wind metabolism of a top-heavy population of evolving\nmassive main sequence stars; c) the super-solar CNO enrichment to the nuclear\nsynthesis during their post-main-sequence evolution; d) the large N/O to the\nbyproduct of multiple stellar generations; and e) the Mg, Si, and Fe to the\nejecta of type II supernovae in the disc. These results provide supporting\nevidence for f) ongoing self-regulated star formation, g) adequate stellar\nluminosity to maintain marginal gravitational stability, h) prolific production\nof seeds and i) dense coexistence of subsequently-grown residual black hole\npopulations in AGN discs.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:00:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Huang","Jiamu",""],["Lin","Douglas N. C.",""],["Shields","Gregory",""]]}
{"id":"2308.15762","submitter":"Ziming Liu","authors":"Ziming Liu, Shenggan Cheng, Haotian Zhou, Yang You","title":"Hanayo: Harnessing Wave-like Pipeline Parallelism for Enhanced Large\n  Model Training Efficiency","comments":"12 pages, 12 figures. This paper has been accepted by SC23(The\n  International Conference for High Performance Computing, Networking, Storage\n  and Analysis). The information can be seen at\n  https://sc23.supercomputing.org/presentation/?id=pap352&sess=sess168","journal-ref":null,"doi":"10.1145/3581784.3607073","report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Large-scale language models have become increasingly challenging and\nexpensive to train. Among various methods addressing this issue, Pipeline\nParallelism has been widely employed to accommodate massive model weights\nwithin limited GPU memory. This paper introduces Hanayo, a wave-like pipeline\nparallelism strategy that boasts a concise structure and practical\napplicability, alongside a high-performance pipeline execution runtime to\ntackle the challenges of pipeline strategy implementation. Hanayo mitigates the\nissues of pipeline bubbles and excessive memory consumption prevalent in\nexisting schemes, without resorting to model duplicates as in Chimera. Our\nevaluation, conducted on four distinct computing clusters and involving both\nGPT-like and BERT-like architectures with up to 32 GPUs, demonstrates up to a\n30.4 \\% increase in throughput compared to the state-of-the-art approach.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:03:29 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Ziming",""],["Cheng","Shenggan",""],["Zhou","Haotian",""],["You","Yang",""]]}
{"id":"2308.15763","submitter":"Md Jubayer Shawon","authors":"Md Jubayer Shawon, Vishal Saxena","title":"Optical Linearization of Silicon Photonic Ring-Assisted Mach-Zehnder\n  Modulator","comments":"12 pages, 24 figures. arXiv admin note: text overlap with\n  arXiv:2110.02737","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In high-performance RF photonic systems, the Electro-Optic (EO) modulators\nplay a critical role as a key component, requiring low SWaP-C and high\nlinearity. While traditional lithium niobate (LiNbO$_3$) Mach-Zehnder\nModulators (MZMs) have been extensively utilized due to their superior\nlinearity, silicon-based EO modulators have lagged behind in achieving\ncomparable performance. This paper presents an experimental demonstration of a\nRing Assisted Mach Zehnder Modulator (RAMZM) fabricated using a silicon\nphotonic foundry process, addressing the performance gap. The proposed RAMZM\nmodulator enables linearization in the optical domain and can be dynamically\nreconfigured to linearize around user-specified center frequency and bias\nconditions, even in the presence of process variations and thermal crosstalk.\nAn automatic reconfiguration algorithm, empowered by Digital-to-Analog\nConverters (DACs), Analog-to-Digital Converters (ADCs), Trans-Impedance\nAmplifiers (TIAs), and a digital configuration engine, is developed to achieve\nlinearization, resulting in a spurious-free dynamic range (SFDR) exceeding 113\ndB.Hz$^{2/3}$. Furthermore, a biasing scheme is introduced for RAMZMs,\nsignificantly enhancing the modulation slope efficiency, which in turn yields a\ntone gain of over 13 dB compared to its standard operation. This reconfigurable\nelectro-optic modulator can be seamlessly integrated into integrated RF\nphotonic System-on-Chips (SoCs), leveraging the advantages of integration and\ncost-effectiveness.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:03:53 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Shawon","Md Jubayer",""],["Saxena","Vishal",""]]}
{"id":"2308.15764","submitter":"Xiangjun Xing","authors":"Mingnan Ding, Jun Wu, and Xiangjun Xing","title":"Stochastic Thermodynamics of Thermophoresis","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.soft","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We study stochastic thermodynamics of Brownian motion in a temperature\ngradient. Using the covariant formulation of over-damped Ito-Langevin theory\nand the associated Fokker-Planck theory, we construct excess entropy production\nboth at trajectory level and at ensemble level, and relate it to the log-ratio\nbetween path probabilities of the forward process and the backward process. We\nprove both a second-law like inequality and transient fluctuation theorem for\nthe excess entropy production. We also simulate a Brownian particle inside a\nLennard-Jones fluid and find that the fluctuation theorem is valid both in the\nover-damped regime and in the under-damped regime.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:09:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ding","Mingnan",""],["Wu","Jun",""],["Xing","Xiangjun",""]]}
{"id":"2308.15765","submitter":"Bianca Sosnovski","authors":"Bianca Sosnovski","title":"Cryptanalysis of a Cayley Hash Function Based on Affine Maps in one\n  Variable over a Finite Field","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR math.GR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Cayley hash functions are cryptographic hashes constructed from Cayley graphs\nof groups. The hash function proposed by Shpilrain and Sosnovski (2016), based\non linear functions over a finite field, was proven insecure. This paper shows\nthat the proposal by Ghaffari and Mostaghim (2018) that uses the Shpilrain and\nSosnovski's hash in its construction is also insecure. We demonstrate its\nsecurity vulnerability by constructing collisions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:13:55 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 06:16:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sosnovski","Bianca",""]]}
{"id":"2308.15766","submitter":"Steve Raj Prabu","authors":"S.Prabu, J.C.A.Miller-Jones, A.Bahramian, C.M.Wood, S.J.Tingay,\n  P.Atri, R.M.Plotkin, J.Strader","title":"Probing the jet size of two Black hole X-ray Binaries in the hard state","comments":"Accepted in MNRAS. 7 Figures and 3 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using multi-frequency Very Long Baseline Interferometer (VLBI) observations,\nwe probe the jet size in the optically thick hard state jets of two black hole\nX-ray binary (BHXRB) systems, MAXI J1820+070 and V404 Cygni. Due to optical\ndepth effects, the phase referenced VLBI core positions move along the jet axis\nof the BHXRB in a frequency dependent manner. We use this \"core shift\" to\nconstrain the physical size of the hard state jet. We place an upper limit of\n$0.3$\\,au on the jet size measured between the 15 and 5 GHz emission regions of\nthe jet in MAXI J1820+070, and an upper limit of $1.0$\\,au between the $8.4$\nand $4.8$\\,GHz emission regions of V404 Cygni. Our limit on the jet size in\nMAXI J1820+070 observed in the low-hard state is a factor of $5$ smaller than\nthe values previously observed in the high-luminosity hard state (using time\nlags between multi-frequency light curves), thus showing evidence of the BHXRB\njet scaling in size with jet luminosity. We also investigate whether motion of\nthe radio-emitting region along the jet axis could affect the measured VLBI\nparallaxes for the two systems, leading to a mild tension with the parallax\nmeasurements of Gaia. Having mitigated the impact of any motion along the jet\naxis in the measured astrometry, we find the previous VLBI parallax\nmeasurements of MAXI J1820+070 and V404 Cygni to be unaffected by jet motion.\nWith a total time baseline of $8$ years, due to having incorporated fourteen\nnew epochs in addition to the previously published ones, our updated parallax\nmeasurement of V404 Cygni is $0.450 \\pm 0.018$\\,mas ($2.226 \\pm 0.091$\\,kpc).\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:22:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Prabu","S.",""],["Miller-Jones","J. C. A.",""],["Bahramian","A.",""],["Wood","C. M.",""],["Tingay","S. J.",""],["Atri","P.",""],["Plotkin","R. M.",""],["Strader","J.",""]]}
{"id":"2308.15767","submitter":"Xiangjun Xing","authors":"Chen Huang, Jun Wu, and Xiangjun Xing","title":"United v.s. Divided, Deconfinement of Social Tension as a Topological\n  Phase Transition","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech physics.soc-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The proverbs \"the enemy of my enemy is my friend\" and alike capture the\nessence of many body correlations in social relations, whose violation leads to\nsocial tension. We study how rule-breakers, who disrespect these norms, affect\nthe structure and dynamics of signed social networks which tries to minimize\nsocial tension. We find two dynamic phases. A friendly society exhibits a\n\"united phase\" where insertion of a rule-breaker only leads to localized\nrearrangement. A hostile society exhibits a \"divided phase\", where insertion\nleads to macroscopic reorganization of social relations. In the divided phase,\nstarting from the utopia state, where all relations are friendly, insertion of\na {\\em separatist}, a particular type of rule-breaker who makes friends with\nonly half of its neighbors, leads to fragmentation, where the society breaks\ninto many finite size, mutually antagonistic cliques. These phenomena are\ndescribed by Ising lattice gauge theory, where social tension behave as $Z_2$\ntopological defects, which are confined in the united phase and deconfined in\nthe divided phase. We further show that the connection between social dynamics\nand Ising lattice gauge theory is viable independently of connectivity\nstructure of the social network.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:25:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Huang","Chen",""],["Wu","Jun",""],["Xing","Xiangjun",""]]}
{"id":"2308.15768","submitter":"Michelle S Lam","authors":"Michelle S. Lam, Ayush Pandit, Colin H. Kalicki, Rachit Gupta, Poonam\n  Sahoo, Dana\\\"e Metaxa","title":"Sociotechnical Audits: Broadening the Algorithm Auditing Lens to\n  Investigate Targeted Advertising","comments":"To appear at CSCW 2023","journal-ref":null,"doi":"10.1145/3610209","report-no":null,"categories":"cs.HC cs.CY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Algorithm audits are powerful tools for studying black-box systems. While\nvery effective in examining technical components, the method stops short of a\nsociotechnical frame, which would also consider users as an integral and\ndynamic part of the system. Addressing this gap, we propose the concept of\nsociotechnical auditing: auditing methods that evaluate algorithmic systems at\nthe sociotechnical level, focusing on the interplay between algorithms and\nusers as each impacts the other. Just as algorithm audits probe an algorithm\nwith varied inputs and observe outputs, a sociotechnical audit (STA)\nadditionally probes users, exposing them to different algorithmic behavior and\nmeasuring resulting attitudes and behaviors. To instantiate this method, we\ndevelop Intervenr, a platform for conducting browser-based, longitudinal\nsociotechnical audits with consenting, compensated participants. Intervenr\ninvestigates the algorithmic content users encounter online and coordinates\nsystematic client-side interventions to understand how users change in\nresponse. As a case study, we deploy Intervenr in a two-week sociotechnical\naudit of online advertising (N=244) to investigate the central premise that\npersonalized ad targeting is more effective on users. In the first week, we\ncollect all browser ads delivered to users, and in the second, we deploy an\nablation-style intervention that disrupts normal targeting by randomly pairing\nparticipants and swapping all their ads. We collect user-oriented metrics\n(self-reported ad interest and feeling of representation) and\nadvertiser-oriented metrics (ad views, clicks, and recognition) throughout,\nalong with a total of over 500,000 ads. Our STA finds that targeted ads indeed\nperform better with users, but also that users begin to acclimate to different\nads in only a week, casting doubt on the primacy of personalized ad targeting\ngiven the impact of repeated exposure.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:26:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lam","Michelle S.",""],["Pandit","Ayush",""],["Kalicki","Colin H.",""],["Gupta","Rachit",""],["Sahoo","Poonam",""],["Metaxa","Dana\u00eb",""]]}
{"id":"2308.15769","submitter":"Cameron Cornell","authors":"Cameron Cornell, Lewis Mitchell and Matthew Roughan","title":"Vector Autoregression in Cryptocurrency Markets: Unraveling Complex\n  Causal Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph q-fin.ST","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Methodologies to infer financial networks from the price series of\nspeculative assets vary, however, they generally involve bivariate or\nmultivariate predictive modelling to reveal causal and correlational structures\nwithin the time series data. The required model complexity intimately relates\nto the underlying market efficiency, where one expects a highly developed and\nefficient market to display very few simple relationships in price data. This\nhas spurred research into the applications of complex nonlinear models for\ndeveloped markets. However, it remains unclear if simple models can provide\nmeaningful and insightful descriptions of the dependency and interconnectedness\nof the rapidly developed cryptocurrency market. Here we show that multivariate\nlinear models can create informative cryptocurrency networks that reflect\neconomic intuition, and demonstrate the importance of high-influence nodes. The\nresulting network confirms that node degree, a measure of influence, is\nsignificantly correlated to the market capitalisation of each coin\n($\\rho=0.193$). However, there remains a proportion of nodes whose influence\nextends beyond what their market capitalisation would imply. We demonstrate\nthat simple linear model structure reveals an inherent complexity associated\nwith the interconnected nature of the data, supporting the use of multivariate\nmodelling to prevent surrogate effects and achieve accurate causal\nrepresentation. In a reductive experiment we show that most of the network\nstructure is contained within a small portion of the network, consistent with\nthe Pareto principle, whereby a fraction of the inputs generates a large\nproportion of the effects. Our results demonstrate that simple multivariate\nmodels provide nontrivial information about cryptocurrency market dynamics, and\nthat these dynamics largely depend upon a few key high-influence coins.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:27:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cornell","Cameron",""],["Mitchell","Lewis",""],["Roughan","Matthew",""]]}
{"id":"2308.15770","submitter":"Volodymyr Minin","authors":"Isaac H. Goldstein, Daniel M. Parker, Sunny Jiang, Volodymyr M. Minin","title":"Semiparametric inference of effective reproduction number dynamics from\n  wastewater pathogen surveillance data","comments":"23 pages, 6 figures in main tex","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Concentrations of pathogen genomes measured in wastewater have recently\nbecome available as a new data source to use when modeling the spread of\ninfectious diseases. One promising use for this data source is inference of the\neffective reproduction number, the average number of individuals a newly\ninfected person will infect. We propose a model where new infections arrive\naccording to a time-varying immigration rate which can be interpreted as a\ncompound parameter equal to the product of the proportion of susceptibles in\nthe population and the transmission rate. This model allows us to estimate the\neffective reproduction number from concentrations of pathogen genomes while\navoiding difficult to verify assumptions about the dynamics of the susceptible\npopulation. As a byproduct of our primary goal, we also produce a new model for\nestimating the effective reproduction number from case data using the same\nframework. We test this modeling framework in an agent-based simulation study\nwith a realistic data generating mechanism which accounts for the time-varying\ndynamics of pathogen shedding. Finally, we apply our new model to estimating\nthe effective reproduction number of SARS-CoV-2 in Los Angeles, California,\nusing pathogen RNA concentrations collected from a large wastewater treatment\nfacility.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:29:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Goldstein","Isaac H.",""],["Parker","Daniel M.",""],["Jiang","Sunny",""],["Minin","Volodymyr M.",""]]}
{"id":"2308.15771","submitter":"Levi Palmer","authors":"Levi D. Palmer, Wonseok Lee, Chung Li Dong, Ru-Shi Liu, Nianqiang Wu,\n  Scott K. Cushing","title":"Determining Quasi-Equilibrium Electron and Hole Distributions from\n  Plasmonic Photocatalysts using Photomodulated X-ray Absorption Spectroscopy","comments":"14 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.mtrl-sci physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Most photocatalytic and photovoltaic devices operate under broadband,\nconstant illumination. Electron and hole dynamics in these devices, however,\nare usually measured using ultrafast pulsed lasers in a narrow wavelength\nrange. In this work, we prove that steady-state, photomodulated x-ray spectra\nfrom a non-time-resolved synchrotron beamline can be used to estimate electron\nand hole distributions. A set of plasmonic metal core-shell nanoparticles is\ndesigned to systematically isolate photothermal, hot electron, and thermalized\nelectron-hole pairs in a TiO2 shell. Steady-state changes in the Ti L2,3 edge\nare measured with and without continuous-wave illumination of the\nnanoparticle's localized surface plasmon resonance. Ab initio excited-state\nx-ray theory developed for transient x-ray measurements is then applied to\nmodel the experimental spectra in an attempt to extract the resultant\nsteady-state carrier distributions. The results suggest that, within error, the\nquasi-equilibrium carrier distribution can be determined even from relatively\nnoisy data with mixed excited-state phenomena.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:33:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Palmer","Levi D.",""],["Lee","Wonseok",""],["Dong","Chung Li",""],["Liu","Ru-Shi",""],["Wu","Nianqiang",""],["Cushing","Scott K.",""]]}
{"id":"2308.15772","submitter":"Hai Pham","authors":"Hai Pham, Young Jin Kim, Subhabrata Mukherjee, David P. Woodruff,\n  Barnabas Poczos, Hany Hassan Awadalla","title":"Task-Based MoE for Multitask Multilingual Machine Translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mixture-of-experts (MoE) architecture has been proven a powerful method for\ndiverse tasks in training deep models in many applications. However, current\nMoE implementations are task agnostic, treating all tokens from different tasks\nin the same manner. In this work, we instead design a novel method that\nincorporates task information into MoE models at different granular levels with\nshared dynamic task-based adapters. Our experiments and analysis show the\nadvantages of our approaches over the dense and canonical MoE models on\nmulti-task multilingual machine translations. With task-specific adapters, our\nmodels can additionally generalize to new tasks efficiently.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:41:29 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pham","Hai",""],["Kim","Young Jin",""],["Mukherjee","Subhabrata",""],["Woodruff","David P.",""],["Poczos","Barnabas",""],["Awadalla","Hany Hassan",""]]}
{"id":"2308.15773","submitter":"James Hogg Mr","authors":"James Hogg, Jessica Cameron, Susanna Cramb, Peter Baade, Kerrie\n  Mengersen","title":"Mapping the prevalence of cancer risk factors at the small area level in\n  Australia","comments":"Submitted to the International Journal of Health Geographics","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cancer is a significant health issue globally and it is well known that\ncancer risk varies geographically. However in many countries there are no small\narea-level data on cancer risk factors with high resolution and complete reach,\nwhich hinders the development of targeted prevention strategies. Using\nAustralia as a case study, the 2017-2018 National Health Survey was used to\ngenerate prevalence estimates for 2221 small areas across Australia for eight\ncancer risk factor measures covering smoking, alcohol, physical activity, diet\nand weight. Utilising a recently developed Bayesian two-stage small area\nestimation methodology, the model incorporated survey-only covariates, spatial\nsmoothing and hierarchical modelling techniques, along with a vast array of\nsmall area-level auxiliary data, including census, remoteness, and\nsocioeconomic data. The models borrowed strength from previously published\ncancer risk estimates provided by the Social Health Atlases of Australia.\nEstimates were internally and externally validated. We illustrated that in\n2017-18 health behaviours across Australia exhibited more spatial disparities\nthan previously realised by improving the reach and resolution of formerly\npublished cancer risk factors. The derived estimates reveal higher prevalence\nof unhealthy behaviours in more remote areas, and areas of lower socioeconomic\nstatus; a trend that aligns well with previous work. Our study addresses the\ngaps in small area level cancer risk factor estimates in Australia. The new\nestimates provide improved spatial resolution and reach and will enable more\ntargeted cancer prevention strategies at the small area level, supporting\npolicy makers, researchers, and the general public in understanding the spatial\ndistribution of cancer risk factors in Australia. To help disseminate the\nresults of this work, they will be made available in the Australian Cancer\nAtlas 2.0.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:43:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hogg","James",""],["Cameron","Jessica",""],["Cramb","Susanna",""],["Baade","Peter",""],["Mengersen","Kerrie",""]]}
{"id":"2308.15774","submitter":"Saleh Kalantari","authors":"Saleh Kalantari, Bill Tong Xu, Armin Mostafavi, Anne Seoyoung Lee, Qi\n  Yang","title":"Comparing Spatial Navigation and Human Environment Interaction in\n  Virtual Reality vs. Identical Real Environments across the Adult Lifespan","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Virtual reality (VR) is increasingly being used as a research platform for\ninvestigating human responses to environmental variables. While VR provides\ntremendous advantages in terms of variable isolation and manipulation, and ease\nof data-collection, some researchers have expressed concerns about the\necological validity of VR-based findings. In the current study we replicated a\nreal-world, multi-level educational facility in VR, and compared data collected\nin the VR and real-world environments as participants (n=36) completed\nidentical wayfinding tasks. We found significant differences in all of the\nmeasures used, including distance covered, number of mistakes made, time for\ntask completion, spatial memory, extent of backtracking, observation of\ndirectional signs, perceived uncertainty levels, perceived cognitive workload,\nand perceived task difficulty. We also analyzed potential age-related effects\nto look for heightened VR/real response discrepancies among older adult\nparticipants (>55 years) compared to younger adults. This analysis yielded no\nsignificant effects of age. Finally, we examined the spatial distribution of\nself-reported wayfinding uncertainty across the building floorplan, finding\nthat areas in which uncertainty was most pronounced were similar between the\nreal-world and VR settings. Thus, participants appeared to be responding to the\nsame environmental features in the real and VR conditions, but the extent of\nthese responses was significantly different. Overall, the findings suggest that\nwhen VR is used to contrast varying environmental design conditions the\nresulting data should be interpreted cautiously and should not be generalized\ninto real-world conclusions without further validation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:51:09 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kalantari","Saleh",""],["Xu","Bill Tong",""],["Mostafavi","Armin",""],["Lee","Anne Seoyoung",""],["Yang","Qi",""]]}
{"id":"2308.15775","submitter":"Amit Giveon","authors":"Amit Giveon","title":"On the cigar CFT and Schwarzschild horizons","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Aspects of shock waves and instantly-created folded strings operators in the\nsupersymmetric $SL(2)_k/U(1)$ CFT, and their relevance to the near-horizon\nphysics of Schwarzschild black holes in perurbative superstring theory, are\npresented.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 05:55:53 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Giveon","Amit",""]]}
{"id":"2308.15776","submitter":"Orlando Luongo","authors":"Peter K. S. Dunsby, Orlando Luongo, Marco Muccino","title":"Unifying the dark sector through a single matter fluid with non-zero\n  pressure","comments":"15 pages, 3 figures, 1 table","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 explore a generalised unified dark energy model that incorporates a\nnon-minimal interaction between a tachyonic fluid and an additional scalar\nfield. Specifically, we require that the second field possesses a vacuum\nenergy, introducing an ineliminable offset due to a symmetry-breaking\nmechanism. After the transition (occurring as due to the symmetry-breaking\nmechanism of the second field), the corresponding equation of state (EoS) takes\nthe form of a combination between a generalised Chaplygin gas (GCG) component\nand a cosmological constant contribution. We reinterpret this outcome by\ndrawing parallels to the so-called Murnaghan EoS, widely-employed in the realm\nof solid-state physics to characterise fluids that, under external pressure,\ncounteract the pressure's effect. We examine the dynamic behaviour of this\nmodel and highlight its key distinctions compared to the GCG model. We\nestablish parameter bounds that clarifies the model's evolution across cosmic\nexpansion history, showing that it, precisely, exhibits behaviour akin to a\nlogotropic fluid that eventually converges to the $\\Lambda$CDM model in the\nearly universe, while behaving as a logotropic or Chaplygin gas at intermediate\nand late times respectively. We explain our findings from a thermodynamic\nperspective, and determine the small perturbations in the linear regime. At\nvery early times, the growth factor flattens as expected while the main\ndepartures occur at late times, where the Murnagham EoS results in a more\nefficient growth of perturbations. We discuss this deviation in view of current\nobservations and conclude that our model is a suitable alternative to the\nstandard cosmological paradigm, introducing the concept of a matter-like field\nwith non-zero pressure.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:07:45 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dunsby","Peter K. S.",""],["Luongo","Orlando",""],["Muccino","Marco",""]]}
{"id":"2308.15777","submitter":"Dongheon Lee","authors":"Dongheon Lee, and Jung-Woo Choi","title":"DeFTAN-II: Efficient Multichannel Speech Enhancement with Subgroup\n  Processing","comments":"13 pages, 6 figures, submitted to IEEE/ACM Trans. Audio, Speech,\n  Lang. Process","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we present DeFTAN-II, an efficient multichannel speech\nenhancement model based on transformer architecture and subgroup processing.\nDespite the success of transformers in speech enhancement, they face challenges\nin capturing local relations, reducing the high computational complexity, and\nlowering memory usage. To address these limitations, we introduce subgroup\nprocessing in our model, combining subgroups of locally emphasized features\nwith other subgroups containing original features. The subgroup processing is\nimplemented in several blocks of the proposed network. In the proposed split\ndense blocks extracting spatial features, a pair of subgroups is sequentially\nconcatenated and processed by convolution layers to effectively reduce the\ncomputational complexity and memory usage. For the F- and T-transformers\nextracting temporal and spectral relations, we introduce cross-attention\nbetween subgroups to identify relationships between locally emphasized and\nnon-emphasized features. The dual-path feedforward network then aggregates\nattended features in terms of the gating of local features processed by dilated\nconvolutions. Through extensive comparisons with state-of-the-art multichannel\nspeech enhancement models, we demonstrate that DeFTAN-II with subgroup\nprocessing outperforms existing methods at significantly lower computational\ncomplexity. Moreover, we evaluate the model's generalization capability on\nreal-world data without fine-tuning, which further demonstrates its\neffectiveness in practical scenarios.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:08:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lee","Dongheon",""],["Choi","Jung-Woo",""]]}
{"id":"2308.15778","submitter":"Alexander Kuchmizhak","authors":"Yulia Borodaenko and Dmitriy Pavlov and Artem Cherepakhin and Eugeny\n  Mitsai and Andrei Pilnik and Sergey Syubaev and Stanislav O. Gurbatov and\n  Evgeny Modin and Aleksey P. Porfirev and Svetlana N. Khonina and Aleksandr V.\n  Shevlyagin and Evgeny L. Gurevich and Aleksandr A. Kuchmizhak","title":"Liquid-assisted laser nanotexturing of silicon: onset of hydrodynamic\n  processes regulated by laser-induced periodic surface structures","comments":"13 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Here, upon systematic studies of femtosecond-laser processing of\nmonocrystalline Si in oxidation-preventing methanol, we showed that the\nelectromagnetic processes dominating at initial steps of the progressive\nmorphology evolution define the onset of the hydrodynamic processes and\nresulting morphology upon subsequent multi-pulse exposure. In particular, under\npromoted exposure quasi-regular subwavelength laser-induced periodic surface\nstructures (LIPSSs) were justified to evolve through the template-assisted\ndevelopment of the Rayleigh-Plateau hydrodynamic instability in the molten\nridges forming quasi-regular surface patterns with a supra-wavelength\nperiodicity and preferential alignment along polarization direction of the\nincident light. Subsequent exposure promotes fusion-assisted morphology\nrearrangement resulting in a spiky surface with a random orientation, yet\nconstant inter-structure distance correlated with initial LIPSS periodicity.\nAlong with the insight onto the physical picture driving the morphology\nevolution and supra-wavelength nanostructure formation, our experiments also\ndemonstrated that the resulting quasi-regular and random spiky morphology can\nbe tailored by the intensity/polarization distribution of the incident laser\nbeam allowing on-demand surface nanotexturing with diverse hierarchical surface\nmorphologies exhibiting reduced reflectivity in the visible and shortwave IR\nspectral ranges. Finally, we highlighted the practical attractiveness of the\nsuggested approach for improving near-IR photoresponse and expanding operation\nspectral range of vertical p-n junction Si photo-detector operating under room\ntemperature and zero-bias conditions via single-step annealing-free laser\nnanopatterning of its surface.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:24:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Borodaenko","Yulia",""],["Pavlov","Dmitriy",""],["Cherepakhin","Artem",""],["Mitsai","Eugeny",""],["Pilnik","Andrei",""],["Syubaev","Sergey",""],["Gurbatov","Stanislav O.",""],["Modin","Evgeny",""],["Porfirev","Aleksey P.",""],["Khonina","Svetlana N.",""],["Shevlyagin","Aleksandr V.",""],["Gurevich","Evgeny L.",""],["Kuchmizhak","Aleksandr A.",""]]}
{"id":"2308.15779","submitter":"Chinkyo Kim","authors":"Hyunkyu Lee, Hyeonoh Jo, Jae Hun Kim, Jongwoo Ha, Su Young An, Jaewu\n  Choi and Chinkyo Kim","title":"Exploring GaN crystallographic orientation disparity and its origin on\n  bare and partly graphene-covered $m$-plane sapphire substrates","comments":"15 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The crystallographic orientation of 3D materials grown over 2D\nmaterial-covered substrates is one of the critical factors in discerning the\ntrue growth mechanism among competing possibilities, including remote epitaxy,\nvan der Waals epitaxy, and pinhole-seeded lateral epitaxy also known as\nthru-hole epitaxy. However, definitive identification demands meticulous\ninvestigation to accurately interpret experimentally observed crystallographic\norientations, as misinterpretation can lead to mistaken conclusions regarding\nthe underlying growth mechanism. In this study, we demonstrate that GaN domains\nexhibit orientation disparities when grown on both bare and partly\ngraphene-covered $m$-plane sapphire substrates. Comprehensive measurements of\ncrystallographic orientation unambiguously reveal that GaN domains adopt (100)\nand (103) orientations even when grown under identical growth conditions on\nbare and partly graphene-covered $m$-plane sapphire substrates, respectively.\nParticularly, high-resolution transmission electron microscopy unequivocally\nestablishes that GaN grown over partly graphene-covered $m$-plane sapphire\nsubstrates started to nucleate on the exposed sapphire surface. Our research\nelucidates that crystallographic orientation disparities can arise even from\nthru-hole epitaxy, challenging the commonly accepted notion that such\ndisparities cannot be attributed to thru-hole epitaxy when grown under\nidentical growth conditions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:25:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lee","Hyunkyu",""],["Jo","Hyeonoh",""],["Kim","Jae Hun",""],["Ha","Jongwoo",""],["An","Su Young",""],["Choi","Jaewu",""],["Kim","Chinkyo",""]]}
{"id":"2308.15780","submitter":"Silvery Fu","authors":"Rithvik Chuppala, Silvery Fu, Sylvia Ratnasamy","title":"DBNet: Leveraging DBMS for Network Automation","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present DBNet, a data-driven network automation framework built on top of\na DBMS. DBNet utilizes key primitives of a DBMS including tables, procedures,\ntransactions, logging, and access control to serve the functions of a\ndata-centric network control plane. DBNet accomplishes this functionality by\nstoring mirrored network device states, executing automation programs on these\nmirror states within the DBMS, and proxying state updates out to the physical\ndevices upon changes to mirror/local state. The framework also stores network\ntelemetry data, performs analytics on the data, uses the analytics to motivate\ncontrol plane actions, and provides provenance logging features on the actions\ntaken. We apply DBNet to motivating cloud network infrastructure examples and\nshow how developers can use DBNet's interface to express rich user-defined\npolicies. Our preliminary case studies show that the overhead to run DBNet is\ntrivial in the timescales generally relevant for network automation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:26:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chuppala","Rithvik",""],["Fu","Silvery",""],["Ratnasamy","Sylvia",""]]}
{"id":"2308.15781","submitter":"Johan Peter Uldall Fynbo","authors":"J. P. U. Fynbo, L. B. Christensen, S. J. Geier, K. E. Heintz, J.-K.\n  Krogager, C. Ledoux, B. Milvang-Jensen, P. M{\\o}eller, S. Vejlgaard, J.\n  Viuho, G. \\\"Ostlin","title":"On the galaxy counterpart and environment of the dusty Damped\n  Lyman-$\\alpha$ Absorber at $z=2.226$ towards Q1218+0832","comments":"9 pages, 10 figures. Accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on further observations of the field of the quasar Q1218+0832.\nGeier et al. (2019) presented the discovery of the quasar resulting from a\nsearch for quasars reddened and dimmed by dust in foreground Damped Lyman-alpha\nAbsorbers (DLAs). The DLA is remarkable by having a very large HI column\ndensity close to 10^22 cm^-2. Its dust extinction curve shows the 2175 AA-bump\nknown from the Local Group. It also shows absorption from cold gas exemplified\nby CI and CO-molecules. We here present narrow-band observations of the field\nof Q1218+0832 and also use archival HST image to search for the galaxy\ncounterpart of the DLA. No emission from the DLA galaxy is found neither in the\nnarrow-band imaging nor in the HST image. In the HST image, we can probe down\nto an impact parameter of 0.3 arcsec and a 3-sigma detection limit of 26.8 mag\nper arcsec^2. In the narrow-band image, we probe down to 0 arcsec impact\nparameter and detect nothing down to a 3-sigma detection limit of about\n3*10^-17 erg s^-1 cm^-2. We do detect a bright Lyman-alpha emitter 59 arcsec\nsouth of Q1218+0832 with a flux of 3*10^-16 erg s^-1 cm^-2. We conclude that\nthe DLA galaxy must be located at very small impact parameter (<0.3 arcsec, 2.5\nkpc) or is optically dark. Also, the DLA galaxy most likely is part of a galaxy\ngroup.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:27:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fynbo","J. P. U.",""],["Christensen","L. B.",""],["Geier","S. J.",""],["Heintz","K. E.",""],["Krogager","J. -K.",""],["Ledoux","C.",""],["Milvang-Jensen","B.",""],["M\u00f8eller","P.",""],["Vejlgaard","S.",""],["Viuho","J.",""],["\u00d6stlin","G.",""]]}
{"id":"2308.15782","submitter":"Markus Kuba","authors":"Markus Kuba and Alois Panholzer","title":"On Card guessing games: limit law for no feedback one-time riffle\n  shuffle","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the following card guessing game with no feedback. An ordered\ndeck of n cards labeled 1 up to n is riffle-shuffled exactly one time. Then,\nthe goal of the game is to maximize the number of correct guesses of the cards.\nOne after another a single card is drawn from the top, the guesser makes a\nguess without seeing the card and gets no response if the guess was correct or\nnot. Building upon and improving earlier results, we provide a limit law for\nthe number of correct guesses and also show convergence of the integer moments.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:28:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kuba","Markus",""],["Panholzer","Alois",""]]}
{"id":"2308.15783","submitter":"Tanveer Khan","authors":"Khoa Nguyen, Tanveer Khan and Antonis Michalas","title":"Split Without a Leak: Reducing Privacy Leakage in Split Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The popularity of Deep Learning (DL) makes the privacy of sensitive data more\nimperative than ever. As a result, various privacy-preserving techniques have\nbeen implemented to preserve user data privacy in DL. Among various\nprivacy-preserving techniques, collaborative learning techniques, such as Split\nLearning (SL) have been utilized to accelerate the learning and prediction\nprocess. Initially, SL was considered a promising approach to data privacy.\nHowever, subsequent research has demonstrated that SL is susceptible to many\ntypes of attacks and, therefore, it cannot serve as a privacy-preserving\ntechnique. Meanwhile, countermeasures using a combination of SL and encryption\nhave also been introduced to achieve privacy-preserving deep learning. In this\nwork, we propose a hybrid approach using SL and Homomorphic Encryption (HE).\nThe idea behind it is that the client encrypts the activation map (the output\nof the split layer between the client and the server) before sending it to the\nserver. Hence, during both forward and backward propagation, the server cannot\nreconstruct the client's input data from the intermediate activation map. This\nimprovement is important as it reduces privacy leakage compared to other\nSL-based works, where the server can gain valuable information about the\nclient's input. In addition, on the MIT-BIH dataset, our proposed hybrid\napproach using SL and HE yields faster training time (about 6 times) and\nsignificantly reduced communication overhead (almost 160 times) compared to\nother HE-based approaches, thereby offering improved privacy protection for\nsensitive data in DL.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:28:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Nguyen","Khoa",""],["Khan","Tanveer",""],["Michalas","Antonis",""]]}
{"id":"2308.15784","submitter":"Roman Jacome","authors":"Roman Jacome, Kumar Vijay Mishra, Brian M. Sadler and Henry Arguello","title":"Octonion Phase Retrieval","comments":"13 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.IV math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Signal processing over hypercomplex numbers arises in many optical imaging\napplications. In particular, spectral image or color stereo data are often\nprocessed using octonion algebra. Recently, the eight-band multispectral image\nphase recovery has gained salience, wherein it is desired to recover the eight\nbands from the phaseless measurements. In this paper, we tackle this hitherto\nunaddressed hypercomplex variant of the popular phase retrieval (PR) problem.\nWe propose octonion Wirtinger flow (OWF) to recover an octonion signal from its\nintensity-only observation. However, contrary to the complex-valued Wirtinger\nflow, the non-associative nature of octonion algebra and the consequent lack of\noctonion derivatives make the extension to OWF non-trivial. We resolve this\nusing the pseudo-real-matrix representation of octonion to perform the\nderivatives in each OWF update. We demonstrate that our approach recovers the\noctonion signal up to a right-octonion phase factor. Numerical experiments\nvalidate OWF-based PR with high accuracy under both noiseless and noisy\nmeasurements.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:32:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Jacome","Roman",""],["Mishra","Kumar Vijay",""],["Sadler","Brian M.",""],["Arguello","Henry",""]]}
{"id":"2308.15785","submitter":"Alexander Krause-Glau","authors":"Alexander Krause-Glau and Wilhelm Hasselbring","title":"Collaborative, Code-Proximal Dynamic Software Visualization within Code\n  Editors","comments":"submitted to VISSOFT 2023(https://vissoft.info/2023/)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Software visualizations are usually realized as standalone and isolated tools\nthat use embedded code viewers within the visualization. In the context of\nprogram comprehension, only few approaches integrate visualizations into code\neditors, such as integrated development environments. This is surprising since\nprofessional developers consider reading source code as one of the most\nimportant ways to understand software, therefore spend a lot of time with code\neditors. In this paper, we introduce the design and proof-of-concept\nimplementation for a software visualization approach that can be embedded into\ncode editors. Our contribution differs from related work in that we use dynamic\nanalysis of a software system's runtime behavior. Additionally, we incorporate\ndistributed tracing. This enables developers to understand how, for example,\nthe currently handled source code behaves as a fully deployed, distributed\nsoftware system. Our visualization approach enhances common remote pair\nprogramming tools and is collaboratively usable by employing shared code\ncities. As a result, user interactions are synchronized between code editor and\nvisualization, as well as broadcasted to collaborators. To the best of our\nknowledge, this is the first approach that combines code editors with\ncollaboratively usable code cities. Therefore, we conducted a user study to\ncollect first-time feedback regarding the perceived usefulness and perceived\nusability of our approach. We additionally collected logging information to\nprovide more data regarding time spent in code cities that are embedded in code\neditors. Seven teams with two students each participated in that study. The\nresults show that the majority of participants find our approach useful and\nwould employ it for their own use. We provide each participant's video\nrecording, raw results, and all steps to reproduce our experiment as\nsupplementary package.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:35:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Krause-Glau","Alexander",""],["Hasselbring","Wilhelm",""]]}
{"id":"2308.15786","submitter":"Zijian Li","authors":"Zijian Li, Zehong Lin, Jiawei Shao, Yuyi Mao, Jun Zhang","title":"FedCiR: Client-Invariant Representation Learning for Federated Non-IID\n  Features","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) is a distributed learning paradigm that maximizes the\npotential of data-driven models for edge devices without sharing their raw\ndata. However, devices often have non-independent and identically distributed\n(non-IID) data, meaning their local data distributions can vary significantly.\nThe heterogeneity in input data distributions across devices, commonly referred\nto as the feature shift problem, can adversely impact the training convergence\nand accuracy of the global model. To analyze the intrinsic causes of the\nfeature shift problem, we develop a generalization error bound in FL, which\nmotivates us to propose FedCiR, a client-invariant representation learning\nframework that enables clients to extract informative and client-invariant\nfeatures. Specifically, we improve the mutual information term between\nrepresentations and labels to encourage representations to carry essential\nclassification knowledge, and diminish the mutual information term between the\nclient set and representations conditioned on labels to promote representations\nof clients to be client-invariant. We further incorporate two regularizers into\nthe FL framework to bound the mutual information terms with an approximate\nglobal representation distribution to compensate for the absence of the\nground-truth global representation distribution, thus achieving informative and\nclient-invariant feature extraction. To achieve global representation\ndistribution approximation, we propose a data-free mechanism performed by the\nserver without compromising privacy. Extensive experiments demonstrate the\neffectiveness of our approach in achieving client-invariant representation\nlearning and solving the data heterogeneity issue.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:36:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Zijian",""],["Lin","Zehong",""],["Shao","Jiawei",""],["Mao","Yuyi",""],["Zhang","Jun",""]]}
{"id":"2308.15787","submitter":"Lars Hupel","authors":"Lars Hupel and Makan Rafiee","title":"How does post-quantum cryptography affect Central Bank Digital Currency?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Central Bank Digital Currency (CBDC) is an emerging trend in digital\npayments, with the vast majority of central banks around the world researching,\npiloting, or even operating a digital version of cash. While design choices\ndiffer broadly, such as accounts vs. tokens, the wallets are generally\nprotected through cryptographic algorithms that safeguard against double\nspending and ensure non-repudiation. But with the advent of quantum computing,\nthese algorithms are threatened by new attack vectors. To better understand\nthose threats, we conducted a study of typical assets in a CBDC system,\ndescribe which ones are most amenable to post-quantum cryptography, and propose\nan upgrade strategy.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:44:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hupel","Lars",""],["Rafiee","Makan",""]]}
{"id":"2308.15788","submitter":"Haruki Mitarai","authors":"Haruki Mitarai and Yoshihiko Hasegawa","title":"Quantum synchronization of qubits via dynamical Casimir effect","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Following the groundbreaking observation of the dynamical Casimir effect in\n2011, the exploration of the dynamical Casimir effect in superconducting\ncircuits has garnered significant attention. In this paper, we investigate the\nsynchronization of qubits induced by the dynamical Casimir effect. Our\ninvestigation revolves around a pragmatic configuration of a quantum system,\nwhere superconducting qubits coupled with a shared coplanar waveguide\nresonator, terminated by a SQUID at one end. We identify the sufficient\ncondition required for achieving in-phase synchronization, which is expected to\nbe accomplished by generating photons in the resonator. Furthermore, we\nnumerically simulate the time evolution of the system and verify that photon\ngeneration via the dynamical Casimir effect arguably induces the\nsynchronization of two qubits. Our result suggests that photon generation by\nthe dynamical Casimir effect affects both the qubits and the resonator, and is\na fruitful resource for the control of quantum systems. In addition, we unveil\na remarkable feature that is probably unique to the dynamical Casimir effect:\nThe differences in initial states and coupling strengths affect the\nsynchronization independently with no overlap between them.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:45:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mitarai","Haruki",""],["Hasegawa","Yoshihiko",""]]}
{"id":"2308.15789","submitter":"Shijie Pan","authors":"Shijie Pan, Sajjad Maleki, Subhash Lakshminarayana, Charalambos\n  Konstantinou","title":"Optimal Placement and Power Supply of Distributed Generation to Minimize\n  Power Losses","comments":"2023 IEEE International Conference on Communications, Control, and\n  Computing Technologies for Smart Grids (SmartGridComm)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An increasing number of renewable energy-based distribution generation (DG)\nunits are being deployed in electric distribution systems. Therefore, it is of\nparamount importance to optimize the installation locations as well as the\npower supply of these DGs. The placement of DGs in the grid can decrease the\ntotal distance that power is transmitted and thus reduce power losses.\nAdditionally, the reactive power supply from the DGs can further reduce power\nlosses in the distribution grid and improve power transmission efficiency. This\npaper presents a two-stage optimization strategy to minimize power losses. In\nthe first stage, the DG locations and active power supply that minimize the\npower losses are determined. The second optimization stage identifies the\noptimal reactive power output of the DGs according to different load demands.\nThe proposed approach is tested on the IEEE 15-bus and the IEEE 33-bus systems\nusing DIgSILENT PowerFactory. The results show that the optimized power losses\ncan be reduced from 58.77 kW to 3.6 kW in the 15-bus system, and from 179.46 kW\nto around 5 kW in the 33-bus system. Moreover, with the proposed optimization\nstrategy, voltage profiles can be maintained at nominal values enabling the\ndistribution grid to support higher load demand.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:45:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pan","Shijie",""],["Maleki","Sajjad",""],["Lakshminarayana","Subhash",""],["Konstantinou","Charalambos",""]]}
{"id":"2308.15790","submitter":"Tomoki Fujii","authors":"Tomoki Fujii, Naoyuki Koike","title":"Translators invariant under hyperpolar actions","comments":"13 pages","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 consider translators (for the mean curvature flow) given by\na graph of a function on a symmetric space $G/K$ of compact type which is\ninvariant under a hyperpolar action on $G/K$. First, in the case of\n$G/K=SO(n+1)/SO(n)$, $SU(n+1)/S(U(1)\\times U(n))$, $Sp(n+1)/(Sp(1)\\times\nSp(n))$ or $F_4/{\\rm Spin}(9)$, we classify the shapes of translators in\n$G/K\\times\\mathbb R$ given by the graphs of functions on $G/K$ which are\ninvariant under the isotropy action $K\\curvearrowright G/K$. Next, in the case\nwhere $G/K$ is of higher rank, we investigate translators in $G/K\\times\\mathbb\nR$ given by the graphs of functions on $G/K$ which are invariant under a\nhyperpolar action $H\\curvearrowright G/K$ of cohomogeneity two.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:47:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fujii","Tomoki",""],["Koike","Naoyuki",""]]}
{"id":"2308.15791","submitter":"Yeongwoong Kim","authors":"Yeongwoong Kim, Suyong Bahk, Seungeon Kim, Won Hee Lee, Dokwan Oh, Hui\n  Yong Kim","title":"Neural Video Compression with Temporal Layer-Adaptive Hierarchical\n  B-frame Coding","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":"  Neural video compression (NVC) is a rapidly evolving video coding research\narea, with some models achieving superior coding efficiency compared to the\nlatest video coding standard Versatile Video Coding (VVC). In conventional\nvideo coding standards, the hierarchical B-frame coding, which utilizes a\nbidirectional prediction structure for higher compression, had been\nwell-studied and exploited. In NVC, however, limited research has investigated\nthe hierarchical B scheme. In this paper, we propose an NVC model exploiting\nhierarchical B-frame coding with temporal layer-adaptive optimization. We first\nextend an existing unidirectional NVC model to a bidirectional model, which\nachieves -21.13% BD-rate gain over the unidirectional baseline model. However,\nthis model faces challenges when applied to sequences with complex or large\nmotions, leading to performance degradation. To address this, we introduce\ntemporal layer-adaptive optimization, incorporating methods such as temporal\nlayer-adaptive quality scaling (TAQS) and temporal layer-adaptive latent\nscaling (TALS). The final model with the proposed methods achieves an\nimpressive BD-rate gain of -39.86% against the baseline. It also resolves the\nchallenges in sequences with large or complex motions with up to -49.13% more\nBD-rate gains than the simple bidirectional extension. This improvement is\nattributed to the allocation of more bits to lower temporal layers, thereby\nenhancing overall reconstruction quality with smaller bits. Since our method\nhas little dependency on a specific NVC model architecture, it can serve as a\ngeneral tool for extending unidirectional NVC models to the ones with\nhierarchical B-frame coding.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:49:34 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 00:46:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kim","Yeongwoong",""],["Bahk","Suyong",""],["Kim","Seungeon",""],["Lee","Won Hee",""],["Oh","Dokwan",""],["Kim","Hui Yong",""]]}
{"id":"2308.15792","submitter":"Laurent Cantier","authors":"Laurent Cantier and Eduard Vilalta","title":"Fra\\\"iss\\'e Theory for Cuntz semigroups","comments":"39 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a Fra\\\"iss\\'e theory for abstract Cuntz semigroups akin to the\ntheory of Fra\\\"iss\\'e categories developed by Kubi\\'s. In particular, we show\nthat any (Cuntz) Fra\\\"iss\\'e category has a unique Fra\\\"iss\\'e limit which is\nboth universal and homogeneous. We also give several examples of such\ncategories and compute their Fra\\\"iss\\'e limits. During our investigations, we\ndevelop a general theory of Cauchy sequences and intertwinings in the category\nCu.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:52:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cantier","Laurent",""],["Vilalta","Eduard",""]]}
{"id":"2308.15793","submitter":"Sabina Abdullayeva","authors":"Anton Kabaev, Pavel Podberezko, Andrey Kaznacheev, Sabina Abdullayeva","title":"HAlf-MAsked Model for Named Entity Sentiment analysis","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":"  Named Entity Sentiment analysis (NESA) is one of the most actively developing\napplication domains in Natural Language Processing (NLP). Social media NESA is\na significant field of opinion analysis since detecting and tracking sentiment\ntrends in the news flow is crucial for building various analytical systems and\nmonitoring the media image of specific people or companies. In this paper, we\nstudy different transformers-based solutions NESA in RuSentNE-23 evaluation.\nDespite the effectiveness of the BERT-like models, they can still struggle with\ncertain challenges, such as overfitting, which appeared to be the main obstacle\nin achieving high accuracy on the RuSentNE-23 data. We present several\napproaches to overcome this problem, among which there is a novel technique of\nadditional pass over given data with masked entity before making the final\nprediction so that we can combine logits from the model when it knows the exact\nentity it predicts sentiment for and when it does not. Utilizing this\ntechnique, we ensemble multiple BERT- like models trained on different subsets\nof data to improve overall performance. Our proposed model achieves the best\nresult on RuSentNE-23 evaluation data and demonstrates improved consistency in\nentity-level sentiment analysis.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:53:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kabaev","Anton",""],["Podberezko","Pavel",""],["Kaznacheev","Andrey",""],["Abdullayeva","Sabina",""]]}
{"id":"2308.15794","submitter":"Micha{\\l} Marczenko","authors":"Volker Koch, Micha{\\l} Marczenko, Krzysztof Redlich, Chihiro Sasaki","title":"Fluctuations and correlations of baryonic chiral partners","comments":"arXiv admin note: substantial text overlap with arXiv:2301.09866","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fluctuations and correlations of the net-baryon number play an important role\nin exploring critical phenomena in phase transitions of strongly interacting\nmatter governed by Quantum chromodynamics (QCD). In this work, we use the\nparity doublet model to investigate the fluctuations of the net-baryon number\ndensity in hot and dense hadronic matter. The model accounts for chiral\ncriticality within the mean-field approximation. We focus on the qualitative\nproperties and systematics of the first- and second-order susceptibility of the\nnet-baryon number density, and their ratios for nucleons of positive and\nnegative parity, as well as their correlator. We show that the fluctuations of\nthe positive-parity nucleon do not necessarily reflect the fluctuations of the\ntotal net-baryon number density at the phase boundary of the chiral phase\ntransition. We also investigate the non-trivial structure of the correlator.\nFurthermore, we discuss and quantify the differences between the fluctuations\nof the net-baryon number density in the vicinity of the chiral and liquid-gas\nphase transition in nuclear matter. We indicate a possible relevance of our\nresults with the interpretation of the experimental data on net-proton number\nfluctuations in heavy-ion collisions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:56:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Koch","Volker",""],["Marczenko","Micha\u0142",""],["Redlich","Krzysztof",""],["Sasaki","Chihiro",""]]}
{"id":"2308.15795","submitter":"Qingyao Wu","authors":"Yukun Su, Ruizhou Sun, Xin Shu, Yu Zhang, Qingyao Wu","title":"Occlusion-Aware Detection and Re-ID Calibrated Network for Multi-Object\n  Tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-Object Tracking (MOT) is a crucial computer vision task that aims to\npredict the bounding boxes and identities of objects simultaneously. While\nstate-of-the-art methods have made remarkable progress by jointly optimizing\nthe multi-task problems of detection and Re-ID feature learning, yet, few\napproaches explore to tackle the occlusion issue, which is a long-standing\nchallenge in the MOT field. Generally, occluded objects may hinder the detector\nfrom estimating the bounding boxes, resulting in fragmented trajectories. And\nthe learned occluded Re-ID embeddings are less distinct since they contain\ninterferer. To this end, we propose an occlusion-aware detection and Re-ID\ncalibrated network for multi-object tracking, termed as ORCTrack. Specifically,\nwe propose an Occlusion-Aware Attention (OAA) module in the detector that\nhighlights the object features while suppressing the occluded background\nregions. OAA can serve as a modulator that enhances the detector for some\npotentially occluded objects. Furthermore, we design a Re-ID embedding matching\nblock based on the optimal transport problem, which focuses on enhancing and\ncalibrating the Re-ID representations through different adjacent frames\ncomplementarily. To validate the effectiveness of the proposed method,\nextensive experiments are conducted on two challenging VisDrone2021-MOT and\nKITTI benchmarks. Experimental evaluations demonstrate the superiority of our\napproach, which can achieve new state-of-the-art performance and enjoy high\nrun-time efficiency.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:56:53 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Su","Yukun",""],["Sun","Ruizhou",""],["Shu","Xin",""],["Zhang","Yu",""],["Wu","Qingyao",""]]}
{"id":"2308.15796","submitter":"Zuxing Yang","authors":"Zu-Xing Yang, Xiao-Hua Fan, Zhi-Pan Li, Shunji Nishimura","title":"A Neural Network Approach for Orienting Heavy-Ion Collision Events","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A convolutional neural network-based classifier is elaborated to retrace the\ninitial orientation of deformed nucleus-nucleus collisions by integrating\nmultiple typical experimental observables. The isospin-dependent\nBoltzmann-Uehling-Uhlenbeck transport model is employed to generate data for\nrandom orientations of ultra-central uranium-uranium collisions at\n$E_\\text{beam} = 1\\,\n  \\text{GeV/nucleon}$. Given the existence of pronounced fluctuations and the\nimpact of spectators in specific scenarios, the classifier still encounters a\nnon-neglectable accuracy loss. Statistically, the data-driven polarization\nscheme is essentially accomplished via the classifier, whose distinct\ncategories filter out specific orientation-biased collision events. This will\nadvance the studies on nuclear symmetry energy, neutron skin, and the\nhigh-momentum tail of deformed nuclei.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:58:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yang","Zu-Xing",""],["Fan","Xiao-Hua",""],["Li","Zhi-Pan",""],["Nishimura","Shunji",""]]}
{"id":"2308.15797","submitter":"Mohd Asim Aftab","authors":"Mohd Asim Aftab, Astha Chawla, Pedro P. Vergara, Shehab Ahmed,\n  Charalambos Konstantinou","title":"Volt/VAR Optimization in the Presence of Attacks: A Real-Time\n  Co-Simulation Study","comments":"2023 IEEE International Conference on Communications, Control, and\n  Computing Technologies for Smart Grids (SmartGridComm)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traditionally, Volt/VAR optimization (VVO) is performed in distribution\nnetworks through legacy devices such as on-load tap changers (OLTCs), voltage\nregulators (VRs), and capacitor banks. With the amendment in IEEE 1547\nstandard, distributed energy resources (DERs) can now provide reactive power\nsupport to the grid. For this, renewable energy-based DERs, such as PV, are\ninterfaced with the distribution networks through smart inverters (SIs). Due to\nthe intermittent nature of such resources, VVO transforms into a dynamic\nproblem that requires extensive communication between the VVO controller and\ndevices performing the VVO scheme. This communication, however, can be\npotentially tampered with by an adversary rendering the VVO ineffective. In\nthis regard, it is important to assess the impact of cyberattacks on the VVO\nscheme. This paper develops a real-time co-simulation setup to assess the\neffect of cyberattacks on VVO. The setup consists of a real-time power system\nsimulator, a communication network emulator, and a master controller in a\nsystem-in-the-loop (SITL) setup. The DNP3 communication protocol is adopted for\nthe underlying communication infrastructure. The results show that corrupted\ncommunication messages can lead to violation of voltage limits, increased\nnumber of setpoint updates of VRs, and economic loss.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:05:10 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Aftab","Mohd Asim",""],["Chawla","Astha",""],["Vergara","Pedro P.",""],["Ahmed","Shehab",""],["Konstantinou","Charalambos",""]]}
{"id":"2308.15798","submitter":"Midhun Augustine","authors":"Midhun T. Augustine","title":"A Note on Linear Quadratic Regulator and Kalman Filter","comments":"12 pages, 4 figures, tutorial article","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Two central problems in modern control theory are the controller design\nproblem: which deals with designing a control law for the dynamical system, and\nthe state estimation problem (observer design problem): which deals with\ncomputing an estimate of the states of the dynamical system. The Linear\nQuadratic Regulator (LQR) and Kalman Filter (KF) solves these problems\nrespectively for linear dynamical systems in an optimal manner, i.e., LQR is an\noptimal state feedback controller and KF is an optimal state estimator. In this\nnote, we will be discussing the basic concepts, derivation, steady-state\nanalysis, and numerical implementation of the LQR and KF.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:10:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Augustine","Midhun T.",""]]}
{"id":"2308.15799","submitter":"Hui Chen","authors":"Hui Chen, Musa Furkan Keskin, Adham Sakhnini, Nicol\\'o Decarli, Sofie\n  Pollin, Davide Dardari, Henk Wymeersch","title":"6G Localization and Sensing in the Near Field: Fundamentals,\n  Opportunities, and 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 far-field channel model has historically been used in wireless\ncommunications due to the simplicity of mathematical modeling and convenience\nfor algorithm design, and its validity for relatively small array apertures.\nWith the need for high data rates, low latency, and ubiquitous connectivity in\nthe sixth generation (6G) of communication systems, new technology enablers\nsuch as extremely large antenna arrays (ELAA), reconfigurable intelligent\nsurfaces (RISs), and distributed multiple-input-multiple-output (D-MIMO)\nsystems will be adopted. These enablers not only aim to improve communication\nservices but also have an impact on localization and sensing (L\\&S), which are\nexpected to be integrated into future wireless systems. Despite appearing in\ndifferent scenarios and supporting different frequency bands, these enablers\nshare the so-called near-field (NF) features, which will provide extra\ngeometric information. In this work, starting from a brief description of NF\nchannel features, we highlight the opportunities and challenges for 6G NF L\\&S.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:10:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Hui",""],["Keskin","Musa Furkan",""],["Sakhnini","Adham",""],["Decarli","Nicol\u00f3",""],["Pollin","Sofie",""],["Dardari","Davide",""],["Wymeersch","Henk",""]]}
{"id":"2308.15800","submitter":"Shuichiro Takeda","authors":"Shuichiro Takeda","title":"Dual groups of symmetric varieties and distinguished representations of\n  $p$-adic groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X=H\\backslash G$ be a symmetric variety over a $p$-adic field. Assume\n$G$ is split. In this paper, we construct a complex group $G_X^\\vee$, which we\ncall the dual group of $X$, and a natural homomorphism\n$\\varphi_X^\\vee:G_X^\\vee\\times\\operatorname{SL}_2(\\mathbb{C})\\to G^\\vee$, where\n$G^\\vee$ is the Langlands dual group of $G$, and make a few conjectures on how\n$\\varphi_X^\\vee$ is related to $H$-distinguished representations of $G$. We\nwill also show that the local Langlands parameter of the trivial representation\nof $G$ factors through $\\varphi_X^\\vee$ for any symmetric variety\n$X=H\\backslash G$.\n  Our group $G_X^\\vee$ is different from the dual group by\nSakellaridis-Venkatesh. However, we will show that our conjectures are\nconsistent with various known examples and conjectures, especially in the\nframework of the theory of Kato-Takano on relative cuspidality and relative\nsquare integrability.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:10:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Takeda","Shuichiro",""]]}
{"id":"2308.15801","submitter":"Sebastian Rickelhoff","authors":"Sebastian Rickelhoff and Alexander Schnurr","title":"The Time-Dependent Symbol of a Non-Homogeneous It\\^o Process and\n  corresponding Maximal Inequalities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The probabilistic symbol is defined as the right-hand side derivative at time\nzero of the characteristic functions corresponding to the one-dimensional\nmarginals of a time-homogeneous stochastic process. As described in various\ncontributions to this topic, the symbol contains crucial information concerning\nthe process. When leaving time-homogeneity behind, a modification of the symbol\nby inserting a time component is needed. In the present article we show the\nexistence of such a time-dependent symbol for non-homogeneous It\\^o processes.\nMoreover, for this class of processes we derive maximal inequalities which we\napply to generalize the Blumenthal-Getoor indices to the non-homogeneous case.\nThese are utilized to derive several properties regarding the paths of the\nprocess, including the asymptotic behavior of the sample patsh, the existence\nof exponential moments and the finiteness of p-variation. In contrast to many\nsituations where non-homogeneous Markov processes are involved, the space-time\nprocess cannot be utilized when considering maximal inequalities.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:11:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rickelhoff","Sebastian",""],["Schnurr","Alexander",""]]}
{"id":"2308.15802","submitter":"Junjie Zhang","authors":"Yangkun Chen, Joseph Suarez, Junjie Zhang, Chenghui Yu, Bo Wu, Hanmo\n  Chen, Hengman Zhu, Rui Du, Shanliang Qian, Shuai Liu, Weijun Hong, Jinke He,\n  Yibing Zhang, Liang Zhao, Clare Zhu, Julian Togelius, Sharada Mohanty, Jiaxin\n  Chen, Xiu Li, Xiaolong Zhu, Phillip Isola","title":"Benchmarking Robustness and Generalization in Multi-Agent Systems: A\n  Case Study on Neural MMO","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the results of the second Neural MMO challenge, hosted at IJCAI\n2022, which received 1600+ submissions. This competition targets robustness and\ngeneralization in multi-agent systems: participants train teams of agents to\ncomplete a multi-task objective against opponents not seen during training. The\ncompetition combines relatively complex environment design with large numbers\nof agents in the environment. The top submissions demonstrate strong success on\nthis task using mostly standard reinforcement learning (RL) methods combined\nwith domain-specific engineering. We summarize the competition design and\nresults and suggest that, as an academic community, competitions may be a\npowerful approach to solving hard problems and establishing a solid benchmark\nfor algorithms. We will open-source our benchmark including the environment\nwrapper, baselines, a visualization tool, and selected policies for further\nresearch.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:16:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Yangkun",""],["Suarez","Joseph",""],["Zhang","Junjie",""],["Yu","Chenghui",""],["Wu","Bo",""],["Chen","Hanmo",""],["Zhu","Hengman",""],["Du","Rui",""],["Qian","Shanliang",""],["Liu","Shuai",""],["Hong","Weijun",""],["He","Jinke",""],["Zhang","Yibing",""],["Zhao","Liang",""],["Zhu","Clare",""],["Togelius","Julian",""],["Mohanty","Sharada",""],["Chen","Jiaxin",""],["Li","Xiu",""],["Zhu","Xiaolong",""],["Isola","Phillip",""]]}
{"id":"2308.15803","submitter":"Ratnangshu Das","authors":"Ratnangshu Das and Pushpak Jagtap","title":"Funnel-based Control for Reach-Avoid-Stay Specifications","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SY eess.SY math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper addresses the problem of controller synthesis for control-affine\nnonlinear systems to meet reach-avoid-stay specifications. Specifically, the\ngoal of the research is to obtain a closed-form control law ensuring that the\ntrajectories of the nonlinear system, reach a target set while avoiding all\nunsafe regions and adhering to the state-space constraints. To tackle this\nproblem, we leverage the concept of the funnel-based control approach. Given an\narbitrary unsafe region, we introduce a circumvent function that guarantees the\nsystem trajectory to steer clear of that region. Subsequently, an adaptive\nfunnel framework is proposed based on the target, followed by the construction\nof a closed-form controller using the established funnel function, enforcing\nthe reach-avoid-stay specifications. To demonstrate the efficacy of the\nproposed funnel-based control approach, a series of simulation experiments have\nbeen carried out.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:16:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Das","Ratnangshu",""],["Jagtap","Pushpak",""]]}
{"id":"2308.15804","submitter":"Viet Khoa Tran","authors":"Tran Viet Khoa and Do Hai Son and Chi-Hieu Nguyen and Dinh Thai Hoang\n  and Diep N. Nguyen and Nguyen Linh Trung and Tran Thi Thuy Quynh and\n  Trong-Minh Hoang and Nguyen Viet Ha and Eryk Dutkiewicz","title":"Securing Blockchain Systems: A Novel Collaborative Learning Framework to\n  Detect Attacks in Transactions and Smart Contracts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  With the escalating prevalence of malicious activities exploiting\nvulnerabilities in blockchain systems, there is an urgent requirement for\nrobust attack detection mechanisms. To address this challenge, this paper\npresents a novel collaborative learning framework designed to detect attacks in\nblockchain transactions and smart contracts by analyzing transaction features.\nOur framework exhibits the capability to classify various types of blockchain\nattacks, including intricate attacks at the machine code level (e.g., injecting\nmalicious codes to withdraw coins from users unlawfully), which typically\nnecessitate significant time and security expertise to detect. To achieve that,\nthe proposed framework incorporates a unique tool that transforms transaction\nfeatures into visual representations, facilitating efficient analysis and\nclassification of low-level machine codes. Furthermore, we propose a customized\ncollaborative learning model to enable real-time detection of diverse attack\ntypes at distributed mining nodes. In order to create a comprehensive dataset,\nwe deploy a pilot system based on a private Ethereum network and conduct\nmultiple attack scenarios. To the best of our knowledge, our dataset is the\nmost comprehensive and diverse collection of transactions and smart contracts\nsynthesized in a laboratory for cyberattack detection in blockchain systems.\nOur framework achieves a detection accuracy of approximately 94\\% through\nextensive simulations and real-time experiments with a throughput of over 1,100\ntransactions per second. These compelling results validate the efficacy of our\nframework and showcase its adaptability in addressing real-world cyberattack\nscenarios.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:17:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Khoa","Tran Viet",""],["Son","Do Hai",""],["Nguyen","Chi-Hieu",""],["Hoang","Dinh Thai",""],["Nguyen","Diep N.",""],["Trung","Nguyen Linh",""],["Quynh","Tran Thi Thuy",""],["Hoang","Trong-Minh",""],["Ha","Nguyen Viet",""],["Dutkiewicz","Eryk",""]]}
{"id":"2308.15805","submitter":"Valery Ugrinovskii","authors":"V. Ugrinovskii and M.R. James","title":"Design of Coherent Passive Quantum Equalizers Using Robust Control\n  Theory","comments":"Submitted for publication in Automatica","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The paper develops a methodology for the design of coherent equalizing\nfilters for quantum communication channels. Given a linear quantum system model\nof a quantum communication channel, the aim is to obtain another quantum system\nwhich, when coupled with the original system, mitigates degrading effects of\nthe environment. The main result of the paper is a systematic equalizer\nsynthesis algorithm which relies on methods of state-space robust control\ndesign via semidefinite programming.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:21:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ugrinovskii","V.",""],["James","M. R.",""]]}
{"id":"2308.15806","submitter":"Gabriel Mejia Dr.","authors":"Gabriel E. Mejia-Ruiz, Yazdan Batmani, Subhash Lakshminarayana, Shehab\n  Ahmed, Charalambos Konstantinou","title":"Communication Reduction for Power Systems: An Observer-Based\n  Event-Triggered Approach","comments":"2023 IEEE International Conference on Communications, Control, and\n  Computing Technologies for Smart Grids (SmartGridComm)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The management of distributed and heterogeneous modern power networks\nnecessitates the deployment of communication links, often characterized by\nlimited bandwidth. This paper presents an event detection mechanism that\nsignificantly reduces the volume of data transmission to perform necessary\ncontrol actions, using a scalable scheme that enhances the stability and\nreliability of power grids. The approach relies on implementing a linear\nquadratic regulator and the execution of a pair of Luenberger observers. The\nlinear quadratic regulator minimizes the amount of energy required to achieve\nthe control actions. Meanwhile, the Luenberger observers estimate the\nunmeasured states from the sensed states, providing the necessary information\nto trigger the event detection mechanism. The effectiveness of the method is\ntested via time-domain simulations on the IEEE 13-node test feeder interfaced\nwith inverter-based distributed generation systems and the proposed\nobserved-based event-triggered controller. The results demonstrate that the\npresented control scheme guarantees the bounding of the system states to a\npre-specified limit while reducing the number of data packet transmissions by\n39.8%.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:22:06 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mejia-Ruiz","Gabriel E.",""],["Batmani","Yazdan",""],["Lakshminarayana","Subhash",""],["Ahmed","Shehab",""],["Konstantinou","Charalambos",""]]}
{"id":"2308.15807","submitter":"Tian-Sheuan Chang","authors":"Tun-Hao Yang, and Tian-Sheuan Chang","title":"ACNPU: A 4.75TOPS/W 1080P@30FPS Super Resolution Accelerator with\n  Decoupled Asymmetric Convolution","comments":"9 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AR cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning-driven superresolution (SR) outperforms traditional techniques\nbut also faces the challenge of high complexity and memory bandwidth. This\nchallenge leads many accelerators to opt for simpler and shallow models like\nFSRCNN, compromising performance for real-time needs, especially for\nresource-limited edge devices. This paper proposes an energy-efficient SR\naccelerator, ACNPU, to tackle this challenge. The ACNPU enhances image quality\nby 0.34dB with a 27-layer model, but needs 36\\% less complexity than FSRCNN,\nwhile maintaining a similar model size, with the \\textit{decoupled asymmetric\nconvolution and split-bypass structure}. The hardware-friendly 17K-parameter\nmodel enables \\textit{holistic model fusion} instead of localized layer fusion\nto remove external DRAM access of intermediate feature maps. The on-chip memory\nbandwidth is further reduced with the \\textit{input stationary flow} and\n\\textit{parallel-layer execution} to reduce power consumption. Hardware is\nregular and easy to control to support different layers by \\textit{processing\nelements (PEs) clusters with reconfigurable input and uniform data flow}. The\nimplementation in the 40 nm CMOS process consumes 2333 K gate counts and 198KB\nSRAMs. The ACNPU achieves 31.7 FPS and 124.4 FPS for x2 and x4 scales Full-HD\ngeneration, respectively, which attains 4.75 TOPS/W energy efficiency.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:23:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yang","Tun-Hao",""],["Chang","Tian-Sheuan",""]]}
{"id":"2308.15808","submitter":"Yubin Wang","authors":"Yubin Wang, Zengqi Peng, Hakim Ghazzai, Jun Ma","title":"Learning the References of Online Model Predictive Control for Urban\n  Self-Driving","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we propose a novel learning-based online model predictive\ncontrol (MPC) framework for motion synthesis of self-driving vehicles. In this\nframework, the decision variables are generated as instantaneous references to\nmodulate the cost functions of online MPC, where the constraints of collision\navoidance and drivable surface boundaries are latently represented in the soft\nform. Hence, the embodied maneuvers of the ego vehicle are empowered to adapt\nto complex and dynamic traffic environments, even with unmodeled uncertainties\nof other traffic participants. Furthermore, we implement a deep reinforcement\nlearning (DRL) framework for policy search to cast the step actions as the\ndecision variables, where the practical and lightweight observations are\nconsidered as the input features of the policy network. The proposed approach\nis implemented in the high-fidelity simulator involving compound-complex urban\ndriving scenarios, and the results demonstrate that the proposed development\nmanifests remarkable adaptiveness to complex and dynamic traffic environments\nwith a success rate of 85%. Also, its advantages in terms of safety,\nmaneuverability, and robustness are illustrated.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:23:37 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wang","Yubin",""],["Peng","Zengqi",""],["Ghazzai","Hakim",""],["Ma","Jun",""]]}
{"id":"2308.15809","submitter":"Tianze Wei","authors":"Tianze Wei, Bo Li, Minming Li","title":"Maximin-Aware Allocations of Indivisible Chores with Symmetric and\n  Asymmetric Agents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The real-world deployment of fair allocation algorithms usually involves a\nheterogeneous population of users, which makes it challenging for the users to\nget complete knowledge of the allocation except for their own bundles. Chan et\nal. [IJCAI 2019] proposed a new fairness notion, maximin-awareness (MMA), which\nguarantees that every agent is not the worst-off one, no matter how the items\nthat are not allocated to her are distributed. We adapt and generalize this\nnotion to the case of indivisible chores and when the agents may have arbitrary\nweights. Due to the inherent difficulty of MMA, we also consider its up to one\nand up to any relaxations. A string of results on the existence and computation\nof MMA related fair allocations, and their connections to existing fairness\nconcepts is given.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:29:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wei","Tianze",""],["Li","Bo",""],["Li","Minming",""]]}
{"id":"2308.15810","submitter":"Jerome Bertrand","authors":"J\\'er\\^ome Bertrand (IMT)","title":"On the Gauss image problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this note, we solve the Gauss image problem given two Borel measures on\nthe unit sphere, one of which is absolutely continuous with respect to the\nuniform measure.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:31:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bertrand","J\u00e9r\u00f4me","","IMT"]]}
{"id":"2308.15811","submitter":"Ye Zhang","authors":"Sebastiano Nicolussi Golo, Ye Zhang","title":"Curvature exponent and geodesic dimension on Sard-regular Carnot groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we characterize the geodesic dimension $N_{GEO}$ and give a new\nlower bound to the curvature exponent $N_{CE}$ on Sard-regular Carnot groups.\nAs an application, we give an example of step-two Carnot group on which $N_{CE}\n> N_{GEO}$: this answers a question posed by Rizzi in arXiv:1510.05960v4\n[math.MG].\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:31:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Golo","Sebastiano Nicolussi",""],["Zhang","Ye",""]]}
{"id":"2308.15812","submitter":"Hritik Bansal","authors":"Hritik Bansal, John Dang, Aditya Grover","title":"Peering Through Preferences: Unraveling Feedback Acquisition for\n  Aligning Large Language Models","comments":"24 pages, 12 Tables, 3 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aligning large language models (LLMs) with human values and intents\ncritically involves the use of human or AI feedback. While dense feedback\nannotations are expensive to acquire and integrate, sparse feedback presents a\nstructural design choice between ratings (e.g., score Response A on a scale of\n1-7) and rankings (e.g., is Response A better than Response B?). In this work,\nwe analyze the effect of this design choice for the alignment and evaluation of\nLLMs. We uncover an inconsistency problem wherein the preferences inferred from\nratings and rankings significantly disagree 60% for both human and AI\nannotators. Our subsequent analysis identifies various facets of annotator\nbiases that explain this phenomena, such as human annotators would rate denser\nresponses higher while preferring accuracy during pairwise judgments. To our\nsurprise, we also observe that the choice of feedback protocol also has a\nsignificant effect on the evaluation of aligned LLMs. In particular, we find\nthat LLMs that leverage rankings data for alignment (say model X) are preferred\nover those that leverage ratings data (say model Y), with a rank-based\nevaluation protocol (is X/Y's response better than reference response?) but not\nwith a rating-based evaluation protocol (score Rank X/Y's response on a scale\nof 1-7). Our findings thus shed light on critical gaps in methods for\nevaluating the real-world utility of language models and their strong\ndependence on the feedback protocol used for alignment. Our code and data are\navailable at https://github.com/Hritikbansal/sparse_feedback.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:35:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bansal","Hritik",""],["Dang","John",""],["Grover","Aditya",""]]}
{"id":"2308.15813","submitter":"Anthony Colas","authors":"Anthony Colas, Jun Araki, Zhengyu Zhou, Bingqing Wang, Zhe Feng","title":"Knowledge-grounded Natural Language Recommendation Explanation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Explanations accompanied by a recommendation can assist users in\nunderstanding the decision made by recommendation systems, which in turn\nincreases a user's confidence and trust in the system. Recently, research has\nfocused on generating natural language explanations in a human-readable format.\nThus far, the proposed approaches leverage item reviews written by users, which\nare often subjective, sparse in language, and unable to account for new items\nthat have not been purchased or reviewed before. Instead, we aim to generate\nfact-grounded recommendation explanations that are objectively described with\nitem features while implicitly considering a user's preferences, based on the\nuser's purchase history. To achieve this, we propose a knowledge graph (KG)\napproach to natural language explainable recommendation. Our approach draws on\nuser-item features through a novel collaborative filtering-based KG\nrepresentation to produce fact-grounded, personalized explanations, while\njointly learning user-item representations for recommendation scoring.\nExperimental results show that our approach consistently outperforms previous\nstate-of-the-art models on natural language explainable recommendation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:36:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Colas","Anthony",""],["Araki","Jun",""],["Zhou","Zhengyu",""],["Wang","Bingqing",""],["Feng","Zhe",""]]}
{"id":"2308.15814","submitter":"Antoine Mouzard","authors":"Quentin Chauleur (LPP, Paradyse), Antoine Mouzard (LPENSL, IRMAR,\n  MINGUS)","title":"The logarithmic Schr{\\\"o}dinger equation with spatial white noise on the\n  full space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We solve the Schr{\\\"o}dinger equation with logarithmic nonlinearity and\nmultiplicative spatial white noise on R d with d $\\le$ 2. Because of the\nnonlinearity, the regularity structures and the paracontrolled calculus can not\nbe used. To solve the equation, we rely on an exponential transform that has\nproven useful in the context of other singular SPDEs.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:37:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chauleur","Quentin","","LPP, Paradyse"],["Mouzard","Antoine","","LPENSL, IRMAR,\n  MINGUS"]]}
{"id":"2308.15815","submitter":"Peizhe Li","authors":"Pei-Zhe Li, Josephine Dias, William J. Munro, Peter van Loock, Kae\n  Nemoto, and Nicol\\'o Lo Piparo","title":"Performance of Rotation-Symmetric Bosonic Codes in a Quantum Repeater\n  Network","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum error correction codes based on continuous variables play an\nimportant role for the implementation of quantum communication systems. A\nnatural application of such codes occurs within quantum repeater systems which\nare used to combat severe channel losses and local gate errors. In particular,\nchannel loss drastically reduces the distance of communication between remote\nusers. Here we consider a cavity-QED based repeater scheme to address the\nlosses in the quantum channel. This repeater scheme relies on the transmission\nof a specific class of rotationally invariant error-correcting codes. We\ncompare several rotation-symmetric bosonic codes (RSBCs) being used to encode\nthe initial states of two remote users connected by a quantum repeater network\nagainst the convention of the cat codes and we quantify the performance of the\nsystem using the secret key rate. In particular, we determine the number of\nstations required to exchange a secret key over a fixed distance and establish\nthe resource overhead.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:39:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Pei-Zhe",""],["Dias","Josephine",""],["Munro","William J.",""],["van Loock","Peter",""],["Nemoto","Kae",""],["Piparo","Nicol\u00f3 Lo",""]]}
{"id":"2308.15816","submitter":"Sajid Javed Dr","authors":"Basit Alawode, Fayaz Ali Dharejo, Mehnaz Ummar, Yuhang Guo, Arif\n  Mahmood, Naoufel Werghi, Fahad Shahbaz Khan, Jiri Matas, Sajid Javed","title":"Improving Underwater Visual Tracking With a Large Scale Dataset and\n  Image Enhancement","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a new dataset and general tracker enhancement method for\nUnderwater Visual Object Tracking (UVOT). Despite its significance, underwater\ntracking has remained unexplored due to data inaccessibility. It poses distinct\nchallenges; the underwater environment exhibits non-uniform lighting\nconditions, low visibility, lack of sharpness, low contrast, camouflage, and\nreflections from suspended particles. Performance of traditional tracking\nmethods designed primarily for terrestrial or open-air scenarios drops in such\nconditions. We address the problem by proposing a novel underwater image\nenhancement algorithm designed specifically to boost tracking quality. The\nmethod has resulted in a significant performance improvement, of up to 5.0%\nAUC, of state-of-the-art (SOTA) visual trackers. To develop robust and accurate\nUVOT methods, large-scale datasets are required. To this end, we introduce a\nlarge-scale UVOT benchmark dataset consisting of 400 video segments and 275,000\nmanually annotated frames enabling underwater training and evaluation of deep\ntrackers. The videos are labelled with several underwater-specific tracking\nattributes including watercolor variation, target distractors, camouflage,\ntarget relative size, and low visibility conditions. The UVOT400 dataset,\ntracking results, and the code are publicly available on:\nhttps://github.com/BasitAlawode/UWVOT400.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:41:26 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 08:14:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Alawode","Basit",""],["Dharejo","Fayaz Ali",""],["Ummar","Mehnaz",""],["Guo","Yuhang",""],["Mahmood","Arif",""],["Werghi","Naoufel",""],["Khan","Fahad Shahbaz",""],["Matas","Jiri",""],["Javed","Sajid",""]]}
{"id":"2308.15817","submitter":"Pierre BON","authors":"Duc-Minh Ta (XLIM-PHOT), Alberto Aguilar (XLIM-PHOT), Pierre Bon\n  (XLIM-PHOT)","title":"Label-free image scanning microscopy for kHz super-resolution imaging\n  and single particle tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report the modification of a label-free image scanning microscope (ISM) to\nperform asynchronous 2D imaging at 24kHz while keeping the lateral resolution\ngain and background rejection of a regular label-free ISM setup. Our method\nuses a resonant mirror oscillating at 12kHz for one-direction scanning and a\nchromatic line for instantaneous scanning in the other direction. We adapt\noptical photon reassignment in this scanning regime to perform fully optical\nsuper-resolution imaging. We exploit the kHz imaging capabilities of this\nconfocal imaging system for single nanoparticle tracking down to 20nm for gold\nand 50nm for silica particles as well as imaging freely moving Lactobacillus\nwith improved resolution.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:42:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ta","Duc-Minh","","XLIM-PHOT"],["Aguilar","Alberto","","XLIM-PHOT"],["Bon","Pierre","","XLIM-PHOT"]]}
{"id":"2308.15818","submitter":"Sunghan Kim","authors":"Sunghan Kim and Kaj Nystr\\\"om","title":"Higher order interpolative geometries and gradient regularity in\n  evolutionary obstacle problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We prove new optimal $C^{1,\\alpha}$ regularity results for obstacle problems\ninvolving evolutionary $p$-Laplace type operators in the degenerate regime $p >\n2$. Our main results include the optimal regularity improvement at free\nboundary points in intrinsic backward $p$-paraboloids, up to the critical\nexponent, $\\alpha \\leq 2/(p-2)$, and the optimal regularity across the free\nboundaries in the full cylinders up to a universal threshold. Moreover, we\nprovide an intrinsic criterion by which the optimal regularity improvement at\nfree boundaries can be extended to the entire cylinders. An important feature\nof our analysis is that we do not impose any assumption on the time derivative\nof the obstacle. Our results are formulated in function spaces associated to\nwhat we refer to as higher order or $C^{1,\\alpha}$ intrinsic interpolative\ngeometries.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:42:58 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kim","Sunghan",""],["Nystr\u00f6m","Kaj",""]]}
{"id":"2308.15819","submitter":"Tuukka Korhonen","authors":"Tuukka Korhonen, Matti J\\\"arvisalo","title":"SharpSAT-TD in Model Counting Competitions 2021-2023","comments":"3 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe SharpSAT-TD, our submission to the unweighted and weighted tracks\nof the Model Counting Competition in 2021-2023, which has won in total $6$\nfirst places in different tracks of the competition. SharpSAT-TD is based on\nSharpSAT [Thurley, SAT 2006], with the primary novel modification being the use\nof tree decompositions in the variable selection heuristic as introduced by the\nauthors in [CP 2021]. Unlike the version of SharpSAT-TD evaluated in [CP 2021],\nthe current version that is available in https://github.com/Laakeri/sharpsat-td\nfeatures also other significant modifications compared to the original\nSharpSAT, for example, a new preprocessor.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:43:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Korhonen","Tuukka",""],["J\u00e4rvisalo","Matti",""]]}
{"id":"2308.15820","submitter":"Yujia Tian","authors":"Yujia Tian (1 and 2), Devesh R. Kripalani (1), Ming Xue (2), Kun Zhou\n  (1) ((1) Nanyang Technological University, (2) Infineon Technologies Asia\n  Pacific Pte. Ltd.)","title":"Fermi level depinning via insertion of a graphene buffer layer at the\n  gold-2D tin monoxide contact","comments":"11 figures, published in 2D Materials","journal-ref":"2D Materials 10 (2023) 045015","doi":"10.1088/2053-1583/aceb05","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Two-dimensional (2D) tin monoxide (SnO) has attracted much attention owing to\nits distinctive electronic and optical properties, which render itself suitable\nas a channel material in field effect transistors (FETs). However, upon contact\nwith metals for such applications, the Fermi level pinning effect may occur,\nwhere states are induced in its band gap by the metal, hindering its intrinsic\nsemiconducting properties. We propose the insertion of graphene at the contact\ninterface to alleviate the metal-induced gap states. By using gold (Au) as the\nelectrode material and monolayer SnO (mSnO) as the channel material, the\ngeometry, bonding strength, charge transfer and tunnel barriers of charges, and\nelectronic properties including the work function, band structure, density of\nstates, and Schottky barriers are thoroughly investigated using\nfirst-principles calculations for the structures with and without graphene to\nreveal the contact behaviours and Fermi level depinning mechanism. It has been\ndemonstrated that strong covalent bonding is formed between gold and mSnO,\nwhile the graphene interlayer forms weak van der Waals interaction with both\nmaterials, which minimises the perturbance to the band structure of mSnO. The\neffects of out-of-plane compression are also analysed to assess the performance\nof the contact under mechanical deformation, and a feasible fabrication route\nfor the heterostructure with graphene is proposed. This work systematically\nexplores the properties of the Au-mSnO contact for applications in FETs and\nprovides thorough guidance for future exploitation of 2D materials in various\nelectronic applications and for selection of buffer layers to improve\nmetal-semiconductor contact.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:45:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Tian","Yujia","","1 and 2"],["Kripalani","Devesh R.",""],["Xue","Ming",""],["Zhou","Kun",""]]}
{"id":"2308.15821","submitter":"Yuxiang Fan","authors":"Hangyu Zhu, Yuxiang Fan, Zhenping Xie","title":"Federated Two Stage Decoupling With Adaptive Personalization Layers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning has gained significant attention due to its groundbreaking\nability to enable distributed learning while maintaining privacy constraints.\nHowever, as a consequence of data heterogeneity among decentralized devices, it\ninherently experiences significant learning degradation and slow convergence\nspeed. Therefore, it is natural to employ the concept of clustering homogeneous\nclients into the same group, allowing only the model weights within each group\nto be aggregated. While most existing clustered federated learning methods\nemploy either model gradients or inference outputs as metrics for client\npartitioning, with the goal of grouping similar devices together, may still\nhave heterogeneity within each cluster. Moreover, there is a scarcity of\nresearch exploring the underlying reasons for determining the appropriate\ntiming for clustering, resulting in the common practice of assigning each\nclient to its own individual cluster, particularly in the context of highly non\nindependent and identically distributed (Non-IID) data. In this paper, we\nintroduce a two-stage decoupling federated learning algorithm with adaptive\npersonalization layers named FedTSDP, where client clustering is performed\ntwice according to inference outputs and model weights, respectively. Hopkins\namended sampling is adopted to determine the appropriate timing for clustering\nand the sampling weight of public unlabeled data. In addition, a simple yet\neffective approach is developed to adaptively adjust the personalization layers\nbased on varying degrees of data skew. Experimental results show that our\nproposed method has reliable performance on both IID and non-IID scenarios.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:46:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhu","Hangyu",""],["Fan","Yuxiang",""],["Xie","Zhenping",""]]}
{"id":"2308.15822","submitter":"Sharun  Akter Khushbu","authors":"Md. Aiyub Ali, Md. Shakhawat Hossain, Md.Kawar Hossain, Subhadra Soumi\n  Sikder, Sharun Akter Khushbu, Mirajul Islam","title":"AMDNet23: A combined deep Contour-based Convolutional Neural Network and\n  Long Short Term Memory system to diagnose Age-related Macular Degeneration","comments":null,"journal-ref":null,"doi":null,"report-no":"ISWA-D-23-00333","categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In light of the expanding population, an automated framework of disease\ndetection can assist doctors in the diagnosis of ocular diseases, yields\naccurate, stable, rapid outcomes, and improves the success rate of early\ndetection. The work initially intended the enhancing the quality of fundus\nimages by employing an adaptive contrast enhancement algorithm (CLAHE) and\nGamma correction. In the preprocessing techniques, CLAHE elevates the local\ncontrast of the fundus image and gamma correction increases the intensity of\nrelevant features. This study operates on a AMDNet23 system of deep learning\nthat combined the neural networks made up of convolutions (CNN) and short-term\nand long-term memory (LSTM) to automatically detect aged macular degeneration\n(AMD) disease from fundus ophthalmology. In this mechanism, CNN is utilized for\nextracting features and LSTM is utilized to detect the extracted features. The\ndataset of this research is collected from multiple sources and afterward\napplied quality assessment techniques, 2000 experimental fundus images\nencompass four distinct classes equitably. The proposed hybrid deep AMDNet23\nmodel demonstrates to detection of AMD ocular disease and the experimental\nresult achieved an accuracy 96.50%, specificity 99.32%, sensitivity 96.5%, and\nF1-score 96.49.0%. The system achieves state-of-the-art findings on fundus\nimagery datasets to diagnose AMD ocular disease and findings effectively\npotential of our method.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:48:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ali","Md. Aiyub",""],["Hossain","Md. Shakhawat",""],["Hossain","Md. Kawar",""],["Sikder","Subhadra Soumi",""],["Khushbu","Sharun Akter",""],["Islam","Mirajul",""]]}
{"id":"2308.15823","submitter":"Jianghong Ma","authors":"Kangzhe Liu, Jianghong Ma, Shanshan Feng, Haijun Zhang, Zhao Zhang","title":"DRGame: Diversified Recommendation for Multi-category Video Games with\n  Balanced Implicit Preferences","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The growing popularity of subscription services in video game consumption has\nemphasized the importance of offering diversified recommendations. Providing\nusers with a diverse range of games is essential for ensuring continued\nengagement and fostering long-term subscriptions. However, existing\nrecommendation models face challenges in effectively handling highly imbalanced\nimplicit feedback in gaming interactions. Additionally, they struggle to take\ninto account the distinctive characteristics of multiple categories and the\nlatent user interests associated with these categories. In response to these\nchallenges, we propose a novel framework, named DRGame, to obtain diversified\nrecommendation. It is centered on multi-category video games, consisting of two\n{components}: Balance-driven Implicit Preferences Learning for data\npre-processing and Clustering-based Diversified Recommendation {Module} for\nfinal prediction. The first module aims to achieve a balanced representation of\nimplicit feedback in game time, thereby discovering a comprehensive view of\nplayer interests across different categories. The second module adopts\ncategory-aware representation learning to cluster and select players and games\nbased on balanced implicit preferences, and then employs asymmetric neighbor\naggregation to achieve diversified recommendations. Experimental results on a\nreal-world dataset demonstrate the superiority of our proposed method over\nexisting approaches in terms of game diversity recommendations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:53:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Kangzhe",""],["Ma","Jianghong",""],["Feng","Shanshan",""],["Zhang","Haijun",""],["Zhang","Zhao",""]]}
{"id":"2308.15824","submitter":"Steffen Pottel","authors":"S. Pottel and K. Sibold","title":"On the Perturbative Quantization of Einstein-Hilbert Gravity Embedded in\n  a Higher Derivative Model II","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a previous paper we presented the renormalization of Einstein-Hilbert\ngravity under inclusion of higher derivative terms and proposed a projection\ndown to the physical state space of Einstein-Hilbert. In the present paper we\ndescribe this procedure in more detail via decomposing the original double-pole\nfield $h^{\\mu\\nu}$ in the bilinear field sector into a massless and a massive\nspin two field. Those are associated with the poles at zero mass resp. at\nnon-zero mass of $h$ in the tree approximation. We show that the massive fields\nhave no poles in higher orders hence do not correspond to particles. The\n$S$-matrix becomes thus unitary. On the way to these results we derive\nfiniteness properties which are valid in the Landau gauge. Those simplify the\nrenormalization group analysis of the model considerably. We also establish a\nrigid Weyl identity which represents a proper substitute for a Callan-Symanzik\nequation in flat spacetime.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:54:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pottel","S.",""],["Sibold","K.",""]]}
{"id":"2308.15825","submitter":"Kotaro Yamasaki","authors":"K. Yamasaki, K. Okuda, J. Kono, A. Saito, D. Mori, R. Suzuki, Y.\n  Kambara, R. Hamada, S. Namba, K. Tomita, Y. Pan N. Tamura, C. Suzuki H. Okuno","title":"Development of the Thomson scattering measurement system for cascade arc\n  device with indirectly heated hollow cathode","comments":"8 pages, 6 figures, 20th International Symposium on Laser-Aided\n  Plasma Diagnostics (LAPD20)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have developed a Thomson scattering measurement system for the cascade arc\ndischarge device designed for the plasma window (PW) application study. The PW\nis one of the plasma application techniques that sustain the steep pressure\ngradient between high pressure (10-100 kPa) and a vacuum environment due to the\nthermal energy of the plasma. Since the plasma thermal energy is the essential\nparameter for the pressure separation capability of PW, we installed the\nThomson scattering measurement system to observe the electron density and\ntemperature within the anode and cathode of the PW for the detailed analysis of\nthe pressure separation capability. The frequency-doubled Nd:YAG laser (532 nm,\n200 mJ, 8 ns) was employed for the probe laser. The scattered light was fed to\nthe triple grating spectrometer. The notch filter between the first and second\ngrating eliminated the stray light, realizing a sufficiently high\nsignal-to-noise ratio. The Thomson scattering measurement system successfully\nobtained the electron density and temperature of the cascade arc plasma at 20\nmm downstream from the tip of the cathode. The installed system successfully\nobtained the Thomson scattering spectrum and showed that the electron density\nincreased from $2\\times10^{19} {\\rm m}^{-3}$ to $7\\times10^{19} {\\rm m}^{-3}$\nwith the discharge power, while the electron temperature was almost constant at\nabout 2 eV. The obtained data successfully contributed to the study of the\npressure separation capability of the PW.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 07:59:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yamasaki","K.",""],["Okuda","K.",""],["Kono","J.",""],["Saito","A.",""],["Mori","D.",""],["Suzuki","R.",""],["Kambara","Y.",""],["Hamada","R.",""],["Namba","S.",""],["Tomita","K.",""],["Tamura","Y. Pan N.",""],["Okuno","C. Suzuki H.",""]]}
{"id":"2308.15826","submitter":"Shengli Ma","authors":"Ji-kun Xie, Sheng-li Ma, Ya-long Ren, Shao-yan Gao, and Fu-li Li","title":"Chiral cavity-magnonic system for the unidirectional emission of a\n  tunable squeezed microwave field","comments":"to appear in Phys. Rev. A","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unidirectional photon emission is crucial for constructing quantum networks\nand realizing scalable quantum information processing. In the present work an\nefficient scheme is developed for the unidirectional emission of a tunable\nsqueezed microwave field. Our scheme is based on a chiral cavity magnonic\nsystem, where a magnon mode in a single-crystalline yttrium iron garnet (YIG)\nsphere is selectively coupled to one of the two degenerate rotating microwave\nmodes in a torus-shaped cavity with the same chirality. With the YIG sphere\ndriven by a two-color Floquet field to induce sidebands in the magnon-photon\ncoupling, we show that the unidirectional emission of a tunable squeezed\nmicrowave field can be generated via the assistance of the dissipative magnon\nmode and a waveguide. Moreover, the direction of the proposed one-way emitter\ncan be controlled on demand by reversing the biased magnetic field. Our work\nopens up an avenue to create and manipulate one-way nonclassical microwave\nradiation field and could find potential quantum technological applications.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:02:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xie","Ji-kun",""],["Ma","Sheng-li",""],["Ren","Ya-long",""],["Gao","Shao-yan",""],["Li","Fu-li",""]]}
{"id":"2308.15827","submitter":"Muhammad Gul Zain Ali Khan","authors":"Muhammad Gul Zain Ali Khan, Muhammad Ferjad Naeem, Luc Van Gool,\n  Didier Stricker, Federico Tombari, Muhammad Zeshan Afzal","title":"Introducing Language Guidance in Prompt-based Continual Learning","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Continual Learning aims to learn a single model on a sequence of tasks\nwithout having access to data from previous tasks. The biggest challenge in the\ndomain still remains catastrophic forgetting: a loss in performance on seen\nclasses of earlier tasks. Some existing methods rely on an expensive replay\nbuffer to store a chunk of data from previous tasks. This, while promising,\nbecomes expensive when the number of tasks becomes large or data can not be\nstored for privacy reasons. As an alternative, prompt-based methods have been\nproposed that store the task information in a learnable prompt pool. This\nprompt pool instructs a frozen image encoder on how to solve each task. While\nthe model faces a disjoint set of classes in each task in this setting, we\nargue that these classes can be encoded to the same embedding space of a\npre-trained language encoder. In this work, we propose Language Guidance for\nPrompt-based Continual Learning (LGCL) as a plug-in for prompt-based methods.\nLGCL is model agnostic and introduces language guidance at the task level in\nthe prompt pool and at the class level on the output feature of the vision\nencoder. We show with extensive experimentation that LGCL consistently improves\nthe performance of prompt-based continual learning methods to set a new\nstate-of-the art. LGCL achieves these performance improvements without needing\nany additional learnable parameters.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:03:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Khan","Muhammad Gul Zain Ali",""],["Naeem","Muhammad Ferjad",""],["Van Gool","Luc",""],["Stricker","Didier",""],["Tombari","Federico",""],["Afzal","Muhammad Zeshan",""]]}
{"id":"2308.15828","submitter":"Camiel Beckers","authors":"Camiel Beckers (1), Erik Hoedemaekers (1), Arda Dagkilic (2), Henk Jan\n  Bergveld (3 and 4) ((1) TNO - Powertrains Dept., (2) VDL Enabling Transport\n  Solutions, (3) Eindhoven University of Technology - Dept. of Electrical\n  Engineering, (4) NXP Semiconductors)","title":"Round-Trip Energy Efficiency and Energy-Efficiency Fade Estimation for\n  Battery Passport","comments":"6 pages, 5 figures, to be presented at VPPC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The battery passport is proposed as a method to make the use and remaining\nvalue of batteries more transparent. The future EU Battery Directive requests\nthis passport to contain the round-trip energy efficiency and its fade. In this\npaper, an algorithm is presented and demonstrated that estimates the round-trip\nenergy efficiency of a battery pack. The algorithm identifies round trips based\non battery current and SoC and characterizes these round trips based on certain\nconditions. 2D efficiency maps are created as a function of the conditions\n`temperature' and `RMS C-rate'. The maps are parameterized using multiple\nlinear regression, which allows comparison of the efficiency under the same\nconditions. Analyzing data from three battery-electric buses over a period of\n3.5 years reveals an efficiency fade of up to 0.86 percent point.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:05:58 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Beckers","Camiel","","3 and 4"],["Hoedemaekers","Erik","","3 and 4"],["Dagkilic","Arda","","3 and 4"],["Bergveld","Henk Jan","","3 and 4"]]}
{"id":"2308.15829","submitter":"Wadii Boulila Prof.","authors":"Wadii Boulila, Ayyub Alzahem, Anis Koubaa, Bilel Benjdira, Adel Ammar","title":"Early Detection of Red Palm Weevil Infestations using Deep Learning\n  Classification of Acoustic Signals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Red Palm Weevil (RPW), also known as the palm weevil, is considered among\nthe world's most damaging insect pests of palms. Current detection techniques\ninclude the detection of symptoms of RPW using visual or sound inspection and\nchemical detection of volatile signatures generated by infested palm trees.\nHowever, efficient detection of RPW diseases at an early stage is considered\none of the most challenging issues for cultivating date palms. In this paper,\nan efficient approach to the early detection of RPW is proposed. The proposed\napproach is based on RPW sound activities being recorded and analyzed. The\nfirst step involves the conversion of sound data into images based on a\nselected set of features. The second step involves the combination of images\nfrom the same sound file but computed by different features into a single\nimage. The third step involves the application of different Deep Learning (DL)\ntechniques to classify resulting images into two classes: infested and not\ninfested. Experimental results show good performances of the proposed approach\nfor RPW detection using different DL techniques, namely MobileNetV2,\nResNet50V2, ResNet152V2, VGG16, VGG19, DenseNet121, DenseNet201, Xception, and\nInceptionV3. The proposed approach outperformed existing techniques for public\ndatasets.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:09:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Boulila","Wadii",""],["Alzahem","Ayyub",""],["Koubaa","Anis",""],["Benjdira","Bilel",""],["Ammar","Adel",""]]}
{"id":"2308.15830","submitter":"Sang Pyo Kim","authors":"Chul Min Kim, Sang Pyo Kim","title":"Schwinger Pair Production and Vacuum Birefringence around High\n  Magnetized Neutron Stars","comments":"13 pages, 6 figures; Talk at the Fifth Zeldovich meeting, an\n  international conference in honor of Ya. B. Zeldovich held in Yerevan,\n  Armenia on June 12--16, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Highly magnetized neutron stars have magnetic fields of order of the critical\nfield and can lead to measurable QED effects. We consider the Goldreich-Julian\npulsar model with supercritical magnetic fields, induced subcritical electric\nfields, and a period of milliseconds. We then study the strong field physics,\nsuch as Schwinger pair production and the vacuum birefringence including the\nwrench effect, whose X-ray polarimetry will be observed in future space\nmissions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:11:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kim","Chul Min",""],["Kim","Sang Pyo",""]]}
{"id":"2308.15831","submitter":"Wei Wang","authors":"Shihong Zhan, Wei Wang","title":"A Dual-Zone Diffusion Model for High Energy Emissions of the Cygnus\n  Cocoon","comments":"7 pages, 5 figures, MNRAS in press","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As one of the brightest galactic ${\\gamma}$-ray sources, the Cygnus Cocoon\nsuperbubble has been observed by many detectors, such as $Fermi$-LAT, ARGO,\nHAWC, and LHAASO. However, the origin of $\\gamma$-ray emission for the Cygnus\nCocoon and the possible contribution to PeV cosmic rays are still under debate.\nThe recent ultrahigh-energy $\\gamma$-ray observations by LHAASO up to 1.4 PeV\ntowards the direction of the Cygnus Cocoon, as well as the neutrino event\nreport of IceCube-201120A coming from the same direction, suggest that the\nCygnus Cocoon may be one of the sources of high-energy cosmic rays in the\nGalaxy. In this work, we propose a dual-zone diffusion model for the Cygnus\nCocoon: the cocoon region and surrounding interstellar medium (ISM). This\nscenario can account for the $\\gamma$-ray data from GeV to $\\sim$ 50 TeV and\nagree with the one sub-PeV neutrino event result from IceCube so far. Moreover,\nit predict a non-negligible contribution $\\gamma$-ray emission at hundreds TeV\nfrom the ISM surrounding the Cygnus Cocoon. This possible diffuse TeV-PeV\ngamma-ray features can be resolved by the future LHAASO observations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:11:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhan","Shihong",""],["Wang","Wei",""]]}
{"id":"2308.15832","submitter":"Masashi Aiko","authors":"Masashi Aiko, Motoi Endo","title":"Higgs Probes of axion-like particles","comments":"25 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"KEK--TH--2548","categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study axion-like particle contributions to the Higgs boson decays. The\nparticle is assumed to couple with the standard model electroweak gauge bosons.\nAlthough direct productions of axion-like particles have often been discussed,\nwe investigate indirect contributions to the Higgs boson decays into fermions,\nphotons, $W$, and $Z$ bosons at the one-loop level. It is found that the\ncorrections to the fermions are suppressed, whereas precise measurements of the\ndi-photon channel of the Higgs boson decay can provide a significant probe of\nthe model especially when the axion-like particle is heavy and its coupling to\ndi-photon is suppressed.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:14:09 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Aiko","Masashi",""],["Endo","Motoi",""]]}
{"id":"2308.15833","submitter":"Zhen Zhang","authors":"Zhen Zhang and Hongrui Sun and Hui Sun","title":"Depth analysis of battery performance based on a data-driven approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Capacity attenuation is one of the most intractable issues in the current of\napplication of the cells. The disintegration mechanism is well known to be very\ncomplex across the system. It is a great challenge to fully comprehend this\nprocess and predict the process accurately. Thus, the machine learning (ML)\ntechnology is employed to predict the specific capacity change of the cell\nthroughout the cycle and grasp this intricate procedure. Different from the\nprevious work, according to the WOA-ELM model proposed in this work (R2 =\n0.9999871), the key factors affecting the specific capacity of the battery are\ndetermined, and the defects in the machine learning black box are overcome by\nthe interpretable model. Their connection with the structural damage of\nelectrode materials and battery failure during battery cycling is\ncomprehensively explained, revealing their essentiality to battery performance,\nwhich is conducive to superior research on contemporary batteries and\nmodification.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:15:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Zhen",""],["Sun","Hongrui",""],["Sun","Hui",""]]}
{"id":"2308.15834","submitter":"Anusree Rajan","authors":"Anusree Rajan, Harini V, Bharadwaj Amrutur, Pavankumar Tallapragada","title":"Event-Triggered Polynomial Control for Trajectory Tracking of Unicycle\n  Robots","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 proposes an event-triggered polynomial control method for\ntrajectory tracking of unicycle robots. In this control method, each control\ninput signal between two consecutive events is a polynomial. At each event, the\ncoefficients of the polynomial control input are chosen to minimize the error\nin approximating a continuous-time control signal. We design an\nevent-triggering rule that guarantees uniform ultimate boundedness of the\ntracking error. We ensure the absence of zeno behavior by showing the existence\nof a uniform positive lower bound on the inter-event times. We illustrate our\nresults through numerical simulations and experiments. We show that the number\nof events generated by the proposed controller is significantly less compared\nto a time-triggered controller and an event-triggered controller based on\nzero-order hold, while guaranteeing similar tracking performance.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:17:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rajan","Anusree",""],["V","Harini",""],["Amrutur","Bharadwaj",""],["Tallapragada","Pavankumar",""]]}
{"id":"2308.15835","submitter":"Gabriel Torralba Paz","authors":"Gabriel Torralba Paz, Artem Bohdan and Jacek Niemiec","title":"Prediction and Anomaly Detection of accelerated particles in PIC\n  simulations using neural networks","comments":"PoS(ICRC2023)341","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE physics.comp-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Acceleration processes that occur in astrophysical plasmas produce cosmic\nrays that are observed on Earth. To study particle acceleration, fully-kinetic\nparticle-in-cell (PIC) simulations are often used as they can unveil the\nmicrophysics of energization processes. Tracing of individual particles in PIC\nsimulations is particularly useful in this regard. However, by-eye inspection\nof particle trajectories includes a high level of bias and uncertainty in\npinpointing specific acceleration mechanisms that affect particles. Here we\npresent a new approach that uses neural networks to aid individual particle\ndata analysis. We demonstrate this approach on the test data that consists of\n252,000 electrons which have been traced in a PIC simulation of a\nnon-relativistic high Mach number perpendicular shock, in which we observe the\ntwo-stream electrostatic Buneman instability to pre-accelerate a portion of\nelectrons to nonthermal energies. We perform classification, regression and\nanomaly detection by using a Convolutional Neural Network. We show that\nregardless of how noisy and imbalanced the datasets are, the regression and\nclassification are able to predict the final energies of particles with high\naccuracy, whereas anomaly detection is able to discern between energetic and\nnon-energetic particles. The methodology proposed may considerably simplify\nparticle classification in large-scale PIC and also hybrid kinetic simulations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:19:53 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Paz","Gabriel Torralba",""],["Bohdan","Artem",""],["Niemiec","Jacek",""]]}
{"id":"2308.15836","submitter":"Mohammad Reza Tanhayi","authors":"F. Khorasani, Reza Pirmoradian and Mohammad Reza Tanhayi","title":"Complexity of Thermofield double state for a Harmonic Oscillator with an\n  External Field","comments":"18 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study the computational complexity of Gaussian states for a\nharmonic oscillator subjected to an external electric field. We use Nielsen's\ngeometric approach to obtain the so-called complexity of the thermofield double\nstate for a harmonic oscillator, and then by numerical analysis, we investigate\nthe effect of the appeared parameters on the complexity. Precisely, by\nnumerical analysis, we consider the effect of an external electric field on the\ndynamics of complexity. Our results indicate that turning on the electric field\nmay reduce the system's complexity.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:20:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Khorasani","F.",""],["Pirmoradian","Reza",""],["Tanhayi","Mohammad Reza",""]]}
{"id":"2308.15837","submitter":"Andrey Pravdivtsev","authors":"Danila A. Barskiy and Andrey Pravdivtsev","title":"Magnetization and Polarization of Coupled Nuclear Spin Ensembles","comments":"26 pages, 6 figures, and 5 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In magnetic resonance, the bulk magnetization of a sample that is being\nmeasured is typically defined as a quantity proportional to spin polarization.\nThe fact that all spins of the same type contribute equally to measurable\nsignals is considered obvious. By focusing on nuclear spin ensembles, we prove\nthe high-field theorem for a general case of spin-I: grouping of spins in\nmolecules does not affect the total measurable NMR signal given thermal\nequilibrium at high field ($\\hbar \\gamma B_0 \\gg |H_{int}|$, where $|H_{int}|$\nis the characteristic amplitude of internal spin-spin interactions). We\ndemonstrate this first by analyzing equations for spin magnetization and then\nfor a general case using the density matrix formalism. We exemplify the theorem\nimplications by predicting NMR signal intensities for ensembles of molecules\ncontaining single, two, and three spins. The theorem is not applied in more\nintricate situations, such as zero- to ultralow-field conditions and far from\nthermodynamic equilibrium. Considering the populations of rotation levels, the\nthermal equilibrium polarization at HF and low temperature for H2 gas\nillustrate one of the intricate cases.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:21:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Barskiy","Danila A.",""],["Pravdivtsev","Andrey",""]]}
{"id":"2308.15838","submitter":"Masaaki Takada","authors":"Masaaki Takada, Hironori Fujisawa","title":"Adaptive Lasso, Transfer Lasso, and Beyond: An Asymptotic Perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.ST stat.ME stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a comprehensive exploration of the theoretical properties\ninherent in the Adaptive Lasso and the Transfer Lasso. The Adaptive Lasso, a\nwell-established method, employs regularization divided by initial estimators\nand is characterized by asymptotic normality and variable selection\nconsistency. In contrast, the recently proposed Transfer Lasso employs\nregularization subtracted by initial estimators with the demonstrated capacity\nto curtail non-asymptotic estimation errors. A pivotal question thus emerges:\nGiven the distinct ways the Adaptive Lasso and the Transfer Lasso employ\ninitial estimators, what benefits or drawbacks does this disparity confer upon\neach method? This paper conducts a theoretical examination of the asymptotic\nproperties of the Transfer Lasso, thereby elucidating its differentiation from\nthe Adaptive Lasso. Informed by the findings of this analysis, we introduce a\nnovel method, one that amalgamates the strengths and compensates for the\nweaknesses of both methods. The paper concludes with validations of our theory\nand comparisons of the methods via simulation experiments.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:21:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Takada","Masaaki",""],["Fujisawa","Hironori",""]]}
{"id":"2308.15839","submitter":"Myungjin Shin","authors":"Myungjin Shin, Dohae Lee, In-Kwon Lee","title":"Utilizing Task-Generic Motion Prior to Recover Full-Body Motion from\n  Very Sparse Signals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The most popular type of devices used to track a user's posture in a virtual\nreality experience consists of a head-mounted display and two controllers held\nin both hands. However, due to the limited number of tracking sensors (three in\ntotal), faithfully recovering the user in full-body is challenging, limiting\nthe potential for interactions among simulated user avatars within the virtual\nworld. Therefore, recent studies have attempted to reconstruct full-body poses\nusing neural networks that utilize previously learned human poses or accept a\nseries of past poses over a short period. In this paper, we propose a method\nthat utilizes information from a neural motion prior to improve the accuracy of\nreconstructed user's motions. Our approach aims to reconstruct user's full-body\nposes by predicting the latent representation of the user's overall motion from\nlimited input signals and integrating this information with tracking sensor\ninputs. This is based on the premise that the ultimate goal of pose\nreconstruction is to reconstruct the motion, which is a series of poses. Our\nresults show that this integration enables more accurate reconstruction of the\nuser's full-body motion, particularly enhancing the robustness of lower body\nmotion reconstruction from impoverished signals. Web:\nhttps://https://mjsh34.github.io/mp-sspe/\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:21:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Shin","Myungjin",""],["Lee","Dohae",""],["Lee","In-Kwon",""]]}
{"id":"2308.15840","submitter":"Mingjie Qiu","authors":"Mingjie Qiu, Zhiyi Tan and Bing-kun Bao","title":"MSGNN: Multi-scale Spatio-temporal Graph Neural Network for Epidemic\n  Forecasting","comments":"29 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI physics.soc-ph q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Infectious disease forecasting has been a key focus and proved to be crucial\nin controlling epidemic. A recent trend is to develop forecast-ing models based\non graph neural networks (GNNs). However, existing GNN-based methods suffer\nfrom two key limitations: (1) Current models broaden receptive fields by\nscaling the depth of GNNs, which is insuffi-cient to preserve the semantics of\nlong-range connectivity between distant but epidemic related areas. (2)\nPrevious approaches model epidemics within single spatial scale, while ignoring\nthe multi-scale epidemic pat-terns derived from different scales. To address\nthese deficiencies, we devise the Multi-scale Spatio-temporal Graph Neural\nNetwork (MSGNN) based on an innovative multi-scale view. To be specific, in the\nproposed MSGNN model, we first devise a novel graph learning module, which\ndirectly captures long-range connectivity from trans-regional epidemic signals\nand integrates them into a multi-scale graph. Based on the learned multi-scale\ngraph, we utilize a newly designed graph convolution module to exploit\nmulti-scale epidemic patterns. This module allows us to facilitate multi-scale\nepidemic modeling by mining both scale-shared and scale-specific pat-terns.\nExperimental results on forecasting new cases of COVID-19 in United State\ndemonstrate the superiority of our method over state-of-arts. Further analyses\nand visualization also show that MSGNN offers not only accurate, but also\nrobust and interpretable forecasting result.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:21:56 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Qiu","Mingjie",""],["Tan","Zhiyi",""],["Bao","Bing-kun",""]]}
{"id":"2308.15841","submitter":"Johannes Zirngibl","authors":"Johannes Zirngibl, Florian Gebauer, Patrick Sattler, Markus Sosnowski,\n  Georg Carle","title":"QUIC Library Hunter: Identifying Server Libraries Across the Internet","comments":"preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The new QUIC protocol can be implemented in user space, and various\nimplementations already exist. While they follow the same specification and\ngeneral interoperability is given, differences in performance, functionality,\nbut also security (e.g., due to bugs) can be expected. Therefore, knowledge\nabout the implementation of an endpoint on the Internet can help researchers,\noperators and users to better analyze connections, evaluations and findings.\n  We provide an approach to identify used libraries of QUIC servers based on\nCONNECTION_CLOSE frames and transport parameter orders. We apply our\nmethodology to Internet-wide scans and identify at least one deployment for 18\nQUIC libraries. In total, we can identify the library of 8.8 M IPv4 and 2.5 M\nIPv6 addresses.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:22:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zirngibl","Johannes",""],["Gebauer","Florian",""],["Sattler","Patrick",""],["Sosnowski","Markus",""],["Carle","Georg",""]]}
{"id":"2308.15842","submitter":"Sujoy Bhore","authors":"Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore","title":"On Colorful Vertex and Edge Cover Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study two generalizations of Vertex Cover and Edge Cover,\nnamely Colorful Vertex Cover and Colorful Edge Cover. In the Colorful Vertex\nCover problem, given an $n$-vertex edge-colored graph $G$ with colors from\n$\\{1, \\ldots, \\omega\\}$ and coverage requirements $r_1, r_2, \\ldots, r_\\omega$,\nthe goal is to find a minimum-sized set of vertices that are incident on at\nleast $r_i$ edges of color $i$, for each $1 \\le i \\le \\omega$, i.e., we need to\ncover at least $r_i$ edges of color $i$. Colorful Edge Cover is similar to\nColorful Vertex Cover, except here we are given a vertex-colored graph and the\ngoal is to cover at least $r_i$ vertices of color $i$, for each $1 \\le i \\le\n\\omega$, by a minimum-sized set of edges. These problems have several\napplications in fair covering and hitting of geometric set systems involving\npoints and lines that are divided into multiple groups. Here, fairness ensures\nthat the coverage (resp. hitting) requirement of every group is fully\nsatisfied.\n  We obtain a $(2+\\epsilon)$-approximation for the Colorful Vertex Cover\nproblem in time $n^{O(\\omega/\\epsilon)}$. Thus, for a constant number of\ncolors, the problem admits a $(2+\\epsilon)$-approximation in polynomial time.\nNext, for the Colorful Edge Cover problem, we design an $O(\\omega n^3)$ time\nexact algorithm, via a chain of reductions to a matching problem. For all\nintermediate problems in this chain of reductions, we design polynomial-time\nalgorithms, which might be of independent interest.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:27:09 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bandyapadhyay","Sayan",""],["Banik","Aritra",""],["Bhore","Sujoy",""]]}
{"id":"2308.15843","submitter":"Etido Inyang","authors":"M. Abu-Shady, E. Omugbe and E.P. Inyang","title":"Approximate Bound State Solutions of the Fractional Schr\\\"odinger\n  Equation under the Spin-Spin-Dependent Cornell Potential","comments":"16 pages,2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, the approximate bound state solutions of the fractional\nSchr\\\"odinger equation under a spin-spin-dependent Cornell potential are\nobtained via the convectional Nikiforov-Uvarov approach. The energy spectra are\napplied to obtain the mass spectra of the heavy mesons such as bottomonium,\ncharmonium and bottom-charm. The masses for the singlet and triplet spin\nnumbers increase as the quantum numbers increase. The fractional Schr\\\"odinger\nequation improves the mass spectra compared to the masses obtained in the\nexisting literature. The bottomonium masses agree with the experimental data of\nthe Particle Data Group where percentage errors for fractional parameters of\n\\b{eta}=1,{\\alpha}=0.97 and \\b{eta}=1,{\\alpha}=0.50 were found to be 0.67% and\n0.49% respectively. The respective percentage errors of 1.97% and 1.62% for\nfractional parameters of \\b{eta}=1,{\\alpha}=0.97 and \\b{eta}=1,{\\alpha}=0.50\nwere obtained for charmonium meson. The results indicate that the potential\ncurves coupled with the fractional parameters account for the short-range gluon\nexchange between the quark-antiquark interactions and the linear confinement\nphenomena which is associated with the quantum chromo-dynamic and\nphenomenological potential models in particle and high-energy physics\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:28:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Abu-Shady","M.",""],["Omugbe","E.",""],["Inyang","E. P.",""]]}
{"id":"2308.15844","submitter":"Yangang Wang","authors":"Buzhen Huang, Jingyi Ju, Zhihao Li and Yangang Wang","title":"Reconstructing Groups of People with Hypergraph Relational Reasoning","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":"  Due to the mutual occlusion, severe scale variation, and complex spatial\ndistribution, the current multi-person mesh recovery methods cannot produce\naccurate absolute body poses and shapes in large-scale crowded scenes. To\naddress the obstacles, we fully exploit crowd features for reconstructing\ngroups of people from a monocular image. A novel hypergraph relational\nreasoning network is proposed to formulate the complex and high-order relation\ncorrelations among individuals and groups in the crowd. We first extract\ncompact human features and location information from the original\nhigh-resolution image. By conducting the relational reasoning on the extracted\nindividual features, the underlying crowd collectiveness and interaction\nrelationship can provide additional group information for the reconstruction.\nFinally, the updated individual features and the localization information are\nused to regress human meshes in camera coordinates. To facilitate the network\ntraining, we further build pseudo ground-truth on two crowd datasets, which may\nalso promote future research on pose estimation and human behavior\nunderstanding in crowded scenes. The experimental results show that our\napproach outperforms other baseline methods both in crowded and common\nscenarios. The code and datasets are publicly available at\nhttps://github.com/boycehbz/GroupRec.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:31:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Huang","Buzhen",""],["Ju","Jingyi",""],["Li","Zhihao",""],["Wang","Yangang",""]]}
{"id":"2308.15845","submitter":"Flavien MABILAT","authors":"Flavien Mabilat (LMR)","title":"A dense subset of $M\\_{n}(\\mathbb{R})$ containing diagonalizable\n  matrices","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 note, we consider matrices similar to $X$-form matrices, which are\nthe matrices for which only the diagonal and the anti-diagonal elements can be\ndifferent from zero. First, we give a characterization of these matrices using\nthe minimal polynomial. Then, we prove that the set of matrices similar to\n$X$-form matrices over $\\mathbb{R}$ and $\\mathbb{C}$ are dense and we give a\ncharacterization of the interior of this set.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:32:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mabilat","Flavien","","LMR"]]}
{"id":"2308.15846","submitter":"Yifan Xu","authors":"Yifan Xu, Mengdan Zhang, Xiaoshan Yang, Changsheng Xu","title":"Exploring Multi-Modal Contextual Knowledge for Open-Vocabulary Object\n  Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we for the first time explore helpful multi-modal contextual\nknowledge to understand novel categories for open-vocabulary object detection\n(OVD). The multi-modal contextual knowledge stands for the joint relationship\nacross regions and words. However, it is challenging to incorporate such\nmulti-modal contextual knowledge into OVD. The reason is that previous\ndetection frameworks fail to jointly model multi-modal contextual knowledge, as\nobject detectors only support vision inputs and no caption description is\nprovided at test time. To this end, we propose a multi-modal contextual\nknowledge distillation framework, MMC-Det, to transfer the learned contextual\nknowledge from a teacher fusion transformer with diverse multi-modal masked\nlanguage modeling (D-MLM) to a student detector. The diverse multi-modal masked\nlanguage modeling is realized by an object divergence constraint upon\ntraditional multi-modal masked language modeling (MLM), in order to extract\nfine-grained region-level visual contexts, which are vital to object detection.\nExtensive experiments performed upon various detection datasets show the\neffectiveness of our multi-modal context learning strategy, where our approach\nwell outperforms the recent state-of-the-art methods.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:33:13 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xu","Yifan",""],["Zhang","Mengdan",""],["Yang","Xiaoshan",""],["Xu","Changsheng",""]]}
{"id":"2308.15847","submitter":"Daniel Russo","authors":"Daniel Russo","title":"Pandemic Pedagogy: Evaluating Remote Education Strategies during\n  COVID-19","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The COVID-19 pandemic precipitated an abrupt shift in the educational\nlandscape, compelling universities to transition from in-person to online\ninstruction. This sudden shift left many university instructors grappling with\nthe intricacies of remote teaching. Now, with the pandemic behind us, we\npresent a retrospective study aimed at understanding and evaluating the remote\nteaching practices employed during that period. Drawing from a cross-sectional\nanalysis of 300 computer science students who underwent a full year of online\neducation during the lockdown, our findings indicate that while remote teaching\npractices moderately influenced students' learning outcomes, they had a\npronounced positive impact on student satisfaction. Remarkably, these outcomes\nwere consistent across various demographics, including country, gender, and\neducational level. As we reflect on the lessons from this global event, this\nresearch offers evidence-based recommendations that could inform educational\nstrategies in unwelcoming future scenarios of a similar nature, ensuring both\nstudent satisfaction and effective learning outcomes in online settings.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:34:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Russo","Daniel",""]]}
{"id":"2308.15848","submitter":"Flavien MABILAT","authors":"Flavien Mabilat (LMR)","title":"$\\lambda$-quiddit{\\'e}s sur des produits directs d'anneaux","comments":"in French language","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aim of this article is to continue the study of the notion of\n$\\lambda$-quiddity over a ring, which appeared during the study of Coxeter's\nfriezes. For this, we will focus here on situations where the ring used can be\nseen as a direct product of unitary commutative rings. In particular, we will\nconsider the cases of direct products of rings containing at least two rings of\ncharacteristic 0 and we will also consider some products of the type\n$\\mathbb{Z}/n\\mathbb{Z} \\times \\mathbb{Z}/m\\mathbb{Z}$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:34:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mabilat","Flavien","","LMR"]]}
{"id":"2308.15849","submitter":"Quan-Feng Wu","authors":"Quan-feng Wu and Xun-Jie Xu","title":"Shedding light on neutrino self-interactions with solar antineutrino\n  searches","comments":"18 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO astro-ph.HE astro-ph.SR hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Solar antineutrinos are absent in the standard solar model prediction.\nConsequently, solar antineutrino searches emerge as a powerful tool to probe\nnew physics capable of converting neutrinos into antineutrinos. In this study,\nwe highlight that neutrino self-interactions, recently gaining considerable\nattention due to their cosmological and astrophysical implications, can lead to\nsignificant solar antineutrino production. We systematically explore various\ntypes of four-fermion effective operators and light scalar mediators for\nneutrino self-interactions. By estimating the energy spectra and event rates of\nsolar antineutrinos at prospective neutrino detectors such as JUNO,\nHyper-Kamiokande, and THEIA, we reveal that solar antineutrino searches can\nimpose stringent constraints on neutrino self-interactions and probe the\nparameter space favored by the Hubble tension.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:35:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wu","Quan-feng",""],["Xu","Xun-Jie",""]]}
{"id":"2308.15850","submitter":"Yong Wang","authors":"Tong Wu, Yong Wang","title":"A general Dabrowski-Sitarz-Zalecki type theorems for manifold with\n  boundary","comments":"arXiv admin note: substantial text overlap with arXiv:2212.12182,\n  arXiv:2204.11021, arXiv:2111.15034, arXiv:2304.00523","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In [17], we obtained the spectral Einstein functional associated with the\nDirac operator for n-dimensional manifolds without boundary. In this paper, we\ngive the proof of general Dabrowski-Sitarz-Zalecki type theorems for the\nspectral Einstein functional associated with the Dirac operator on even and odd\ndimensional manifolds with boundary.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:35:10 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wu","Tong",""],["Wang","Yong",""]]}
{"id":"2308.15851","submitter":"Yang Zhou","authors":"Yang Zhou, Pengfei Cao, Yubo Chen, Kang Liu, Jun Zhao","title":"Prompting Vision Language Model with Knowledge from Large Language Model\n  for Knowledge-Based VQA","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Knowledge-based visual question answering is a very challenging and widely\nconcerned task. Previous methods adopts the implicit knowledge in large\nlanguage models (LLM) to achieve excellent results, but we argue that existing\nmethods may suffer from biasing understanding of the image and insufficient\nknowledge to solve the problem. In this paper, we propose PROOFREAD -PROmpting\nvision language model with knOwledge From laRgE lAnguage moDel, a novel,\nlightweight and efficient kowledge-based VQA framework, which make the vision\nlanguage model and the large language model cooperate to give full play to\ntheir respective strengths and bootstrap each other. In detail, our proposed\nmethod uses LLM to obtain knowledge explicitly, uses the vision language model\nwhich can see the image to get the knowledge answer, and introduces knowledge\nperceiver to filter out knowledge that is harmful for getting the correct final\nanswer. Experimental results on two datasets prove the effectiveness of our\napproach. Our method outperforms all state-of-the-art methods on the A-OKVQA\ndataset in two settings and also achieves relatively good performance on the\nOKVQA dataset.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:35:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhou","Yang",""],["Cao","Pengfei",""],["Chen","Yubo",""],["Liu","Kang",""],["Zhao","Jun",""]]}
{"id":"2308.15852","submitter":"Daria de Tinguy","authors":"Daria de Tinguy, Sven Remmery, Pietro Mazzaglia, Tim Verbelen, Bart\n  Dhoedt","title":"Learning to Navigate from Scratch using World Models and Curiosity: the\n  Good, the Bad, and the Ugly","comments":"IROS 2023 workshop World Models and Predictive Coding in Cognitive\n  Robotics","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning to navigate unknown environments from scratch is a challenging\nproblem. This work presents a system that integrates world models with\ncuriosity-driven exploration for autonomous navigation in new environments. We\nevaluate performance through simulations and real-world experiments of varying\nscales and complexities. In simulated environments, the approach rapidly and\ncomprehensively explores the surroundings. Real-world scenarios introduce\nadditional challenges. Despite demonstrating promise in a small controlled\nenvironment, we acknowledge that larger and dynamic environments can pose\nchallenges for the current system. Our analysis emphasizes the significance of\ndeveloping adaptable and robust world models that can handle environmental\nchanges to prevent repetitive exploration of the same areas.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:38:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["de Tinguy","Daria",""],["Remmery","Sven",""],["Mazzaglia","Pietro",""],["Verbelen","Tim",""],["Dhoedt","Bart",""]]}
{"id":"2308.15853","submitter":"Xuding Zhu","authors":"Huan Zhou and Jialu Zhu and Xuding Zhu","title":"Weak$^*$ degeneracy and weak$^*$ $k$-truncated-degree-degenerate graphs","comments":"19 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces the concept of weak$^*$ degeneracy of a graph that\nshares many nice properties of degeneracy.\n  We prove that for any $f: V(G) \\to \\mathbb{N}$, if $G$ is weak$^*$\n$f$-degenerate, then $G$ is DP-$f$-paintable and $f$-AT. Hence the weak$^*$\ndegeneracy of $G$ is an upper bound for many colouring parameters, including\nthe online DP-chromatic number and the Alon-Tarsi number. Let $k$ be a positive\ninteger and let $f(v)=\\min\\{d_G(v), k\\}$ for each vertex $v$ of $G$. If $G$ is\nweak$^*$ $f$-degenerate (respectively, $f$-choosable), then we say $G$ is\nweak$^*$ $k$-truncated-degree--degenerate (respectively,\n$k$-truncated-degree-choosable). Richtor asked whether every 3-connected\nnon-complete planar graph is $6$-truncated-degree-choosable. We construct a\n3-connected non-complete planar graph which is not\n$7$-truncated-degree-choosable, so the answer to Richtor's question is negative\neven if 6 is replaced by 7. Then we prove that every 3-connected non-complete\nplanar graph is weak$^*$ $16$-truncated-degree-degenerate (and hence\n$16$-truncated-degree-choosable). For an arbitrary proper minor closed family\n${\\mathcal G}$ of graphs, let $s$ be the minimum integer such that $K_{s,t}\n\\notin \\mathcal{G}$ for some $t$. We prove that there is a constant $k$ such\nthat every $s$-connected non-complete graph $G \\in {\\mathcal G}$ is weak$^*$\n$k$-truncated-degree-degenerate.\n  In particular, for any surface $\\Sigma$, there is a constant $k$ such that\nevery 3-connected non-complete graph embeddable on $\\Sigma$ is weak$^*$\n$k$-truncated-degree-degenerate.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:39:13 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhou","Huan",""],["Zhu","Jialu",""],["Zhu","Xuding",""]]}
{"id":"2308.15854","submitter":"Zhanbo Feng","authors":"Zhanbo Feng, Zenan Ling, Ci Gong, Feng Zhou, Jie Li, Robert C. Qiu","title":"Zero-shot Inversion Process for Image Attribute Editing with Diffusion\n  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":"  Denoising diffusion models have shown outstanding performance in image\nediting. Existing works tend to use either image-guided methods, which provide\na visual reference but lack control over semantic coherence, or text-guided\nmethods, which ensure faithfulness to text guidance but lack visual quality. To\naddress the problem, we propose the Zero-shot Inversion Process (ZIP), a\nframework that injects a fusion of generated visual reference and text guidance\ninto the semantic latent space of a \\textit{frozen} pre-trained diffusion\nmodel. Only using a tiny neural network, the proposed ZIP produces diverse\ncontent and attributes under the intuitive control of the text prompt.\nMoreover, ZIP shows remarkable robustness for both in-domain and out-of-domain\nattribute manipulation on real images. We perform detailed experiments on\nvarious benchmark datasets. Compared to state-of-the-art methods, ZIP produces\nimages of equivalent quality while providing a realistic editing effect.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:40:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Feng","Zhanbo",""],["Ling","Zenan",""],["Gong","Ci",""],["Zhou","Feng",""],["Li","Jie",""],["Qiu","Robert C.",""]]}
{"id":"2308.15855","submitter":"Weifu Fu","authors":"Weifu Fu, Qiang Nie, Jialin Li, Yuhuan Lin, Kai Wu, Yong Liu, Chengjie\n  Wang","title":"Semi-supervised Domain Adaptation with Inter and Intra-domain Mixing for\n  Semantic Segmentation","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite recent advances in semantic segmentation, an inevitable challenge is\nthe performance degradation caused by the domain shift in real application.\nCurrent dominant approach to solve this problem is unsupervised domain\nadaptation (UDA). However, the absence of labeled target data in UDA is overly\nrestrictive and limits performance. To overcome this limitation, a more\npractical scenario called semi-supervised domain adaptation (SSDA) has been\nproposed. Existing SSDA methods are derived from the UDA paradigm and primarily\nfocus on leveraging the unlabeled target data and source data. In this paper,\nwe highlight the significance of exploiting the intra-domain information\nbetween the limited labeled target data and unlabeled target data, as it\ngreatly benefits domain adaptation. Instead of solely using the scarce labeled\ndata for supervision, we propose a novel SSDA framework that incorporates both\ninter-domain mixing and intra-domain mixing, where inter-domain mixing\nmitigates the source-target domain gap and intra-domain mixing enriches the\navailable target domain information. By simultaneously learning from\ninter-domain mixing and intra-domain mixing, the network can capture more\ndomain-invariant features and promote its performance on the target domain. We\nalso explore different domain mixing operations to better exploit the target\ndomain information. Comprehensive experiments conducted on the GTA5toCityscapes\nand SYNTHIA2Cityscapes benchmarks demonstrate the effectiveness of our method,\nsurpassing previous methods by a large margin.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:44:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fu","Weifu",""],["Nie","Qiang",""],["Li","Jialin",""],["Lin","Yuhuan",""],["Wu","Kai",""],["Liu","Yong",""],["Wang","Chengjie",""]]}
{"id":"2308.15856","submitter":"Ozan Sener","authors":"Ozan Sener and Vladlen Koltun","title":"Domain Generalization without Excess Empirical Risk","comments":"Published at NeurIPS 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given data from diverse sets of distinct distributions, domain generalization\naims to learn models that generalize to unseen distributions. A common approach\nis designing a data-driven surrogate penalty to capture generalization and\nminimize the empirical risk jointly with the penalty. We argue that a\nsignificant failure mode of this recipe is an excess risk due to an erroneous\npenalty or hardness in joint optimization. We present an approach that\neliminates this problem. Instead of jointly minimizing empirical risk with the\npenalty, we minimize the penalty under the constraint of optimality of the\nempirical risk. This change guarantees that the domain generalization penalty\ncannot impair optimization of the empirical risk, i.e., in-distribution\nperformance. To solve the proposed optimization problem, we demonstrate an\nexciting connection to rate-distortion theory and utilize its tools to design\nan efficient method. Our approach can be applied to any penalty-based domain\ngeneralization method, and we demonstrate its effectiveness by applying it to\nthree examplar methods from the literature, showing significant improvements.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:46:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sener","Ozan",""],["Koltun","Vladlen",""]]}
{"id":"2308.15857","submitter":"Lucie Pepe","authors":"Lucie Pepe, Vincent Pouthier, Saad Yalouz","title":"Optimized excitonic transport mediated by local energy defects: survival\n  of optimization laws in the presence of dephasing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In an extended star with peripheral defects and a core occupied by a trap, it\nhas been shown that exciton-mediated energy transport from the periphery to the\ncore can be optimized [S. Yalouz et al. Phys. Rev. E 106, 064313 (2022)]. If\nthe defects are judiciously chosen, the exciton dynamics is isomorphic to that\nof an asymmetric chain and a speedup of the excitonic propagation is observed.\nHere, we extend this previous work by considering that the exciton in both an\nextended star and an asymmetric chain, is perturbed by the presence of a\ndephasing environment. Simulating the dynamics using a Lindblad master\nequation, two questions are addressed: how does the environment affect the\nenergy transport on these two networks? And, do the two systems still behave\nequivalently in the presence of dephasing? Our results reveal that the\ntime-scale for the exciton dynamics strongly depends on the nature of the\nnetwork. But quite surprisingly, the two networks behave similarly regarding\nthe survival of their optimization law. In both cases, the energy transport can\nbe improved using the same original optimal tuning of energy defects as long as\nthe dephasing remains weak. However, for moderate/strong dephasing, the\noptimization law is lost due to quantum Zeno effect.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:47:30 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 13:49:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pepe","Lucie",""],["Pouthier","Vincent",""],["Yalouz","Saad",""]]}
{"id":"2308.15858","submitter":"Thibaut Delcroix","authors":"Thibaut Delcroix, Pierre-Louis Montagard","title":"Spherical actions on locally factorial Fano varieties of dimension $\\leq\n  4$ and rank $\\leq 2$","comments":"65 pages including two big tables and more than 200 polytopes.\n  Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain the exhaustive list of 337 faithful spherical actions of rank two\nor less on locally factorial Fano manifolds of dimension four or less. As a\npreliminary step, we determine the explicit list of spherical homogeneous\nspaces of dimension four or less, together with their combinatorial data. Then\nwe classify the possible locally factorial $G/H$-reflexive polytopes for each\nsuch spherical homogeneous space $G/H$. From the combinatorial data gathered in\nthis article, one can easily read off the Picard rank (even the Picard group),\nFano index, anticanonical volume of the underlying locally factorial Fano\nvariety, etc.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:47:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Delcroix","Thibaut",""],["Montagard","Pierre-Louis",""]]}
{"id":"2308.15859","submitter":"Samira Rezaei","authors":"S. Rezaei, J. P. McKean, A. T. Deller and J. F. Radcliffe","title":"On the source counts of VLBI-detected radio sources and the prospects of\n  all-sky surveys with current and next generation instruments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an analysis of the detection fraction and the number counts of\nradio sources imaged with Very Long Baseline Interferometry (VLBI) at 1.4 GHz\nas part of the mJIVE-20 survey. From a sample of 24,903 radio sources\nidentified by FIRST, 4,965 are detected on VLBI-scales, giving an overall\ndetection fraction of $19.9\\pm2.9~$per cent. However, we find that the\ndetection fraction falls from around 50 per cent at a peak surface brightness\nof $80~mJy~beam^{-1}$ in FIRST to around 8 per cent at the detection limit,\nwhich is likely dominated by the surface brightness sensitivity of the VLBI\nobservations, with some contribution from a change in the radio source\npopulation. We also find that compactness at arcsec-scales is the dominant\nfactor in determining whether a radio source is detected with VLBI, and that\nthe median size of the VLBI-detected radio sources is 7.7 mas. After correcting\nfor the survey completeness and effective sky area, we determine the slope of\nthe differential number counts of VLBI-detected radio sources with flux\ndensities $S_{\\rm 1.4~GHz} > 1~mJy$ to be $\\eta_{\\rm VLBI} = -1.74\\pm 0.02$,\nwhich is shallower than in the cases of the FIRST parent population ($\\eta_{\\rm\nFIRST} = -1.77\\pm 0.02$) and for compact radio sources selected at higher\nfrequencies ($\\eta_{\\rm JBF} = -2.06\\pm 0.02$). From this, we find that all-sky\n($3\\pi~sr$) surveys with the EVN and the VLBA have the potential to detect\n$(7.2\\pm0.9)\\times10^{5}$ radio sources at mas-resolution, and that the density\nof compact radio sources is sufficient (5.3~deg$^{-2}$) for in-beam phase\nreferencing with multiple sources (3.9 per primary beam) in the case of a\nhypothetical SKA-VLBI array.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:47:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rezaei","S.",""],["McKean","J. P.",""],["Deller","A. T.",""],["Radcliffe","J. F.",""]]}
{"id":"2308.15860","submitter":"Qi Liu","authors":"Qi Liu and Xiyu Tang and Ju Huo","title":"Research on Image Stitching Based on Invariant Features of Reconstructed\n  Plane","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generating high-quality stitched images is a challenging task in computer\nvision. The existing feature-based image stitching methods commonly only focus\non point and line features, neglecting the crucial role of higher-level planar\nfeatures in image stitching. This paper proposes an image stitching method\nbased on invariant planar features, which uses planar features as constraints\nto improve the overall effect of natural image stitching. Initially, our\napproach expands the quantity of matched feature points and lines through\nstraight-line procedures, advancing alignment quality and reducing artifacts in\noverlapping areas. Then, uncertain planes are described by known matching\npoints and matching lines, and plane features are introduced to preserve energy\nitems, which improves the overall appearance of stitched images while reducing\ndistortion and guarantees a more natural stitched image. Furthermore, to\ndemonstrate the superiority of our approach, we also propose several evaluation\nindexes related to planar features to quantify the detailed changes of planar\nfeatures. An extensive set of experiments validates the effectiveness of our\napproach in stitching natural images with a larger field of view. Compared with\nthe most advanced methods, our method retains the texture and structure of the\nimage better, and produces less unnatural distortion. Multiple quantitative\nevaluations illustrate that our approach outperforms existing methods with\nsignificant improvements, further validating the effectiveness and superiority\nof our proposed method.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:50:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Qi",""],["Tang","Xiyu",""],["Huo","Ju",""]]}
{"id":"2308.15861","submitter":"Zekai Hong","authors":"Zhengjiang Li and Zekai Hong","title":"Islands on codim-2 branes in Gauss-Bonnet Gravity","comments":"18 pages,6 figurs","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the black hole information problem on codim-2 branes in Gauss-Bonnet\ngravity. Thanks to the island surface ending on the brane, the Page curve of\neternal black holes can be recovered for all of the GB couplings within the\ncausal constraints. Our results strongly support the universality of the island\nmechanism. Similar to Einstein's gravity, the HM surface can exist only in a\nfinite time in GB gravity. Remarkably, for various parameters, the maximum\ntimes of HM surface are always larger than the Page times. As a result, the\nstrange behavior of HM surfaces does not affect the Page curves for general GB\ngravity. Finally, we find that the Page time increases with the GB couplings\nand the brane tension.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:53:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Zhengjiang",""],["Hong","Zekai",""]]}
{"id":"2308.15862","submitter":"EPTCS","authors":"Peter Baumgartner (Data61/CSIRO), Elena Tartaglia (Data61/CSIRO)","title":"Bottom-Up Stratified Probabilistic Logic Programming with Fusemate","comments":"In Proceedings ICLP 2023, arXiv:2308.14898. A full version of this\n  paper, containing all proofs, appears at arXiv:2305.18924","journal-ref":"EPTCS 385, 2023, pp. 87-100","doi":"10.4204/EPTCS.385.11","report-no":null,"categories":"cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces the Fusemate probabilistic logic programming system.\nFusemate's inference engine comprises a grounding component and a variable\nelimination method for probabilistic inference. Fusemate differs from most\nother systems by grounding the program in a bottom-up way instead of the common\ntop-down way. While bottom-up grounding is attractive for a number of reasons,\ne.g., for dynamically creating distributions of varying support sizes, it makes\nit harder to control the amount of ground clauses generated. We address this\nproblem by interleaving grounding with a query-guided relevance test which\nprunes rules whose bodies are inconsistent with the query. % This is done We\npresent our method in detail and demonstrate it with examples that involve\n\"time\", such as (hidden) Markov models. Our experiments demonstrate competitive\nor better performance compared to a state-of-the art probabilistic logic\nprogramming system, in particular for high branching problems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:54:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Baumgartner","Peter","","Data61/CSIRO"],["Tartaglia","Elena","","Data61/CSIRO"]]}
{"id":"2308.15863","submitter":"EPTCS","authors":"Richard Comploi-Taupe (Siemens AG \\\"Osterreich, Vienna, Austria)","title":"Inductive Learning of Declarative Domain-Specific Heuristics for ASP","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 129-140","doi":"10.4204/EPTCS.385.14","report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Domain-specific heuristics are a crucial technique for the efficient solving\nof problems that are large or computationally hard. Answer Set Programming\n(ASP) systems support declarative specifications of domain-specific heuristics\nto improve solving performance. However, such heuristics must be invented\nmanually so far. Inventing domain-specific heuristics for answer-set programs\nrequires expertise with the domain under consideration and familiarity with ASP\nsyntax, semantics, and solving technology. The process of inventing useful\nheuristics would highly profit from automatic support. This paper presents a\nnovel approach to the automatic learning of such heuristics. We use Inductive\nLogic Programming (ILP) to learn declarative domain-specific heuristics from\nexamples stemming from (near-)optimal answer sets of small but representative\nproblem instances. Our experimental results indicate that the learned\nheuristics can improve solving performance and solution quality when solving\nlarger, harder instances of the same problem.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:55:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Comploi-Taupe","Richard","","Siemens AG \u00d6sterreich, Vienna, Austria"]]}
{"id":"2308.15864","submitter":"Grace Qiyuan Miao","authors":"Grace Qiyuan Miao, Rick Dale and Alexia Galati","title":"(Mis)align: A Simple Dynamic Framework for Modeling Interpersonal\n  Coordination","comments":"Code and data necessary to reproduce findings in this article can be\n  found at the following GitHub repository:\n  https://github.com/miaoqy0729/sim-syn-sims","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As people coordinate in daily interactions, they engage in different patterns\nof behavior to achieve successful outcomes. This includes both synchrony - the\ntemporal coordination of the same behaviors at the same time - and\ncomplementarity - the coordination of the same or different behaviors that may\noccur at different relative times. Using computational methods, we develop a\nsimple framework to describe the interpersonal dynamics of behavioral synchrony\nand complementarity over time, and explore their task dependence. A key feature\nof this framework is the inclusion of a task context that mediates\ninteractions, and consists of active, inactive, and inhibitory constraints on\ncommunication. Initial simulation results show that these task constraints can\nbe a robust predictor of simulated agents' behaviors over time. We also show\nthat the framework can reproduce some general patterns observed in human\ninteraction data. We describe preliminary theoretical implications from these\nresults, and relate them to broader proposals of synergistic self-organization\nin communication.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:55:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Miao","Grace Qiyuan",""],["Dale","Rick",""],["Galati","Alexia",""]]}
{"id":"2308.15865","submitter":"EPTCS","authors":"Kilian R\\\"uckschlo{\\ss} (Ludwig-Maximilians-Universit\\\"at M\\\"unchen),\n  Felix Weitk\\\"amper (Ludwig-Maximilians-Universit\\\"at M\\\"unchen)","title":"On the Independencies Hidden in the Structure of a Probabilistic Logic\n  Program","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 169-182","doi":"10.4204/EPTCS.385.17","report-no":null,"categories":"cs.LO cs.AI cs.PL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pearl and Verma developed d-separation as a widely used graphical criterion\nto reason about the conditional independencies that are implied by the causal\nstructure of a Bayesian network. As acyclic ground probabilistic logic programs\ncorrespond to Bayesian networks on their dependency graph, we can compute\nconditional independencies from d-separation in the latter.\n  In the present paper, we generalize the reasoning above to the non-ground\ncase. First, we abstract the notion of a probabilistic logic program away from\nexternal databases and probabilities to obtain so-called program structures. We\nthen present a correct meta-interpreter that decides whether a certain\nconditional independence statement is implied by a program structure on a given\nexternal database. Finally, we give a fragment of program structures for which\nwe obtain a completeness statement of our conditional independence oracle. We\nclose with an experimental evaluation of our approach revealing that our\nmeta-interpreter performs significantly faster than checking the definition of\nindependence using exact inference in ProbLog 2.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:55:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["R\u00fcckschlo\u00df","Kilian","","Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"],["Weitk\u00e4mper","Felix","","Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"]]}
{"id":"2308.15866","submitter":"Yuhua Yao","authors":"Yu-Hua Yao, Xu-Lin Dong, Yi-Qing Guo and Qiang Yuan","title":"A common origin of multi-messenger spectral anomaly of galactic cosmic\n  rays","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recent observations of cosmic rays (CRs) have revealed a two-component\nanomaly in the spectra of primary and secondary particles, as well as their\nratios, prompting investigation into their common origin. In this study, we\nincorporate the identification of slow diffusion zones around sources as a\ncommon phenomenon into our calculations, which successfully reproduces all\npreviously described anomalies except for the positron spectrum. Crucially, our\nresearch offers a clear physical picture of the origin of CR: while high-energy\n($\\textrm{>200~GV}$, including the knee) particles are primarily produced by\nfresh accelerators and are confined to local regions, low energy\n($\\textrm{<200~GV}$) components come from distant sources and travel through\nthe outer diffusive zone outside of the galactic disk. This scenario can be\nuniversally applied in the galactic disk, as evidenced by ultra-high energy\ndiffuse $\\rm\\gamma$-ray emissions detected by the AS$\\rm\\gamma$ experiment.\nFurthermore, our results predict that the spectrum of diffuse $\\rm\\gamma$-ray\nis spatial-dependent, resting with local sources, which can be tested by LHAASO\nexperiment.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:55:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yao","Yu-Hua",""],["Dong","Xu-Lin",""],["Guo","Yi-Qing",""],["Yuan","Qiang",""]]}
{"id":"2308.15867","submitter":"EPTCS","authors":"W{\\l}odzimierz Drabent","title":"On Feasibility of Declarative Diagnosis","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 193-200","doi":"10.4204/EPTCS.385.20","report-no":null,"categories":"cs.LO cs.PL cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The programming language Prolog makes declarative programming possible, at\nleast to a substantial extent. Programs may be written and reasoned about in\nterms of their declarative semantics. All the advantages of declarative\nprogramming are however lost when it comes to program debugging. This is\nbecause the Prolog debugger is based solely on the operational semantics.\nDeclarative methods of diagnosis (i.e. locating errors in programs) exist, but\nare neglected. This paper discusses their possibly main weaknesses and shows\nhow to overcome them. We argue that useful ways of declarative diagnosis of\nlogic programs exist, and should be usable in actual programming.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:56:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Drabent","W\u0142odzimierz",""]]}
{"id":"2308.15868","submitter":"Muhammed Hamza","authors":"Muhammad Hamza (1), Ammar Hawbani (1), Sami Ul Rehman (1), Xingfu Wang\n  (1) and Liang Zhao (2) ((1) Computer Science and Technology, University of\n  Science and Technology of China, (2) School of Computer Science, Shenyang\n  Aerospace University)","title":"Feature Attention Network (FA-Net): A Deep-Learning Based Approach for\n  Underwater Single Image Enhancement","comments":"Fourteenth International Conference on Digital Image Processing\n  (ICDIP 2022), 2022, Wuhan, China, May 20-23, 2022.8 pages.5 Figures.doi:\n  10.1117/12.2644516","journal-ref":"Fourteenth International Conference on Digital Image Processing\n  (ICDIP 2022), 2022, Wuhan, China, May 20-23, 2022","doi":"10.1117/12.2644516","report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Underwater image processing and analysis have been a hotspot of study in\nrecent years, as more emphasis has been focused to underwater monitoring and\nusage of marine resources. Compared with the open environment, underwater image\nencountered with more complicated conditions such as light abortion,\nscattering, turbulence, nonuniform illumination and color diffusion. Although\nconsiderable advances and enhancement techniques achieved in resolving these\nissues, they treat low-frequency information equally across the entire channel,\nwhich results in limiting the network's representativeness. We propose a deep\nlearning and feature-attention-based end-to-end network (FA-Net) to solve this\nproblem. In particular, we propose a Residual Feature Attention Block (RFAB),\ncontaining the channel attention, pixel attention, and residual learning\nmechanism with long and short skip connections. RFAB allows the network to\nfocus on learning high-frequency information while skipping low-frequency\ninformation on multi-hop connections. The channel and pixel attention mechanism\nconsiders each channel's different features and the uneven distribution of haze\nover different pixels in the image. The experimental results shows that the\nFA-Net propose by us provides higher accuracy, quantitatively and qualitatively\nand superiority to previous state-of-the-art methods.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:56:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hamza","Muhammad",""],["Hawbani","Ammar",""],["Rehman","Sami Ul",""],["Wang","Xingfu",""],["Zhao","Liang",""]]}
{"id":"2308.15869","submitter":"Huixia Luo","authors":"Kuan Li, Xunwu Hu, Ruixin Guo, Wenrui Jiang, Lingyong Zeng, Longfu Li,\n  Peifeng Yu, Kangwang Wang, Chao Zhang, Shu Guo, Ruidan Zhong, Tao Xie, DaoXin\n  Yao, Huixia Luo","title":"Superconductivity in the medium-entropy alloy TiVNbTa with a\n  body-centered cubic structure","comments":"20 pages, 7 figures","journal-ref":"J.Phys.Chem.C 2023,127,16211-16218","doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Here we report the TiVNbTa medium-entropy alloy (MEA) superconductor with the\nmixed 3d - 5d elements synthesized by an arc-melting method. The TiVNbTa\nmaterial has a body-centered cubic structure. The superconducting properties of\nTiVNbTa were studied by resistivity, magnetic susceptibility, and specific heat\nmeasurements. The experimental results show that the bulk superconducting phase\ntransition temperature of TiVNbTa is about 4.65 K, and the upper and lower\ncritical fields are 49.3(4) mT and 5.9(5) T, respectively, which indicates\nTiVNbTa is a type-II superconductor. First-principles calculations show that\nthe d electrons of Ti, V, Nb, and Ta atoms play a significant role near the\nFermi level. The results show TiVNbTa is a traditional s-wave superconductor.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:56:37 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Kuan",""],["Hu","Xunwu",""],["Guo","Ruixin",""],["Jiang","Wenrui",""],["Zeng","Lingyong",""],["Li","Longfu",""],["Yu","Peifeng",""],["Wang","Kangwang",""],["Zhang","Chao",""],["Guo","Shu",""],["Zhong","Ruidan",""],["Xie","Tao",""],["Yao","DaoXin",""],["Luo","Huixia",""]]}
{"id":"2308.15870","submitter":"EPTCS","authors":"Christian Hatschka (TU Vienna), Agata Ciabattoni (TU Vienna), Thomas\n  Eiter (TU Vienna)","title":"Deontic Paradoxes in ASP with Weak Constraints","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 367-380","doi":"10.4204/EPTCS.385.39","report-no":null,"categories":"cs.LO cs.AI cs.CY cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rise of powerful AI technology for a range of applications that are\nsensitive to legal, social, and ethical norms demands decision-making support\nin presence of norms and regulations. Normative reasoning is the realm of\ndeontic logics, that are challenged by well-known benchmark problems (deontic\nparadoxes), and lack efficient computational tools. In this paper, we use\nAnswer Set Programming (ASP) for addressing these shortcomings and showcase how\nto encode and resolve several well-known deontic paradoxes utilizing weak\nconstraints. By abstracting and generalizing this encoding, we present a\nmethodology for translating normative systems in ASP with weak constraints.\nThis methodology is applied to \"ethical\" versions of Pac-man, where we obtain a\ncomparable performance with related works, but ethically preferable results.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:56:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hatschka","Christian","","TU Vienna"],["Ciabattoni","Agata","","TU Vienna"],["Eiter","Thomas","","TU Vienna"]]}
{"id":"2308.15871","submitter":"Alexander Sushchyev","authors":"Alexander Sushchyev and Stefan Wessel","title":"Anomalous scaling corrections and quantum phase diagram of the\n  Heisenberg antiferromagnet on the spatially anisotropic honeycomb lattice","comments":"8 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using large-scale quantum Monte Carlo simulations, we determine the ground\nstate phase diagram of the spin-1/2 antiferromagnetic Heisenberg model on the\nhoneycomb lattice for the most generic case of three varying interaction\nstrengths along the different lattice directions. We identify continuous\nquantum phase transition lines that separate the long-range ordered\nantiferromagnetic regime from three distinct quantum-disordered phases, each\ncharacterized by dominant dimer-singlet formations. The finite-size behavior\nalong these phase transition lines exhibits anomalously large corrections to\nscaling, which we relate to similar recent findings in certain dimerized\nquantum spin systems and to singular one-dimensional limits in the model\nparameter space. We also comment more generally on the non-universality of\ncritical cumulant ratios in anisotropic systems and attempts to restore\nuniversality by varying the aspect ratio.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:57:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sushchyev","Alexander",""],["Wessel","Stefan",""]]}
{"id":"2308.15872","submitter":"Chong-Bin Chen","authors":"Chong-Bin Chen, Ziwei Wang and Siyi Zhou","title":"On the importance of heavy fields in pseudo-scalar inflation","comments":"36 pages, 7 figures","journal-ref":null,"doi":null,"report-no":"KOBE-COSMO-23-08","categories":"hep-th astro-ph.CO gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pseudo-scalar inflation coupled with U(1) gauge fields through the\nChern-Simons term has been extensively studied. However, new physics arising\nfrom UV theories may still influence the pseudo-scalar field at low-energy\nscales, potentially impacting predictions of inflation. In the realm of\neffective field theory (EFT), we investigated axion inflation, where operators\nfrom heavy fields are also present, in addition to the axion and gauge fields.\nThe integrated out fields have two significant effects: the non-linear\ndispersion regime and coupling heavy modes to the Chern-Simons term. The first\neffect changes the propagation of the curvature fluctuation, while the second\none results in additional operators that contribute to curvature fluctuation\nvia inverse decay. We derived the power spectrum and magnitude of equilateral\nnon-Gaussianity in this low-energy EFT. We found that the second effect could\nbecome significant as the mass of heavy fields approaches Hubble scale.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:57:37 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Chong-Bin",""],["Wang","Ziwei",""],["Zhou","Siyi",""]]}
{"id":"2308.15873","submitter":"Geonho Hwang","authors":"Geonho Hwang","title":"Minimum Width for Deep, Narrow MLP: A Diffeomorphism and the Whitney\n  Embedding Theorem Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, there has been significant attention on determining the minimum\nwidth for the universal approximation property of deep, narrow MLPs. Among\nthese challenges, approximating a continuous function under the uniform norm is\nimportant and challenging, with the gap between its lower and upper bound being\nhard to narrow. In this regard, we propose a novel upper bound for the minimum\nwidth, given by $\\operatorname{max}(2d_x+1, d_y) + \\alpha(\\sigma)$, to achieve\nuniform approximation in deep narrow MLPs, where $0\\leq \\alpha(\\sigma)\\leq 2$\nrepresents the constant depending on the activation function. We demonstrate\nthis bound through two key proofs. First, we establish that deep, narrow MLPs\nwith little additional width can approximate diffeomorphisms. Secondly, we\nutilize the Whitney embedding theorem to show that any continuous function can\nbe approximated by embeddings, further decomposed into linear transformations\nand diffeomorphisms.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:58:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hwang","Geonho",""]]}
{"id":"2308.15874","submitter":"Yuanqing Gu","authors":"Yuanqing Gu, Xiao Zhang, Guowu Wei, Yan Chen","title":"Sarrus-inspired Deployable Polyhedral Mechanisms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deployable polyhedral mechanisms (DPMs) have witnessed flourishing growth in\nrecent years because of their potential applications in robotics, space\nexploration, structure engineering, etc. This paper firstly presents the\nconstruction, mobility and kinematics of a family of Sarrus-inspired deployable\npolyhedral mechanisms. By carrying out expansion operation and implanting\nSarrus linkages along the straight-line motion paths, deployable tetrahedral,\ncubic and dodecahedral mechanisms are identified and constructed following\ntetrahedral, octahedral and icosahedral symmetry, respectively. Three paired\ntransformations with synchronized radial motion between Platonic and\nArchimedean polyhedrons are revealed, and their significant symmetric\nproperties are perfectly remained in each work configuration. Subsequently,\nwith assistant of equivalent prismatic joints, the equivalent analysis strategy\nfor mobility of multiloop polyhedral mechanisms is proposed to significantly\nsimplify the calculation process. This paper hence presents the construction\nmethod and equivalent analysis of the Sarrus-inspired DPMs that are not only\nvaluable in theoretical investigation, but also have great potential in\npractical applications such as mechanical metamaterials, deployable\narchitectures and space exploration.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:58:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gu","Yuanqing",""],["Zhang","Xiao",""],["Wei","Guowu",""],["Chen","Yan",""]]}
{"id":"2308.15875","submitter":"Yi-Han Luo","authors":"Baoqi Shi, Yi-Han Luo, Wei Sun, Yue Hu, Jinbao Long, Xue Bai, Anting\n  Wang and Junqiu Liu","title":"Frequency-comb-linearized, widely tunable lasers for coherent ranging","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":"  Tunable lasers, with the ability to continuously adjust their emission\nwavelengths, have found widespread applications across various fields such as\nbiomedical imaging, coherent ranging, optical communications and spectroscopy.\nIn these applications, a wide chirp range is advantageous for large spectral\ncoverage and high frequency resolution. Besides, the frequency accuracy and\nprecision also depend critically on the chirp linearity of the laser. While\nextensive efforts have been made on the development of many kinds of\nfrequency-agile, widely tunable, narrow-linewidth lasers, wideband yet precise\nmethods to characterize and to linearize laser chirp dynamics are also\ndemanded. Here we present an approach to characterize laser chirp dynamics\nusing an optical frequency comb. The instantaneous laser frequency is tracked\nover terahertz bandwidth with 1 MHz interval. Using this approach we calibrate\nthe chirp performance of twelve tunable lasers from Toptica, Santec, New Focus,\nEXFO and NKT that are commonly used in fiber optics and integrated photonics.\nIn addition, with acquired knowledge on laser chirp dynamics, we demonstrate a\nsimple frequency-linearization scheme that enables coherent ranging without any\noptical or electronic linearization units. Our approach not only presents a\nnovel wideband, high-resolution laser spectroscopy, but is also critical for\nsensing applications with ever-increasing requirements on performance.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:58:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Shi","Baoqi",""],["Luo","Yi-Han",""],["Sun","Wei",""],["Hu","Yue",""],["Long","Jinbao",""],["Bai","Xue",""],["Wang","Anting",""],["Liu","Junqiu",""]]}
{"id":"2308.15876","submitter":"Eibun Senaha","authors":"Koichi Funakubo, Eibun Senaha","title":"Refined renormalization group improvement for thermally resummed\n  effective potential","comments":"41 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We newly develop a renormalization group (RG) improvement for thermally\nresummed effective potentials. In this method, $\\beta$-functions are\nconsistently defined in resummed perturbation theories, so that order-by-order\nRG invariance is not spoiled after thermal resummation. With this improvement,\nscale dependences of phase transition quantities such as a critical\ntemperature, which are known to be notoriously large at the one-loop order, are\ngreatly reduced compared to calculations with the conventional\n$\\overline{\\text{MS}}$ scheme. By taking advantage of the RG invariance, we\nalso devise a resummation method that can incorporate potentially harmful large\nlogarithmic terms and temperature-dependent power corrections in a generic\nform. We point out that a resummed one-loop effective potential refined by the\nmethod can give results that agree with those obtained by resummed two-loop\neffective potentials within errors.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:00:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Funakubo","Koichi",""],["Senaha","Eibun",""]]}
{"id":"2308.15877","submitter":"EPTCS","authors":"Emanuele De Angelis (IASI-CNR, Rome, Italy), Maurizio Proietti\n  (IASI-CNR, Rome, Italy), Francesca Toni (Department of Computing, Imperial\n  College London, UK)","title":"ABA Learning via ASP","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 1-8","doi":"10.4204/EPTCS.385.1","report-no":null,"categories":"cs.AI cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, ABA Learning has been proposed as a form of symbolic machine\nlearning for drawing Assumption-Based Argumentation frameworks from background\nknowledge and positive and negative examples. We propose a novel method for\nimplementing ABA Learning using Answer Set Programming as a way to help guide\nRote Learning and generalisation in ABA Learning.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:02:29 GMT"}],"update_date":"2023-08-31","authors_parsed":[["De Angelis","Emanuele","","IASI-CNR, Rome, Italy"],["Proietti","Maurizio","","IASI-CNR, Rome, Italy"],["Toni","Francesca","","Department of Computing, Imperial\n  College London, UK"]]}
{"id":"2308.15878","submitter":"EPTCS","authors":"Yanhong A. Liu (Stony Brook University), Scott D. Stoller (Stony Brook\n  University), Yi Tong (Stony Brook University), K. Tuncay Tekle (Stony Brook\n  University)","title":"Benchmarking for Integrating Logic Rules with Everything Else","comments":"In Proceedings ICLP 2023, arXiv:2308.14898. arXiv admin note:\n  substantial text overlap with arXiv:2205.15204","journal-ref":"EPTCS 385, 2023, pp. 12-26","doi":"10.4204/EPTCS.385.3","report-no":null,"categories":"cs.PL cs.LO cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Integrating logic rules with other language features is increasingly sought\nafter for advanced applications that require knowledge-base capabilities. To\naddress this demand, increasingly more languages and extensions for such\nintegration have been developed. How to evaluate such languages?\n  This paper describes a set of programming and performance benchmarks for\nevaluating languages supporting integrated use of rules and other features, and\nthe results of evaluating such an integrated language together with logic\nlanguages and languages not supporting logic rules.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:02:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Yanhong A.","","Stony Brook University"],["Stoller","Scott D.","","Stony Brook\n  University"],["Tong","Yi","","Stony Brook University"],["Tekle","K. Tuncay","","Stony Brook\n  University"]]}
{"id":"2308.15879","submitter":"EPTCS","authors":"Mario Alviano (University of Calabria), Ly Ly Trieu (New Mexico State\n  Universty), Tran Cao Son (New Mexico State Universty), Marcello Balduccini\n  (Saint Joseph's University)","title":"Explanations for Answer Set Programming","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 27-40","doi":"10.4204/EPTCS.385.4","report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper presents an enhancement of xASP, a system that generates\nexplanation graphs for Answer Set Programming (ASP). Different from xASP, the\nnew system, xASP2, supports different clingo constructs like the choice rules,\nthe constraints, and the aggregates such as #sum, #min. This work formalizes\nand presents an explainable artificial intelligence system for a broad fragment\nof ASP, capable of shrinking as much as possible the set of assumptions and\npresenting explanations in terms of directed acyclic graphs.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:03:07 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Alviano","Mario","","University of Calabria"],["Trieu","Ly Ly","","New Mexico State\n  Universty"],["Son","Tran Cao","","New Mexico State Universty"],["Balduccini","Marcello","","Saint Joseph's University"]]}
{"id":"2308.15880","submitter":"EPTCS","authors":"Gonzague Yernaux (Faculty of Computer Science, University of Namur),\n  Wim Vanhoof (Faculty of Computer Science, University of Namur)","title":"A Dataflow Analysis for Comparing and Reordering Predicate Arguments","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 41-54","doi":"10.4204/EPTCS.385.5","report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, which is done in the context of a (moded) logic programming\nlanguage, we devise a data-flow analysis dedicated to computing what we call\nargument profiles. Such a profile essentially describes, for each argument of a\npredicate, its functionality, i.e. the operations in which the argument can be\ninvolved during an evaluation of the predicate, as well as how the argument\ncontributes to the consumption and/or construction of data values. While the\ncomputed argument profiles can be useful for applications in the context of\nprogram understanding (as each profile essentially provides a way to better\nunderstand the role of the argument), they more importantly provide a way to\ndiscern between arguments in a manner that is more fine-grained than what can\nbe done with other abstract characterizations such as types and modes. This is\nimportant for applications where one needs to identify correspondences between\nthe arguments of two or more different predicates that need to be compared,\nsuch as during clone detection. Moreover, since a total order can be defined on\nthe abstract domain of profiles, our analysis can be used for rearranging\npredicate arguments and order them according to their functionality,\nconstituting as such an essential ingredient for predicate normalization\ntechniques.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:03:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yernaux","Gonzague","","Faculty of Computer Science, University of Namur"],["Vanhoof","Wim","","Faculty of Computer Science, University of Namur"]]}
{"id":"2308.15881","submitter":"Valentina Corbetta","authors":"Valentina Corbetta, Regina Beets-Tan, and Wilson Silva","title":"Interpretability-guided Data Augmentation for Robust Segmentation in\n  Multi-centre Colonoscopy Data","comments":"10 pages, 4 figures, 1 table, accepted at MICCAI 2023 Workshop on\n  Machine Learning in Medical Imaging (MLMI)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Multi-centre colonoscopy images from various medical centres exhibit distinct\ncomplicating factors and overlays that impact the image content, contingent on\nthe specific acquisition centre. Existing Deep Segmentation networks struggle\nto achieve adequate generalizability in such data sets, and the currently\navailable data augmentation methods do not effectively address these sources of\ndata variability. As a solution, we introduce an innovative data augmentation\napproach centred on interpretability saliency maps, aimed at enhancing the\ngeneralizability of Deep Learning models within the realm of multi-centre\ncolonoscopy image segmentation. The proposed augmentation technique\ndemonstrates increased robustness across different segmentation models and\ndomains. Thorough testing on a publicly available multi-centre dataset for\npolyp detection demonstrates the effectiveness and versatility of our approach,\nwhich is observed both in quantitative and qualitative results. The code is\npublicly available at:\nhttps://github.com/nki-radiology/interpretability_augmentation\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:03:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Corbetta","Valentina",""],["Beets-Tan","Regina",""],["Silva","Wilson",""]]}
{"id":"2308.15882","submitter":"Hongjun Gao","authors":"Shiduo Qu and Hongjun Gao","title":"The high-order approximation of SPDEs with multiplicative noise via\n  amplitude equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The emphasis of this paper is to investigate the high-order approximation of\na class of SPDEs with cubic nonlinearity driven by multiplicative noise with\nthe help of the amplitude equations. The highlight of our work is that we\nimprove the convergence rate between the real solutions and the approximate\nones. Precisely, previous results often focused on deriving the approximate\nsolutions via the first-order amplitude equations. However, the approximate\nsolutions are constructed by the first-order amplitude equations and the\nsecond-order ones in this paper. And, we rigorously prove that such approximate\nsolutions enjoy improved convergence property. In order to illustrate this\ndemonstration more intuitively, we apply our main theorem to stochastic\nAllen-Cahn equation, and provide numerical analysis.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:03:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Qu","Shiduo",""],["Gao","Hongjun",""]]}
{"id":"2308.15883","submitter":"EPTCS","authors":"Kilian R\\\"uckschlo{\\ss} (Ludwig-Maximilians Universit\\\"at), Felix\n  Weitk\\\"amper (Ludwig-Maximilians Universit\\\"at)","title":"\"Would life be more interesting if I were in AI?\" Answering\n  Counterfactuals based on Probabilistic Inductive Logic Programming","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 58-64","doi":"10.4204/EPTCS.385.7","report-no":null,"categories":"cs.LO cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Probabilistic logic programs are logic programs where some facts hold with a\nspecified probability. Here, we investigate these programs with a causal\nframework that allows counterfactual queries. Learning the program structure\nfrom observational data is usually done through heuristic search relying on\nstatistical tests. However, these statistical tests lack information about the\ncausal mechanism generating the data, which makes it unfeasible to use the\nresulting programs for counterfactual reasoning. To address this, we propose a\nlanguage fragment that allows reconstructing a program from its induced\ndistribution. This further enables us to learn programs supporting\ncounterfactual queries.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:03:45 GMT"}],"update_date":"2023-08-31","authors_parsed":[["R\u00fcckschlo\u00df","Kilian","","Ludwig-Maximilians Universit\u00e4t"],["Weitk\u00e4mper","Felix","","Ludwig-Maximilians Universit\u00e4t"]]}
{"id":"2308.15884","submitter":"Hoang Ta","authors":"Yeow Meng Chee, Hoang Ta, and Van Khu Vu","title":"Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.DS cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Determining the optimal fidelity for the transmission of quantum information\nover noisy quantum channels is one of the central problems in quantum\ninformation theory. Recently, [Berta \\& et al., Mathematical Programming, 2021]\nintroduced an asymptotically converging semidefinite programming hierarchy of\nouter bounds for this quantity. However, the size of the semidefinite program\n(SDP) grows exponentially with respect to the level of the hierarchy, and thus\ncomputing the SDP directly is inefficient. In this work, by exploiting the\nsymmetries in the SDP, we show that, for fixed input and output dimensions, we\ncan compute the SDP in polynomial time in term of level of the hierarchy. As a\ndirect consequence of our result, the optimal fidelity can be approximated with\nan accuracy of $\\epsilon$ in a time that is polynomial in $1/\\epsilon$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:03:45 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chee","Yeow Meng",""],["Ta","Hoang",""],["Vu","Van Khu",""]]}
{"id":"2308.15885","submitter":"EPTCS","authors":"Ghazal Afroozi Milani (University of Surrey), Daniel Cyrus (University\n  of Surrey), Alireza Tamaddoni-Nezhad (University of Surrey)","title":"Towards One-Shot Learning for Text Classification using Inductive Logic\n  Programming","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 69-79","doi":"10.4204/EPTCS.385.9","report-no":null,"categories":"cs.LG cs.CL cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the ever-increasing potential of AI to perform personalised tasks, it is\nbecoming essential to develop new machine learning techniques which are\ndata-efficient and do not require hundreds or thousands of training data. In\nthis paper, we explore an Inductive Logic Programming approach for one-shot\ntext classification. In particular, we explore the framework of\nMeta-Interpretive Learning (MIL), along with using common-sense background\nknowledge extracted from ConceptNet. Results indicate that MIL can learn text\nclassification rules from a small number of training examples. Moreover, the\nhigher complexity of chosen examples, the higher accuracy of the outcome.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:04:06 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Milani","Ghazal Afroozi","","University of Surrey"],["Cyrus","Daniel","","University\n  of Surrey"],["Tamaddoni-Nezhad","Alireza","","University of Surrey"]]}
{"id":"2308.15886","submitter":"Davide Perrone","authors":"Davide Perrone, Thomas Barreira, Alex Kehagias, Antonio Riotto","title":"Non-linear Black Hole Ringdowns: an Analytical Approach","comments":"23 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Due to the nature of gravity, non-linear effects are left imprinted in the\nquasi-normal modes generated in the ringdown phase of the merger of two black\nholes. We offer an analytical treatment of the quasi-normal modes at\nsecond-order in black hole perturbation theory which takes advantage from the\nfact that the non-linear sources are peaked around the light ring. As a\nbyproduct, we describe why the amplitude of the second-order mode relative to\nthe square of the first-order amplitude depends only weakly on the initial\ncondition of the problem.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:04:09 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Perrone","Davide",""],["Barreira","Thomas",""],["Kehagias","Alex",""],["Riotto","Antonio",""]]}
{"id":"2308.15887","submitter":"EPTCS","authors":"Justin Brody (Franklin and Marshall College)","title":"On the Potential of CLIP for Compositional Logical Reasoning","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 80-86","doi":"10.4204/EPTCS.385.10","report-no":null,"categories":"cs.AI cs.CV cs.LG cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we explore the possibility of using OpenAI's CLIP to perform\nlogically coherent grounded visual reasoning. To that end, we formalize our\nterms and give a geometric analysis of how embeddings in CLIP's latent space\nwould need to be configured in order for the system to be logically coherent.\nOur main conclusion is that, as usually configured, CLIP cannot perform such\nreasoning.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:04:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Brody","Justin","","Franklin and Marshall College"]]}
{"id":"2308.15888","submitter":"EPTCS","authors":"Tomi Janhunen (Tampere University)","title":"Generalizing Level Ranking Constraints for Monotone and Convex\n  Aggregates","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 101-115","doi":"10.4204/EPTCS.385.12","report-no":null,"categories":"cs.LO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In answer set programming (ASP), answer sets capture solutions to search\nproblems of interest and thus the efficient computation of answer sets is of\nutmost importance. One viable implementation strategy is provided by\ntranslation-based ASP where logic programs are translated into other KR\nformalisms such as Boolean satisfiability (SAT), SAT modulo theories (SMT), and\nmixed-integer programming (MIP). Consequently, existing solvers can be\nharnessed for the computation of answer sets. Many of the existing translations\nrely on program completion and level rankings to capture the minimality of\nanswer sets and default negation properly. In this work, we take level ranking\nconstraints into reconsideration, aiming at their generalizations to cover\naggregate-based extensions of ASP in more systematic way. By applying a number\nof program transformations, ranking constraints can be rewritten in a general\nform that preserves the structure of monotone and convex aggregates and thus\noffers a uniform basis for their incorporation into translation-based ASP. The\nresults open up new possibilities for the implementation of translators and\nsolver pipelines in practice.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:04:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Janhunen","Tomi","","Tampere University"]]}
{"id":"2308.15889","submitter":"EPTCS","authors":"Andre Thevapalan, Gabriele Kern-Isberner","title":"Sorting Strategies for Interactive Conflict Resolution in ASP","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 116-128","doi":"10.4204/EPTCS.385.13","report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Answer set programs in practice are often subject to change. This can lead to\ninconsistencies in the modified program due to conflicts between rules which\nare the results of the derivation of strongly complementary literals. To\nfacilitate the maintenance of consistency in answer set programs, in this paper\nwe continue work on a recently presented framework that implements interactive\nconflict resolution by extending the bodies of conflicting rules by suitable\nliterals, so-called $\\lambda$-extensions. More precisely, we present strategies\nto choose $\\lambda$-extensions that allow for resolving several conflicts at a\ntime in an order that aims at minimizing (cognitive) efforts. In particular, we\npresent a graphical representation of connections between conflicts and their\npossible solutions. Such a representation can be utilized to efficiently guide\nthe user through the conflict resolution process by displaying conflicts and\nsuggesting solutions in a suitable order.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:04:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Thevapalan","Andre",""],["Kern-Isberner","Gabriele",""]]}
{"id":"2308.15890","submitter":"EPTCS","authors":"Paul Tarau (University of North Texas)","title":"Natlog: Embedding Logic Programming into the Python Deep-Learning\n  Ecosystem","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 141-154","doi":"10.4204/EPTCS.385.15","report-no":null,"categories":"cs.AI cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Driven by expressiveness commonalities of Python and our Python-based\nembedded logic-based language Natlog, we design high-level interaction patterns\nbetween equivalent language constructs and data types on the two sides.\n  By directly connecting generators and backtracking, nested tuples and terms,\ncoroutines and first-class logic engines, reflection and meta-interpretation,\nwe enable logic-based language constructs to access the full power of the\nPython ecosystem.\n  We show the effectiveness of our design via Natlog apps working as\norchestrators for JAX and Pytorch pipelines and as DCG-driven GPT3 and DALL.E\nprompt generators.\n  Keyphrases: embedding of logic programming in the Python ecosystem,\nhigh-level inter-paradigm data exchanges, coroutining with logic engines,\nlogic-based neuro-symbolic computing, logic grammars as prompt-generators for\nLarge Language Models, logic-based neural network configuration and training.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:05:13 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Tarau","Paul","","University of North Texas"]]}
{"id":"2308.15891","submitter":"EPTCS","authors":"Francesca Toni (Department of Computing, Imperial College London, UK),\n  Nico Potyka (Department of Computing, Imperial College London, UK), Markus\n  Ulbricht (Department of Computer Science, Leipzig University, Germany),\n  Pietro Totis (Department of Computer Science, KU Leuven, Belgium)","title":"Understanding ProbLog as Probabilistic Argumentation","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 183-189","doi":"10.4204/EPTCS.385.18","report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  ProbLog is a popular probabilistic logic programming language/tool, widely\nused for applications requiring to deal with inherent uncertainties in\nstructured domains. In this paper we study connections between ProbLog and a\nvariant of another well-known formalism combining symbolic reasoning and\nreasoning under uncertainty, i.e. probabilistic argumentation. Specifically, we\nshow that ProbLog is an instance of a form of Probabilistic Abstract\nArgumentation (PAA) that builds upon Assumption-Based Argumentation (ABA). The\nconnections pave the way towards equipping ProbLog with alternative semantics,\ninherited from PAA/PABA, as well as obtaining novel argumentation semantics for\nPAA/PABA, leveraging on prior connections between ProbLog and argumentation.\nFurther, the connections pave the way towards novel forms of argumentative\nexplanations for ProbLog's outputs.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:05:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Toni","Francesca","","Department of Computing, Imperial College London, UK"],["Potyka","Nico","","Department of Computing, Imperial College London, UK"],["Ulbricht","Markus","","Department of Computer Science, Leipzig University, Germany"],["Totis","Pietro","","Department of Computer Science, KU Leuven, Belgium"]]}
{"id":"2308.15892","submitter":"EPTCS","authors":"Emmanuelle Dietz (Airbus Central Research & Technology, Hein-Sass-Weg\n  22, 21129 Hamburg, Germany), Tobias Philipp (secunet Security Networks AG,\n  Germany), Gerrit Schramm (Airbus Central Research & Technology, Hein-Sass-Weg\n  22, 21129 Hamburg, Germany), Andreas Zindel (Airbus Central Research &\n  Technology, Hein-Sass-Weg 22, 21129 Hamburg, Germany)","title":"A Logic Programming Approach to Global Logistics in a Co-Design\n  Environment","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 227-240","doi":"10.4204/EPTCS.385.23","report-no":null,"categories":"cs.AI cs.DB cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a co-design environment changes need to be integrated quickly and in an\nautomated manner. This paper considers the challenge of creating and optimizing\na global logistics system for the construction of a passenger aircraft within a\nco-design approach with respect to key performance indicators (like cost, time\nor resilience). The product in question is an aircraft, comprised of multiple\ncomponents, manufactured at multiple sites worldwide. The goal is to find an\noptimal way to build the aircraft taking into consideration the requirements\nfor its industrial system. The main motivation for approaching this challenge\nis to develop the industrial system in tandem with the product and making it\nmore resilient against unforeseen events, reducing the risks of bottlenecks in\nthe supply chain. This risk reduction ensures continued efficiency and\noperational success. To address this challenging and complex task we have\nchosen Answer Set Programming (ASP) as the modeling language, formalizing the\nrelevant requirements of the investigated industrial system. The approach\npresented in this paper covers three main aspects: the extraction of the\nrelevant information from a knowledge graph, the translation into logic\nprograms and the computation of existing configurations guided by optimization\ncriteria. Finally we visualize the results for an effortless evaluation of\nthese models. Internal results seem promising and yielded several new research\nquestions for future improvements of the discussed use case.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:06:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dietz","Emmanuelle","","Airbus Central Research & Technology, Hein-Sass-Weg\n  22, 21129 Hamburg, Germany"],["Philipp","Tobias","","secunet Security Networks AG,\n  Germany"],["Schramm","Gerrit","","Airbus Central Research & Technology, Hein-Sass-Weg\n  22, 21129 Hamburg, Germany"],["Zindel","Andreas","","Airbus Central Research &\n  Technology, Hein-Sass-Weg 22, 21129 Hamburg, Germany"]]}
{"id":"2308.15893","submitter":"EPTCS","authors":"Theresa Swift (Johns Hopkins Applied Physics Lab), Carl Andersen","title":"The Janus System: Multi-paradigm Programming in Prolog and Python","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 241-255","doi":"10.4204/EPTCS.385.24","report-no":null,"categories":"cs.PL cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Python and Prolog express different programming paradigms, with different\nstrengths. Python is wildly popular because it is well-structured, easy to use,\nand mixes well with thousands of scientific and machine learning programs\nwritten in C. Prolog's logic-based approach provides powerful reasoning\ncapabilities, especially when combined with constraint evaluation,\nprobabilistic reasoning, well-founded negation, and other advances. Both\nlanguages have commonalities as well: both are usually written in C, both are\ndynamically typed, and both use data structures based on a small number of\nrecursive types.\n  This paper describes the design and implementation of Janus, a system that\ntightly combines Prolog and Python into a single process. Janus bi-translates\ndata structures and offers performance of many hundreds of thousands of\nround-trip inter-language calls per second. Although Janus is still new, it has\nbeen used in commercial applications including natural language processing,\nvisual query answering and robotic automation. Janus was developed for XSB, but\nporting Janus code to a second Prolog has been straightforward, indicating that\nJanus is a tool that other Prologs may easily adopt.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:07:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Swift","Theresa","","Johns Hopkins Applied Physics Lab"],["Andersen","Carl",""]]}
{"id":"2308.15894","submitter":"EPTCS","authors":"Stefano Forti (University of Pisa), Ahmad Ibrahim (University of\n  Birmingham), Antonio Brogi (University of Pisa)","title":"Leasing the Cloud-Edge Continuum, \\`a la Carte","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 288-299","doi":"10.4204/EPTCS.385.28","report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Next-gen computing paradigms foresee deploying applications to virtualised\nresources along a continuum of Cloud-Edge nodes. Much literature focussed on\nhow to place applications onto such resources so as to meet their requirements.\nTo lease resources to application operators, infrastructure providers need to\nidentify a portion of their Cloud-Edge assets to meet set requirements. This\narticle proposes a novel declarative resource selection strategy prototyped in\nProlog to determine a suitable infrastructure portion that satisfies all\nrequirements. The proposal is showcased over a lifelike scenario.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:07:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Forti","Stefano","","University of Pisa"],["Ibrahim","Ahmad","","University of\n  Birmingham"],["Brogi","Antonio","","University of Pisa"]]}
{"id":"2308.15895","submitter":"EPTCS","authors":"Jakob Suchan (German Aerospace Center (DLR), Oldenburg, Germany),\n  Jan-Patrick Osterloh (German Aerospace Center (DLR), Oldenburg, Germany)","title":"Assessing Drivers' Situation Awareness in Semi-Autonomous Vehicles: ASP\n  based Characterisations of Driving Dynamics for Modelling Scene\n  Interpretation and Projection","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 300-313","doi":"10.4204/EPTCS.385.29","report-no":null,"categories":"cs.AI cs.HC cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Semi-autonomous driving, as it is already available today and will eventually\nbecome even more accessible, implies the need for driver and automation system\nto reliably work together in order to ensure safe driving. A particular\nchallenge in this endeavour are situations in which the vehicle's automation is\nno longer able to drive and is thus requesting the human to take over. In these\nsituations the driver has to quickly build awareness for the traffic situation\nto be able to take over control and safely drive the car. Within this context\nwe present a software and hardware framework to asses how aware the driver is\nabout the situation and to provide human-centred assistance to help in building\nsituation awareness. The framework is developed as a modular system within the\nRobot Operating System (ROS) with modules for sensing the environment and the\ndriver state, modelling the driver's situation awareness, and for guiding the\ndriver's attention using specialized Human Machine Interfaces (HMIs).\n  A particular focus of this paper is on an Answer Set Programming (ASP) based\napproach for modelling and reasoning about the driver's interpretation and\nprojection of the scene. This is based on scene data, as well as eye-tracking\ndata reflecting the scene elements observed by the driver. We present the\noverall application and discuss the role of semantic reasoning and modelling\ncognitive functions based on logic programming in such applications.\nFurthermore we present the ASP approach for interpretation and projection of\nthe driver's situation awareness and its integration within the overall system\nin the context of a real-world use-case in simulated as well as in real\ndriving.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:07:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Suchan","Jakob","","German Aerospace Center"],["Osterloh","Jan-Patrick","","German Aerospace Center"]]}
{"id":"2308.15896","submitter":"EPTCS","authors":"Daniela Ferreiro, Jos\\'e F. Morales, Salvador Abreu, Manuel V.\n  Hermenegildo","title":"Demonstrating (Hybrid) Active Logic Documents and the Ciao Prolog\n  Playground, and an Application to Verification Tutorials","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 324-329","doi":"10.4204/EPTCS.385.33","report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Active Logic Documents (ALD) are web pages which incorporate embedded Prolog\nengines that run locally within the browser. ALD offers both a very easy way to\nadd click-to-run capabilities to any kind of teaching materials, independently\nof the tool used to generate them, as well as a tool-set for generating\nweb-based materials with embedded examples and exercises. Both leverage on\n(components of) the Ciao Prolog Playground. We present a demonstration of the\nALD approach and the Ciao Prolog Playground, as well as a recent extension to\nALDs to facilitate the integration of other tools into the system for creating\nHybrid Active Logic Documents (HALD). We also present a concrete application of\nthese technologies to the creation of tutorials for a program verification\ntool.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:08:10 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ferreiro","Daniela",""],["Morales","Jos\u00e9 F.",""],["Abreu","Salvador",""],["Hermenegildo","Manuel V.",""]]}
{"id":"2308.15897","submitter":"EPTCS","authors":"Alex Ivliev, Stefan Ellmauthaler, Lukas Gerlach, Maximilian Marx,\n  Matthias Mei{\\ss}ner, Simon Meusel, Markus Kr\\\"otzsch","title":"Nemo: First Glimpse of a New Rule Engine","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 333-335","doi":"10.4204/EPTCS.385.35","report-no":null,"categories":"cs.AI cs.DB cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This system demonstration presents Nemo, a new logic programming engine with\na focus on reliability and performance. Nemo is built for data-centric analytic\ncomputations, modelled in a fully declarative Datalog dialect. Its scalability\nfor these tasks matches or exceeds that of leading Datalog systems. We\ndemonstrate uses in reasoning with knowledge graphs and ontologies with 10^5 to\n10^8 input facts, all on a laptop. Nemo is written in Rust and available as a\nfree and open source tool.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:08:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ivliev","Alex",""],["Ellmauthaler","Stefan",""],["Gerlach","Lukas",""],["Marx","Maximilian",""],["Mei\u00dfner","Matthias",""],["Meusel","Simon",""],["Kr\u00f6tzsch","Markus",""]]}
{"id":"2308.15898","submitter":"EPTCS","authors":"Alessandro Dal Pal\\`u (Universit\\`a di Parma, Italy), Agostino Dovier\n  (Universit\\`a di Udine, Italy), Andrea Formisano (Universit\\`a di Udine,\n  Italy)","title":"An xAI Approach for Data-to-Text Processing with ASP","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 353-366","doi":"10.4204/EPTCS.385.38","report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The generation of natural language text from data series gained renewed\ninterest among AI research goals. Not surprisingly, the few proposals in the\nstate of the art are based on training some system, in order to produce a text\nthat describes and that is coherent to the data provided as input. Main\nchallenges of such approaches are the proper identification of \"what\" to say\n(the key descriptive elements to be addressed in the data) and \"how\" to say:\nthe correspondence and accuracy between data and text, the presence of\ncontradictions/redundancy in the text, the control of the amount of synthesis.\n  This paper presents a framework that is compliant with xAI requirements. In\nparticular we model ASP/Python programs that enable an explicit control of\naccuracy errors and amount of synthesis, with proven optimal solutions. The\ntext description is hierarchically organized, in a top-down structure where\ntext is enriched with further details, according to logic rules. The generation\nof natural language descriptions' structure is also managed by logic rules.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:09:09 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pal\u00f9","Alessandro Dal","","Universit\u00e0 di Parma, Italy"],["Dovier","Agostino","","Universit\u00e0 di Udine, Italy"],["Formisano","Andrea","","Universit\u00e0 di Udine,\n  Italy"]]}
{"id":"2308.15899","submitter":"EPTCS","authors":"Andrea Rafanelli (University of Pisa, Italy, University of L'Aquila,\n  Italy)","title":"Beyond Traditional Neural Networks: Toward adding Reasoning and Learning\n  Capabilities through Computational Logic Techniques","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 416-422","doi":"10.4204/EPTCS.385.51","report-no":null,"categories":"cs.AI cs.LG cs.LO cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep Learning (DL) models have become popular for solving complex problems,\nbut they have limitations such as the need for high-quality training data, lack\nof transparency, and robustness issues. Neuro-Symbolic AI has emerged as a\npromising approach combining the strengths of neural networks and symbolic\nreasoning. Symbolic knowledge injection (SKI) techniques are a popular method\nto incorporate symbolic knowledge into sub-symbolic systems. This work proposes\nsolutions to improve the knowledge injection process and integrate elements of\nML and logic into multi-agent systems (MAS).\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:09:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rafanelli","Andrea","","University of Pisa, Italy, University of L'Aquila,\n  Italy"]]}
{"id":"2308.15900","submitter":"Sebastian Siebertz","authors":"Jona Dirks and Enna Gerhard and Mario Grobler and Amer E. Mouawad and\n  Sebastian Siebertz","title":"Data reduction for directed feedback vertex set on graphs without long\n  induced cycles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study reduction rules for Directed Feedback Vertex Set (DFVS) on instances\nwithout long cycles. A DFVS instance without cycles longer than $d$ naturally\ncorresponds to an instance of $d$-Hitting Set, however, enumerating all cycles\nin an $n$-vertex graph and then kernelizing the resulting $d$-Hitting Set\ninstance can be too costly, as already enumerating all cycles can take time\n$\\Omega(n^d)$. We show how to compute a kernel with at most $2^dk^d$ vertices\nand at most $d^{3d}k^d$ induced cycles of length at most $d$ (which however,\ncannot be enumerated efficiently), where $k$ is the size of a minimum directed\nfeedback vertex set. We then study classes of graphs whose underlying\nundirected graphs have bounded expansion or are nowhere dense; these are very\ngeneral classes of sparse graphs, containing e.g. classes excluding a minor or\na topological minor. We prove that for such classes without induced cycles of\nlength greater than $d$ we can compute a kernel with $O_d(k)$ and\n$O_{d,\\epsilon}(k^{1+\\epsilon})$ vertices for any $\\epsilon>0$, respectively,\nin time $O_d(n^{O(1)})$ and $O_{d,\\epsilon}(n^{O(1)})$, respectively. The most\nrestricted classes we consider are strongly connected planar graphs without any\n(induced or non-induced) long cycles. We show that these have bounded treewidth\nand hence DFVS on planar graphs without cycles of length greater than $d$ can\nbe solved in time $2^{O(d)}\\cdot n^{O(1)}$. We finally present a new data\nreduction rule for general DFVS and prove that the rule together with a few\nstandard rules subsumes all the rules applied by Bergougnoux et al. to obtain a\npolynomial kernel for DFVS[FVS], i.e., DFVS parameterized by the feedback\nvertex set number of the underlying (undirected) graph. We conclude by studying\nthe LP-based approximation of DFVS.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:09:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dirks","Jona",""],["Gerhard","Enna",""],["Grobler","Mario",""],["Mouawad","Amer E.",""],["Siebertz","Sebastian",""]]}
{"id":"2308.15901","submitter":"EPTCS","authors":"Tobias Geibinger (TU Wien)","title":"Explainable Answer-set Programming","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 423-429","doi":"10.4204/EPTCS.385.52","report-no":null,"categories":"cs.AI cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interest in explainability in artificial intelligence (AI) is growing\nvastly due to the near ubiquitous state of AI in our lives and the increasing\ncomplexity of AI systems. Answer-set Programming (ASP) is used in many areas,\namong them are industrial optimisation, knowledge management or life sciences,\nand thus of great interest in the context of explainability. To ensure the\nsuccessful application of ASP as a problem-solving paradigm in the future, it\nis thus crucial to investigate explanations for ASP solutions. Such an\nexplanation generally tries to give an answer to the question of why something\nis, respectively is not, part of the decision produced or solution to the\nformulated problem. Although several explanation approaches for ASP exist,\nalmost all of them lack support for certain language features that are used in\npractice. Most notably, this encompasses the various ASP extensions that have\nbeen developed in the recent years to enable reasoning over theories, external\ncomputations, or neural networks. This project aims to fill some of these gaps\nand contribute to the state of the art in explainable ASP. We tackle this by\nextending the language support of existing approaches but also by the\ndevelopment of novel explanation formalisms, like contrastive explanations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:09:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Geibinger","Tobias","","TU Wien"]]}
{"id":"2308.15902","submitter":"Ming Li","authors":"Yijia Li, Ming Li, MingYi Gao, Chang-Ling Zou, Chun-Hua Dong, Jin Lu,\n  Yali Qin, XiaoNiu Yang, Qi Xuan and Hongliang Ren","title":"Photonic time-delayed reservoir computing based on series coupled\n  microring resonators with high memory capacity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cs.ET","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  On-chip microring resonators (MRRs) have been proposed to construct the\ntime-delayed reservoir computing (RC), which offers promising configurations\navailable for computation with high scalability, high-density computing, and\neasy fabrication. A single MRR, however, is inadequate to supply enough memory\nfor the computational task with diverse memory requirements. Large memory needs\nare met by the MRR with optical feedback waveguide, but at the expense of its\nlarge footprint. In the structure, the ultra-long optical feedback waveguide\nsubstantially limits the scalable photonic RC integrated designs. In this\npaper, a time-delayed RC is proposed by utilizing a silicon-based nonlinear MRR\nin conjunction with an array of linear MRRs. These linear MRRs possess a high\nquality factor, providing sufficient memory capacity for the entire system. We\nquantitatively analyze and assess the proposed RC structure's performance on\nthree classical tasks with diverse memory requirements, i.e., the Narma 10,\nMackey-Glass, and Santa Fe chaotic timeseries prediction tasks. The proposed\nsystem exhibits comparable performance to the MRR with an ultra-long optical\nfeedback waveguide-based system when it comes to handling the Narma 10 task,\nwhich requires a significant memory capacity. Nevertheless, the overall length\nof these linear MRRs is significantly smaller, by three orders of magnitude,\ncompared to the ultra-long feedback waveguide in the MRR with optical feedback\nwaveguide-based system. The compactness of this structure has significant\nimplications for the scalability and seamless integration of photonic RC.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:10:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Yijia",""],["Li","Ming",""],["Gao","MingYi",""],["Zou","Chang-Ling",""],["Dong","Chun-Hua",""],["Lu","Jin",""],["Qin","Yali",""],["Yang","XiaoNiu",""],["Xuan","Qi",""],["Ren","Hongliang",""]]}
{"id":"2308.15903","submitter":"Steen H. Hansen","authors":"Fabiano Tracanna and Steen H. Hansen","title":"The destiny of Dark Matter","comments":"15 pages, 5 figures, accepted by ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The majority of baryons, which account for $15\\%$ of the matter in the\nUniverse, will end their lives as carbon and oxygen inside cold black dwarfs.\nDark matter (DM) makes up the remaining $85\\%$ of the matter in the universe,\nhowever, the fate of DM is unknown. Here we show that the destiny of purely\ngravitationally interacting DM particles follows one of two possible routes.\nThe first possible route, the \"radiation-destiny\" scenario, is that massive DM\nparticles lose sufficient energy through gravitational radiation causing them\nto spiral into a supermassive black hole that ultimately disappears through\nHawking radiation. The second possible route, the \"drifting-alone\" destiny,\napplies to lighter DM particles, where only the central DM halo region spirals\ninto the central BH which is then Hawking radiated away. The rest of the DM\nhalo is ripped apart by the accelerated expansion of the Universe.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:10:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Tracanna","Fabiano",""],["Hansen","Steen H.",""]]}
{"id":"2308.15904","submitter":"Asahi Takaoka","authors":"Asahi Takaoka","title":"Forbidden patterns of graphs 12-representable by pattern-avoiding words","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A graph $G = (\\{1, 2, \\ldots, n\\}, E)$ is $12$-representable if there is a\nword $w$ over $\\{1, 2, \\ldots, n\\}$ such that two vertices $i$ and $j$ with $i\n< j$ are adjacent if and only if every $j$ occurs before every $i$ in $w$.\nThese graphs have been shown to be equivalent to the complements of\nsimple-triangle graphs. This equivalence provides a characterization in terms\nof forbidden patterns in vertex orderings as well as a polynomial-time\nrecognition algorithm. The class of $12$-representable graphs was introduced by\nJones et al. (2015) as a variant of word-representable graphs. A general\nresearch direction for word-representable graphs suggested by Kitaev and Lozin\n(2015) is to study graphs representable by some specific types of words. For\ninstance, Gao, Kitaev, and Zhang (2017) and Mandelshtam (2019) investigated\nword-representable graphs represented by pattern-avoiding words. Following this\nresearch direction, this paper studies $12$-representable graphs represented by\nwords that avoid a pattern $p$. Such graphs are trivial when $p$ is of length\n$2$. When $p = 111$, $121$, $231$, and $321$, the classes of such graphs are\nequivalent to well-known classes, such as trivially perfect graphs and\nbipartite permutation graphs. For the cases where $p = 123$, $132$, and $211$,\nthis paper provides forbidden pattern characterizations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:14:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Takaoka","Asahi",""]]}
{"id":"2308.15905","submitter":"Patryk Lipka-Bartosik","authors":"Patryk Lipka-Bartosik, Mart\\'i Perarnau-Llobet, Nicolas Brunner","title":"Thermodynamic Computing via Autonomous Quantum Thermal Machines","comments":"12 + 4 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall cond-mat.stat-mech cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop a physics-based model for classical computation based on\nautonomous quantum thermal machines. These machines consist of few interacting\nquantum bits (qubits) connected to several environments at different\ntemperatures. Heat flows through the machine are here exploited for computing.\nThe process starts by setting the temperatures of the environments according to\nthe logical input. The machine evolves, eventually reaching a non-equilibrium\nsteady state, from which the output of the computation can be determined via\nthe temperature of an auxilliary finite-size reservoir. Such a machine, which\nwe term a \"thermodynamic neuron\", can implement any linearly-separable\nfunction, and we discuss explicitly the cases of NOT, 3-majority and NOR gates.\nIn turn, we show that a network of thermodynamic neurons can perform any\ndesired function. We discuss the close connection between our model and\nartificial neurons (perceptrons), and argue that our model provides an\nalternative physics-based analogue implementation of neural networks, and more\ngenerally a platform for thermodynamic computing.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:15:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lipka-Bartosik","Patryk",""],["Perarnau-Llobet","Mart\u00ed",""],["Brunner","Nicolas",""]]}
{"id":"2308.15906","submitter":"Inyoung Cheong","authors":"Inyoung Cheong, Aylin Caliskan, Tadayoshi Kohno","title":"Is the U.S. Legal System Ready for AI's Challenges to Human Values?","comments":"26 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Our interdisciplinary study investigates how effectively U.S. laws confront\nthe challenges posed by Generative AI to human values. Through an analysis of\ndiverse hypothetical scenarios crafted during an expert workshop, we have\nidentified notable gaps and uncertainties within the existing legal framework\nregarding the protection of fundamental values, such as autonomy, privacy,\ndignity, diversity, equality, and physical/mental well-being. Constitutional\nand civil rights, it appears, may not provide sufficient protection against\nAI-generated discriminatory outputs. Furthermore, even if we exclude the\nliability shield provided by Section 230, proving causation for defamation and\nproduct liability claims is a challenging endeavor due to the intricate and\nopaque nature of AI systems. To address the unique and unforeseeable threats\nposed by Generative AI, we advocate for legal frameworks that evolve to\nrecognize new threat and provide proactive, auditable guidelines to industry\nstakeholders. Addressing these issues requires deep interdisciplinary\ncollaborations to identify harms, values, and mitigation strategies.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:19:06 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cheong","Inyoung",""],["Caliskan","Aylin",""],["Kohno","Tadayoshi",""]]}
{"id":"2308.15907","submitter":"Hugo Rossignol","authors":"Hugo Rossignol, Michail Minotakis, Matteo Cobelli, Stefano Sanvito","title":"Machine-Learning-Assisted Construction of Ternary Convex Hull Diagrams","comments":"14 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the search for novel intermetallic ternary alloys, much of the effort goes\ninto performing a large number of ab-initio calculations covering a wide range\nof compositions and structures. These are essential to build a reliable convex\nhull diagram. While density functional theory (DFT) provides accurate\npredictions for many systems, its computational overheads set a throughput\nlimit on the number of hypothetical phases that can be probed. Here, we\ndemonstrate how an ensemble of machine-learning spectral neighbor-analysis\npotentials (SNAPs) can be integrated into a workflow for the construction of\naccurate ternary convex hull diagrams, highlighting regions fertile for\nmaterials discovery. Our workflow relies on using available binary-alloy data\nboth to train the SNAP models and to create prototypes for ternary phases. From\nthe prototype structures, all unique ternary decorations are created and used\nto form a pool of candidate compounds. The SNAPs are then used to pre-relax the\nstructures and screen the most favourable prototypes, before using DFT to build\nthe final phase diagram. As constructed, the proposed workflow relies on no\nextra first-principles data to train the machine-learning surrogate model and\nyields a DFT-level accurate convex hull. We demonstrate its efficacy by\ninvestigating the Cu-Ag-Au and Mo-Ta-W ternary systems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:22:37 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rossignol","Hugo",""],["Minotakis","Michail",""],["Cobelli","Matteo",""],["Sanvito","Stefano",""]]}
{"id":"2308.15908","submitter":"Ivan de Martino","authors":"Ivan De Martino","title":"Dynamics of Dwarf Galaxies in Scalar-Tensor-Vector-Gravity","comments":"11 Pages, 4 Figure, 2 Tables. Accepted on Physical Review D","journal-ref":"Phys. Rev. D 108, 044074 (2023)","doi":"10.1103/PhysRevD.108.044074","report-no":null,"categories":"gr-qc astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have investigated whether the Scalar-Tensor-Vector Gravity theory (STVG)\nmay explain the kinematic of stars in dwarf spheroidal galaxies. STVG modifies\nGeneral Relativity by adding extra scalar and vector fields with the main aim\nof replacing dark matter in astrophysical self-gravitating systems. The\nweak-field limit of STVG brings a Yukawa-like modification to the Newtonian\ngravitational potential. The modification is modulated by two parameters,\n$\\alpha$ and $\\mu$, that represent a redefinition of the gravitational coupling\nconstant and the mass of the additional vector fields, respectively. Thus,\nadopting the modified gravitational potential arising in the weak-field limit\nof STVG, we have solved the spherical Jeans equation to predict the\nline-of-sight velocity dispersion profiles of eight dwarf spheroidal galaxies\norbiting around the Milky Way. The predicted profiles are then compared to the\ndata using a Monte Carlo Markov Chain algorithm. Our results pointed out some\ntensions on the $\\alpha$ parameter within the data set, while comparison with\nprevious analysis shows the effectiveness of STVG in replacing dark matter with\nextra massive fields. Further improvements will require more sophisticated\nmodelling of the line-of-sight velocity dispersion which will be possible as\nsoon as high-precision astrometric data in dwarf spheroidals will become\navailable.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:22:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["De Martino","Ivan",""]]}
{"id":"2308.15909","submitter":"Denis Obrezkov","authors":"Denis Obrezkov, Allard Oelen, and S\\\"oren Auer","title":"An Approach to Evaluate User Interfaces in a Scholarly Knowledge\n  Communication Domain","comments":"5 pages, 2 figures","journal-ref":"19th IFIP TC13 International Conference, York, UK, August 28 -\n  September 1, 2023, Proceedings, Part IV","doi":"10.1007/978-3-031-42293-5_44","report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The amount of research articles produced every day is overwhelming: scholarly\nknowledge is getting harder to communicate and easier to get lost. A possible\nsolution is to represent the information in knowledge graphs: structures\nrepresenting knowledge in networks of entities, their semantic types, and\nrelationships between them. But this solution has its own drawback: given its\nvery specific task, it requires new methods for designing and evaluating user\ninterfaces. In this paper, we propose an approach for user interface evaluation\nin the knowledge communication domain. We base our methodology on the\nwell-established Cognitive Walkthough approach but employ a different set of\nquestions, tailoring the method towards domain-specific needs. We demonstrate\nour approach on a scholarly knowledge graph implementation called Open Research\nKnowledge Graph (ORKG).\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:36:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Obrezkov","Denis",""],["Oelen","Allard",""],["Auer","S\u00f6ren",""]]}
{"id":"2308.15910","submitter":"Kaoru Irie","authors":"Riku Masuda and Kaoru Irie","title":"Sequential Bayesian Predictive Synthesis","comments":"31 pages, 15 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dynamic Bayesian predictive synthesis is a formal approach to coherently\nsynthesizing multiple predictive distributions into a single distribution. In\nsequential analysis, the computation of the synthesized predictive distribution\nhas heavily relied on the repeated use of the Markov chain Monte Carlo method.\nThe sequential Monte Carlo method in this problem has also been studied but is\nlimited to a subclass of linear synthesis with weight constraint but no\nintercept. In this study, we provide a custom, Rao-Blackwellized particle\nfilter for the linear and Gaussian synthesis, supplemented by timely\ninterventions by the MCMC method to avoid the problem of particle degeneracy.\nIn an example of predicting US inflation rate, where a sudden burst is observed\nin 2020-2022, we confirm the slow adaptation of the predictive distribution. To\novercome this problem, we propose the estimation/averaging of parameters called\ndiscount factors based on the power-discounted likelihoods, which becomes\nfeasible due to the fast computation by the proposed method.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:38:04 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Masuda","Riku",""],["Irie","Kaoru",""]]}
{"id":"2308.15911","submitter":"Stefan Sylvius Wagner","authors":"Stefan Sylvius Wagner, Peter Arndt, Jan Robine, Stefan Harmeling","title":"Cyclophobic Reinforcement Learning","comments":"Published in Transactions on Machine Learning Research (08/2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In environments with sparse rewards, finding a good inductive bias for\nexploration is crucial to the agent's success. However, there are two competing\ngoals: novelty search and systematic exploration. While existing approaches\nsuch as curiosity-driven exploration find novelty, they sometimes do not\nsystematically explore the whole state space, akin to depth-first-search vs\nbreadth-first-search. In this paper, we propose a new intrinsic reward that is\ncyclophobic, i.e., it does not reward novelty, but punishes redundancy by\navoiding cycles. Augmenting the cyclophobic intrinsic reward with a sequence of\nhierarchical representations based on the agent's cropped observations we are\nable to achieve excellent results in the MiniGrid and MiniHack environments.\nBoth are particularly hard, as they require complex interactions with different\nobjects in order to be solved. Detailed comparisons with previous approaches\nand thorough ablation studies show that our newly proposed cyclophobic\nreinforcement learning is more sample efficient than other state of the art\nmethods in a variety of tasks.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:38:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wagner","Stefan Sylvius",""],["Arndt","Peter",""],["Robine","Jan",""],["Harmeling","Stefan",""]]}
{"id":"2308.15912","submitter":"Fleur Seuren","authors":"Fleur Seuren, Santiago A. Triana, J\\'er\\'emy Rekier, Ankit Barik, Tim\n  Van Hoolst","title":"Effects of the librationally induced flow in Mercury's fluid core with\n  an outer stably stratified layer","comments":"26 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Observational constraints on Mercury's thermal evolution and magnetic field\nindicate that the top part of the fluid core is stably stratified. Here we\ncompute how a stable layer affects the core flow in response to Mercury's main\n88-day longitudinal libration, assuming various degrees of stratification, and\nstudy whether the core flow can modify the libration amplitude through viscous\nand electromagnetic torques acting on the core-mantle boundary (CMB). We show\nthat the core flow strongly depends on the strength of the stratification near\nthe CMB but that the influence of core motions on libration is negligible with\nor without a stably stratified layer. A stably stratified layer at the top of\nthe core can however prevent resonant behaviour with gravito-inertial modes by\nimpeding radial motions and promote a strong horizontal flow near the CMB. The\nlibrationally driven flow is likely turbulent and might produce a\nnon-axisymmetric induced magnetic field with a strength of the order of 1$\\%$\nof Mercury's dipolar field.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:39:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Seuren","Fleur",""],["Triana","Santiago A.",""],["Rekier","J\u00e9r\u00e9my",""],["Barik","Ankit",""],["Van Hoolst","Tim",""]]}
{"id":"2308.15913","submitter":"Rohit Kumar","authors":"Vasudeva Rao Allu, Rohit Kumar","title":"Bloch theorem in higher dimension","comments":"11","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we first define a class of holomorphic mappings in several\nvariables which contains the class of Bochner $K$- mappings and give the lower\nestimates for the Bloch's constant for this class. We show that if $f$ is a\nBochner $K$-mapping defined on the unit ball $B^n$ into $\\IC^n$ then $f(B^n)$\ncontains a schlicht ball of radius atleast $1/12K^{2n-1}$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:41:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Allu","Vasudeva Rao",""],["Kumar","Rohit",""]]}
{"id":"2308.15914","submitter":"Vince Grolmusz","authors":"Kinga K. Nagy, Krist\\'of Tak\\'acs, Imre N\\'emeth, B\\'alint Varga,\n  Vince Grolmusz, M\\'onika Moln\\'ar, Be\\'ata G. V\\'ertessy","title":"Novel enzymes for biodegradation of polycyclic aromatic hydrocarbons:\n  metagenomics-linked identification followed by functional analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Polycyclic aromatic hydrocarbons (PAHs) are highly toxic, carcinogenic\nsubstances. On soils contaminated with PAHs, crop cultivation, animal husbandry\nand even the survival of microflora in the soil are greatly perturbed,\ndepending on the degree of contamination. Most microorganisms cannot tolerate\nPAH-contaminated soils, however, some microbial strains can adapt to these\nharsh conditions and survive on contaminated soils. Analysis of the metagenomes\nof contaminated environmental samples may lead to discovery of PAH-degrading\nenzymes suitable for green biotechnology methodologies ranging from\nbiocatalysis to pollution control. In the present study, our goal was to apply\na metagenomic data search to identify efficient novel enzymes in remediation of\nPAH-contaminated soils. The metagenomic hits were further analyzed using a set\nof bioinformatics tools to select protein sequences predicted to encode\nwell-folded soluble enzymes. Three novel enzymes (two dioxygenases and one\nperoxidase) were cloned and used in soil remediation microcosms experiments.\nThe novel enzymes were found to be efficient for degradation of naphthalene and\nphenanthrene. Adding the inorganic oxidant CaO2 further increased the degrading\npotential of the novel enzymes for anthracene and pyrene. We conclude that\nmetagenome mining paired with bioinformatic predictions, structural modelling\nand functional assays constitutes a powerful approach towards novel enzymes for\nsoil remediation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:42:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Nagy","Kinga K.",""],["Tak\u00e1cs","Krist\u00f3f",""],["N\u00e9meth","Imre",""],["Varga","B\u00e1lint",""],["Grolmusz","Vince",""],["Moln\u00e1r","M\u00f3nika",""],["V\u00e9rtessy","Be\u00e1ta G.",""]]}
{"id":"2308.15915","submitter":"Johannes Sicks","authors":"Johannes Sicks and Heiko Rieger","title":"The double-well Bose Hubbard model with nearest-neighbor and\n  cavity-mediated long-range interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We consider a one-dimensional Bose-Hubbard model (BHM) with on-site\ndouble-well potentials and study the effect of nearest-neighbor repulsion and\ncavity-mediated long-range interactions by calculating the ground-state phase\ndiagrams with quantum Monte-Carlo simulations. We show that when the intra-well\nrepulsion is as strong as the on-site repulsion a dimerized Mott insulator\nphase appears at the tip of the dimerized Density Wave phase for a density of\none particle per double well. Furthermore, we find a dimerized Haldane\ninsulator phase in the double-well BHM with nearest-neighbor interaction, which\nis identical to a dimerized BHM with repulsive interactions up to the third\nneighbor.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:42:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sicks","Johannes",""],["Rieger","Heiko",""]]}
{"id":"2308.15916","submitter":"Tim Lengler","authors":"Tim Lengler, Dieter Lott, Gudrid Moortgat-Pick, Sabine Riemann","title":"Target tests for the ILC positron source Talk presented at the\n  International Workshop on Future Linear Colliders (LCWS2023)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The positron source is an essential component of the International Linear\nCollider (ILC) and is an area that poses some design challenges. One\nconsideration is the material for the target, where the 1014 positrons per\nsecond for the ILC are generated. The potential material would need to be able\nto resist the high load created by the intense high energy photon beam. One of\nsuch candidates is the titanium alloy Ti-6Al-4V, for which the results of\nmaterial tests with 3.5 MeV electrons are shown. The material was characterized\nafter the irradiation by high-energy X-ray diffraction (HE-XRD) and changes\ncaused by the irradiation to the crystal structure were studied. These tests\nrevealed there was only minimal change in the phase fractions and crystal\nstructure of the material under conditions as expected for the ILC.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:44:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lengler","Tim",""],["Lott","Dieter",""],["Moortgat-Pick","Gudrid",""],["Riemann","Sabine",""]]}
{"id":"2308.15917","submitter":"Konstantin Shibin","authors":"Konstantin Shibin, Maksim Jenihhin, Artur Jutman, Sergei Devadze,\n  Anton Tsertov","title":"On-Chip Sensors Data Collection and Analysis for SoC Health Management","comments":"6 pages, 3 figures. This paper is accepted at the 36th IEEE\n  International Symposium on Defect and Fault Tolerance in VLSI and\n  Nanotechnology Systems (DFT) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Data produced by on-chip sensors in modern SoCs contains a large amount of\ninformation such as occurring faults, aging status, accumulated radiation dose,\nperformance characteristics, environmental and other operational parameters.\nSuch information provides insight into the overall health of a system's\nhardware as well as the operability of individual modules. This gives a chance\nto mitigate faults and avoid using faulty units, thus enabling hardware health\nmanagement. Raw data from embedded sensors cannot be immediately used to\nperform health management tasks. In most cases, the information about occurred\nfaults needs to be analyzed taking into account the history of the previously\nreported fault events and other collected statistics. For this purpose, we\npropose a special structure called Health Map (HM) that holds the information\nabout functional resources, occurring faults and maps relationships between\nthese. In addition, we propose algorithms for aggregation and classification of\ndata received from on-chip sensors. The proposed Health Map contains detailed\ninformation on a particular system level (e.g., module, SoC, board) that can be\ncompiled into a summary of hardware health status that in its turn enables\ndistributed hierarchical health management by using this information at a\nhigher level of system hierarchy, thus increasing the system's availability and\neffective lifetime.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:44:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Shibin","Konstantin",""],["Jenihhin","Maksim",""],["Jutman","Artur",""],["Devadze","Sergei",""],["Tsertov","Anton",""]]}
{"id":"2308.15918","submitter":"Zhuo-Xu Cui","authors":"Zhuo-Xu Cui, Congcong Liu, Xiaohong Fan, Chentao Cao, Jing Cheng,\n  Qingyong Zhu, Yuanyuan Liu, Sen Jia, Yihang Zhou, Haifeng Wang, Yanjie Zhu,\n  Jianping Zhang, Qiegen Liu, Dong Liang","title":"Physics-Informed DeepMRI: Bridging the Gap from Heat Diffusion to\n  k-Space Interpolation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the field of parallel imaging (PI), alongside image-domain regularization\nmethods, substantial research has been dedicated to exploring $k$-space\ninterpolation. However, the interpretability of these methods remains an\nunresolved issue. Furthermore, these approaches currently face acceleration\nlimitations that are comparable to those experienced by image-domain methods.\nIn order to enhance interpretability and overcome the acceleration limitations,\nthis paper introduces an interpretable framework that unifies both $k$-space\ninterpolation techniques and image-domain methods, grounded in the physical\nprinciples of heat diffusion equations. Building upon this foundational\nframework, a novel $k$-space interpolation method is proposed. Specifically, we\nmodel the process of high-frequency information attenuation in $k$-space as a\nheat diffusion equation, while the effort to reconstruct high-frequency\ninformation from low-frequency regions can be conceptualized as a reverse heat\nequation. However, solving the reverse heat equation poses a challenging\ninverse problem. To tackle this challenge, we modify the heat equation to align\nwith the principles of magnetic resonance PI physics and employ the score-based\ngenerative method to precisely execute the modified reverse heat diffusion.\nFinally, experimental validation conducted on publicly available datasets\ndemonstrates the superiority of the proposed approach over traditional\n$k$-space interpolation methods, deep learning-based $k$-space interpolation\nmethods, and conventional diffusion models in terms of reconstruction accuracy,\nparticularly in high-frequency regions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:45:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cui","Zhuo-Xu",""],["Liu","Congcong",""],["Fan","Xiaohong",""],["Cao","Chentao",""],["Cheng","Jing",""],["Zhu","Qingyong",""],["Liu","Yuanyuan",""],["Jia","Sen",""],["Zhou","Yihang",""],["Wang","Haifeng",""],["Zhu","Yanjie",""],["Zhang","Jianping",""],["Liu","Qiegen",""],["Liang","Dong",""]]}
{"id":"2308.15919","submitter":"Sunayana Maben","authors":"Sunayana Maben, Simon W. Campbell, Yerra Bharat Kumar, Bacham E.\n  Reddy, Gang Zhao","title":"Asteroseismology sheds light on the origin of carbon-deficient red\n  giants: likely merger products and linked to the Li-rich giants","comments":"27 pages, 14 figures, accepted by ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Carbon-deficient red giants (CDGs) are a peculiar class of stars that have\neluded explanation for decades. We aim to better characterise CDGs by using\nasteroseismology (Kepler, TESS) combined with spectroscopy (APOGEE, LAMOST),\nand astrometry (Gaia). We discovered 15 new CDGs in the Kepler field, and\nconfirm that CDGs are rare, being only $0.15\\%$ of our background sample.\nRemarkably, we find that our CDGs are almost exclusively in the red clump (RC)\nphase. Asteroseismic masses reveal that our CDGs are primarily low-mass stars\n($M \\lesssim$ 2~M$_{\\odot}$), in contrast to previous studies which suggested\nthey are intermediate mass ($M = 2.5 - 5.0~\\rm M_{\\odot}$) based on HR\ndiagrams. A very high fraction of our CDGs ($50\\%$) are also Li-rich giants. We\nobserve a bimodal distribution of luminosity in our CDGs, with one group having\nnormal RC luminosity and the other being a factor of two more luminous than\nexpected for their masses. We find demarcations in chemical patterns and\nluminosities which lead us to split them into three groups: (i)\nnormal-luminosity CDGs, (ii) over-luminous CDGs, and (iii) over-luminous\nhighly-polluted CDGs. We conclude that a merger of a helium white dwarf with an\nRGB star is the most likely scenario for the two groups of over-luminous stars.\nBinary mass-transfer from intermediate-mass AGB stars is a possibility for the\nhighly-polluted over-luminous group. For the normal-luminosity CDGs, we cannot\ndistinguish between core He-flash pollution or lower-mass merger scenarios. Due\nto the overlap with the CDGs, Li-rich giants may have similar formation\nchannels.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:47:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Maben","Sunayana",""],["Campbell","Simon W.",""],["Kumar","Yerra Bharat",""],["Reddy","Bacham E.",""],["Zhao","Gang",""]]}
{"id":"2308.15920","submitter":"Silvio Peroni","authors":"Roberto Balzani, Sebastian Barzaghi, Gabriele Bitelli, Federica\n  Bonifazi, Alice Bordignon, Luca Cipriani, Simona Colitti, Federica Collina,\n  Marilena Daquino, Francesca Fabbri, Bruno Fanini, Filippo Fantini, Daniele\n  Ferdani, Giulia Fiorini, Elena Formia, Anna Forte, Federica Giacomini,\n  Valentina Alena Girelli, Bianca Gualandi, Ivan Heibi, Alessandro Iannucci,\n  Rachele Manganelli Del F\\`a, Arcangelo Massari, Arianna Moretti, Silvio\n  Peroni, Sofia Pescarin, Giulia Renda, Diego Ronchi, Mattia Sullini, Maria\n  Alessandra Tini, Francesca Tomasi, Laura Travaglini, Luca Vittuari","title":"Saving temporary exhibitions in virtual environments: the Digital\n  Renaissance of Ulisse Aldrovandi","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR cs.DL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Our goal was to obtain the digital twin of the temporary exhibition \"The\nOther Renaissance: Ulisse Aldrovandi and the Wonders of the World\", to make it\naccessible online to users using various devices (from smartphones to VR\nheadsets). We started with a preliminary assessment of the exhibition,\nfocussing on possible acquisition constraints - time, space, and materials -\nand related solutions. Then, we proceeded with the creation of the digital twin\nby acquiring, processing, modelling, optimising, exporting, metadating, and\nuploading the exhibition. We adopted a hybrid use of two distinct acquisition\ntechniques, i.e. structured light projection scanning and photogrammetry, to\ncreate new digital cultural heritage objects and environments, and we used open\ntechnologies, formats and protocols to make available the final digital\nproduct. We described the process to collect and curate bibliographical\n(meta)data of the exhibition and digital twin creation process to foster its\nfindability, accessibility, interoperability and reusability.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:53:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Balzani","Roberto",""],["Barzaghi","Sebastian",""],["Bitelli","Gabriele",""],["Bonifazi","Federica",""],["Bordignon","Alice",""],["Cipriani","Luca",""],["Colitti","Simona",""],["Collina","Federica",""],["Daquino","Marilena",""],["Fabbri","Francesca",""],["Fanini","Bruno",""],["Fantini","Filippo",""],["Ferdani","Daniele",""],["Fiorini","Giulia",""],["Formia","Elena",""],["Forte","Anna",""],["Giacomini","Federica",""],["Girelli","Valentina Alena",""],["Gualandi","Bianca",""],["Heibi","Ivan",""],["Iannucci","Alessandro",""],["Del F\u00e0","Rachele Manganelli",""],["Massari","Arcangelo",""],["Moretti","Arianna",""],["Peroni","Silvio",""],["Pescarin","Sofia",""],["Renda","Giulia",""],["Ronchi","Diego",""],["Sullini","Mattia",""],["Tini","Maria Alessandra",""],["Tomasi","Francesca",""],["Travaglini","Laura",""],["Vittuari","Luca",""]]}
{"id":"2308.15921","submitter":"Loris Del Grosso","authors":"L. Del Grosso, P. Pani","title":"Fermion Soliton Stars with Asymmetric Vacua","comments":"9 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fermion soliton stars are a motivated model of exotic compact objects in\nwhich a nonlinear self-interacting real scalar field couples to a fermion via a\nYukawa term, giving rise to an effective fermion mass that depends on the fluid\nproperties. Here we continue our investigation of this model within General\nRelativity by considering a scalar potential with generic asymmetric vacua.\nThis case provides fermion soliton stars with a parametrically different\nscaling of the maximum mass relative to the model parameters, showing that the\nspecial case of symmetric vacua, in which we recover our previous results,\nrequires fine tuning. In the more generic case studied here the mass and radius\nof a fermion soliton star are comparable to those of a neutron star for natural\nmodel parameters at the GeV scale. Finally, the asymmetric scalar potential\ninside the star can provide either a positive or a negative effective\ncosmological constant in the interior, being thus reminiscent of gravastars or\nanti-de Sitter bubbles, respectively. In the latter case we find the existence\nof multiple, disconnected, branches of solutions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:56:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Del Grosso","L.",""],["Pani","P.",""]]}
{"id":"2308.15922","submitter":"Jingzhong Yang","authors":"Jingzhong Yang, Zenghui Jiang, Frederik Benthin, Joscha Hanel, Tom\n  Fandrich, Raphael Joos, Stephanie Bauer, Sascha Kolatschek, Ali Hreibi, Eddy\n  Patrick Rugeramigabo, Michael Jetter, Simone Luca Portalupi, Michael Zopf,\n  Peter Michler, Stefan K\\\"uck, and Fei Ding","title":"High-rate intercity quantum key distribution with a semiconductor\n  single-photon source","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall cond-mat.mtrl-sci physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum key distribution (QKD) enables the transmission of information that\nis secure against general attacks by eavesdroppers. The use of on-demand\nquantum light sources in QKD protocols is expected to help improve security and\nmaximum tolerable loss. Semiconductor quantum dots (QDs) are a promising\nbuilding block for quantum communication applications because of the\ndeterministic emission of single photons with high brightness and low\nmultiphoton contribution. Here we report on the first intercity QKD experiment\nusing a bright deterministic single photon source. A BB84 protocol based on\npolarisation encoding is realised using the high-rate single photons in the\ntelecommunication C-band emitted from a semiconductor QD embedded in a circular\nBragg grating structure. Utilising the 79 km long link with 25.49 dB loss\n(equivalent to 130 km for the direct-connected optical fibre) between the\nGerman cities of Hannover and Braunschweig, a record-high secret key bits per\npulse of 4.8e-5 with an average quantum bit error ratio of 0.65 % are\ndemonstrated. An asymptotic maximum tolerable loss of 28.11 dB is found,\ncorresponding to a length of 144 km of standard telecommunication fibre.\nDeterministic semiconductor sources therefore compete with state-of-the-art\ndecoy state QKD with weak coherent pulses with respect to high secret key rate\nand have the potential to excel in measurement device independent protocols and\nquantum repeater applications.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:57:07 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yang","Jingzhong",""],["Jiang","Zenghui",""],["Benthin","Frederik",""],["Hanel","Joscha",""],["Fandrich","Tom",""],["Joos","Raphael",""],["Bauer","Stephanie",""],["Kolatschek","Sascha",""],["Hreibi","Ali",""],["Rugeramigabo","Eddy Patrick",""],["Jetter","Michael",""],["Portalupi","Simone Luca",""],["Zopf","Michael",""],["Michler","Peter",""],["K\u00fcck","Stefan",""],["Ding","Fei",""]]}
{"id":"2308.15923","submitter":"Armin Stocker","authors":"Armin Stocker and Hermann de Meer","title":"A Tutorial on Resilience in Smart Grids","comments":null,"journal-ref":"2022 12th International Workshop on Resilient Networks Design and\n  Modeling (RNDM), Compi\\`egne, France, 2022, pp. 1-14","doi":"10.1109/RNDM55901.2022.9927711","report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A key quality of any kind of system is its ability to deliver its respective\nservice correctly. Often the unavailability of commercial systems may lead to\nlost revenue, which are minor compared to what may be at stake when critical\ninfrastructures fail. A failure to deliver critical services, such as clean\nwater or electricity may have dire consequences that endanger human lives and\nmay even halt or break other infrastructures. The services provided by critical\ninfrastructures need to be supplied continuously even when faced with\nre-configurations, outside disturbances and systemic changes. A system is\ncalled resilient if it fulfils this property. From the many critical\ninfrastructures that exist, power systems may be the most important ones,\nbecause they are supplying the required electricity for other critical\ninfrastructures. At the same time, a power system itself may be exposed to\nseveral disturbances from internal sources, e.g., fluctuations in the energy\ndemand, and external sources, e.g., heavy storms. Especially, fast dynamic\neffects caused by these disturbances may lead to deviations of grid frequency,\nshort-circuits, or, in severe cases, a total power system failure. As future\nscenarios will include more distributed renewable sources and less centralized\ngeneration from fossil fuels, ICT-based communication and coordination will\nplay an increasing role. This paper examines the notion of resilience, how it\nhas been traditionally ensured for the power system, and novel approaches to\nmaintain the frequency, protect people and devices against short circuits and\nrecover from a blackout. A special focus is on communication and the role that\ndistributed renewable generation plays for these processes.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:57:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Stocker","Armin",""],["de Meer","Hermann",""]]}
{"id":"2308.15924","submitter":"Jongsu Kim","authors":"Jongsu Kim","title":"Vacuum static spaces with harmonic curvature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article we make a thorough classification of (not necessarily\ncomplete) $n$-dimensional vacuum static spaces $(M,g,f)$ with harmonic\ncurvature and, as a corollary, obtain a classification of complete vacuum\nstatic spaces with harmonic curvature. Indeed, we showed that $(M,g,f)$ is\nlocally isometric to one of the following four types; (i) the Riemannian\nproduct of an Einstein manifold and a vacuum static space, (ii) the warped\nproduct over an interval with an Einstein manifold as fiber, (iii) an Einstein\nmanifold, (iv) the Riemannian product of two Einstein manifolds.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:58:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kim","Jongsu",""]]}
{"id":"2308.15925","submitter":"Matteo Rinaldi","authors":"Filippo Fornetti, Emanuele Pace, Matteo Rinaldi, Giovanni Salm\\`e,\n  Sergio Scopetta and Michele Viviani","title":"The EMC effect for few-nucleon bound systems in Light-Front Hamiltonian\n  Dynamics","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The light-front formalism for a covariant description of the European Muon\nCollaboration (EMC) effect, already applied to $^3$He, is formally extended to\nany nucleus, and used for actually calculating the $^3$H and $^4$He cases. The\nrealistic and accurate nuclear description of few-nucleon bound systems,\nobtained with both phenomenological and chiral potentials, has been properly\ncombined with the Poincare' covariance and macroscopic locality, automatically\nsatisfying both number of particles and momentum sum rule. While retaining the\non-mass-shell nucleon structure functions, one is then able to predict a\nsizable EMC effect for $^4$He, as already observed for $^3$He. Moreover, the\nimpact on the EMC effect of both i) the short-range correlations, such as those\ngenerated by modern nuclear interactions, and ii) the ratio between the neutron\nand proton structure functions has been studied. The short-range correlations\ngenerated by retaining only the standard nuclear degrees of freedom act on the\ndepth of the minimum in the EMC ratio, while the uncertainties linked to the\nratio of neutron to proton structure functions are found to be very small.\nThese light-front results facilitates ascribing deviations from experimental\ndata due to genuine QCD effects, not included in a standard nuclear\ndescription, and initiating unbiased investigations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:01:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fornetti","Filippo",""],["Pace","Emanuele",""],["Rinaldi","Matteo",""],["Salm\u00e8","Giovanni",""],["Scopetta","Sergio",""],["Viviani","Michele",""]]}
{"id":"2308.15926","submitter":"Jianghong Ma","authors":"Dezhao Yang, Jianghong Ma, Shanshan Feng, Haijun Zhang, Zhao Zhang","title":"IDVT: Interest-aware Denoising and View-guided Tuning for Social\n  Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the information age, recommendation systems are vital for efficiently\nfiltering information and identifying user preferences. Online social platforms\nhave enriched these systems by providing valuable auxiliary information.\nSocially connected users are assumed to share similar preferences, enhancing\nrecommendation accuracy and addressing cold start issues. However, empirical\nfindings challenge the assumption, revealing that certain social connections\ncan actually harm system performance. Our statistical analysis indicates a\nsignificant amount of noise in the social network, where many socially\nconnected users do not share common interests. To address this issue, we\npropose an innovative \\underline{I}nterest-aware \\underline{D}enoising and\n\\underline{V}iew-guided \\underline{T}uning (IDVT) method for the social\nrecommendation. The first ID part effectively denoises social connections.\nSpecifically, the denoising process considers both social network structure and\nuser interaction interests in a global view. Moreover, in this global view, we\nalso integrate denoised social information (social domain) into the propagation\nof the user-item interactions (collaborative domain) and aggregate user\nrepresentations from two domains using a gating mechanism. To tackle potential\nuser interest loss and enhance model robustness within the global view, our\nsecond VT part introduces two additional views (local view and dropout-enhanced\nview) for fine-tuning user representations in the global view through\ncontrastive learning. Extensive evaluations on real-world datasets with varying\nnoise ratios demonstrate the superiority of IDVT over state-of-the-art social\nrecommendation methods.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:03:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yang","Dezhao",""],["Ma","Jianghong",""],["Feng","Shanshan",""],["Zhang","Haijun",""],["Zhang","Zhao",""]]}
{"id":"2308.15927","submitter":"Alessandro Sfondrini","authors":"Nicola Baglioni, Davide Polvara, Andrea Pone, Alessandro Sfondrini","title":"On the worldsheet S matrix of the AdS3/CFT2 mixed-flux mirror model","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  String on $AdS_3\\times S^3\\times T^4$ backgrounds are known to be classically\nintegrable in the presence of a mixture of Ramond-Ramond and\nNeveu-Schwarz-Neveu-Schwarz fluxes. It is expected that this results in the\nexistence of a well-defined factorised worldsheet S matrix. In order to use\nintegrability to compute the string spectrum we need such a factorised S matrix\nto exist also for the \"mirror\" model, obtained by a double Wick rotation of the\noriginal worldsheet theory. In the mixed-flux case the mirror model has a\ncomplex Hamiltonian, which raises questions on its well-definedness. In the\npaper we study the worldsheet tree-level S matrix of the original and mirror\nmodel and discuss some necessary conditions for the integrability and reality\nof the spectrum.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:04:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Baglioni","Nicola",""],["Polvara","Davide",""],["Pone","Andrea",""],["Sfondrini","Alessandro",""]]}
{"id":"2308.15928","submitter":"Pawe{\\l} Gawrychowski","authors":"Bart{\\l}omiej Dudek and Pawe{\\l} Gawrychowski and Tatiana\n  Starikovskaya","title":"Sorting Signed Permutations by Reversals in Nearly-Linear Time","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a signed permutation on $n$ elements, we need to sort it with the\nfewest reversals. This is a fundamental algorithmic problem motivated by\napplications in comparative genomics, as it allows to accurately model\nrearrangements in small genomes. The first polynomial-time algorithm was given\nin the foundational work of Hannenhalli and Pevzner [J. ACM'99]. Their approach\nwas later streamlined and simplified by Kaplan, Shamir, and Tarjan [SIAM J.\nComput.'99] and their framework has eventually led to an algorithm that works\nin $\\mathcal{O}(n^{3/2}\\sqrt{\\log n})$ time given by Tannier, Bergeron, and\nSagot [Discr. Appl. Math.'07]. However, the challenge of finding a\nnearly-linear time algorithm remained unresolved. In this paper, we show how to\nleverage the results on dynamic graph connectivity to obtain a surprisingly\nsimple $\\mathcal{O}(n \\log^2 n / \\log \\log n)$ time algorithm for this problem.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:09:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dudek","Bart\u0142omiej",""],["Gawrychowski","Pawe\u0142",""],["Starikovskaya","Tatiana",""]]}
{"id":"2308.15929","submitter":"Sonae Hadama","authors":"Sonae Hadama","title":"Asymptotic stability of a wide class of stationary solutions for the\n  Hartree and Schr\\\"{o}dinger equations for infinitely many particles","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the Hartree and Schr\\\"{o}dinger equations describing the time\nevolution of wave functions of infinitely many interacting fermions in\nthree-dimensional space. These equations can be formulated using density\noperators, and they have infinitely many stationary solutions. In this paper,\nwe prove the asymptotic stability of a wide class of stationary solutions. We\nemphasize that our result includes Fermi gas at zero temperature. This is one\nof the most important steady states from the physics point of view; however,\nits asymptotic stability has been left open after Lewin and Sabin first\nformulated this stability problem and gave significant results in their seminal\nwork [arXiv:1310.0604].\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:12:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hadama","Sonae",""]]}
{"id":"2308.15930","submitter":"Yu Shu","authors":"Yu Shu, Siwei Dong, Guangyao Chen, Wenhao Huang, Ruihua Zhang, Daochen\n  Shi, Qiqi Xiang, Yemin Shi","title":"LLaSM: Large Language and Speech Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-modal large language models have garnered significant interest\nrecently. Though, most of the works focus on vision-language multi-modal models\nproviding strong capabilities in following vision-and-language instructions.\nHowever, we claim that speech is also an important modality through which\nhumans interact with the world. Hence, it is crucial for a general-purpose\nassistant to be able to follow multi-modal speech-and-language instructions. In\nthis work, we propose Large Language and Speech Model (LLaSM). LLaSM is an\nend-to-end trained large multi-modal speech-language model with cross-modal\nconversational abilities, capable of following speech-and-language\ninstructions. Our early experiments show that LLaSM demonstrates a more\nconvenient and natural way for humans to interact with artificial intelligence.\nSpecifically, we also release a large Speech Instruction Following dataset\nLLaSM-Audio-Instructions. Code and demo are available at\nhttps://github.com/LinkSoul-AI/LLaSM and\nhttps://huggingface.co/spaces/LinkSoul/LLaSM. The LLaSM-Audio-Instructions\ndataset is available at\nhttps://huggingface.co/datasets/LinkSoul/LLaSM-Audio-Instructions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:12:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Shu","Yu",""],["Dong","Siwei",""],["Chen","Guangyao",""],["Huang","Wenhao",""],["Zhang","Ruihua",""],["Shi","Daochen",""],["Xiang","Qiqi",""],["Shi","Yemin",""]]}
{"id":"2308.15931","submitter":"Tong Yang","authors":"Tong Yang, Jiangpin Liu, Yue Wang, Rong Xiong","title":"Sparse Waypoint Validity Checking for Self-Entanglement-Free Tethered\n  Path Planning","comments":"This is a generalised version of the authors' ICRA23 conference paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A novel mechanism to derive self-entanglement-free (SEF) path for tethered\ndifferential-driven robots is proposed in this work. The problem is tailored to\nthe deployment of tethered differential-driven robots in situations where an\nomni-directional tether re-tractor is not available. This is frequently\nencountered when it is impractical to concurrently equip an omni-directional\ntether retracting mechanism with other geometrically intricate devices, such as\na manipulator, which is notably relevant in applications like disaster\nrecovery, spatial exploration, etc. Without specific attention to the spatial\nrelation between the shape of the tether and the pose of the mobile unit, the\nissue of self-entanglement arises when the robot moves, resulting in unsafe\nrobot movements and the risk of damaging the tether. In this paper, the SEF\nconstraint is first formulated as the boundedness of a relative angle function\nwhich characterises the angular difference between the tether stretching\ndirection and the robot's heading direction. Then, a constrained\nsearching-based path planning algorithm is proposed which produces a path that\nis sub-optimal whilst ensuring the avoidance of tether self-entanglement.\nFinally, the algorithmic efficiency of the proposed path planner is further\nenhanced by proving the conditioned sparsity of the primitive path validity\nchecking module. The effectiveness of the proposed algorithm is assessed\nthrough case studies, comparing its performance against untethered\ndifferential-driven planners in challenging planning scenarios. A comparative\nanalysis is further conducted between the normal node expansion module and the\nimproved node expansion module which incorporates sparse waypoint validity\nchecking. Real-world tests are also conducted to validate the algorithm's\nperformance. An open-source implementation has also made available for the\nbenefit of the robotics community.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:21:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yang","Tong",""],["Liu","Jiangpin",""],["Wang","Yue",""],["Xiong","Rong",""]]}
{"id":"2308.15932","submitter":"Mohammad Hamghalam","authors":"Mohammad Hamghalam, Richard K. G. Do, and Amber L. Simpson","title":"Attention-based CT Scan Interpolation for Lesion Segmentation of\n  Colorectal Liver Metastases","comments":null,"journal-ref":"Proc. SPIE 12468, Medical Imaging 2023: Biomedical Applications in\n  Molecular, Structural, and Functional Imaging, 124680U (10 April 2023)","doi":"10.1117/12.2656072","report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Small liver lesions common to colorectal liver metastases (CRLMs) are\nchallenging for convolutional neural network (CNN) segmentation models,\nespecially when we have a wide range of slice thicknesses in the computed\ntomography (CT) scans. Slice thickness of CT images may vary by clinical\nindication. For example, thinner slices are used for presurgical planning when\nfine anatomic details of small vessels are required. While keeping the\neffective radiation dose in patients as low as possible, various slice\nthicknesses are employed in CRLMs due to their limitations. However,\ndifferences in slice thickness across CTs lead to significant performance\ndegradation in CT segmentation models based on CNNs. This paper proposes a\nnovel unsupervised attention-based interpolation model to generate intermediate\nslices from consecutive triplet slices in CT scans. We integrate segmentation\nloss during the interpolation model's training to leverage segmentation labels\nin existing slices to generate middle ones. Unlike common interpolation\ntechniques in CT volumes, our model highlights the regions of interest (liver\nand lesions) inside the abdominal CT scans in the interpolated slice. Moreover,\nour model's outputs are consistent with the original input slices while\nincreasing the segmentation performance in two cutting-edge 3D segmentation\npipelines. We tested the proposed model on the CRLM dataset to upsample\nsubjects with thick slices and create isotropic volume for our segmentation\nmodel. The produced isotropic dataset increases the Dice score in the\nsegmentation of lesions and outperforms other interpolation approaches in terms\nof interpolation metrics.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:21:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hamghalam","Mohammad",""],["Do","Richard K. G.",""],["Simpson","Amber L.",""]]}
{"id":"2308.15933","submitter":"Jose Manuel Ruiz Franco","authors":"Maximilian M. Schmidt, Jos\\'e Ruiz-Franco, Steffen Bochenek, Fabrizio\n  Camerin, Emanuela Zaccarelli, and Andrea Scotti","title":"Interfacial fluid rheology of soft 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":"  In situ interfacial rheology and numerical simulations are used to\ninvestigate microgel monolayers in a wide range of packing fractions,\n$\\zeta_{2D}$. The heterogeneous particle compressibility determines two flow\nregimes characterized by distinct master curves. To mimic the microgel\narchitecture and reproduce experiments, a potential combining a soft shoulder\nwith the Hertzian model is introduced. In contrast to bulk conditions, the\nmeasured elastic moduli vary non-monotonically with $\\zeta_{2D}$ at the\ninterface, confirming long-sought predictions of reentrant behavior for\nHertzian-like systems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:22:04 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Schmidt","Maximilian M.",""],["Ruiz-Franco","Jos\u00e9",""],["Bochenek","Steffen",""],["Camerin","Fabrizio",""],["Zaccarelli","Emanuela",""],["Scotti","Andrea",""]]}
{"id":"2308.15934","submitter":"Fabio Bagarello Dr.","authors":"Fabio Bagarello","title":"Uncertainty relation for non-Hermitian operators","comments":"In press in J. Phys. A","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":"  In this paper we discuss some aspects of the Heisenberg uncertainty relation,\nmostly from the point of view of non self-adjoint operators. Some equivalence\nresults, and some refinements of the inequality, are deduced, and some relevant\nexamples are discussed.\n  We also begin a sort of {\\em dynamical analysis} of the relation, in\nconnection with what has been recently called $\\gamma$-{dynamics} and\n$\\gamma$-symmetries, and we discuss in some details the role of different\nscalar products in our analysis.\n  The case of self-adjoint operators is recovered as a special case of our\ngeneral settings.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:24:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bagarello","Fabio",""]]}
{"id":"2308.15935","submitter":"Eerke Boiten","authors":"Isabel Wagner (University of Basel) and Eerke Boiten (De Montfort\n  University)","title":"What's going on at the back-end? Risks and benefits of smart toilets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a thematic analysis of an expert focus group considering\nsmart toilets that record health data. The themes that arise indicate risks,\nmany of which could be mitigated but currently are not, suggesting health\nbenefits for the moment override other concerns only in specific application\ncontexts.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:29:29 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wagner","Isabel","","University of Basel"],["Boiten","Eerke","","De Montfort\n  University"]]}
{"id":"2308.15936","submitter":"Chamalee Wickrama Arachchi Miss","authors":"Chamalee Wickrama Arachchi and Nikolaj Tatti","title":"Jaccard-constrained dense subgraph discovery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.LG cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Finding dense subgraphs is a core problem in graph mining with many\napplications in diverse domains. At the same time many real-world networks vary\nover time, that is, the dataset can be represented as a sequence of graph\nsnapshots. Hence, it is natural to consider the question of finding dense\nsubgraphs in a temporal network that are allowed to vary over time to a certain\ndegree. In this paper, we search for dense subgraphs that have large pairwise\nJaccard similarity coefficients. More formally, given a set of graph snapshots\nand a weight $\\lambda$, we find a collection of dense subgraphs such that the\nsum of densities of the induced subgraphs plus the sum of Jaccard indices,\nweighted by $\\lambda$, is maximized. We prove that this problem is NP-hard. To\ndiscover dense subgraphs with good objective value, we present an iterative\nalgorithm which runs in $\\mathcal{O}(n^2k^2 + m \\log n + k^3 n)$ time per\nsingle iteration, and a greedy algorithm which runs in $\\mathcal{O}(n^2k^2 + m\n\\log n + k^3 n)$ time, where $k$ is the length of the graph sequence and $n$\nand $m$ denote number of nodes and total number of edges respectively. We show\nexperimentally that our algorithms are efficient, they can find ground truth in\nsynthetic datasets and provide interpretable results from real-world datasets.\nFinally, we present a case study that shows the usefulness of our problem.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:33:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Arachchi","Chamalee Wickrama",""],["Tatti","Nikolaj",""]]}
{"id":"2308.15937","submitter":"Luis Brey","authors":"Luis Brey and H.A.Fertig","title":"Quantum Plasmons in Double Layer Systems","comments":"14 pages, including SI","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":"  Plasmons are fundamental excitations of metals which can be described in\nterms of electron dynamics, or in terms of the electromagnetic fields\nassociated with them. In this work we develop a quantum description of plasmons\nin a double layer structure, treating them as confined electromagnetic modes of\nthe structure. The structure of the resulting bosonic Hamiltonian indicates the\npresence of virtual plasmons of the individual layers which appear as quantum\nfluctuations in the ground state. For momenta smaller than the inverse\nseparation between layers, these modes are in the ultrastrong coupling regime.\nCoherence terms in the Hamiltonian indicate that modes with equal and opposite\nmomenta are entangled. We consider how in principle these entangled modes might\nbe accessed, by analyzing a situation in which the conductivity of one of the\ntwo layers suddenly drops to zero. The resulting density matrix has a large\nentanglement entropy at small momenta, and modes at $\\pm \\mathbf{q}$ that are\ninseparable. More practical routes to releasing and detecting entangled\nplasmons from this system are considered.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:33:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Brey","Luis",""],["Fertig","H. A.",""]]}
{"id":"2308.15938","submitter":"Yeshayahu Weiss","authors":"Michael Bar-Sinai, Achiya Elyasaf, Gera Weiss and Yeshayahu Weiss","title":"Provengo: A Tool Suite for Scenario Driven Model-Based Testing","comments":"4 pages, 3 figures, 2 listing","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present Provengo, a comprehensive suite of tools designed to facilitate\nthe implementation of Scenario-Driven Model-Based Testing (SDMBT), an\ninnovative approach that utilizes scenarios to construct a model encompassing\nthe user's perspective and the system's business value while also defining the\ndesired outcomes. With the assistance of Provengo, testers gain the ability to\neffortlessly create natural user stories and seamlessly integrate them into a\nmodel capable of generating effective tests. The demonstration illustrates how\nSDMBT effectively addresses the bootstrapping challenge commonly encountered in\nmodel-based testing (MBT) by enabling incremental development, starting from\nsimple models and gradually augmenting them with additional stories.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:34:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bar-Sinai","Michael",""],["Elyasaf","Achiya",""],["Weiss","Gera",""],["Weiss","Yeshayahu",""]]}
{"id":"2308.15939","submitter":"Hanqiu Deng","authors":"Hanqiu Deng, Zhaoxiang Zhang, Jinan Bao, Xingyu Li","title":"AnoVL: Adapting Vision-Language Models for Unified Zero-shot Anomaly\n  Localization","comments":null,"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) models have shown promising\nperformance on zero-shot visual recognition tasks by learning visual\nrepresentations under natural language supervision. Recent studies attempt the\nuse of CLIP to tackle zero-shot anomaly detection by matching images with\nnormal and abnormal state prompts. However, since CLIP focuses on building\ncorrespondence between paired text prompts and global image-level\nrepresentations, the lack of patch-level vision to text alignment limits its\ncapability on precise visual anomaly localization. In this work, we introduce a\ntraining-free adaptation (TFA) framework of CLIP for zero-shot anomaly\nlocalization. In the visual encoder, we innovate a training-free value-wise\nattention mechanism to extract intrinsic local tokens of CLIP for patch-level\nlocal description. From the perspective of text supervision, we particularly\ndesign a unified domain-aware contrastive state prompting template. On top of\nthe proposed TFA, we further introduce a test-time adaptation (TTA) mechanism\nto refine anomaly localization results, where a layer of trainable parameters\nin the adapter is optimized using TFA's pseudo-labels and synthetic\nnoise-corrupted tokens. With both TFA and TTA adaptation, we significantly\nexploit the potential of CLIP for zero-shot anomaly localization and\ndemonstrate the effectiveness of our proposed methods on various datasets.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:35:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Deng","Hanqiu",""],["Zhang","Zhaoxiang",""],["Bao","Jinan",""],["Li","Xingyu",""]]}
{"id":"2308.15940","submitter":"Lukas Freter","authors":"L. Freter, M. S. Mirmoosa, A. Sihvola, C. R. Simovski, S. A. Tretyakov","title":"Electromagnetic Effects in Anti-Hermitian Media with Gain and Loss","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Incorporating both gain and loss into electromagnetic systems provides\npossibilities to engineer effects in unprecedented ways. Concerning\nelectromagnetic effects in isotropic media that have concurrently electric and\nmagnetic responses, there is in fact a degree of freedom to distribute the gain\nand loss in different effective material parameters. In this paper, we\nanalytically scrutinize wave interactions with those media, and, most\nimportantly, we contemplate the extreme scenario where such media are\nanti-Hermitian. Considering various conditions for excitation, polarization,\nand geometry, we uncover important effects and functionalities such as lasing\ninto both surface waves and propagating waves, conversion of evanescent source\nfields to transmitted propagating waves, full absorption, and enhancing\nbackward to forward scattering ratio. We hope that these findings explicitly\nshow the potential of anti-Hermiticity to be used in optical physics as well as\nmicrowave engineering for creating and using unconventional wave phenomena.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:37:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Freter","L.",""],["Mirmoosa","M. S.",""],["Sihvola","A.",""],["Simovski","C. R.",""],["Tretyakov","S. A.",""]]}
{"id":"2308.15941","submitter":"Nicolas Bergmann","authors":"Nicolas Bergmann (1), Nicolas G H\\\"ormann (1) and Karsten Reuter (1)\n  ((1) Fritz-Haber-Institut der Max-Planck-Gesellschaft, Berlin, Germany )","title":"Ab-Initio-Based Modeling of Thermodynamic Cyclic Voltammograms: A\n  Benchmark Study on Ag(100) in Bromide Solutions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Experimental cyclic voltammograms (CVs) measured in the slow scan rate limit\ncan be entirely described in terms of thermodynamic equilibrium quantities of\nthe electrified solid-liquid interface. They correspondingly serve as an\nimportant benchmark for the quality of first-principles calculations of the\ninterfacial thermodynamics. Here, we investigate the partially drastic\napproximations made presently in computationally efficient such calculations\nfor the well-defined showcase of a Ag(100) model electrode in Br-containing\nelectrolytes, where the non-trivial part of the CV stems from the\nelectrosorption of Br ions. We specifically study the entanglement of common\napproximations in the treatment of solvation and field effects, as well as in\nthe way macroscopic averages of the two key quantities, namely the\npotential-dependent adsorbate coverage and electrosorption valency, are derived\nfrom the first-principles energetics. We demonstrate that the combination of\nenergetics obtained within an implicit solvation model and a perturbative\nsecond order account of capacitive double layer effects with a\nconstant-potential grand-canonical Monte Carlo sampling of the adsorbate layer\nprovides an accurate description of the experimental CV. However, our analysis\nalso shows that error cancellation at lower levels of theory may equally lead\nto good descriptions even though key underlying physics like the disorder-order\ntransition of the Br adlayer at increasing coverages is inadequately treated.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:45:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bergmann","Nicolas","","Fritz-Haber-Institut der Max-Planck-Gesellschaft, Berlin, Germany"],["H\u00f6rmann","Nicolas G","","Fritz-Haber-Institut der Max-Planck-Gesellschaft, Berlin, Germany"],["Reuter","Karsten","","Fritz-Haber-Institut der Max-Planck-Gesellschaft, Berlin, Germany"]]}
{"id":"2308.15942","submitter":"Qiegen Liu","authors":"Kai Xu, Shiyu Lu, Bin Huang, Weiwen Wu, Qiegen Liu","title":"Stage-by-stage Wavelet Optimization Refinement Diffusion Model for\n  Sparse-View CT Reconstruction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diffusion models have emerged as potential tools to tackle the challenge of\nsparse-view CT reconstruction, displaying superior performance compared to\nconventional methods. Nevertheless, these prevailing diffusion models\npredominantly focus on the sinogram or image domains, which can lead to\ninstability during model training, potentially culminating in convergence\ntowards local minimal solutions. The wavelet trans-form serves to disentangle\nimage contents and features into distinct frequency-component bands at varying\nscales, adeptly capturing diverse directional structures. Employing the Wavelet\ntransform as a guiding sparsity prior significantly enhances the robustness of\ndiffusion models. In this study, we present an innovative approach named the\nStage-by-stage Wavelet Optimization Refinement Diffusion (SWORD) model for\nsparse-view CT reconstruction. Specifically, we establish a unified\nmathematical model integrating low-frequency and high-frequency generative\nmodels, achieving the solution with optimization procedure. Furthermore, we\nperform the low-frequency and high-frequency generative models on wavelet's\ndecomposed components rather than sinogram or image domains, ensuring the\nstability of model training. Our method rooted in established optimization\ntheory, comprising three distinct stages, including low-frequency generation,\nhigh-frequency refinement and domain transform. Our experimental results\ndemonstrate that the proposed method outperforms existing state-of-the-art\nmethods both quantitatively and qualitatively.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:48:53 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xu","Kai",""],["Lu","Shiyu",""],["Huang","Bin",""],["Wu","Weiwen",""],["Liu","Qiegen",""]]}
{"id":"2308.15943","submitter":"Kun Lin Liu","authors":"Kun-Lin Liu, Yu-Heng Chen, Chiao-Yin Wang, Po-Hsiang Tsui, Meng-Lin Li","title":"Improved Ultrasound Attenuation Coefficient Estimation Using Spectral\n  Normalization on Local Interference-Free Single-Scatterer Power Spectrum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultrasound attenuation coefficient estimation (ACE) can be utilized to\nquantify liver fat content, offering significant diagnostic potential in\naddressing the growing global public health issue of non-alcoholic fatty liver\nand other chronic liver diseases. Among ACE methods, the reference frequency\nmethod (RFM) proposed recently possesses the advantages of being\nsystem-independent and not requiring reference phantom. However, the presence\nof large oscillations in frequency power ratio decay curves leads to unstable\nACE results with RFM, originating from noise as well as constructive and\ndestructive interference in the backscattered signal's power spectrum. To\naddress this issue, we propose an improved RFM version where a single-scatterer\npower spectrum estimator is incorporated to restore interference free\nsingle-scatterer power spectrum, thereby reducing oscillations in the frequency\npower ratio decay curves and greatly improving the accuracy of ACE.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:49:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Kun-Lin",""],["Chen","Yu-Heng",""],["Wang","Chiao-Yin",""],["Tsui","Po-Hsiang",""],["Li","Meng-Lin",""]]}
{"id":"2308.15944","submitter":"Ji-Hoon Jeong","authors":"Euijong Lee, Jaemin Jung, Gee-Myung Moon, Seong-Whan Lee, and Ji-Hoon\n  Jeong","title":"WUDI: A Human Involved Self-Adaptive Framework to Prevent Childhood\n  Obesity in Internet of Things Environment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Internet of Things (IoT) connects people, devices, and information\nresources, in various domains to improve efficiency. The healthcare domain has\nbeen transformed by the integration of the IoT, leading to the development of\ndigital healthcare solutions such as health monitoring, emergency detection,\nand remote operation. This integration has led to an increase in the health\ndata collected from a variety of IoT sources. Consequently, advanced\ntechnologies are required to analyze health data, and artificial intelligence\nhas been employed to extract meaningful insights from the data. Childhood\noverweight and obesity have emerged as some of the most serious global public\nhealth challenges, as they can lead to a variety of health-related problems and\nthe early development of chronic diseases. To address this, a self-adaptive\nframework is proposed to prevent childhood obesity by using lifelog data from\nIoT environments, with human involvement being an important consideration in\nthe framework. The framework uses an ensemble-based learning model to predict\nobesity using the lifelog data. Empirical experiments using lifelog data from\nsmartphone applications were conducted to validate the effectiveness of human\ninvolvement and obesity prediction. The results demonstrated the efficiency of\nthe proposed framework with human involvement in obesity prediction. The\nproposed framework can be applied in real-world healthcare services for\nchildhood obesity.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:52:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lee","Euijong",""],["Jung","Jaemin",""],["Moon","Gee-Myung",""],["Lee","Seong-Whan",""],["Jeong","Ji-Hoon",""]]}
{"id":"2308.15945","submitter":"Christophe Veaux","authors":"Christophe Veaux, Ranniery Maia, Spyridoula Papendreou","title":"The DeepZen Speech Synthesis System for Blizzard Challenge 2023","comments":"Blizzard Challenge 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper describes the DeepZen text to speech (TTS) system for Blizzard\nChallenge 2023. The goal of this challenge is to synthesise natural and\nhigh-quality speech in French, from a large monospeaker dataset (hub task) and\nfrom a smaller dataset by speaker adaptation (spoke task). We participated to\nboth tasks with the same model architecture. Our approach has been to use an\nauto-regressive model, which retains an advantage for generating natural\nsounding speech but to improve prosodic control in several ways. Similarly to\nnon-attentive Tacotron, the model uses a duration predictor and gaussian\nupsampling at inference, but with a simpler unsupervised training. We also\nmodel the speaking style at both sentence and word levels by extracting global\nand local style tokens from the reference speech. At inference, the global and\nlocal style tokens are predicted from a BERT model run on text. This BERT model\nis also used to predict specific pronunciation features like schwa elision and\noptional liaisons. Finally, a modified version of HifiGAN trained on a large\npublic dataset and fine-tuned on the target voices is used to generate speech\nwaveform. Our team is identified as O in the the Blizzard evaluation and MUSHRA\ntest results show that our system performs second ex aequo in both hub task\n(median score of 0.75) and spoke task (median score of 0.68), over 18 and 14\nparticipants, respectively.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:52:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Veaux","Christophe",""],["Maia","Ranniery",""],["Papendreou","Spyridoula",""]]}
{"id":"2308.15946","submitter":"Huu-Thinh Do","authors":"Huu-Thinh Do and Ionela Prodan","title":"Experimental validation of an explicit flatness-based MPC design for\n  quadcopter position tracking","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":"  Due to the nonlinearities and operational constraints typical to quadcopter\nmissions, Model Predictive Control (MPC) encounters the major challenge of high\ncomputational power necessary for the online implementation. This problem may\nprove impractical, especially for a hardware-limited or small-scale setup. By\nremoving the need for online solvers while keeping the constraint satisfaction\nand optimality, Explicit MPC (ExMPC) stands out as a strong candidate for this\napplication. Yet, the formulation was usually hindered by the two main\nproblems: nonlinearity and dimensionality. In this paper, we propose an ExMPC\nsolution for the quadcopter position stabilization by analyzing its description\n(dynamics and constraints) in the flat output space. With the former issue, the\nsystem is exactly linearized into a concatenation of three double integrators\nat a price of cumbersome constraints in the new coordinates. For the latter,\nwith a suitable characterization of these constraints, the stabilizing ExMPC\ncan be computed for each double integrator separately. The controller is then\nvalidated via simulations and experimental tests. The proposed scheme achieves\nsimilar performance and guarantees to the state-of-the-art solution but with\nnotably less computational effort, allowing scalability in a centralized manner\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:53:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Do","Huu-Thinh",""],["Prodan","Ionela",""]]}
{"id":"2308.15947","submitter":"George Fikioris","authors":"Christos Mystilidis, George Fikioris, Christos Tserkezis, Guy A. E.\n  Vandenbosch, and Xuezhi Zheng","title":"The Uniqueness Theorem for Nonlocal Hydrodynamic Media","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":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate a fundamental electromagnetic theorem, namely the uniqueness\ntheorem, in the context of nonlocal electromagnetics, as simulated by a popular\nsemiclassical model, the Hydrodynamic Drude Model (HDM) and extensions thereof\nsuch as the Generalized Nonlocal Optical Response (GNOR). The derivations and\nproofs presented here give a theoretical foundation to the use of the\nAdditional Boundary Conditions (ABCs), whose necessity is recognized and\nunderlined in virtually all implementations and applications of HDM. Our proofs\nfollow a mathematically relaxed style, borrowing from the literature of\nestablished electromagnetics textbooks that study the matter from an\nengineering perspective. Through this simpler route we deduce clear and\nintuitive material-response requirements for uniqueness to hold, while using a\nfamiliar parlance in a topic that is mostly studied through a physics\nperspective. Two numerical examples that examine the problem from either a\nsemianalytical or a purely numerical viewpoint support our findings.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:55:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mystilidis","Christos",""],["Fikioris","George",""],["Tserkezis","Christos",""],["Vandenbosch","Guy A. E.",""],["Zheng","Xuezhi",""]]}
{"id":"2308.15948","submitter":"Jason R.C. Nurse Dr","authors":"Maria Bada and Jason R. C. Nurse","title":"Exploring Cybercriminal Activities, Behaviors and Profiles","comments":null,"journal-ref":"Applied Cognitive Science and Technology, 2023","doi":"10.1007/978-981-99-3966-4_7","report-no":null,"categories":"cs.CR cs.CY cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While modern society benefits from a range of technological advancements, it\nalso is exposed to an ever-increasing set of cybersecurity threats. These\naffect all areas of life including business, government, and individuals. To\ncomplement technology solutions to this problem, it is crucial to understand\nmore about cybercriminal perpetrators themselves, their use of technology,\npsychological aspects, and profiles. This is a topic that has received little\nsocio-technical research emphasis in the technology community, has few concrete\nresearch findings, and is thus a prime area for development. The aim of this\narticle is to explore cybercriminal activities and behavior from a psychology\nand human aspects perspective, through a series of notable case studies. We\nexamine motivations, psychological and other interdisciplinary concepts as they\nmay impact/influence cybercriminal activities. We expect this paper to be of\nvalue and particularly insightful for those studying technology, psychology,\nand criminology, with a focus on cybersecurity and cybercrime.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:57:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bada","Maria",""],["Nurse","Jason R. C.",""]]}
{"id":"2308.15949","submitter":"Yizeng Han","authors":"Yizeng Han, Zeyu Liu, Zhihang Yuan, Yifan Pu, Chaofei Wang, Shiji\n  Song, Gao Huang","title":"Latency-aware Unified Dynamic Networks for Efficient Image Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dynamic computation has emerged as a promising avenue to enhance the\ninference efficiency of deep networks. It allows selective activation of\ncomputational units, leading to a reduction in unnecessary computations for\neach input sample. However, the actual efficiency of these dynamic models can\ndeviate from theoretical predictions. This mismatch arises from: 1) the lack of\na unified approach due to fragmented research; 2) the focus on algorithm design\nover critical scheduling strategies, especially in CUDA-enabled GPU contexts;\nand 3) challenges in measuring practical latency, given that most libraries\ncater to static operations. Addressing these issues, we unveil the\nLatency-Aware Unified Dynamic Networks (LAUDNet), a framework that integrates\nthree primary dynamic paradigms-spatially adaptive computation, dynamic layer\nskipping, and dynamic channel skipping. To bridge the theoretical and practical\nefficiency gap, LAUDNet merges algorithmic design with scheduling optimization,\nguided by a latency predictor that accurately gauges dynamic operator latency.\nWe've tested LAUDNet across multiple vision tasks, demonstrating its capacity\nto notably reduce the latency of models like ResNet-101 by over 50% on\nplatforms such as V100, RTX3090, and TX2 GPUs. Notably, LAUDNet stands out in\nbalancing accuracy and efficiency. Code is available at:\nhttps://www.github.com/LeapLabTHU/LAUDNet.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 10:57:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Han","Yizeng",""],["Liu","Zeyu",""],["Yuan","Zhihang",""],["Pu","Yifan",""],["Wang","Chaofei",""],["Song","Shiji",""],["Huang","Gao",""]]}
{"id":"2308.15950","submitter":"Soroush Sadeghnejad Prof.","authors":"Amir Mohammad Zarif Shahsavan Nejad, Amir Mahdi Zarif Shahsavan Nejad,\n  Amirali Setayeshi, Soroush Sadeghnejad","title":"High Performance Networking Layer for Simulation Applications","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous vehicles are one of the most popular and also fast-growing\ntechnologies in the world. As we go further, there are still a lot of\nchallenges that are unsolved and may cause problems in the future when it comes\nto testing in real world. Simulations on the other hand have always had a huge\nimpact in the fields of science, technology, physics, etc. The simulation also\npowers real-world Autonomous Vehicles nowadays. Therefore, We have built an\nAutonomous Vehicle Simulation Software - called AVIS Engine - that provides\ntools and features that help develop autonomous vehicles in various\nenvironments. AVIS Engine features an advanced input and output system for the\nvehicle and includes a traffic system and vehicle sensor system which can be\ncommunicated using the fast networking system and ROS Bridge.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:00:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Nejad","Amir Mohammad Zarif Shahsavan",""],["Nejad","Amir Mahdi Zarif Shahsavan",""],["Setayeshi","Amirali",""],["Sadeghnejad","Soroush",""]]}
{"id":"2308.15951","submitter":"Marcelino Agundez","authors":"M. Agundez, N. Marcelino, B. Tercero, J. Cernicharo","title":"How widespread are aromatic cycles in cold clouds?","comments":"Accepted for publication in A&A Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report the detection of large hydrocarbon cycles toward several cold dense\nclouds. We observed four sources (L1495B, Lupus-1A, L483, and L1527) in the Q\nband (31-50 GHz) using the Yebes 40m radiotelescope. Using the line stack\ntechnique, we find statistically significant evidence of benzonitrile (C6H5CN)\nin L1495B, Lupus-1A, and L483 at the 31.8 sigma, 15.0 sigma, and 17.2 sigma\nlevels, respectively, while there is no hint of C6H5CN in the fourth source,\nL1527. The column densities derived are in the range (1.8-4.0)e12 cm-2, which\nis somewhat below the value derived toward the cold dense cloud TMC-1. When we\nanalyse together all the benzonitrile abundances derived toward cold clouds in\nthis study and in the literature, a clear trend emerges in which the higher the\nabundance of HC7N, the more abundant C6H5CN is. This indicates that aromatic\ncycles are specially favored in those interstellar clouds where long carbon\nchains are abundant, which suggests that the chemical processes that are\nresponsible for the formation of linear carbon chains are also behind the\nsynthesis of aromatic rings. We also searched for cycles other than\nbenzonitrile, and found evidence of indene (C9H8), cyclopentadiene (C5H6), and\n1-cyano cyclopentadiene (1-C5H5CN) at the 9.3 sigma, 7.5 sigma, and 8.4 sigma,\nrespectively, toward L1495B, which shows the strongest signal from C6H5CN. The\nrelative abundances between the various cycles detected in L1495B are\nconsistent, within a factor of three, to those found previously in TMC-1. It is\ntherefore likely that not only C6H5CN but also other large aromatic cycles are\nabundant in clouds rich in carbon chains.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:00:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Agundez","M.",""],["Marcelino","N.",""],["Tercero","B.",""],["Cernicharo","J.",""]]}
{"id":"2308.15952","submitter":"Anton Alekseev","authors":"Anton Alekseev, Sergey I. Nikolenko, Gulnara Kabaeva","title":"Benchmarking Multilabel Topic Classification in the Kyrgyz Language","comments":"Accepted to AIST 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kyrgyz is a very underrepresented language in terms of modern natural\nlanguage processing resources. In this work, we present a new public benchmark\nfor topic classification in Kyrgyz, introducing a dataset based on collected\nand annotated data from the news site 24.KG and presenting several baseline\nmodels for news classification in the multilabel setting. We train and evaluate\nboth classical statistical and neural models, reporting the scores, discussing\nthe results, and proposing directions for future work.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:02:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Alekseev","Anton",""],["Nikolenko","Sergey I.",""],["Kabaeva","Gulnara",""]]}
{"id":"2308.15953","submitter":"Ueli Angst","authors":"Federico Martinelli-Orlando, Shishir Mundra, Ueli M. Angst","title":"Mechanism of cathodic protection of iron and steel in porous media","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cathodic protection (CP) was introduced two centuries ago and since has found\nwidespread application in protecting structures such as pipelines, offshore\ninstallations, and bridges from corrosion. Despite its extensive use, the\nfundamental working mechanism of CP remains debated, particularly for metals in\nporous media such as soil. Here, we offer resolution to the long-standing\ndebate by employing in-situ and ex-situ characterisation techniques coupled\nwith electrochemical measurements to characterise the spatio-temporal changes\noccurring at the steel-electrolyte interface. We show that upon CP, the\ninterfacial electrolyte undergoes alkalinisation and deoxygenation, and that\ndepending on polarisation conditions, an iron oxide film can simultaneously\nform on the steel surface. We further demonstrate that these changes in\ninterfacial electrolyte chemistry and steel surface state result in altered\nanodic and cathodic reactions and their kinetics. We propose a mechanism of CP\nthat integrates the long debated theories, based on both concentration and\nactivation polarisation, complimentarily. Implications of this coherent\nscientific understanding for enhancing corrosion protection technologies and\nthe safe, economic, and environmental-friendly operation of critical\nsteel-based infrastructures are discussed.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:09:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Martinelli-Orlando","Federico",""],["Mundra","Shishir",""],["Angst","Ueli M.",""]]}
{"id":"2308.15954","submitter":"Hiromu Nakano","authors":"Hiromu Nakano","title":"Fusion rules for the triplet $W$-algebra $\\mathcal{W}_{p_+,p_-}$","comments":"65 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math-ph math.MP math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the structure of fusion rules for the triplet $W$-algebra\n$\\mathcal{W}_{p_+,p_-}$. By using the vertex tensor category theory developed\nby Huang, Lepowsky and Zhang, we rederive certain non-semisimple fusion rules\ngiven by Gaberdiel-Runkel-Wood and Rasmussen. We further show that certain rank\ntwo and three indecomposable modules are self-dual.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:13:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Nakano","Hiromu",""]]}
{"id":"2308.15955","submitter":"Vale Gonz\\'alez Lobos","authors":"Vale Gonz\\'alez Lobos, Fabrizio Arrigoni Battaia, Seok-Jun Chang, Max\n  Gronke, Guinevere Kauffmann, Chian-Chou Chen, Hai Fu, Aura Obreja and\n  Emanuele P. Farina","title":"Circumgalactic Ly$\\alpha$ emission around submillimeter-bright galaxies\n  with different quasar contributions","comments":"17 pages, 9 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present VLT/MUSE observations targeting the extended Lyman-$\\alpha$\n(Ly$\\alpha$) emission of five high-redshift ($z\\sim$3-4) submillimeter galaxies\n(SMGs) with increasing quasar (QSO) radiation: two SMGs, two SMGs hosting a\nQSO, and one SMG hosting a QSO with a SMG companion (QSO+SMG). These sources\nshould be located in dark matter halos of comparable masses (average mass of\n$M_{\\rm DM}\\sim10^{12.2}\\,{\\rm M}_\\odot$). We quantify the luminosity and\nextent of the Ly$\\alpha$ emission, together with its kinematics, and examine\nfour Ly$\\alpha$ powering mechanisms: photoionization from QSOs/star formation,\nshocks by galactic/QSO outflows, gravitational cooling radiation, and\nLy$\\alpha$ photons resonant scattering. We find a variety of Ly$\\alpha$\nluminosities and extents, with the QSO+SMG system displaying the most extended\nand bright nebula, followed by the SMGs hosting a QSO, and finally the\nundetected circumgalactic medium (CGM) of SMGs. This diversity implies that\ngravitational cooling is unlikely to be the main powering mechanism. We show\nthat photoionization from the QSO and QSO outflows can contribute to power the\nemission for average densities $n_{\\rm H}>0.5\\,$cm$^{-3}$. Moreover, the\nobserved Ly$\\alpha$ luminosities scale with the QSO's budget of Ly$\\alpha$\nphotons modulo the dust content in each galaxy, highlighting a possible\ncontribution from resonant scattering of QSO's radiation in powering the\nnebulae. We find larger Ly$\\alpha$ linewidths (FWHM$\\gtrsim\n1200\\,$km$\\,$s$^{-1}$) than usually reported around radio-quiet systems,\npointing to large-scale outflows. A statistical survey targeting similar\nhigh-redshift massive systems with known host properties is needed to confirm\nour findings.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:16:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lobos","Vale Gonz\u00e1lez",""],["Battaia","Fabrizio Arrigoni",""],["Chang","Seok-Jun",""],["Gronke","Max",""],["Kauffmann","Guinevere",""],["Chen","Chian-Chou",""],["Fu","Hai",""],["Obreja","Aura",""],["Farina","Emanuele P.",""]]}
{"id":"2308.15956","submitter":"Emanuele Greco","authors":"Emanuele Greco, Jacco Vink, Amael Ellien, Carlo Ferrigno","title":"Jitter radiation as an alternative mechanism for the nonthermal X-ray\n  emission of Cassiopeia A","comments":"Accepted for publications on ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Synchrotron radiation from relativistic electrons is usually invoked as the\nresponsible for the nonthermal emission observed in Supernova Remnants (SNRs).\nDiffusive shock acceleration (DSA) is the most popular mechanism to explain the\nprocess of particles acceleration and within its framework a crucial role is\nplayed by the turbulent magnetic-field. However, the standard models commonly\nused to fit X-ray synchrotron emission do not take into account the effects of\nturbulence in the shape of the resulting photon spectra. An alternative\nmechanism that properly includes such effects is the jitter radiation, that\nprovides for an additional power-law beyond the classical synchrotron cutoff.\nWe fitted a jitter spectral model to Chandra, NuSTAR, SWIFT/BAT and\nINTEGRAL/ISGRI spectra of Cassiopeia A and found that it describes the X-ray\nsoft-to-hard range better than any of the standard cutoff models. The jitter\nradiation allows us to measure the index of the magnetic turbulence spectrum\n$\\nu_B$ and the minimum scale of the turbulence $\\lambda_{\\rm{min}}$ across\nseveral regions of Cas A, with best-fit values $\\nu_B \\sim 2-2.4$ and\n$\\lambda_{\\rm{min}} \\lesssim 100$ km.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:17:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Greco","Emanuele",""],["Vink","Jacco",""],["Ellien","Amael",""],["Ferrigno","Carlo",""]]}
{"id":"2308.15957","submitter":"Diego Royo","authors":"Diego Royo and Zesheng Huang and Yun Liang and Boyan Song and Adolfo\n  Mu\\~noz and Diego Gutierrez and Julio Marco","title":"Structure-Aware Parametric Representations for Time-Resolved Light\n  Transport","comments":null,"journal-ref":null,"doi":"10.1364/OL.465316","report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Time-resolved illumination provides rich spatio-temporal information for\napplications such as accurate depth sensing or hidden geometry reconstruction,\nbecoming a useful asset for prototyping and as input for data-driven\napproaches. However, time-resolved illumination measurements are\nhigh-dimensional and have a low signal-to-noise ratio, hampering their\napplicability in real scenarios. We propose a novel method to compactly\nrepresent time-resolved illumination using mixtures of exponentially-modified\nGaussians that are robust to noise and preserve structural information. Our\nmethod yields representations two orders of magnitude smaller than discretized\ndata, providing consistent results in applications such as hidden scene\nreconstruction and depth estimation, and quantitative improvements over\nprevious approaches.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:23:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Royo","Diego",""],["Huang","Zesheng",""],["Liang","Yun",""],["Song","Boyan",""],["Mu\u00f1oz","Adolfo",""],["Gutierrez","Diego",""],["Marco","Julio",""]]}
{"id":"2308.15958","submitter":"Tamara Servi Dr.","authors":"Raf Cluckers, Georges Comte, Tamara Servi","title":"Parametric Fourier and Mellin transforms of power-constructible\n  functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.AG math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We enrich the class of power-constructible functions, introduced in [CCRS23],\nto a class of algebras of functions which contains all complex powers of\nsubanalytic functions, their parametric Mellin and Fourier transforms, and\nwhich is stable under parametric integration. By describing a set of generators\nof a special prepared form we deduce information on the asymptotics and on the\nloci of integrability of the functions of the class. We furthermore identify a\nsubclass which is the smallest class containing all power-constructible\nfunctions and stable under parametric Fourier transforms and right-composition\nwith subanalytic maps. This subclass is also stable under parametric\nintegration, under taking pointwise and $L^p$limits, and under parametric\nFourier-Plancherel transforms. Finally, we give a full asymptotic expansion in\nthe power-logarithmic scale, uniformly in the parameters, for functions in this\nsubclass.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:23:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cluckers","Raf",""],["Comte","Georges",""],["Servi","Tamara",""]]}
{"id":"2308.15959","submitter":"Adam Doliwa","authors":"Adam Doliwa","title":"B\\\"{a}cklund transformations as integrable discretization. The geometric\n  approach","comments":"18 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present interpretation of known results in the theory of discrete\nasymptotic and discrete conjugate nets from the \"discretization by B\\\"{a}cklund\ntransformations\" point of view. We collect both classical formulas of XIXth\ncentury differential geometry of surfaces and their transformations, and more\nrecent results from geometric theory of integrable discrete equations. We first\npresent transformations of hyperbolic surfaces within the context of the\nMoutard equation and Weingarten congruences. The permutability property of the\ntransformations provides a way to construct integrable discrete analogs of the\nasymptotic nets for such surfaces. Then after presenting the theory of\nconjugate nets and their transformations we apply the principle that\nB\\\"{a}cklund transformations provide integrable discretization to obtain known\nresults on the discrete conjugate nets. The same approach gives, via the\nRibaucour transformations, discrete integrable analogs of orthogonal conjugate\nnets.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:24:04 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Doliwa","Adam",""]]}
{"id":"2308.15960","submitter":"Harshith Mohan Kumar","authors":"Harshith Mohan Kumar, Sean Lawrence","title":"Fusing Pseudo Labels with Weak Supervision for Dynamic Traffic Scenarios","comments":"This work was accepted as an extended abstract at the International\n  Conference on Computer Vision (ICCV) 2023 BRAVO Workshop, Paris, France","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Advanced Driver Assistance Systems (ADAS) have made significant strides,\ncapitalizing on computer vision to enhance perception and decision-making\ncapabilities. Nonetheless, the adaptation of these systems to diverse traffic\nscenarios poses challenges due to shifts in data distribution stemming from\nfactors such as location, weather, and road infrastructure. To tackle this, we\nintroduce a weakly-supervised label unification pipeline that amalgamates\npseudo labels from a multitude of object detection models trained on\nheterogeneous datasets. Our pipeline engenders a unified label space through\nthe amalgamation of labels from disparate datasets, rectifying bias and\nenhancing generalization. We fine-tune multiple object detection models on\nindividual datasets, subsequently crafting a unified dataset featuring pseudo\nlabels, meticulously validated for precision. Following this, we retrain a\nsolitary object detection model using the merged label space, culminating in a\nresilient model proficient in dynamic traffic scenarios. We put forth a\ncomprehensive evaluation of our approach, employing diverse datasets\noriginating from varied Asian countries, effectively demonstrating its efficacy\nin challenging road conditions. Notably, our method yields substantial\nenhancements in object detection performance, culminating in a model with\nheightened resistance against domain shifts.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:33:07 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kumar","Harshith Mohan",""],["Lawrence","Sean",""]]}
{"id":"2308.15961","submitter":"Francesco Dalla Serra","authors":"Francesco Dalla Serra, Chaoyang Wang, Fani Deligianni, Jeffrey Dalton,\n  Alison Q. O'Neil","title":"Finding-Aware Anatomical Tokens for Chest X-Ray Automated Reporting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The task of radiology reporting comprises describing and interpreting the\nmedical findings in radiographic images, including description of their\nlocation and appearance. Automated approaches to radiology reporting require\nthe image to be encoded into a suitable token representation for input to the\nlanguage model. Previous methods commonly use convolutional neural networks to\nencode an image into a series of image-level feature map representations.\nHowever, the generated reports often exhibit realistic style but imperfect\naccuracy. Inspired by recent works for image captioning in the general domain\nin which each visual token corresponds to an object detected in an image, we\ninvestigate whether using local tokens corresponding to anatomical structures\ncan improve the quality of the generated reports. We introduce a novel\nadaptation of Faster R-CNN in which finding detection is performed for the\ncandidate bounding boxes extracted during anatomical structure localisation. We\nuse the resulting bounding box feature representations as our set of\nfinding-aware anatomical tokens. This encourages the extracted anatomical\ntokens to be informative about the findings they contain (required for the\nfinal task of radiology reporting). Evaluating on the MIMIC-CXR dataset of\nchest X-Ray images, we show that task-aware anatomical tokens give\nstate-of-the-art performance when integrated into an automated reporting\npipeline, yielding generated reports with improved clinical accuracy.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:35:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Serra","Francesco Dalla",""],["Wang","Chaoyang",""],["Deligianni","Fani",""],["Dalton","Jeffrey",""],["O'Neil","Alison Q.",""]]}
{"id":"2308.15962","submitter":"Tianyu Wang","authors":"Tianyu Wang, Yifan Li, Haitao Lin, Xiangyang Xue, Yanwei Fu","title":"WALL-E: Embodied Robotic WAiter Load Lifting with Large Language Model","comments":"14 pages, 8 figures. See https://star-uu-wang.github.io/WALL-E/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Enabling robots to understand language instructions and react accordingly to\nvisual perception has been a long-standing goal in the robotics research\ncommunity. Achieving this goal requires cutting-edge advances in natural\nlanguage processing, computer vision, and robotics engineering. Thus, this\npaper mainly investigates the potential of integrating the most recent Large\nLanguage Models (LLMs) and existing visual grounding and robotic grasping\nsystem to enhance the effectiveness of the human-robot interaction. We\nintroduce the WALL-E (Embodied Robotic WAiter load lifting with Large Language\nmodel) as an example of this integration. The system utilizes the LLM of\nChatGPT to summarize the preference object of the users as a target instruction\nvia the multi-round interactive dialogue. The target instruction is then\nforwarded to a visual grounding system for object pose and size estimation,\nfollowing which the robot grasps the object accordingly. We deploy this\nLLM-empowered system on the physical robot to provide a more user-friendly\ninterface for the instruction-guided grasping task. The further experimental\nresults on various real-world scenarios demonstrated the feasibility and\nefficacy of our proposed framework. See the project website at:\nhttps://star-uu-wang.github.io/WALL-E/\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:35:21 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 13:51:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Tianyu",""],["Li","Yifan",""],["Lin","Haitao",""],["Xue","Xiangyang",""],["Fu","Yanwei",""]]}
{"id":"2308.15963","submitter":"Hui Deng","authors":"Kai Sun and Hui Deng","title":"Polariton-Induced Unconventional Superconductivity and Emergent SU(2)\n  Symmetry in Moire flat bands","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We propose a polariton-moir\\'e coupled system to realize an exact solvable\nmodel of strongly correlated superconductors. The polariton condensate induces\nintervalley attraction between moir\\'e electrons in quasi-flat topological\nbands, leading to emergent SU(2) symmetry and exactly solutions of the\nmany-body ground state. This system expands the condensate-induced\nsuperconductivity to the strong-correlation regime, enabling superconductivity\nat elevated temperatures and allowing the study of non-Fermi liquid states with\na solvable, predictive model. It is promising as a versatile platform for\nemulating unconventional superconductivity and other strongly correlated\nphenomena in complex, correlated materials.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:40:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sun","Kai",""],["Deng","Hui",""]]}
{"id":"2308.15964","submitter":"B\\'erenger Bramas","authors":"Paul Cardosi, B\\'erenger Bramas","title":"Specx: a C++ task-based runtime system for heterogeneous distributed\n  architectures","comments":"Research report. https://gitlab.inria.fr/bramas/specx","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Parallelization is needed everywhere, from laptops and mobile phones to\nsupercomputers. Among parallel programming models, task-based programming has\ndemonstrated a powerful potential and is widely used in high-performance\nscientific computing. Not only does it allow for efficient parallelization\nacross distributed heterogeneous computing nodes, but it also allows for\nelegant source code structuring by describing hardware-independent algorithms.\nIn this paper, we present Specx, a task-based runtime system written in modern\nC++. Specx supports distributed heterogeneous computing by simultaneously\nexploiting CPUs and GPUs (CUDA/HIP) and incorporating communication into the\ntask graph. We describe the specificities of Specx and demonstrate its\npotential by running parallel applications.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:41:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cardosi","Paul",""],["Bramas","B\u00e9renger",""]]}
{"id":"2308.15965","submitter":"Xin-She Yang","authors":"Geethu Joy, Christian Huyck, Xin-She Yang","title":"Review of Parameter Tuning Methods for Nature-Inspired Algorithms","comments":null,"journal-ref":null,"doi":"10.1007/978-981-99-3970-1_3","report-no":null,"categories":"cs.AI cs.NE math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Almost all optimization algorithms have algorithm-dependent parameters, and\nthe setting of such parameter values can largely influence the behaviour of the\nalgorithm under consideration. Thus, proper parameter tuning should be carried\nout to ensure the algorithm used for optimization may perform well and can be\nsufficiently robust for solving different types of optimization problems. This\nchapter reviews some of the main methods for parameter tuning and then\nhighlights the important issues concerning the latest development in parameter\ntuning. A few open problems are also discussed with some recommendations for\nfuture research.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:41:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Joy","Geethu",""],["Huyck","Christian",""],["Yang","Xin-She",""]]}
{"id":"2308.15966","submitter":"Anis Kacem","authors":"Dimitrios Mallis, Sk Aziz Ali, Elona Dupont, Kseniya Cherenkova, Ahmet\n  Serdar Karadeniz, Mohammad Sadil Khan, Anis Kacem, Gleb Gusev, Djamila Aouada","title":"SHARP Challenge 2023: Solving CAD History and pArameters Recovery from\n  Point clouds and 3D scans. Overview, Datasets, Metrics, and Baselines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recent breakthroughs in geometric Deep Learning (DL) and the availability of\nlarge Computer-Aided Design (CAD) datasets have advanced the research on\nlearning CAD modeling processes and relating them to real objects. In this\ncontext, 3D reverse engineering of CAD models from 3D scans is considered to be\none of the most sought-after goals for the CAD industry. However, recent\nefforts assume multiple simplifications limiting the applications in real-world\nsettings. The SHARP Challenge 2023 aims at pushing the research a step closer\nto the real-world scenario of CAD reverse engineering through dedicated\ndatasets and tracks. In this paper, we define the proposed SHARP 2023 tracks,\ndescribe the provided datasets, and propose a set of baseline methods along\nwith suitable evaluation metrics to assess the performance of the track\nsolutions. All proposed datasets along with useful routines and the evaluation\nmetrics are publicly available.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:42:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mallis","Dimitrios",""],["Ali","Sk Aziz",""],["Dupont","Elona",""],["Cherenkova","Kseniya",""],["Karadeniz","Ahmet Serdar",""],["Khan","Mohammad Sadil",""],["Kacem","Anis",""],["Gusev","Gleb",""],["Aouada","Djamila",""]]}
{"id":"2308.15967","submitter":"Yurii V. Dumin","authors":"Yurii V. Dumin, Anastasiia T. Lukashenko","title":"On the Efficiency of Disorder-induced Heating of Ultracold Plasmas","comments":"LaTeX2e, revtex4-1 documentclass, 5 pages, 4 EPS figures, submitted\n  to Physics of Plasmas","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.atom-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Starting from the beginning of their research in the early 2000's, the\nultracold plasmas were considered as a promising tool to achieve considerable\nvalues of the Coulomb coupling parameter for electrons. Unfortunately, this was\nfound to be precluded by a sharp spontaneous increase of temperature, which was\ncommonly attributed to the so-called disorder-induced heating (DIH). It is the\naim of the present paper to quantify this effect as function of the initial\nionic disorder and, thereby, to estimate the efficiency of its mitigation,\ne.g., by the Rydberg blockade. As a result of the performed simulations, we\nfound that the dynamics of electrons exhibited a well-expressed transition from\nthe case of the quasi-regular arrangement of ions to the disordered one; the\nmagnitude of the effect being about 30%. Thereby, we can conclude that the\ntwo-step formation of ultracold plasmas - involving the intermediate stage of\nthe blockaded Rydberg gas - can really serve as a tool to increase the degree\nof Coulomb coupling, but the efficiency of this method is moderate.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:44:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dumin","Yurii V.",""],["Lukashenko","Anastasiia T.",""]]}
{"id":"2308.15968","submitter":"Pranav Kasela","authors":"Elias Bassani, Pranav Kasela, Gabriella Pasi","title":"Denoising Attention for Query-aware User Modeling in Personalized Search","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The personalization of search results has gained increasing attention in the\npast few years, thanks to the development of Neural Networks-based approaches\nfor Information Retrieval and the importance of personalization in many search\nscenarios. Recent works have proposed to build user models at query time by\nleveraging the Attention mechanism, which allows weighing the contribution of\nthe user-related information w.r.t. the current query. This approach allows\ntaking into account the diversity of the user's interests by giving more\nimportance to those related to the current search performed by the user.\n  In this paper, we first discuss some shortcomings of the standard Attention\nformulation when employed for personalization. In particular, we focus on\nissues related to its normalization mechanism and its inability to entirely\nfilter out noisy user-related information. Then, we introduce the Denoising\nAttention mechanism: an Attention variant that directly tackles the above\nshortcomings by adopting a robust normalization scheme and introducing a\nfiltering mechanism. The reported experimental evaluation shows the benefits of\nthe proposed approach over other Attention-based variants.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:45:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bassani","Elias",""],["Kasela","Pranav",""],["Pasi","Gabriella",""]]}
{"id":"2308.15969","submitter":"Jasmina Gajcin","authors":"Jasmina Gajcin, James McCarthy, Rahul Nair, Radu Marinescu, Elizabeth\n  Daly, Ivana Dusparic","title":"Iterative Reward Shaping using Human Feedback for Correcting Reward\n  Misspecification","comments":"7 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A well-defined reward function is crucial for successful training of an\nreinforcement learning (RL) agent. However, defining a suitable reward function\nis a notoriously challenging task, especially in complex, multi-objective\nenvironments. Developers often have to resort to starting with an initial,\npotentially misspecified reward function, and iteratively adjusting its\nparameters, based on observed learned behavior. In this work, we aim to\nautomate this process by proposing ITERS, an iterative reward shaping approach\nusing human feedback for mitigating the effects of a misspecified reward\nfunction. Our approach allows the user to provide trajectory-level feedback on\nagent's behavior during training, which can be integrated as a reward shaping\nsignal in the following training iteration. We also allow the user to provide\nexplanations of their feedback, which are used to augment the feedback and\nreduce user effort and feedback frequency. We evaluate ITERS in three\nenvironments and show that it can successfully correct misspecified reward\nfunctions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:45:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gajcin","Jasmina",""],["McCarthy","James",""],["Nair","Rahul",""],["Marinescu","Radu",""],["Daly","Elizabeth",""],["Dusparic","Ivana",""]]}
{"id":"2308.15970","submitter":"Bocheng Zhu","authors":"Bocheng Zhu, Feng Yuan, Suoqing Ji, Yingjie Peng, and Luis C. Ho","title":"On the dominant role of wind in the quasar feedback mode in the late\n  stage evolution of massive elliptical galaxies","comments":"15 pages, 14 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":"  In this paper we investigate the role of AGN feedback on the late stage\nevolution of elliptical galaxies by performing high-resolution hydrodynamical\nsimulation in the {\\it MACER} framework. By comparing models that take into\naccount different feedback mechanisms, namely AGN and stellar feedback, we find\nthat AGN feedback is crucial in keeping the black hole in a low accretion state\nand suppressing the star formation. We then compare the energy from AGN\nradiation and wind deposited in the galaxy and find that only wind can\ncompensate for the radiative cooling of the gas in the galaxy. Further, we\ninvestigate which plays the dominant role, the wind from the cold (quasar) or\nhot (radio) feedback modes, by examining the cumulative energy output and\nimpact area to which the wind can heat the interstellar medium and suppress\nstar formation. Our results indicate that first, although AGN spends most of\nits time in hot (radio) mode, the cumulative energy output is dominated by the\noutburst of the cold mode. Second, only the impact area of the cold-mode wind\nis large enough to heat the gas in the halo, while the hot-mode wind is not.\nAdditionally, the cold-mode wind is capable of sweeping up the material from\nstellar mass loss. These results indicate the dominant role of cold-mode wind.\nThe limitations of our model, including the absence of jet feedback, are\ndiscussed.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:49:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhu","Bocheng",""],["Yuan","Feng",""],["Ji","Suoqing",""],["Peng","Yingjie",""],["Ho","Luis C.",""]]}
{"id":"2308.15971","submitter":"Sigmundur Gudmundsson","authors":"Sigmundur Gudmundsson and Thomas Jack Munn","title":"Harmonic Morphisms on Lie groups and Minimal Conformal Foliations of\n  Codimension two","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 be a Lie group equipped with a left-invariant semi-Riemannian metric.\nLet K be a semisimple subgroup of G generating a left-invariant conformal\nfoliation F of codimension two on G. We then show that the foliation F is\nminimal. This means that locally the leaves of F are fibres of a complex-valued\nharmonic morphism. In the Riemannian case, we prove that if the metric\nrestricted to K is biinvariant then F is totally geodesic.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:49:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gudmundsson","Sigmundur",""],["Munn","Thomas Jack",""]]}
{"id":"2308.15972","submitter":"Alexander Venus MSc","authors":"Alexander Venus, Erik Leitinger, Stefan Tertinek, Klaus Witrisal","title":"A Neural-enhanced Factor Graph-based Algorithm for Robust Positioning in\n  Obstructed LOS Situations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a neural-enhanced probabilistic model and corresponding\nfactor graph-based sum-product algorithm for robust localization and tracking\nin multipath-prone environments. The introduced hybrid probabilistic model\nconsists of physics-based and data-driven measurement models capturing the\ninformation contained in both, the line-of-sight (LOS) component as well as in\nmultipath components (NLOS components). The physics-based and data-driven\nmodels are embedded in a joint Bayesian framework allowing to derive from first\nprinciples a factor graph-based algorithm that fuses the information of these\nmodels. The proposed algorithm uses radio signal measurements from multiple\nbase stations to robustly estimate the mobile agent's position together with\nall model parameters. It provides high localization accuracy by exploiting the\nposition-related information of the LOS component via the physics-based model\nand robustness by exploiting the geometric imprint of multipath components\nindependent of the propagation channel via the data-driven model. In a\nchallenging numerical experiment involving obstructed LOS situations to all\nanchors, we show that the proposed sequential algorithm significantly\noutperforms state-of-the-art methods and attains the posterior Cramer-Rao lower\nbound even with training data limited to local regions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:50:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Venus","Alexander",""],["Leitinger","Erik",""],["Tertinek","Stefan",""],["Witrisal","Klaus",""]]}
{"id":"2308.15973","submitter":"Peizheng Li","authors":"Peizheng Li, Adnan Aijaz, Tim Farnham, Sajida Gufran, Sita\n  Chintalapati","title":"Demo: A Digital Twin of the 5G Radio Access Network for Anomaly\n  Detection Functionality","comments":"2 pages, 2 figures. This paper has been accepted by the 31st IEEE\n  International Conference on Network Protocols (ICNP 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, the concept of digital twins (DTs) has received significant\nattention within the realm of 5G/6G. This demonstration shows an innovative DT\ndesign and implementation framework tailored toward integration within the 5G\ninfrastructure. The proposed DT enables near real-time anomaly detection\ncapability pertaining to user connectivity. It empowers the 5G system to\nproactively execute decisions for resource control and connection restoration.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:51:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Peizheng",""],["Aijaz","Adnan",""],["Farnham","Tim",""],["Gufran","Sajida",""],["Chintalapati","Sita",""]]}
{"id":"2308.15974","submitter":"Micha{\\l} Marcinkowski","authors":"Michael Brandenbursky and Micha{\\l} Marcinkowski","title":"Volume and Euler classes in bounded cohomology of transformation groups","comments":"Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DS math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $M$ be an oriented smooth manifold, and $\\operatorname{Homeo}(M,\\omega)$\nthe group of measure preserving homeomorphisms of $M$, where $\\omega$ is a\nfinite measure induced by a volume form. In this paper we define volume and\nEuler classes in bounded cohomology of an infinite dimensional transformation\ngroup $\\operatorname{Homeo}_0(M,\\omega)$ and $\\operatorname{Homeo}(M,\\omega)$\nrespectively, and in several cases prove their non-triviality. More precisely,\nwe define:\n  - Volume classes in $\\operatorname{H}_b^n(\\operatorname{Homeo}_0(M,\\omega))$\nwhere $M$ is a hyperbolic manifold of dimension $n$.\n  - Euler classes in $\\operatorname{H}_b^2(\\operatorname{Homeo}(S,\\omega))$\nwhere $S$ is a closed hyperbolic surface.\n  We show that Euler classes have positive norms for any closed hyperbolic $S$\nand volume classes have positive norms for all hyperbolic surfaces and certain\nhyperbolic $3$-manifolds, and hence they are non-trivial.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:52:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Brandenbursky","Michael",""],["Marcinkowski","Micha\u0142",""]]}
{"id":"2308.15975","submitter":"Mel Vecerik","authors":"Mel Vecerik and Carl Doersch and Yi Yang and Todor Davchev and Yusuf\n  Aytar and Guangyao Zhou and Raia Hadsell and Lourdes Agapito and Jon Scholz","title":"RoboTAP: Tracking Arbitrary Points for Few-Shot Visual Imitation","comments":"Project website: https://robotap.github.io","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":"  For robots to be useful outside labs and specialized factories we need a way\nto teach them new useful behaviors quickly. Current approaches lack either the\ngenerality to onboard new tasks without task-specific engineering, or else lack\nthe data-efficiency to do so in an amount of time that enables practical use.\nIn this work we explore dense tracking as a representational vehicle to allow\nfaster and more general learning from demonstration. Our approach utilizes\nTrack-Any-Point (TAP) models to isolate the relevant motion in a demonstration,\nand parameterize a low-level controller to reproduce this motion across changes\nin the scene configuration. We show this results in robust robot policies that\ncan solve complex object-arrangement tasks such as shape-matching, stacking,\nand even full path-following tasks such as applying glue and sticking objects\ntogether, all from demonstrations that can be collected in minutes.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:57:04 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 15:29:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vecerik","Mel",""],["Doersch","Carl",""],["Yang","Yi",""],["Davchev","Todor",""],["Aytar","Yusuf",""],["Zhou","Guangyao",""],["Hadsell","Raia",""],["Agapito","Lourdes",""],["Scholz","Jon",""]]}
{"id":"2308.15976","submitter":"Boquan Chen","authors":"Boquan Chen, Yuan-Sen Ting, Michael Hayden","title":"The dawn is quiet here: Rise in [$\\alpha$/Fe] is a signature of massive\n  gas accretion that fueled proto-Milky Way","comments":"15 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The proto-Milky Way epoch forms the earliest stars in our Galaxy and sets the\ninitial conditions for subsequent disk formation. Recent observations from\nAPOGEE and H3 surveys showed that the [$\\alpha$/Fe] ratio slowly declined\nbetween [Fe/H] $=-3$ and $-1.3$ until it reached the lowest value ($\\sim 0.25$)\namong the selected in situ metal-poor stars that most likely formed during the\nproto-Galaxy epoch. [$\\alpha$/Fe] rose to meet the traditional high value\ncommonly associated with the thick disk population at [Fe/H] $=-1$. It was\nsuggested that the rise in [$\\alpha$/Fe] could be caused by an increase in the\nstar formation efficiency (SFE), known as the \"simmering\" phase scenario.\nHowever, gas inflow also plays a vital role in shaping the star formation\nhistory and chemical evolution of galaxies. We investigate this unexpected\n[$\\alpha$/Fe]-rise with a statistical experiment involving a galactic chemical\nevolution (GCE). Our model has five free parameters: the mass of the initial\nreservoir of the cold interstellar medium (ISM) at birth, the frequency of Type\nIa supernovae (SNe Ia), the cooling timescale of the warm ISM, the SFE, and the\ninflow rate of fresh gas. The last two free parameters were allowed to change\nafter [$\\alpha$/Fe] reached its lowest value, dividing the proto-Galaxy epoch\ninto two phases. We find that the rise in [$\\alpha$/Fe] is caused by a large\ninflow of fresh gas and conclude that the [$\\alpha$/Fe]-rise is a signature of\nthe cold mode accretion whose materials formed the prototype Milky Way\npreceding disk formation. Although the SFE is essential in regulating the\nchemical evolution, it does not necessarily increase to facilitate the\n[$\\alpha$/Fe]-rise.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:59:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Boquan",""],["Ting","Yuan-Sen",""],["Hayden","Michael",""]]}
{"id":"2308.15977","submitter":"Peizheng Li","authors":"Tim Farnham, Sajida Gufran, Peizheng Li, Adnan Aijaz","title":"Demo: Integration of Marketplace for the 5G Open RAN Ecosystem","comments":"2 pages, 3 figures. This paper has been accepted by the 31st IEEE\n  International Conference on Network Protocols (ICNP 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Open RAN API and interface standards facilitate the new ecosystems where\ndistinct hardware and software components are brought together to build 5G\nsystems. Key to this concept is the seamless and efficient integration and\nmonetization process among stakeholders. A marketplace serves as a means to\nrealize this collaborative revenue sharing, eliminating the need for intricate\nproprietary agreements or contracts between each participant. This demo\npresents the marketplace strategy emphasizing software integration across\ndiverse deployment settings, utilizing the API-centric integration\nPlatform-as-a-Service (iPaas) model aligned with Open RAN standards.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 11:59:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Farnham","Tim",""],["Gufran","Sajida",""],["Li","Peizheng",""],["Aijaz","Adnan",""]]}
{"id":"2308.15978","submitter":"Matthias Eder","authors":"Matthias Eder, Gerald Steinbauer-Wagner","title":"Predicting Energy Consumption and Traversal Time of Ground Robots for\n  Outdoor Navigation on Multiple Types of Terrain","comments":"Accepted for publication in 2023 IEEE/RSJ International Conference on\n  Intelligent Robots and Systems (IROS)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The outdoor navigation capabilities of ground robots have improved\nsignificantly in recent years, opening up new potential applications in a\nvariety of settings. Cost-based representations of the environment are\nfrequently used in the path planning domain to obtain an optimized path based\non various objectives, such as traversal time or energy consumption. However,\nobtaining such cost representations is still cumbersome, particularly in\noutdoor settings with diverse terrain types and slope angles. In this paper, we\naddress this problem by using a data-driven approach to develop a cost\nrepresentation for various outdoor terrain types that supports two optimization\nobjectives, namely energy consumption and traversal time. We train a supervised\nmachine learning model whose inputs consists of extracted environment data\nalong a path and whose outputs are the predicted energy consumption and\ntraversal time. The model is based on a ResNet neural network architecture and\ntrained using field-recorded data. The error of the proposed method on\ndifferent types of terrain is within 11\\% of the ground truth data. To show\nthat it performs and generalizes better than currently existing approaches on\nvarious types of terrain, a comparison to a baseline method is made.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:05:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Eder","Matthias",""],["Steinbauer-Wagner","Gerald",""]]}
{"id":"2308.15979","submitter":"Sungwon Park","authors":"Donghyun Ahn, Minhyuk Song, Seungeon Lee, Yubin Choi, Jihee Kim,\n  Sangyoon Park, Hyunjoo Yang and Meeyoung Cha","title":"Fine-Grained Socioeconomic Prediction from Satellite Images with\n  Distributional Adjustment","comments":"Published at CIKM '23 as a short paper","journal-ref":null,"doi":"10.1145/3583780.3615226","report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  While measuring socioeconomic indicators is critical for local governments to\nmake informed policy decisions, such measurements are often unavailable at\nfine-grained levels like municipality. This study employs deep learning-based\npredictions from satellite images to close the gap. We propose a method that\nassigns a socioeconomic score to each satellite image by capturing the\ndistributional behavior observed in larger areas based on the ground truth. We\ntrain an ordinal regression scoring model and adjust the scores to follow the\ncommon power law within and across regions. Evaluation based on official\nstatistics in South Korea shows that our method outperforms previous models in\npredicting population and employment size at both the municipality and grid\nlevels. Our method also demonstrates robust performance in districts with\nuneven development, suggesting its potential use in developing countries where\nreliable, fine-grained data is scarce.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:06:04 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ahn","Donghyun",""],["Song","Minhyuk",""],["Lee","Seungeon",""],["Choi","Yubin",""],["Kim","Jihee",""],["Park","Sangyoon",""],["Yang","Hyunjoo",""],["Cha","Meeyoung",""]]}
{"id":"2308.15980","submitter":"Hengchang Hu","authors":"Hengchang Hu, Wei Guo, Yong Liu, Min-Yen Kan","title":"Adaptive Multi-Modalities Fusion in Sequential Recommendation Systems","comments":"CIKM'2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In sequential recommendation, multi-modal information (e.g., text or image)\ncan provide a more comprehensive view of an item's profile. The optimal stage\n(early or late) to fuse modality features into item representations is still\ndebated. We propose a graph-based approach (named MMSR) to fuse modality\nfeatures in an adaptive order, enabling each modality to prioritize either its\ninherent sequential nature or its interplay with other modalities. MMSR\nrepresents each user's history as a graph, where the modality features of each\nitem in a user's history sequence are denoted by cross-linked nodes. The edges\nbetween homogeneous nodes represent intra-modality sequential relationships,\nand the ones between heterogeneous nodes represent inter-modality\ninterdependence relationships. During graph propagation, MMSR incorporates dual\nattention, differentiating homogeneous and heterogeneous neighbors. To\nadaptively assign nodes with distinct fusion orders, MMSR allows each node's\nrepresentation to be asynchronously updated through an update gate. In\nscenarios where modalities exhibit stronger sequential relationships, the\nupdate gate prioritizes updates among homogeneous nodes. Conversely, when the\ninterdependent relationships between modalities are more pronounced, the update\ngate prioritizes updates among heterogeneous nodes. Consequently, MMSR\nestablishes a fusion order that spans a spectrum from early to late modality\nfusion. In experiments across six datasets, MMSR consistently outperforms\nstate-of-the-art models, and our graph propagation methods surpass other graph\nneural networks. Additionally, MMSR naturally manages missing modalities.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:09:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hu","Hengchang",""],["Guo","Wei",""],["Liu","Yong",""],["Kan","Min-Yen",""]]}
{"id":"2308.15981","submitter":"Veronica Leccese","authors":"Veronica Leccese, Michele Caldara, Samuele Bisi, Marcello Pagano,\n  Simone Gargiulo, Carlotta Trigila, Arnaud Bertsch, Alessandro Mapelli,\n  Fabrizio Carbone","title":"Microstructured Plastic Scintillators For Beam Profiling In Medical\n  Accelerators","comments":"11 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A novel beam profiler based on microstructured scintillation resin is\npresented. The detector consists of a bundle of waveguides, with an active area\nof 30 x 30 mm$^2$ and a pitch of 400 $\\mu$m, obtained by molding a\nscintillating resin into a microfabricated PDMS mold. A first prototype,\ncoupled to an array of photodiodes and readout electronics, which potentially\nallows profile rates of more than 7 kHz, has been tested using both a UV source\nand a proton beam accelerated at different energies, such as those typically\nused in proton therapy. The results obtained during the experimental test\ncampaigns were compared with theoretical simulations showing a good agreement\nwith the modeling expectations, thus confirming the validity of this novel\ndesign for microstructured scintillating detectors.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:10:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Leccese","Veronica",""],["Caldara","Michele",""],["Bisi","Samuele",""],["Pagano","Marcello",""],["Gargiulo","Simone",""],["Trigila","Carlotta",""],["Bertsch","Arnaud",""],["Mapelli","Alessandro",""],["Carbone","Fabrizio",""]]}
{"id":"2308.15982","submitter":"Shwai He","authors":"Shwai He, Run-Ze Fan, Liang Ding, Li Shen, Tianyi Zhou, Dacheng Tao","title":"MerA: Merging Pretrained Adapters For Few-Shot Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Adapter tuning, which updates only a few parameters, has become a mainstream\nmethod for fine-tuning pretrained language models to downstream tasks. However,\nit often yields subpar results in few-shot learning. AdapterFusion, which\nassembles pretrained adapters using composition layers tailored to specific\ntasks, is a possible solution but significantly increases trainable parameters\nand deployment costs. Despite this, our preliminary study reveals that even\nsingle adapters can outperform Adapterfusion in few-shot learning, urging us to\npropose \\textbf{\\texttt{Merging Pretrained Adapters}} (MerA) that efficiently\nincorporates pretrained adapters to a single model through model fusion.\nExtensive experiments on two PLMs demonstrate that MerA achieves substantial\nimprovements compared to both single adapters and AdapterFusion. To further\nenhance the capacity of MerA, we also introduce a simple yet effective\ntechnique, referred to as the \"\\textit{same-track}\" setting, that merges\nadapters from the same track of pretraining tasks. With the implementation of\nthe \"\\textit{same-track}\" setting, we observe even more impressive gains,\nsurpassing the performance of both full fine-tuning and adapter tuning by a\nsubstantial margin, e.g., 3.5\\% in MRPC and 5.0\\% in MNLI.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:10:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["He","Shwai",""],["Fan","Run-Ze",""],["Ding","Liang",""],["Shen","Li",""],["Zhou","Tianyi",""],["Tao","Dacheng",""]]}
{"id":"2308.15983","submitter":"Hannah Christine Sabo","authors":"Hannah C. Sabo, Tor Ole B. Odden, and Marcos D. Caballero","title":"How do we assess computation in physics?","comments":"7 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In recent years, computing has become an important part of the way we teach\nand learn physics. Teachers, both at high school and college levels, now use\ncomputational activities in many of their courses. Physics departments are\noffering specialized courses and degrees in computational physics. And many\ncountries are adding programming or computational thinking to their secondary\nscience education standards. Although we know more about how to teach\ncomputation, that's only half the picture; we need to know how to assess it. In\nthis paper, we provide a snapshot of some commonly used assessment activities\nand forms.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:11:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sabo","Hannah C.",""],["Odden","Tor Ole B.",""],["Caballero","Marcos D.",""]]}
{"id":"2308.15984","submitter":"Lucas Brynte","authors":"Lucas Brynte and Jos\\'e Pedro Iglesias and Carl Olsson and Fredrik\n  Kahl","title":"Learning Structure-from-Motion with Graph Attention Networks","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":"  In this paper we tackle the problem of learning Structure-from-Motion (SfM)\nthrough the use of graph attention networks. SfM is a classic computer vision\nproblem that is solved though iterative minimization of reprojection errors,\nreferred to as Bundle Adjustment (BA), starting from a good initialization. In\norder to obtain a good enough initialization to BA, conventional methods rely\non a sequence of sub-problems (such as pairwise pose estimation, pose averaging\nor triangulation) which provides an initial solution that can then be refined\nusing BA. In this work we replace these sub-problems by learning a model that\ntakes as input the 2D keypoints detected across multiple views, and outputs the\ncorresponding camera poses and 3D keypoint coordinates. Our model takes\nadvantage of graph neural networks to learn SfM-specific primitives, and we\nshow that it can be used for fast inference of the reconstruction for new and\nunseen sequences. The experimental results show that the proposed model\noutperforms competing learning-based methods, and challenges COLMAP while\nhaving lower runtime.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:13:13 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Brynte","Lucas",""],["Iglesias","Jos\u00e9 Pedro",""],["Olsson","Carl",""],["Kahl","Fredrik",""]]}
{"id":"2308.15985","submitter":"Jianwu Fang","authors":"Jianwu Fang, iahuan Qiao, Jianru Xue, and Zhengguo Li","title":"Vision-Based Traffic Accident Detection and Anticipation: A Survey","comments":"accepted in IEEE Transactions on Circuits and Systems for Video\n  Technology; 16 pages, 155 references","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traffic accident detection and anticipation is an obstinate road safety\nproblem and painstaking efforts have been devoted. With the rapid growth of\nvideo data, Vision-based Traffic Accident Detection and Anticipation (named\nVision-TAD and Vision-TAA) become the last one-mile problem for safe driving\nand surveillance safety. However, the long-tailed, unbalanced, highly dynamic,\ncomplex, and uncertain properties of traffic accidents form the\nOut-of-Distribution (OOD) feature for Vision-TAD and Vision-TAA. Current AI\ndevelopment may focus on these OOD but important problems. What has been done\nfor Vision-TAD and Vision-TAA? What direction we should focus on in the future\nfor this problem? A comprehensive survey is important. We present the first\nsurvey on Vision-TAD in the deep learning era and the first-ever survey for\nVision-TAA. The pros and cons of each research prototype are discussed in\ndetail during the investigation. In addition, we also provide a critical review\nof 31 publicly available benchmarks and related evaluation metrics. Through\nthis survey, we want to spawn new insights and open possible trends for\nVision-TAD and Vision-TAA tasks.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:13:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fang","Jianwu",""],["Qiao","iahuan",""],["Xue","Jianru",""],["Li","Zhengguo",""]]}
{"id":"2308.15986","submitter":"Md Abdul Basit","authors":"Md Abdul Basit, Mahbub A.H.M. Latif, Abdus S Wahed","title":"Sensitivity Analysis for Causal Effects in Observational Studies with\n  Multivalued Treatments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the fundamental challenges in drawing causal inferences from\nobservational studies is that the assumption of no unmeasured confounding is\nnot testable from observed data. Therefore, assessing sensitivity to this\nassumption's violation is important to obtain valid causal conclusions in\nobservational studies. Although several sensitivity analysis frameworks are\navailable in the casual inference literature, none of them are applicable to\nobservational studies with multivalued treatments. To address this issue, we\npropose a sensitivity analysis framework for performing sensitivity analysis in\nmultivalued treatment settings. Within this framework, a general class of\nadditive causal estimands has been proposed. We demonstrate that the estimation\nof the causal estimands under the proposed sensitivity model can be performed\nvery efficiently. Simulation results show that the proposed framework performs\nwell in terms of bias of the point estimates and coverage of the confidence\nintervals when there is sufficient overlap in the covariate distributions. We\nillustrate the application of our proposed method by conducting an\nobservational study that estimates the causal effect of fish consumption on\nblood mercury levels.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:15:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Basit","Md Abdul",""],["Latif","Mahbub A. H. M.",""],["Wahed","Abdus S",""]]}
{"id":"2308.15987","submitter":"Yifan Zhang","authors":"Qingyuan Li, Yifan Zhang, Liang Li, Peng Yao, Bo Zhang, Xiangxiang\n  Chu, Yerui Sun, Li Du, Yuchen Xie","title":"FPTQ: Fine-grained Post-Training Quantization for 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":"  In the era of large-scale language models, the substantial parameter size\nposes significant challenges for deployment. Being a prevalent compression\ntechnique, quantization has emerged as the mainstream practice to tackle this\nissue, which is mainly centered on two recipes W8A8 and W4A16 (i.e. weights and\nactivations in such bit widths). In this study, we propose a novel W4A8\npost-training quantization method for the available open-sourced LLMs, which\ncombines the advantages of both two recipes. Therefore, we can leverage the\nbenefit in the I/O utilization of 4-bit weight quantization and the\nacceleration due to 8-bit matrix computation. Nevertheless, the W4A8 faces\nnotorious performance degradation. As a remedy, we involve layerwise activation\nquantization strategies which feature a novel logarithmic equalization for most\nintractable layers, and we combine them with fine-grained weight quantization.\nWithout whistles and bells, we eliminate the necessity for further fine-tuning\nand obtain the state-of-the-art W4A8 quantized performance on BLOOM, LLaMA, and\nLLaMA-2 on standard benchmarks. We confirm that the W4A8 quantization is\nachievable for the deployment of large language models, fostering their\nwide-spreading real-world applications.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:18:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Qingyuan",""],["Zhang","Yifan",""],["Li","Liang",""],["Yao","Peng",""],["Zhang","Bo",""],["Chu","Xiangxiang",""],["Sun","Yerui",""],["Du","Li",""],["Xie","Yuchen",""]]}
{"id":"2308.15988","submitter":"Tomer Adar","authors":"Tomer Adar and Eldar Fischer and Amit Levi","title":"Support Testing in the Huge Object Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Huge Object model is a distribution testing model in which we are given\naccess to independent samples from an unknown distribution over the set of\nstrings $\\{0,1\\}^n$, but are only allowed to query a few bits from the samples.\n  We investigate the problem of testing whether a distribution is supported on\n$m$ elements in this model. It turns out that the behavior of this property is\nsurprisingly intricate, especially when also considering the question of\nadaptivity.\n  We prove lower and upper bounds for both adaptive and non-adaptive algorithms\nin the one-sided and two-sided error regime. Our bounds are tight when $m$ is\nfixed to a constant (and the distance parameter $\\varepsilon$ is the only\nvariable). For the general case, our bounds are at most $O(\\log m)$ apart.\n  In particular, our results show a surprising $O(\\log \\varepsilon^{-1})$ gap\nbetween the number of queries required for non-adaptive testing as compared to\nadaptive testing. For one sided error testing, we also show that an $O(\\log m)$\ngap between the number of samples and the number of queries is necessary.\n  Our results utilize a wide variety of combinatorial and probabilistic\nmethods.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:19:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Adar","Tomer",""],["Fischer","Eldar",""],["Levi","Amit",""]]}
{"id":"2308.15989","submitter":"Dian Zheng","authors":"Dian Zheng, Xiao-Ming Wu, Zuhao Liu, Jingke Meng, Wei-shi Zheng","title":"DiffuVolume: Diffusion Model for Volume based Stereo Matching","comments":"17 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stereo matching is a significant part in many computer vision tasks and\ndriving-based applications. Recently cost volume-based methods have achieved\ngreat success benefiting from the rich geometry information in paired images.\nHowever, the redundancy of cost volume also interferes with the model training\nand limits the performance. To construct a more precise cost volume, we\npioneeringly apply the diffusion model to stereo matching. Our method, termed\nDiffuVolume, considers the diffusion model as a cost volume filter, which will\nrecurrently remove the redundant information from the cost volume. Two main\ndesigns make our method not trivial. Firstly, to make the diffusion model more\nadaptive to stereo matching, we eschew the traditional manner of directly\nadding noise into the image but embed the diffusion model into a task-specific\nmodule. In this way, we outperform the traditional diffusion stereo matching\nmethod by 22% EPE improvement and 240 times inference acceleration. Secondly,\nDiffuVolume can be easily embedded into any volume-based stereo matching\nnetwork with boost performance but slight parameters rise (only 2%). By adding\nthe DiffuVolume into well-performed methods, we outperform all the published\nmethods on Scene Flow, KITTI2012, KITTI2015 benchmarks and zero-shot\ngeneralization setting. It is worth mentioning that the proposed model ranks\n1st on KITTI 2012 leader board, 2nd on KITTI 2015 leader board since 15, July\n2023.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:19:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zheng","Dian",""],["Wu","Xiao-Ming",""],["Liu","Zuhao",""],["Meng","Jingke",""],["Zheng","Wei-shi",""]]}
{"id":"2308.15990","submitter":"Aoqi Guo","authors":"Aoqi Guo and Sichong Qian and Baoxiang Li and Dazhi Gao","title":"Dual-path Transformer Based Neural Beamformer for Target Speech\n  Extraction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural beamformers, integrating both pre-separation and beamforming modules,\nhave shown impressive efficacy in the target speech extraction task.\nNevertheless, the performance of these beamformers is inherently constrained by\nthe predictive accuracy of the pre-separation module. In this paper, we\nintroduce a neural beamformer underpinned by a dual-path transformer.\nInitially, we harness the cross-attention mechanism in the time domain,\nextracting pivotal spatial information related to beamforming from the noisy\ncovariance matrix. Subsequently, in the frequency domain, the self-attention\nmechanism is employed to bolster the model's capacity to process\nfrequency-specific details. By design, our model circumvents the influence of\npre-separation modules, delivering the performance in a more holistic\nend-to-end fashion. Experimental results reveal that our model not only\nsurpasses contemporary leading neural beamforming algorithms in separation\nperformance, but also achieves this with a notable reduction in parameter\ncount.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:22:58 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Guo","Aoqi",""],["Qian","Sichong",""],["Li","Baoxiang",""],["Gao","Dazhi",""]]}
{"id":"2308.15991","submitter":"Yinda Xu","authors":"Yinda Xu, Lidong Yu","title":"DRL-Based Trajectory Tracking for Motion-Related Modules in Autonomous\n  Driving","comments":"Technical report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous driving systems are always built on motion-related modules such as\nthe planner and the controller. An accurate and robust trajectory tracking\nmethod is indispensable for these motion-related modules as a primitive\nroutine. Current methods often make strong assumptions about the model such as\nthe context and the dynamics, which are not robust enough to deal with the\nchanging scenarios in a real-world system. In this paper, we propose a Deep\nReinforcement Learning (DRL)-based trajectory tracking method for the\nmotion-related modules in autonomous driving systems. The representation\nlearning ability of DL and the exploration nature of RL bring strong robustness\nand improve accuracy. Meanwhile, it enhances versatility by running the\ntrajectory tracking in a model-free and data-driven manner. Through extensive\nexperiments, we demonstrate both the efficiency and effectiveness of our method\ncompared to current methods.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:24:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xu","Yinda",""],["Yu","Lidong",""]]}
{"id":"2308.15992","submitter":"Bingqiao Luo","authors":"Bingqiao Luo, Zhen Zhang, Qian Wang, Anli Ke, Shengliang Lu, Bingsheng\n  He","title":"AI-powered Fraud Detection in Decentralized Finance: A Project Life\n  Cycle Perspective","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, blockchain technology has introduced decentralized finance\n(DeFi) as an alternative to traditional financial systems. DeFi aims to create\na transparent and efficient financial ecosystem using smart contracts and\nemerging decentralized applications. However, the growing popularity of DeFi\nhas made it a target for fraudulent activities, resulting in losses of billions\nof dollars due to various types of frauds. To address these issues, researchers\nhave explored the potential of artificial intelligence (AI) approaches to\ndetect such fraudulent activities. Yet, there is a lack of a systematic survey\nto organize and summarize those existing works and to identify the future\nresearch opportunities. In this survey, we provide a systematic taxonomy of\nvarious frauds in the DeFi ecosystem, categorized by the different stages of a\nDeFi project's life cycle: project development, introduction, growth, maturity,\nand decline. This taxonomy is based on our finding: many frauds have strong\ncorrelations in the stage of the DeFi project. According to the taxonomy, we\nreview existing AI-powered detection methods, including statistical modeling,\nnatural language processing and other machine learning techniques, etc. We find\nthat fraud detection in different stages employs distinct types of methods and\nobserve the commendable performance of tree-based and graph-related models in\ntackling fraud detection tasks. By analyzing the challenges and trends, we\npresent the findings to provide proactive suggestion and guide future research\nin DeFi fraud detection. We believe that this survey is able to support\nresearchers, practitioners, and regulators in establishing a secure and\ntrustworthy DeFi ecosystem.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:24:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Luo","Bingqiao",""],["Zhang","Zhen",""],["Wang","Qian",""],["Ke","Anli",""],["Lu","Shengliang",""],["He","Bingsheng",""]]}
{"id":"2308.15993","submitter":"Paolo Torrielli","authors":"Luca Rottoli, Paolo Torrielli, Alessandro Vicini","title":"A new observable for $W$-mass determination","comments":"Proceeding of RADCOR2023","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this contribution we discuss the properties of the jacobian asymmetry, the\nnew observable introduced in hep-ph/2301.04059 for a robust determination of\nthe value and uncertainty of the $W$-boson mass at hadron colliders.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:25:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rottoli","Luca",""],["Torrielli","Paolo",""],["Vicini","Alessandro",""]]}
{"id":"2308.15994","submitter":"Stefan Steinerberger","authors":"Jeffrey S. Ovall, Hadrian Quan, Robyn Reid, Stefan Steinerberger","title":"On localization of eigenfunctions of the magnetic Laplacian","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\Omega \\subset \\mathbb{R}^d$ and consider the magnetic Laplace operator\ngiven by $ H(A) = \\left(- i\\nabla - A(x)\\right)^2$, where $A:\\Omega \\rightarrow\n\\mathbb{R}^d$, subject to Dirichlet eigenfunction. This operator can, for\ncertain vector fields $A$, have eigenfunctions $H(A) \\psi = \\lambda \\psi$ that\nare highly localized in a small region of $\\Omega$. The main goal of this paper\nis to show that if $|\\psi|$ assumes its maximum in $x_0 \\in \\Omega$, then $A$\nbehaves `almost' like a conservative vector field in a\n$1/\\sqrt{\\lambda}-$neighborhood of $x_0$ in a precise sense: we expect\nlocalization in regions where $\\left|\\mbox{curl} A \\right|$ is small. The\nresult is illustrated with numerical examples.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:28:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ovall","Jeffrey S.",""],["Quan","Hadrian",""],["Reid","Robyn",""],["Steinerberger","Stefan",""]]}
{"id":"2308.15995","submitter":"Maria Caruana","authors":"Salvatore Capozziello, Maria Caruana, Gabriel Farrugia, Jackson Levi\n  Said, Joseph Sultana","title":"Cosmic Growth in $f(T)$ Teleparallel Gravity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Physical evolution of cosmological models can be tested by using expansion\ndata, while growth history of these models is capable of testing dynamics of\nthe inhomogeneous parts of energy density. The growth factor, as well as its\ngrowth index, gives a clear indication of the performance of cosmological\nmodels in the regime of structure formation of early Universe. In this work, we\nexplore the growth index in several leading $f(T)$ cosmological models, based\non a specific class of teleparallel gravity theories. These have become\nprominent in the literature and lead to other formulations of teleparallel\ngravity. Here we adopt a generalized approach by obtaining the M\\'{e}sz\\'{a}ros\nequation without immediately imposing the subhorizon limit, because this\nassumption could lead to over-simplification. This approach gives avenue to\nstudy at which $k$ modes the subhorizon limit starts to apply. We obtain\nnumerical results for the growth factor and growth index for a variety of data\nset combinations for each $f(T)$ model.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:35:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Capozziello","Salvatore",""],["Caruana","Maria",""],["Farrugia","Gabriel",""],["Said","Jackson Levi",""],["Sultana","Joseph",""]]}
{"id":"2308.15996","submitter":"Masato Fujitake","authors":"Masato Fujitake","title":"DTrOCR: Decoder-only Transformer for Optical Character Recognition","comments":"Accepted to WACV2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Typical text recognition methods rely on an encoder-decoder structure, in\nwhich the encoder extracts features from an image, and the decoder produces\nrecognized text from these features. In this study, we propose a simpler and\nmore effective method for text recognition, known as the Decoder-only\nTransformer for Optical Character Recognition (DTrOCR). This method uses a\ndecoder-only Transformer to take advantage of a generative language model that\nis pre-trained on a large corpus. We examined whether a generative language\nmodel that has been successful in natural language processing can also be\neffective for text recognition in computer vision. Our experiments demonstrated\nthat DTrOCR outperforms current state-of-the-art methods by a large margin in\nthe recognition of printed, handwritten, and scene text in both English and\nChinese.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:37:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fujitake","Masato",""]]}
{"id":"2308.15997","submitter":"Lampros Gavalakis","authors":"Alexandros Eskenazis and Lampros Gavalakis","title":"On the entropy and information of Gaussian mixtures","comments":"14 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish several convexity properties for the entropy and Fisher\ninformation of mixtures of centered Gaussian distributions. First, we prove\nthat if $X_1, X_2$ are independent scalar Gaussian mixtures, then the entropy\nof $\\sqrt{t}X_1 + \\sqrt{1-t}X_2$ is concave in $t \\in [0,1]$, thus confirming a\nconjecture of Ball, Nayar and Tkocz (2016) for this class of random variables.\nIn fact, we prove a generalisation of this assertion which also strengthens a\nresult of Eskenazis, Nayar and Tkocz (2018). For the Fisher information, we\nextend a convexity result of Bobkov (2022) by showing that the Fisher\ninformation matrix is operator convex as a matrix-valued function acting on\ndensities of mixtures in $\\mathbb{R}^d$. As an application, we establish rates\nfor the convergence of the Fisher information matrix of the sum of weighted\ni.i.d. Gaussian mixtures in the operator norm along the central limit theorem\nunder mild moment assumptions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:37:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Eskenazis","Alexandros",""],["Gavalakis","Lampros",""]]}
{"id":"2308.15998","submitter":"Jinlong Zhang","authors":"Zhaohuizi Ji, Xiaoyan Zhao, Aiqiang Guo, Qinghua Xu, and Jinlong Zhang","title":"Lambda polarization at Electron-ion collider in China","comments":"8 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lambda polarization can be measured through its self-analyzing weak decay,\nmaking it an ideal candidate for studying spin effects in high energy\nscatterings. In lepton-nucleon deeply inelastic scatterings (DIS), Lambda\npolarization measurements can probe the polarized parton distribution functions\n(PDFs) and the polarized fragmentation functions (FFs). One of the most\npromising facilities for high-energy nuclear physics research is the proposed\nElectron-ion collider in China (EicC). As a next-generation facility, EicC is\nset to propel our understandings of nuclear physics to new heights. In this\narticle, we study the Lambda production in electron-proton collision at EicC\nenergy, in particular Lambda's reconstruction based on the performance of the\ndesigned EicC detector. In addition, taking spontaneous transverse polarization\nas an example, we provide a theoretical prediction with statistical projection\nbased on one month of EicC data taking, offering valuable insights into future\nresearch prospects.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:38:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ji","Zhaohuizi",""],["Zhao","Xiaoyan",""],["Guo","Aiqiang",""],["Xu","Qinghua",""],["Zhang","Jinlong",""]]}
{"id":"2308.15999","submitter":"Julian Scheuer","authors":"Julian Scheuer and Xuwen Zhang","title":"Stability of the Wulff shape with respect to anisotropic curvature\n  functionals","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a function $f$ which foliates a one-sided neighbourhood of a closed\nhypersurface $M$, we give an estimate of the distance of $M$ to a Wulff shape\nin terms of the $L^{p}$-norm of the traceless $F$-Hessian of $f$, where $F$ is\nthe support function of the Wulff shape. This theorem is applied to prove\nquantitative stability results for the anisotropic Heintze-Karcher inequality,\nthe anisotropic Alexandrov problem, as well as for the anisotropic\noverdetermined boundary value problem of Serrin-type.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:38:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Scheuer","Julian",""],["Zhang","Xuwen",""]]}
{"id":"2308.16000","submitter":"Noora Kartiosuo","authors":"Noora Kartiosuo, Jaakko Nevalainen, Olli Raitakari, Katja Pahkala,\n  Kari Auranen","title":"Hypothesis-driven mediation analysis for compositional data: an\n  application to gut microbiome","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biological sequencing data consist of read counts, e.g. of specified taxa and\noften exhibit sparsity (zero-count inflation) and overdispersion (extra-Poisson\nvariability). As most sequencing techniques provide an arbitrary total count,\ntaxon-specific counts should ideally be treated as proportions under the\ncompositional data-analytic framework. There is increasing interest in the role\nof the gut microbiome composition in mediating the effects of different\nexposures on health outcomes. Most previous approaches to compositional\nmediation have addressed the problem of identifying potentially mediating taxa\namong a large number of candidates. We here consider causal inference in\ncompositional mediation when a priori knowledge is available about the\nhierarchy for a restricted number of taxa, building on a single hypothesis\nstructured in terms of contrasts between appropriate sub-compositions. Based on\nthe theory on multiple contemporaneous mediators and the assumed causal graph,\nwe define non-parametric estimands for overall and coordinate-wise mediation\neffects, and show how these indirect effects can be estimated from empirical\ndata based on simple parametric linear models. The mediators have\nstraightforward and coherent interpretations, related to specific causal\nquestions about the interrelationships between the sub-compositions. We perform\na simulation study focusing on the impact of sparsity and overdispersion on\nestimation of mediation. While unbiased, the precision of the estimators\ndepends, for any given magnitude of indirect effect, on sparsity and the\nrelative magnitudes of exposure-to-mediator and mediator-to-outcome effects in\na complex manner. We demonstrate the approach on empirical data, finding an\ninverse association of fibre intake on insulin level, mainly attributable to\ndirect rather than indirect effects.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:39:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kartiosuo","Noora",""],["Nevalainen","Jaakko",""],["Raitakari","Olli",""],["Pahkala","Katja",""],["Auranen","Kari",""]]}
{"id":"2308.16001","submitter":"Thanasis Giannakopoulos","authors":"Thanasis Giannakopoulos","title":"Characteristic formulations of general relativity and applications","comments":"179 pages, PhD Thesis, supplementary material at\n  https://github.com/ThanasisGiannakopoulos/PhD-thesis-supp","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  General relativity can describe various gravitational systems of\nastrophysical relevance, like black holes and neutron stars, or even strongly\ncoupled systems through the holographic duality. The characteristic initial\n(boundary) value problem has numerous applications in general relativity\ninvolving numerical studies and is often formulated using Bondi-like\ncoordinates. Well-posedness of the resulting systems of partial differential\nequations, however, remains an open question. The answer to this question\naffects the accuracy, and potentially the reliability of conclusions drawn from\nnumerical studies based on such formulations. In the first part of this thesis,\nwe expand our understanding of the hyperbolicity and well-posedness of\nBondi-like free evolution systems. We show that several prototype Bondi-like\nformulations are only weakly hyperbolic and examine the root cause of this\nresult. Consequently, the characteristic initial (boundary) value problem of\ngeneral relativity in these gauges is rendered ill-posed in the simplest norms\none would like to employ. We discuss the implications of this result in\naccurate gravitational waveform modeling methods and work towards the\nconstruction of alternative norms that might be more appropriate. We also\npresent numerical tests that demonstrate weak hyperbolicity in practice and\nhighlight important features to perform them effectively. In the second part,\nwe turn our attention to applications of these formulations to the qualitative\nbehavior of strongly coupled systems via holography.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:41:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Giannakopoulos","Thanasis",""]]}
{"id":"2308.16002","submitter":"Christoph Borgers","authors":"Christoph B\\\"orgers and Samer Nour Eddine","title":"Variations on the two-child problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Mr. Smith has two children. Given that at least one of them is a boy, how\nlikely is it that Mr. Smith has two boys? It's a very standard puzzle in\nelementary books on probability theory. Whoever asks you this question hopes\nthat you will answer \"$\\frac{1}{2}$\", in which case they can say triumphantly\n\"Oh no, the answer is $\\frac{1}{3}$\". This is called the two-child puzzle. Some\nauthors have discussed a striking variation, which we'll call the Adam puzzle.\nAgain, Mr. Smith has two children. Given that one of them is a boy named Adam,\nhow likely is it that Mr. Smith has two boys? Astonishingly, now the answer is\n$\\frac{1}{2}$, at least approximately. (The exact answer depends a bit on\nprecise assumptions.) We give pictorial explanations of both puzzles. We then\npoint out that the answers usually given rely on a tacit assumption about how\nthe information that one of Mr. Smith's two children is a boy, or one of them\nis a boy named Adam, is obtained. We give examples showing that the answers may\nbe different with different assumptions. We conclude with a discussion of why\nthe Adam puzzle is so confusing to most people.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:45:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["B\u00f6rgers","Christoph",""],["Eddine","Samer Nour",""]]}
{"id":"2308.16003","submitter":"David Marsh","authors":"David J. E. Marsh","title":"Axions for amateurs","comments":"28 pages, invited review for Contemporary Physics","journal-ref":null,"doi":null,"report-no":"KCL-PH-TH/2023-46","categories":"physics.pop-ph hep-ph physics.ed-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Axions are an increasingly popular topic in theoretical physics, and are\nsparking a global experimental effort. In the following I review the\nmotivations for the existence of axions, the theories underlying them, and the\nmethods to search for them. The target audience is an interested amateur,\nphysics undergraduate, or scientist in another field, and so I use no\ncomplicated mathematics or advanced theoretical topics, and instead use lots of\nanalogies.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:47:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Marsh","David J. E.",""]]}
{"id":"2308.16004","submitter":"Xi Wang X","authors":"Xi Wang, Deming Yuan, Yiguang Hong, Zihao Hu, Lei Wang, Guodong Shi","title":"Riemannian Optimistic Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider Riemannian online convex optimization with dynamic\nregret. First, we propose two novel algorithms, namely the Riemannian Online\nOptimistic Gradient Descent (R-OOGD) and the Riemannian Adaptive Online\nOptimistic Gradient Descent (R-AOOGD), which combine the advantages of\nclassical optimistic algorithms with the rich geometric properties of\nRiemannian manifolds. We analyze the dynamic regrets of the R-OOGD and R-AOOGD\nin terms of regularity of the sequence of cost functions and comparators. Next,\nwe apply the R-OOGD to Riemannian zero-sum games, leading to the Riemannian\nOptimistic Gradient Descent Ascent algorithm (R-OGDA). We analyze the average\niterate and best-iterate of the R-OGDA in seeking Nash equilibrium for a\ntwo-player, zero-sum, g-convex-concave games. We also prove the last-iterate\nconvergence of the R-OGDA for g-strongly convex-strongly concave problems. Our\ntheoretical analysis shows that all proposed algorithms achieve results in\nregret and convergence that match their counterparts in Euclidean spaces.\nFinally, we conduct several experiments to verify our theoretical findings.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:47:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wang","Xi",""],["Yuan","Deming",""],["Hong","Yiguang",""],["Hu","Zihao",""],["Wang","Lei",""],["Shi","Guodong",""]]}
{"id":"2308.16005","submitter":"Cai Zhang","authors":"Mingrui Shi and Haozhen Situ and Cai Zhang","title":"Hybrid Quantum Neural Network Structures for Image Multi-classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image classification is a fundamental computer vision problem, and neural\nnetworks offer efficient solutions. With advancing quantum technology, quantum\nneural networks have gained attention. However, they work only for\nlow-dimensional data and demand dimensionality reduction and quantum encoding.\nTwo recent image classification methods have emerged: one employs PCA\ndimensionality reduction and angle encoding, the other integrates QNNs into\nCNNs to boost performance. Despite numerous algorithms, comparing PCA reduction\nwith angle encoding against the latter remains unclear. This study explores\nthese algorithms' performance in multi-class image classification and proposes\nan optimized hybrid quantum neural network suitable for the current\nenvironment. Investigating PCA-based quantum algorithms unveils a barren\nplateau issue for QNNs as categories increase, unsuitable for multi-class in\nthe hybrid setup. Simultaneously, the combined CNN-QNN model partly overcomes\nQNN's multi-class training challenges but lags in accuracy to superior\ntraditional CNN models. Additionally, this work explores transfer learning in\nthe hybrid quantum neural network model. In conclusion, quantum neural networks\nshow promise but require further research and optimization, facing challenges\nahead.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:48:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Shi","Mingrui",""],["Situ","Haozhen",""],["Zhang","Cai",""]]}
{"id":"2308.16006","submitter":"Simone Zanotto","authors":"Alessandro Pitanti, Gaia Da Prato, Giorgio Biasiol, Alessandro\n  Tredicucci, Simone Zanotto","title":"Gigahertz modulation of a fully dielectric nonlocal metasurface","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Nonlocal metasurfaces are currently emerging as advanced tools for the\nmanipulation of electromagnetic radiation, going beyond the widely explored\nHuygens metasurface concept. Nonetheless, the lack of an unified approach for\ntheir fast and efficient tunability still represents a serious challenge to\novercome. In this article we report on gigahertz modulation of a dielectric\nslab-based, nonlocal (i.e. angle-dispersive) metasurface, whose operation\nrelies on the optomechanical coupling with a mechanical wave excited\npiezoelectrically by a transducer integrated on the same chip. Importantly, the\nmetasurface region is free from any conductive material, thus eliminating\noptical losses, and making our device of potential interest for delicate\nenvironments such as high-power apparatuses or quantum optical systems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:49:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pitanti","Alessandro",""],["Da Prato","Gaia",""],["Biasiol","Giorgio",""],["Tredicucci","Alessandro",""],["Zanotto","Simone",""]]}
{"id":"2308.16007","submitter":"Miguel Angel Martin Contreras Dr.","authors":"Miguel Angel Martin Contreras and Alfredo Vega and Saulo Diles","title":"Isospectrality and configurational entropy as testing tools for\n  bottom-up AdS/QCD","comments":"14 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work discusses the connection between isospectrality and configurational\nentropy in holographic bottom-up models. We analyze the effect of\nmonoparametric isospectral transformation in holographic decay constants and\nconfigurational entropy for a set of softwall-like models at zero temperature.\nWe conclude that the isospectral parameter $\\lambda$ defines a window of\npossible holographic models suitable to describe spectroscopy.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:52:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Contreras","Miguel Angel Martin",""],["Vega","Alfredo",""],["Diles","Saulo",""]]}
{"id":"2308.16008","submitter":"Xu Han","authors":"Xu Han, Xianda Chen, Meixin Zhu, Pinlong Cai, Jianshan Zhou, Xiaowen\n  Chu","title":"EnsembleFollower: A Hybrid Car-Following Framework Based On\n  Reinforcement Learning and Hierarchical Planning","comments":"12 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Car-following models have made significant contributions to our understanding\nof longitudinal driving behavior. However, they often exhibit limited accuracy\nand flexibility, as they cannot fully capture the complexity inherent in\ncar-following processes, or may falter in unseen scenarios due to their\nreliance on confined driving skills present in training data. It is worth\nnoting that each car-following model possesses its own strengths and weaknesses\ndepending on specific driving scenarios. Therefore, we propose\nEnsembleFollower, a hierarchical planning framework for achieving advanced\nhuman-like car-following. The EnsembleFollower framework involves a high-level\nReinforcement Learning-based agent responsible for judiciously managing\nmultiple low-level car-following models according to the current state, either\nby selecting an appropriate low-level model to perform an action or by\nallocating different weights across all low-level components. Moreover, we\npropose a jerk-constrained kinematic model for more convincing car-following\nsimulations. We evaluate the proposed method based on real-world driving data\nfrom the HighD dataset. The experimental results illustrate that\nEnsembleFollower yields improved accuracy of human-like behavior and achieves\neffectiveness in combining hybrid models, demonstrating that our proposed\nframework can handle diverse car-following conditions by leveraging the\nstrengths of various low-level models.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:55:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Han","Xu",""],["Chen","Xianda",""],["Zhu","Meixin",""],["Cai","Pinlong",""],["Zhou","Jianshan",""],["Chu","Xiaowen",""]]}
{"id":"2308.16009","submitter":"Lidia Stocker","authors":"Lidia Stocker and Oded Zilberberg","title":"Coherent exchange-coupled nonlocal Kondo impurities","comments":"5 pages, 3 figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum dots exhibit a variety of strongly correlated effects, e.g., when\ntuned to emulate localized magnetic impurities that form a Kondo singlet with\ntheir surrounding environment. Interestingly, in double-dots setups, the\nmagnetic impurities couple to each other by direct\nRuderman-Kittel-Kasuya-Yosida (RKKY) interaction, which wins over the Kondo\nphysics. In this work, we investigate a double-dot device where the dots are\ncoupled via off-resonant ballistic whispering gallery modes, dubbed electronic\ncavity modes. Within this cavity-double-dot system, we study, using variational\nmatrix product state techniques, the competition between Kondo formation and\nthe coherent RKKY-like interaction that the cavity facilitates. Specifically,\nwe find that (i) Kondo can win and form on each dot individually, or (ii) the\ncavity can win and mediate between the two dots either a singlet or a novel\nnonlocal Kondo-like effect phase, which we call \"cat Kondo\". We systematically\nstudy the quantum phase transitions between the different many-body states. Our\ndiscoveries lay the foundation for the experimental observation of\nunconventional nonlocal magnetic impurities.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:56:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Stocker","Lidia",""],["Zilberberg","Oded",""]]}
{"id":"2308.16010","submitter":"Alessandra Costantini","authors":"Alessandra Costantini, Edward F. Price III, Matthew Weaver","title":"On Rees algebras of linearly presented ideals and modules","comments":"15 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $I$ be a perfect ideal of height two in $R=k[x_1, \\ldots, x_d]$ and let\n$\\varphi$ denote its Hilbert-Burch matrix. When $\\varphi$ has linear entries,\nthe algebraic structure of the Rees algebra $\\mathcal{R}(I)$ is well-understood\nunder the additional assumption that the minimal number of generators of $I$ is\nbounded locally up to codimension $d-1$. In the first part of this article, we\ndetermine the defining ideal of $\\mathcal{R}(I)$ under the weaker assumption\nthat such condition holds only up to codimension $d-2$, generalizing previous\nwork of P.~H.~L.~Nguyen. In the second part, we use generic Bourbaki ideals to\nextend our findings to Rees algebras of linearly presented modules of\nprojective dimension one.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:58:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Costantini","Alessandra",""],["Price","Edward F.","III"],["Weaver","Matthew",""]]}
{"id":"2308.16011","submitter":"Jacob B Khurgin","authors":"Jacob B Khurgin","title":"Energy and Power requirements for alteration of the refractive index","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ability to manipulate the refractive index is a fundamental principle\nunderlying numerous photonic devices. Various techniques exist to modify the\nrefractive index across diverse materials, making performance comparison far\nfrom straightforward. In evaluating these methods, power consumption emerges as\na key performance characteristic, alongside bandwidth and footprint. Here I\nundertake a comprehensive comparison of the energy and power requirements for\nthe most well-known index change schemes. The findings reveal that while the\nenergy per volume for index change remains within the same order of magnitude\nacross different techniques and materials, the power consumption required to\nachieve switching, 100% modulation, or 100% frequency conversion can differ\nsignificantly, spanning many orders of magnitude. As it turns out, the material\nused has less influence on power reduction than the specific resonant or\ntraveling wave scheme employed to enhance the interaction time between light\nand matter. Though this work is not intended to serve as a design guide, it\ndoes establish the limitations and trade-offs involved in index modulation,\nthus providing valuable insights for photonics practitioners.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:09:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Khurgin","Jacob B",""]]}
{"id":"2308.16012","submitter":"Hans Munthe-Kaas","authors":"Hans Munthe-Kaas","title":"Geometric integration on symmetric spaces","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 consider geometric numerical integration algorithms for differential\nequations evolving on symmetric spaces. The integrators are constructed from\ncanonical operations on the symmetric space, its Lie triple system (LTS), and\nthe exponential from the LTS to the symmetric space. Examples of symmetric\nspaces are n-spheres and Grassmann manifolds, the space of positive definite\nsymmetric matrices, Lie groups with a symmetric product, and elliptic and\nhyperbolic spaces with constant sectional curvatures. We illustrate the\nabstract algorithm with concrete examples. In particular for the n-sphere and\nthe n-dimensional hyperbolic space the resulting algorithms are very simple and\ncost only O(n) operations per step.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:13:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Munthe-Kaas","Hans",""]]}
{"id":"2308.16013","submitter":"William Barford Professor","authors":"William Barford","title":"Singlet Fission in Lycopene H-Aggregates","comments":null,"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":"  A theory of singlet fission (SF) in carotenoid dimers is applied to explain\nthe SF in lycopene H-aggregates observed after high energy photoexcitation. The\nexplanation proposed here is that a high energy, delocalized bright $^1B_u^+$\nstate first relaxes and localizes onto a single lycopene monomer. The\nhigh-energy intramonomer state then undergoes internal conversion to the\n$1^1B_u^-$ state. Once populated, the $1^1B_u^-$ state allows exothermic\nbimolecular singlet fission, while its internal conversion to the $2^1A_g^-$\nstate is symmetry forbidden. The simulation of SF predicts that the\nintramonomer triplet-pair state undergoes complete population transfer to the\nintermonomer singlet triplet-pair state within 100 ps. ZFS interactions then\nbegin to partially populate the intermonomer quintet triplet-pair state up to\nca. 2 ns, after which hyperfine interactions thermally equilibrate the\ntriplet-pair states, thus forming free, single triplets within ca. 0.1 $\\mu$s.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:14:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Barford","William",""]]}
{"id":"2308.16014","submitter":"Anbhu Swaminathan","authors":"Vikash Kumar and A. Swaminathan","title":"Lubinsky inequality associated with certain measures in the\n  Marcell\\'{a}n class","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, an attempt is made to examine the Lubinsky inequality within\na specific pair of measures by relaxing the relation between the measures given\nin the original hypothesis. Specifically, the bound for the Lubinsky inequality\nis derived in relation to the Verblunsky coefficients, along with parameters\nobtained from the Marcell\\'{a}n class. Furthermore, the representation of\northogonal polynomials using the polynomials derived from the Marcell\\'{a}n\nclass is obtained. The chain sequence in terms of Verblunsky coefficients\ncorresponding to the measures from the Marcell\\'{a}n class is obtained.\nAdditionally, estimates for the norms of orthogonal polynomials concerning\nmeasures within the Marcell\\'{a}n class are provided.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:15:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kumar","Vikash",""],["Swaminathan","A.",""]]}
{"id":"2308.16015","submitter":"Ludovico Nista","authors":"Ludovico Nista, Christoph David Karl Schumann, Mathis Bode, Temistocle\n  Grenga, Jonathan F. MacArt, Antonio Attili, and Heinz Pitsch","title":"Influence of adversarial training on super-resolution turbulence models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Supervised super-resolution deep convolutional neural networks (CNNs) have\ngained significant attention for large eddy simulation subfilter-scale (SFS)\nmodeling due to their ability to reconstruct statistically meaningful flow\nfields on fine meshes. Despite their popularity, CNNs lack the ability to\naccurately reconstruct high-frequency features and generalization performance\non out-of-sample flows. Generative adversarial networks (GANs) are a potential\nalternative, allowing for both semi-supervised and fully unsupervised training,\nthough they have not been thoroughly investigated as turbulence closures, and a\ncomprehensive understanding of the discriminator's role has not been developed.\nThis study assesses the effectiveness of GANs for a priori SFS stress modeling\nin forced homogeneous isotropic turbulence. It is found that GAN-based\narchitectures outperform supervised CNN models for SFS reconstruction for\nin-sample cases. The reconstruction accuracy of both models decreases for\nout-of-sample data, though the GAN discriminator applied as a \"feature\nextractor\" narrows the model's solution space and enhances the generator's\nout-of-sample robustness. The extrapolation ability of the GAN-based model for\nhigher-Reynolds-number flows is also demonstrated. This highlights the\neffectiveness of the GAN discriminator in optimizing robust and accurate SFS\nmodels for out-of-sample flows. Based on these findings, training with a\ndiscriminator is recommended before integrating super-resolution CNN closures\ninto numerical solvers.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:17:49 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 06:05:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nista","Ludovico",""],["Schumann","Christoph David Karl",""],["Bode","Mathis",""],["Grenga","Temistocle",""],["MacArt","Jonathan F.",""],["Attili","Antonio",""],["Pitsch","Heinz",""]]}
{"id":"2308.16016","submitter":"Alexander Mozeika","authors":"Mohammad M. Jalalzai, Alexander Mozeika, Marcin P. Pawlowsk, Ganesh\n  Narayanaswamy","title":"Carnot: A highly Scalable and Responsive BFT Consensus protocol","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC math.PR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present Carnot, a leader-based Byzantine Fault Tolerant (BFT) consensus\nprotocol that is responsive and operates under the partially synchronous model.\nResponsive BFT consensus protocols exhibit wire-speed operation and deliver\ninstantaneous finality, thereby addressing a fundamental need in distributed\nsystems. A key challenge in scaling these protocols has been the computational\ncomplexity associated with authenticator verification. We demonstrate that\nCarnot effectively addresses this bottleneck by adeptly streamlining the\nverification and aggregation of O(log(N)) authenticators per node. This notable\nadvancement marks a substantial improvement over the prevailing O(N)\nstate-of-the-art approaches. Leveraging this inherent property, Carnot\ndemonstrates its capacity to seamlessly scale to networks comprising tens to\nhundreds of thousands of nodes. We envision Carnot as a critical stride towards\nbridging the gap between classical BFT consensus mechanisms and blockchain\ntechnology.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:20:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Jalalzai","Mohammad M.",""],["Mozeika","Alexander",""],["Pawlowsk","Marcin P.",""],["Narayanaswamy","Ganesh",""]]}
{"id":"2308.16017","submitter":"Brian Zhang","authors":"Luca Carminati, Brian Hu Zhang, Gabriele Farina, Nicola Gatti, Tuomas\n  Sandholm","title":"Hidden-Role Games: Equilibrium Concepts and Computation","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 study the class of games known as hidden-role games in\nwhich players get privately assigned a team and are faced with the challenge of\nrecognizing and cooperating with teammates. This model includes both popular\nrecreational games such as the Mafia/Werewolf family and The Resistance\n(Avalon) and real-world security settings, where a distributed system wants to\noperate while some of its nodes are controlled by adversaries. There has been\nlittle to no formal mathematical grounding of such settings in the literature,\nand it is not even immediately clear what the right solution concept is. In\nparticular, the suitable notion of equilibrium depends on communication\navailable to the players (whether players can communicate, whether they can\ncommunicate in private, and whether they can observe who is communicating), and\ndefining it turns out to be a nontrivial task with several surprising\nconsequences. We show that in certain cases, including the above recreational\ngames, near-optimal equilibria can be computed efficiently. In most other\ncases, we show that computing an optimal equilibrium is either NP-hard or\ncoNP-hard. Lastly, we experimentally validate our approach by computing\nnearly-exact equilibria for complete Avalon instances up to 6 players whose\nsize in terms of number of information sets is larger than $10^{56}$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:20:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Carminati","Luca",""],["Zhang","Brian Hu",""],["Farina","Gabriele",""],["Gatti","Nicola",""],["Sandholm","Tuomas",""]]}
{"id":"2308.16018","submitter":"Shaojie Zhang","authors":"Shaojie Zhang, Jianqin Yin, Yonghao Dang and Jiajun Fu","title":"Topology-aware MLP for Skeleton-based 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":"  Graph convolution networks (GCNs) have achieved remarkable performance in\nskeleton-based action recognition. However, existing previous GCN-based methods\nhave relied excessively on elaborate human body priors and constructed complex\nfeature aggregation mechanisms, which limits the generalizability of networks.\nTo solve these problems, we propose a novel Spatial Topology Gating Unit\n(STGU), which is an MLP-based variant without extra priors, to capture the\nco-occurrence topology features that encode the spatial dependency across all\njoints. In STGU, to model the sample-specific and completely independent\npoint-wise topology attention, a new gate-based feature interaction mechanism\nis introduced to activate the features point-to-point by the attention map\ngenerated from the input. Based on the STGU, in this work, we propose the first\ntopology-aware MLP-based model, Ta-MLP, for skeleton-based action recognition.\nIn comparison with existing previous methods on three large-scale datasets,\nTa-MLP achieves competitive performance. In addition, Ta-MLP reduces the\nparameters by up to 62.5% with favorable results. Compared with previous\nstate-of-the-art (SOAT) approaches, Ta-MLP pushes the frontier of real-time\naction recognition. The code will be available at\nhttps://github.com/BUPTSJZhang/Ta-MLP.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:20:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Shaojie",""],["Yin","Jianqin",""],["Dang","Yonghao",""],["Fu","Jiajun",""]]}
{"id":"2308.16019","submitter":"Joseph Davis","authors":"Samantha M. Webster, Mira B. May, Barrett M. Powell, Joseph H. Davis","title":"Imaging structurally dynamic ribosomes with cryogenic electron\n  microscopy","comments":"15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Throughout the history of electron microscopy, ribosomes have served as an\nideal subject for imaging and technological development, which in turn has\ndriven our understanding of ribosomal biology. Here, we provide a historical\nperspective at the intersection of electron microscopy technology development\nand ribosome biology and reflect on how this technique has shed light on each\nstage of the life cycle of this dynamic macromolecular machine. With an\nemphasis on prokaryotic systems, we specifically describe how pairing cryo-EM\nwith clever experimental design, time-resolved techniques, and next-generation\nheterogeneous structural analysis has afforded insights into the modular nature\nof assembly, the roles of the many transient biogenesis and translation\nco-factors, and the subtle variations in structure and function between strains\nand species. The work concludes with a prospective outlook on the field,\nhighlighting the pivotal role cryogenic electron tomography is playing in\nadding cellular context to our understanding of ribosomal life cycles, and\nnoting how this exciting technology promises to bridge the gap between cellular\nand structural biology.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:21:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Webster","Samantha M.",""],["May","Mira B.",""],["Powell","Barrett M.",""],["Davis","Joseph H.",""]]}
{"id":"2308.16020","submitter":"Gregor Diatzko","authors":"Sabine Cornelsen and Gregor Diatzko","title":"Decomposing Triangulations into 4-Connected Components","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.CG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A connected graph is 4-connected if it contains at least five vertices and\nremoving any three of them does not disconnect it. A frequent preprocessing\nstep in graph drawing is to decompose a plane graph into its 4-connected\ncomponents and to determine their nesting structure. A linear-time algorithm\nfor this problem was already proposed by Kant. However, using common graph data\nstructures, we found the subroutine dealing with triangulated graphs difficult\nto implement in such a way that it actually runs in linear time. As a drop-in\nreplacement, we provide a different, easy-to-implement linear-time algorithm\nthat decomposes a triangulated graph into its 4-connected components and\ncomputes the respective nesting structure. The algorithm is based on\ndepth-first search.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:21:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cornelsen","Sabine",""],["Diatzko","Gregor",""]]}
{"id":"2308.16021","submitter":"Xiang Li","authors":"Yi Meng, Xiang Li, Zhiyong Wu, Tingtian Li, Zixun Sun, Xinyu Xiao, Chi\n  Sun, Hui Zhan, Helen Meng","title":"CALM: Contrastive Cross-modal Speaking Style Modeling for Expressive\n  Text-to-Speech Synthesis","comments":"Accepted by InterSpeech 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To further improve the speaking styles of synthesized speeches, current\ntext-to-speech (TTS) synthesis systems commonly employ reference speeches to\nstylize their outputs instead of just the input texts. These reference speeches\nare obtained by manual selection which is resource-consuming, or selected by\nsemantic features. However, semantic features contain not only style-related\ninformation, but also style irrelevant information. The information irrelevant\nto speaking style in the text could interfere the reference audio selection and\nresult in improper speaking styles. To improve the reference selection, we\npropose Contrastive Acoustic-Linguistic Module (CALM) to extract the\nStyle-related Text Feature (STF) from the text. CALM optimizes the correlation\nbetween the speaking style embedding and the extracted STF with contrastive\nlearning. Thus, a certain number of the most appropriate reference speeches for\nthe input text are selected by retrieving the speeches with the top STF\nsimilarities. Then the style embeddings are weighted summarized according to\ntheir STF similarities and used to stylize the synthesized speech of TTS.\nExperiment results demonstrate the effectiveness of our proposed approach, with\nboth objective evaluations and subjective evaluations on the speaking styles of\nthe synthesized speeches outperform a baseline approach with\nsemantic-feature-based reference selection.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:21:51 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Meng","Yi",""],["Li","Xiang",""],["Wu","Zhiyong",""],["Li","Tingtian",""],["Sun","Zixun",""],["Xiao","Xinyu",""],["Sun","Chi",""],["Zhan","Hui",""],["Meng","Helen",""]]}
{"id":"2308.16022","submitter":"Louis Rouillard","authors":"Louis Rouillard, Alexandre Le Bris, Thomas Moreau, Demian Wassermann","title":"PAVI: Plate-Amortized Variational Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given observed data and a probabilistic generative model, Bayesian inference\nsearches for the distribution of the model's parameters that could have yielded\nthe data. Inference is challenging for large population studies where millions\nof measurements are performed over a cohort of hundreds of subjects, resulting\nin a massive parameter space. This large cardinality renders off-the-shelf\nVariational Inference (VI) computationally impractical.\n  In this work, we design structured VI families that efficiently tackle large\npopulation studies. Our main idea is to share the parameterization and learning\nacross the different i.i.d. variables in a generative model, symbolized by the\nmodel's \\textit{plates}. We name this concept \\textit{plate amortization}.\nContrary to off-the-shelf stochastic VI, which slows down inference, plate\namortization results in orders of magnitude faster to train variational\ndistributions.\n  Applied to large-scale hierarchical problems, PAVI yields expressive,\nparsimoniously parameterized VI with an affordable training time. This faster\nconvergence effectively unlocks inference in those large regimes. We illustrate\nthe practical utility of PAVI through a challenging Neuroimaging example\nfeaturing 400 million latent parameters, demonstrating a significant step\ntowards scalable and expressive Variational Inference.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:22:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rouillard","Louis",""],["Bris","Alexandre Le",""],["Moreau","Thomas",""],["Wassermann","Demian",""]]}
{"id":"2308.16023","submitter":"Juliana Caspers","authors":"Karthika Krishna Kumar, Juliana Caspers, F\\'elix Ginot, Matthias\n  Kr\\\"uger, Clemens Bechinger","title":"Memory-induced alignment of colloidal dumbbells","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  When a colloidal probe is forced through a viscoelastic fluid which is\ncharacterized by a long stress-relaxation time, the fluid is excited out of\nequilibrium. This is leading to a number of interesting effects including a\nnon-trivial recoil of the probe when the driving force is removed. Here, we\nexperimentally and theoretically investigate the transient recoil dynamics of\nnon-spherical particles, i.e., colloidal dumbbells. In addition to a\ntranslational recoil of the dumbbells, we also find a pronounced angular\nreorientation which results from the relaxation of the surrounding fluid. Our\nfindings are in good agreement with a Langevin description based on the\nsymmetries of a director (dumbbell) as well as a microscopic bath-rod model.\nRemarkably, we find a frustrated state with amplified fluctuations when the\ndumbbell is oriented perpendicular to the direction of driving. Our results\ndemonstrate the complex behavior of non-spherical objects within a relaxing\nenvironment which are of immediate interest for the motion of externally but\nalso self-driven asymmetric objects in viscoelastic fluids.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:23:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kumar","Karthika Krishna",""],["Caspers","Juliana",""],["Ginot","F\u00e9lix",""],["Kr\u00fcger","Matthias",""],["Bechinger","Clemens",""]]}
{"id":"2308.16024","submitter":"David Knoble","authors":"D. Ben Knoble and Bogdan Popa","title":"Functional Shell and Reusable Components for Easy GUIs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Some object-oriented GUI toolkits tangle state management with rendering.\nFunctional shells and observable toolkits like GUI Easy simplify and promote\nthe creation of reusable views by analogy to functional programming. We have\nsuccessfully used GUI Easy on small and large GUI projects. We report on our\nexperience constructing and using GUI Easy and derive from that experience\nseveral architectural patterns and principles for building functional programs\nout of imperative systems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:27:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Knoble","D. Ben",""],["Popa","Bogdan",""]]}
{"id":"2308.16025","submitter":"Rudy Arthur","authors":"Rudy Arthur","title":"A Critical Analysis of the What3Words Geocoding Algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  What3Words is a geocoding application that uses triples of words instead of\nalphanumeric coordinates to identify locations. What3Words has grown rapidly in\npopularity over the past few years and is used in logistical applications\nworldwide, including by emergency services. What3Words has also attracted\ncriticism for being less reliable than claimed, in particular that the chance\nof confusing one address with another is high. This paper investigates these\nclaims and shows that the What3Words algorithm for assigning addresses to grid\nboxes creates many pairs of confusable addresses, some of which are quite close\ntogether. The implications of this for the use of What3Words in critical or\nemergency situations is discussed.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:30:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Arthur","Rudy",""]]}
{"id":"2308.16026","submitter":"Ludmila Petrova L.I.","authors":"L.I. Petrova","title":"Internal connection between the field theory equations. Fundamentals of\n  the field theory","comments":"11 pages, XXIII International Scientific Conference \"Physical\n  Interpretations of Relativity Theory , Moscow, July 3rd to 6th, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is shown that there is a correspondence between field theory equations\nsuch as the Dirac, Shr\\H{o}dinger, Maxwell, Einstein equations and closed\nexterior forms of a certain degree. In this case, the Dirac and Shr\\H{o}dinger\nequations for the wave function correspond to closed exterior forms of zero\ndegree. The Shr\\H{o}dinger equation for the state functional corresponds to\nclosed exterior forms of the first degree. The Maxwell's equations based on\nexterior forms of second degree. Einstein's equation for the gravitational\nfield consists of covariant tensors, which correspond to closed exterior forms\nof the second degree. However, the covariant tensors of the Einstein equation\nare derived from the covariant tensors, which correspond to closed exterior\nforms of third degree. Such a correspondence between the field theory equations\nand closed exterior forms of a certain degree reveals the internal connection\nbetween the field theory equations. At the same time, it was shown that closed\nexterior forms, on which the field theory equations for physical fields are\nbased, are associated with the equations of mathematical physics for material\nmedia, such as thermodynamic, gas-dynamic, electromagnetic, cosmological\nequations, etc.\n  This indicates the connection between the field theory equations and the\nmathematical physics equations and reveals the foundations of field theory.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:32:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Petrova","L. I.",""]]}
{"id":"2308.16027","submitter":"Sait Umar","authors":"M. Arik, S. Ayik, O. Yilmaz, and A. S. Umar","title":"Description of multinucleon transfer mechanism for ${}^{48}\n  \\mathrm{Ca}+{ }^{244} \\mathrm{Pu}$ and ${ }^{86} \\mathrm{Kr}+{}^{198}\n  \\mathrm{Pt}$ reactions in quantal transport approach","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work aims to show that the quantal diffusion approach based on the\nstochastic mean field (SMF) theory is capable of explaining the reaction\ndynamics observed in MNT reactions. Primary product mass distributions in\n$^{48}$Ca+$^{244}$Pu reaction at E$_\\text{{c.m.}}= $ 203.2 MeV and\n$^{86}$Kr+$^{198}$Pt reaction at E$_\\text{{c.m.}} = $ 324.2 MeV are calculated\nand compared with the available experimental data.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:35:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Arik","M.",""],["Ayik","S.",""],["Yilmaz","O.",""],["Umar","A. S.",""]]}
{"id":"2308.16028","submitter":"Zhigui Lin","authors":"Haiyan Xu, Zhigui Lin and Huaiping Zhu","title":"On an age-structured juvenile-adult model with harvesting pulse in\n  moving and heterogeneous environment","comments":"35 pages, 25 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper concerns an age-structured juvenile-adult model with harvesting\npulse and moving boundaries in a heterogeneous environment, in which the moving\nboundaries describe the natural expanding front of species and human periodic\npulse intervention is carried on the adults. The principal eigenvalue is\nfirstly defined and its properties involving the intensity of harvesting and\nlength of habitat sizes are analysed. Then the criteria to determine whether\nthe species spread or vanish is discussed, and some relevant sufficient\nconditions characterized by pulse are established. Our results reveal that the\nco-extinction or coexistence of species is influenced by internal expanding\ncapacities from species itself and external harvesting pulse from human\nintervention, in which the intensity and timing of harvesting play key roles.\nThe final numerical approximations indicate that the larger the harvesting rate\nand the shorter the harvesting period, the worse the survival of all\nindividuals due to the cooperation among juveniles and adults, and such\nharvesting pulse can even alter the situation of species, from persistence to\nextinction. In addition, expanding capacities also affect or alter the outcomes\nof spreading-vanishing\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:36:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xu","Haiyan",""],["Lin","Zhigui",""],["Zhu","Huaiping",""]]}
{"id":"2308.16029","submitter":"Matthew Barthet","authors":"Matthew Barthet, Chintan Trivedi, Kosmas Pinitas, Emmanouil Xylakis,\n  Konstantinos Makantasis, Antonios Liapis, Georgios N. Yannakakis","title":"Knowing Your Annotator: Rapidly Testing the Reliability of Affect\n  Annotation","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The laborious and costly nature of affect annotation is a key detrimental\nfactor for obtaining large scale corpora with valid and reliable affect labels.\nMotivated by the lack of tools that can effectively determine an annotator's\nreliability, this paper proposes general quality assurance (QA) tests for\nreal-time continuous annotation tasks. Assuming that the annotation tasks rely\non stimuli with audiovisual components, such as videos, we propose and evaluate\ntwo QA tests: a visual and an auditory QA test. We validate the QA tool across\n20 annotators that are asked to go through the test followed by a lengthy task\nof annotating the engagement of gameplay videos. Our findings suggest that the\nproposed QA tool reveals, unsurprisingly, that trained annotators are more\nreliable than the best of untrained crowdworkers we could employ. Importantly,\nthe QA tool introduced can predict effectively the reliability of an affect\nannotator with 80% accuracy, thereby, saving on resources, effort and cost, and\nmaximizing the reliability of labels solicited in affective corpora. The\nintroduced QA tool is available and accessible through the PAGAN annotation\nplatform.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:37:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Barthet","Matthew",""],["Trivedi","Chintan",""],["Pinitas","Kosmas",""],["Xylakis","Emmanouil",""],["Makantasis","Konstantinos",""],["Liapis","Antonios",""],["Yannakakis","Georgios N.",""]]}
{"id":"2308.16030","submitter":"Jos\\'e Siqueira","authors":"Jos\\'e Siqueira","title":"Nonstandard proof methods in toposes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We determine sufficient structure for an elementary topos to emulate E.\nNelson's Internal Set Theory in its internal language, and show that any topos\nsatisying the internal axiom of choice occurs as a universe of standard objects\nand maps. This development allows one to employ the proof methods of\nnonstandard analysis (transfer, standardisation, and idealisation) in new\nenvironments such as toposes of $G$-sets and Boolean \\'entendues.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:41:09 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Siqueira","Jos\u00e9",""]]}
{"id":"2308.16031","submitter":"Bowen Gu","authors":"Bowen Gu, Dong Li, Haiyang Ding, Gongpu Wang and Chintha Tellambura","title":"Breaking the Interference and Fading Gridlock in Backscatter\n  Communications: State-of-the-Art, Design Challenges, and Future Directions","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":"  With the rapid advancement of the Internet of Things (IoT) and mobile\ncommunication technologies, a multitude of devices are becoming interconnected,\nmarking the onset of an era where all things are connected. While this growth\nopens opportunities for novel products and applications, it also leads to\nincreased energy demand and battery reliance in IoT devices, creating a\nsignificant bottleneck that hinders sustainable progress. Traditional energy\nharvesting (EH) techniques, although promising, face limitations such as\ninsufficient efficiency, high costs, and practical constraints that impede\nwidespread adoption. Backscatter communication (BackCom), a low-power and\npassive method, emerges as a promising solution to these challenges, directly\naddressing stranded energy impasse by reducing manufacturing costs and energy\nconsumption in IoT devices. We perform an in-depth analysis of three primary\nBackCom architectures: Monostatic, Bistatic, and Ambient BackComs. In our\nexploration, we identify fundamental challenges, such as complex interference\nenvironments (including the direct-link interference and the mutual\ninterference among tags) and double-path fading, which contribute to suboptimal\nperformance in BackCom systems. This review aims to furnish a comprehensive\nexamination of existing solutions designed to combat complex interference\nenvironments and double-path fading, offering insightful analysis and\ncomparison to select effective strategies to address these challenges. We also\ndelve into emerging trends and challenges in BackCom, forecasting potential\npaths for technological advancement and providing insights into navigating the\nintricate landscape of future communication needs. Our work provides\nresearchers and engineers with a clear and comprehensive perspective, enabling\nthem to better understand and creatively tackle the ongoing challenges in\nBackCom systems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:42:04 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gu","Bowen",""],["Li","Dong",""],["Ding","Haiyang",""],["Wang","Gongpu",""],["Tellambura","Chintha",""]]}
{"id":"2308.16032","submitter":"Youngrong Lim","authors":"Youngrong Lim, Minki Hhan, Hyukjoon Kwon","title":"Non-destructive Local Discrimination of Entangled Quantum States","comments":"6+3 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate a substantial gap between local and nonlocal strategies in a\nquantum state discrimination task under a non-destructiveness condition. The\ncondition imposes additional constraints to conventional state discrimination\nthat the initial state should be returned without disturbance. For a set of\nmaximally entangled states, the success probability of the proposed task using\nlocal operations and classical communications is completely suppressed; it\ncannot beat random guessing. We also show that a local strategy that\nefficiently exploits pre-shared entanglement for this task can be essentially\ndifferent from the conventional approaches. We construct a non-destructive and\nadaptive strategy to achieve perfect discrimination of maximally entangled\nstates which has a strictly lower entanglement cost than the best-known method\nbased on teleportation. Our approach can be generalized to multipartite\nscenarios, offering an application in entanglement certification of a quantum\nnetwork.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:46:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lim","Youngrong",""],["Hhan","Minki",""],["Kwon","Hyukjoon",""]]}
{"id":"2308.16033","submitter":"Ameet Gadekar","authors":"Parinya Chalermsook and Ameet Gadekar and Kamyar Khodamoradi and\n  Joachim Spoerhase","title":"Independent set in $k$-Claw-Free Graphs: Conditional $\\chi$-boundedness\n  and the Power of LP/SDP Relaxations","comments":"WAOA 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper studies $k$-claw-free graphs, exploring the connection between an\nextremal combinatorics question and the power of a convex program in\napproximating the maximum-weight independent set in this graph class. For the\nextremal question, we consider the notion, that we call \\textit{conditional\n$\\chi$-boundedness} of a graph: Given a graph $G$ that is assumed to contain an\nindependent set of a certain (constant) size, we are interested in upper\nbounding the chromatic number in terms of the clique number of $G$. This\nquestion, besides being interesting on its own, has algorithmic implications\n(which have been relatively neglected in the literature) on the performance of\nSDP relaxations in estimating the value of maximum-weight independent set.\n  For $k=3$, Chudnovsky and Seymour (JCTB 2010) prove that any $3$-claw-free\ngraph $G$ with an independent set of size three must satisfy $\\chi(G) \\leq 2\n\\omega(G)$. Their result implies a factor $2$-estimation algorithm for the\nmaximum weight independent set via an SDP relaxation (providing the first\nnon-trivial result for maximum-weight independent set in such graphs via a\nconvex relaxation). An obvious open question is whether a similar conditional\n$\\chi$-boundedness phenomenon holds for any $k$-claw-free graph. Our main\nresult answers this question negatively. We further present some evidence that\nour construction could be useful in studying more broadly the power of convex\nrelaxations in the context of approximating maximum weight independent set in\n$k$-claw free graphs. In particular, we prove a lower bound on families of\nconvex programs that are stronger than known convex relaxations used\nalgorithmically in this context.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:47:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chalermsook","Parinya",""],["Gadekar","Ameet",""],["Khodamoradi","Kamyar",""],["Spoerhase","Joachim",""]]}
{"id":"2308.16034","submitter":"Sandro Mattarei","authors":"Marina Avitabile and Sandro Mattarei","title":"On some coefficients of the Artin-Hasse series modulo a prime","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $p$ be an odd prime, and let $\\sum_{n=0}^{\\infty}\na_{n}X^{n}\\in\\mathbb{F}_p[[X]]$ be the reduction modulo $p$ of the Artin-Hasse\nexponential. We obtain a polynomial expression for $a_{kp}$ in terms of those\n$a_{rp}$ with $r<k$, for even $k<p^2-1$. A conjectural analogue covering the\ncase of odd $k<p$ can be stated in various polynomial forms, essentially in\nterms of the polynomial $\\gamma(X) =\\sum_{n=1}^{p-2}(B_{n}/n)X^{p-n}$, where\n$B_n$ denotes the $n$-th Bernoulli number.\n  We prove that $\\gamma(X)$ satisfies the functional equation\n$\\gamma(X-1)-\\gamma(X)=\\pounds_1(X)+X^{p-1}-w_p-1$ in $\\mathbb{F}_p[X]$, where\n$\\pounds_1(X)$ and $w_p$ are the truncated logarithm and the Wilson quotient.\nThis is an analogue modulo $p$ of a functional equation, in $\\mathbb{Q}[[X]]$,\nestablished by Zagier for the power series $\\sum_{n=1}^{\\infty}(B_{n}/n)X^n$.\nOur proof of the functional equation establishes a connection with a result of\nNielsen of 1915, of which we provide a fresh proof. Our polynomial framing\nallows us to derive congruences for certain numerical sums involving divided\nBernoulli numbers.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:48:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Avitabile","Marina",""],["Mattarei","Sandro",""]]}
{"id":"2308.16035","submitter":"Filip Ficek","authors":"Filip Ficek, Claude Warnick","title":"Quasinormal modes of Reissner-Nordstr\\\"{o}m-AdS: the approach to\n  extremality","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the quasinormal spectrum of scalar and gravitational\nperturbations of the Reissner-Nordstr\\\"om-AdS black hole as the horizon\napproaches extremality. By considering a foliation of the black hole by\nspacelike surfaces which intersect the future horizon we implement numerical\nmethods which are well behaved up to and including the extremal limit and which\nadmit initial data which is nontrivial at the horizon. As extremality is\napproached we observe a transition whereby the least damped mode ceases to be\noscillatory in time, and the late time signal changes qualitatively as a\nconsequence.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:48:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ficek","Filip",""],["Warnick","Claude",""]]}
{"id":"2308.16036","submitter":"Yotam Shapira","authors":"Yotam Shapira, Jovan Markov, Nitzan Akerman, Ady Stern and Roee Ozeri","title":"Programmable quantum simulations on a trapped-ions quantum computer with\n  a global drive","comments":"Any comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Simulation of quantum systems is notoriously challenging for classical\ncomputers, while quantum computers are naturally well-suited for this task.\nHowever, the imperfections of contemporary quantum computers pose a\nconsiderable challenge in carrying out accurate simulations over long evolution\ntimes. Here we experimentally demonstrate a method for quantum simulations on a\nsmall-scale trapped ions-based quantum computer. Our method enables quantum\nsimulations of programmable spin-Hamiltonians, using only simple global fields,\ndriving all qubits homogeneously and simultaneously. We measure the evolution\nof a quantum Ising ring and accurately reconstruct the Hamiltonian parameters,\nshowcasing an accurate and high-fidelity simulation. Our method enables a\nsignificant reduction in the required control and depth of quantum simulations,\nthus generating longer evolution times with higher accuracy.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:49:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Shapira","Yotam",""],["Markov","Jovan",""],["Akerman","Nitzan",""],["Stern","Ady",""],["Ozeri","Roee",""]]}
{"id":"2308.16037","submitter":"Bernard Lidick\\'y","authors":"Michelle Delcourt, Catherine Greenhill, Mikhail Isaev, Bernard\n  Lidick\\'y, Luke Postle","title":"Decomposing random regular graphs into stars","comments":"41 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study $k$-star decompositions, that is, partitions of the edge set into\ndisjoint stars with $k$ edges, in the uniformly random $d$-regular graph model\n$\\mathcal{G}_{n,d}$. We prove an existence result for such decompositions for\nall $d,k$ such that $d/2 < k \\leq d/2 + \\max\\{1,\\frac{1}{6}\\log d\\}$. More\ngenerally, we give a sufficient existence condition that can be checked\nnumerically for any given values of $d$ and $k$. Complementary negative results\nare obtained using the independence ratio of random regular graphs. Our results\nestablish an existence threshold for $k$-star decompositions in\n$\\mathcal{G}_{n,d}$ for all $d\\leq 100$ and $k > d/2$, and strongly suggest the\na.a.s. existence of such decompositions is equivalent to the a.a.s. existence\nof independent sets of size $(2k-d)n/(2k)$, subject to the necessary\ndivisibility conditions on the number of vertices.\n  For smaller values of $k$, the connection between $k$-star decompositions and\n$\\beta$-orientations allows us to apply results of Thomassen (2012) and\nLov\\'asz, Thomassen, Wu and Zhang (2013). We prove that random $d$-regular\ngraphs satisfy their assumptions with high probability, thus establishing\na.a.s. existence of $k$-star decompositions (i) when $2k^2+k\\leq d$, and (ii)\nwhen $k$ is odd and $k < d/2$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:50:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Delcourt","Michelle",""],["Greenhill","Catherine",""],["Isaev","Mikhail",""],["Lidick\u00fd","Bernard",""],["Postle","Luke",""]]}
{"id":"2308.16038","submitter":"Alex Samorodnitsky","authors":"Alex Samorodnitsky","title":"On the difficulty to beat the first linear programming bound for binary\n  codes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The first linear programming bound of McEliece, Rodemich, Rumsey, and Welch\nis the best known asymptotic upper bound for binary codes, for a certain\nsubrange of distances. Starting from the work of Friedman and Tillich, there\nare, by now, some arguably easier and more direct arguments for this bound. We\nshow that this more recent line of argument runs into certain difficulties if\none tries to go beyond this bound (say, towards the second linear programming\nbound of McEliece, Rodemich, Rumsey, and Welch).\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:52:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Samorodnitsky","Alex",""]]}
{"id":"2308.16039","submitter":"Saulo Matuslem Da Silva Mendes","authors":"Saulo Mendes","title":"A Continuous Non-ergodic Theory for the Wave Set-up","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":"  Inhomogeneities in the wave field due to wave groups, currents, and shoaling\namong other ocean processes can affect the mean water level. In this work, the\nclassical and unsolved problem of continuously computing the set-down and the\nfollowing set-up induced by wave breaking on a shoal of constant finite slope\nis tackled. This is possible by using available theoretical knowledge on how to\napproximate the distribution of wave random phases in finite depth. Then, the\nnon-homogeneous spectral analysis of the wave field allows the computation of\nthe ensemble average by means of the phase distribution and the inversion of\nthe integral of the second moment for the special case of a shoaling process\nwith uniform phase distribution. In doing so, I am able to obtain a direct\neffect of the slope magnitude on the phases distribution. Therefore, an\nanalytical and slope-dependent mean water level with continuity over the entire\nrange of water depth is provided.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:56:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mendes","Saulo",""]]}
{"id":"2308.16040","submitter":"Chunqing Deng","authors":"Xizheng Ma, Gengyan Zhang, Feng Wu, Feng Bao, Xu Chang, Jianjun Chen,\n  Hao Deng, Ran Gao, Xun Gao, Lijuan Hu, Honghong Ji, Hsiang-Sheng Ku, Kannan\n  Lu, Lu Ma, Liyong Mao, Zhijun Song, Hantao Sun, Chengchun Tang, Fei Wang,\n  Hongcheng Wang, Tenghui Wang, Tian Xia, Make Ying, Huijuan Zhan, Tao Zhou,\n  Mengyu Zhu, Qingbin Zhu, Yaoyun Shi, Hui-Hai Zhao, Chunqing Deng","title":"Native approach to controlled-Z gates in inductively coupled fluxonium\n  qubits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The fluxonium qubits have emerged as a promising platform for gate-based\nquantum information processing. However, their extraordinary protection against\ncharge fluctuations comes at a cost: when coupled capacitively, the qubit-qubit\ninteractions are restricted to XX-interactions. Consequently, effective XX- or\nXZ-interactions are only constructed either by temporarily populating\nhigher-energy states, or by exploiting perturbative effects under microwave\ndriving. Instead, we propose and demonstrate an inductive coupling scheme,\nwhich offers a wide selection of native qubit-qubit interactions for fluxonium.\nIn particular, we leverage a built-in, flux-controlled ZZ-interaction to\nperform qubit entanglement. To combat the increased flux-noise-induced\ndephasing away from the flux-insensitive position, we use a continuous version\nof the dynamical decoupling scheme to perform noise filtering. Combining these,\nwe demonstrate a 20 ns controlled-Z (CZ) gate with a mean fidelity of 99.53%.\nMore than confirming the efficacy of our gate scheme, this high-fidelity result\nalso reveals a promising but rarely explored parameter space uniquely suitable\nfor gate operations between fluxonium qubits.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 13:57:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ma","Xizheng",""],["Zhang","Gengyan",""],["Wu","Feng",""],["Bao","Feng",""],["Chang","Xu",""],["Chen","Jianjun",""],["Deng","Hao",""],["Gao","Ran",""],["Gao","Xun",""],["Hu","Lijuan",""],["Ji","Honghong",""],["Ku","Hsiang-Sheng",""],["Lu","Kannan",""],["Ma","Lu",""],["Mao","Liyong",""],["Song","Zhijun",""],["Sun","Hantao",""],["Tang","Chengchun",""],["Wang","Fei",""],["Wang","Hongcheng",""],["Wang","Tenghui",""],["Xia","Tian",""],["Ying","Make",""],["Zhan","Huijuan",""],["Zhou","Tao",""],["Zhu","Mengyu",""],["Zhu","Qingbin",""],["Shi","Yaoyun",""],["Zhao","Hui-Hai",""],["Deng","Chunqing",""]]}
{"id":"2308.16041","submitter":"Shreyank N Gowda","authors":"Shreyank N Gowda, Dheeraj Pandey, Shashank Narayana Gowda","title":"From Pixels to Portraits: A Comprehensive Survey of Talking Head\n  Generation Techniques and Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advancements in deep learning and computer vision have led to a surge\nof interest in generating realistic talking heads. This paper presents a\ncomprehensive survey of state-of-the-art methods for talking head generation.\nWe systematically categorises them into four main approaches: image-driven,\naudio-driven, video-driven and others (including neural radiance fields (NeRF),\nand 3D-based methods). We provide an in-depth analysis of each method,\nhighlighting their unique contributions, strengths, and limitations.\nFurthermore, we thoroughly compare publicly available models, evaluating them\non key aspects such as inference time and human-rated quality of the generated\noutputs. Our aim is to provide a clear and concise overview of the current\nlandscape in talking head generation, elucidating the relationships between\ndifferent approaches and identifying promising directions for future research.\nThis survey will serve as a valuable reference for researchers and\npractitioners interested in this rapidly evolving field.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:00:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gowda","Shreyank N",""],["Pandey","Dheeraj",""],["Gowda","Shashank Narayana",""]]}
{"id":"2308.16042","submitter":"Kasper Green Larsen","authors":"Kasper Green Larsen, Rasmus Pagh, Toniann Pitassi, Or Zamir","title":"Optimal Non-Adaptive Cell Probe Dictionaries and Hashing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a simple and provably optimal non-adaptive cell probe data\nstructure for the static dictionary problem. Our data structure supports\nstoring a set of $n$ key-value pairs from $[u]\\times [u]$ using $s$ words of\nspace and answering key lookup queries in $t = O(\\lg(u/n)/\\lg(s/n))$\nnon-adaptive probes. This generalizes a solution to the membership problem\n(i.e., where no values are associated with keys) due to Buhrman et al. and\nmatches a recent lower bound by Persiano and Yeo.\n  Using the ideas underlying our data structure, we also obtain the first\nimplementation of a $n$-wise independent family of hash functions with optimal\nevaluation time in the cell probe model.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:02:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Larsen","Kasper Green",""],["Pagh","Rasmus",""],["Pitassi","Toniann",""],["Zamir","Or",""]]}
{"id":"2308.16043","submitter":"Michaela Brchnelova","authors":"Michaela Brchnelova, B{\\l}a\\.zej Ku\\'zma, Fan Zhang, Andrea Lani,\n  Stefaan Poedts","title":"COCONUT-MF: Two-fluid ion-neutral global coronal modelling","comments":"16 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.comp-ph physics.space-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The global coronal model COCONUT was originally developed to replace models\nsuch as the WSA model in space weather forecasting to improve the physical\naccuracy of the predictions. This model has, however, several simplifications\nimplemented in its formulation to allow for rapid convergence, one of which\nincludes a single-fluid treatment. In this paper, we have two goals. Firstly,\nwe aim to introduce a novel multi-fluid global coronal model and validate it\nwith simple cases as well as with real data-driven applications. Secondly, we\naim to investigate to what extent considering a single-fluid plasma in the\nglobal coronal model might affect the resulting plasma dynamics, and thus\nwhether the assumptions on which the single-fluid coronal model is based are\njustified. We developed a multi-fluid global coronal model, COCONUT-MF, which\nresolves the ion and neutral fluid equations separately. While this model is\nstill steady-state and thus does not resolve unsteady processes, it can account\nfor charge exchange, chemical and collisional contributions. We present the\nresults of the ion-neutral modelling for a dipole, a minimum of solar activity,\nand a solar maximum. We demonstrate the higher accuracy of the applied AUSM+\nscheme compared to HLL. Subsequently, we also evaluate the effects of the\nconsidered ion-neutral coupling terms on the resulting plasma dynamics. Despite\nthe very low concentration of neutrals, these terms still affect the flow field\nto a limited but non-negligible extent (up to 5 to 10% locally). Even though\nthe coronal plasma is generally assumed to be collisionless, our results show\nthat there is sufficient collisionality in it to couple the two fluids.\nFollow-up work will include extension of the model to lower atmospheric layers\nof the Sun and inclusion of more advanced physical terms such as heating and\nradiation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:03:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Brchnelova","Michaela",""],["Ku\u017ama","B\u0142a\u017cej",""],["Zhang","Fan",""],["Lani","Andrea",""],["Poedts","Stefaan",""]]}
{"id":"2308.16044","submitter":"Maria Petronikolou","authors":"Maria Petronikolou, Emmanuel N. Saridakis","title":"Alleviating $H_0$ tension in scalar-tensor and bi-scalar-tensor theories","comments":"20 pages, 4 figures, Invited Contribution to Universe Special Issue\n  \"Modified Gravity Approaches to the Tensions of LambdaCDM\", with Editors\n  Eleonora Di Valentino, Leandros Perivolaropoulos, Jackson Levi Said","journal-ref":"Universe 2023, 9(9), 397;","doi":"10.3390/universe9090397","report-no":null,"categories":"gr-qc astro-ph.CO hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate scalar-tensor and bi-scalar-tensor modified theories of\ngravity that can alleviate the $H_0$ tension. In the first class of theories we\nshow that choosing particular models with shift-symmetric friction term we are\nable to alleviate the tension by obtaining smaller effective Newton's constant\nat intermediate times, a feature that cannot be easily obtained in modified\ngravity. In the second class of theories, which involve two extra propagating\ndegrees of freedom, we show that the $H_0$ tension can be alleviated, and the\nmechanism behind it is the phantom behavior of the effective dark-energy\nequation-of-state parameter. Hence, scalar-tensor and bi-scalar-tensor theories\nhave the capability of alleviating $H_0$ tension with both known sufficient\nlate-time mechanisms.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:06:37 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Petronikolou","Maria",""],["Saridakis","Emmanuel N.",""]]}
{"id":"2308.16045","submitter":"Junichi Shiogai","authors":"Ryuji Atsumi, Junichi Shiogai, Takumi Yamazaki, Takeshi Seki, Kohei\n  Ueda, and Jobu Matsuno","title":"Impact of epitaxial strain relaxation on ferromagnetism in a\n  freestanding La2/3Sr1/3MnO3 membrane","comments":"16 pages","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":"  Manganite perovskites host emerging physical properties of\nstrongly-correlated electrons with charge, spin, and lattice degrees of\nfreedom. Using epitaxial lift-off technique, we report enhancement of\nsaturation magnetization and ferromagnetic transition temperature of the\nfreestanding La2/3Sr1/3MnO3 membrane compared with the as-grown film on SrTiO3\nsubstrate involving lateral tensile strain. Structural analysis reveals\nshrinkage of unit-cell volume by tensile strain relaxation in the freestanding\nmembrane, which causes enhancement of the ferromagnetic interaction. The impact\nof the microscopic lattice deformation on the ferromagnetism of La2/3Sr1/3MnO3\nindicates a high potential of this material for flexible electronics\napplication with intriguing functionalities in strongly-correlated electron\nsystems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:11:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Atsumi","Ryuji",""],["Shiogai","Junichi",""],["Yamazaki","Takumi",""],["Seki","Takeshi",""],["Ueda","Kohei",""],["Matsuno","Jobu",""]]}
{"id":"2308.16046","submitter":"Bartlomiej Waclaw Dr","authors":"Witold Postek, Klaudia Staskiewicz, Elin Lilja, Bartlomiej Waclaw","title":"Substrate geometry affects population dynamics in a bacterial biofilm","comments":"15 pages and 4 figures (main text), 13 pages and 6 figures\n  (supplementary material)","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE cond-mat.soft physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biofilms inhabit a range of environments, such as dental plaques or soil\nmicropores, often characterized by intricate, non-even surfaces. However, the\nimpact of surface irregularities on the population dynamics of biofilms remains\nelusive as most biofilm experiments are conducted on flat surfaces. Here, we\nshow that the shape of the surface on which a biofilm grows influences genetic\ndrift and selection within the biofilm. We culture E. coli biofilms in\nmicro-wells with an undulating bottom surface and observe the emergence of\nclonal sectors whose size corresponds to that of the undulations, despite no\nphysical barrier separating different areas of the biofilm. The sectors are\nremarkably stable over time and do not invade each other; we attribute this\nstability to the characteristics of the velocity field within the growing\nbiofilm, which hinders mixing and clonal expansion. A microscopically-detailed\ncomputer model fully reproduces these findings and highlights the role of\nmechanical (physical) interactions such as adhesion and friction in microbial\nevolution. The model also predicts clonal expansion to be severely limited even\nfor clones with a significant growth advantage - a finding which we\nsubsequently confirm experimentally using a mixture of antibiotic-sensitive and\nantibiotic-resistant mutants in the presence of sub-lethal concentrations of\nthe antibiotic rifampicin. The strong suppression of selection contrasts\nsharply with the behavior seen in bacterial colonies on agar commonly used to\nstudy range expansion and evolution in biofilms. Our results show that biofilm\npopulation dynamics can be controlled by patterning the surface, and\ndemonstrate how a better understanding of the physics of bacterial growth can\npave the way for new strategies in steering microbial evolution.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:14:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Postek","Witold",""],["Staskiewicz","Klaudia",""],["Lilja","Elin",""],["Waclaw","Bartlomiej",""]]}
{"id":"2308.16047","submitter":"Surabhi Rathore Dr.","authors":"Surabhi Rathore, Dasari Srikanth","title":"Mathematical Modeling of Blood Flow for a Diseased Model with\n  Therapeutic Nanoparticles","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 use of nanoparticles for targeted drug delivery, especially in diseased\narteries, is a novel procedure. We are incorporating nanoparticles into blood\nvessels using a catheter, which could potentially deliver drugs precisely to\naffected areas, reducing side effects and increasing treatment efficiency.\nConsidering non-Newtonian fluid modeling because blood is a complex fluid with\nnon-linear behavior. In this paper, we are using mathematical modeling to\nunderstand blood flow dynamics, temperature, and concentration dispersion,\nwhich can provide valuable insights into the behavior of therapeutic\nnanoparticles in the bloodstream. The perturbation method is used to solve the\ncomplex mathematical model with permeable flow boundary conditions. We are\ninvestigating flow field characteristics including wall shear stress, pressure,\nand impedance to understand how nanoparticles disperse and interact with\ndifferent physiological aspects. In conclusion, the proposed study focuses on\nthe use of nanotechnology and mathematical modeling to understand the effects\nof therapeutic nanoparticles in diseased arteries, which is an important and\nvaluable contribution to the medical field.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:14:51 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rathore","Surabhi",""],["Srikanth","Dasari",""]]}
{"id":"2308.16048","submitter":"Baptiste Gault","authors":"Binhan Sun, Wenjun Lu, Ran Ding, Surendra Kumar Makineni, Baptiste\n  Gault, Chun-Hung Wu, Di Wan, Hao Chen, Dirk Ponge, Dierk Raabe","title":"Chemical heterogeneity enhances hydrogen resistance in high-strength\n  steels","comments":null,"journal-ref":null,"doi":"10.1038/s41563-021-01050-y","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When H, the lightest, smallest and most abundant atom in the universe, makes\nits way into a high-strength alloy (>650 MPa), the material's load-bearing\ncapacity is abruptly lost. This phenomenon, known as H embrittlement, was\nresponsible for the catastrophic and unpredictable failure of large engineering\nstructures in service. The inherent antagonism between high strength\nrequirements and H embrittlement susceptibility strongly hinders the design of\nlightweight yet reliable structural components needed for carbon-free\nhydrogen-propelled industries and reduced-emission transportation solutions.\nInexpensive and scalable alloying and microstructural solutions that enable\nboth, an intrinsically high resilience to H and high mechanical performance,\nmust be found. Here we introduce a counterintuitive strategy to exploit\ntypically undesired chemical heterogeneity within the material's microstructure\nthat allows the local enhancement of crack resistance and local H trapping,\nthereby enhancing the resistance against H embrittlement. We deploy this\napproach to a lightweight, high-strength steel and produce a high-number\ndensity Mn-rich zones dispersed within the microstructure. These solute-rich\nbuffer regions allow for local micro-tuning of the phase stability, arresting\nH-induced microcracks thus interrupting the H-assisted damage evolution chain,\nregardless of how and when H is introduced and also regardless of the\nunderlying embrittling mechanisms. A superior H embrittlement resistance,\nincreased by a factor of two compared to a reference material with a\nhomogeneous solute distribution within each microstructure constituent, is\nachieved at no expense of the material's strength and ductility.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:15:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sun","Binhan",""],["Lu","Wenjun",""],["Ding","Ran",""],["Makineni","Surendra Kumar",""],["Gault","Baptiste",""],["Wu","Chun-Hung",""],["Wan","Di",""],["Chen","Hao",""],["Ponge","Dirk",""],["Raabe","Dierk",""]]}
{"id":"2308.16049","submitter":"Ignacio Piquero-Zulaica","authors":"Ignacio Piquero-Zulaica, Wenqi Hu, Ari Paavo Seitsonen, Felix Haag,\n  Johannes K\\\"uchle, Francesco Allegretti, Yuanhao Lyu, Lan Chen, Kehui Wu,\n  Zakaria M. Abd El-Fattah, Ethem Akt\\\"urk, Svetlana Klyatskaya, Mario Ruben,\n  Matthias Muntwiler, Johannes V. Barth and Yi-Qi Zhang","title":"Unconventional band structure via combined molecular orbital and lattice\n  symmetries in a surface-confined metallated graphdiyne sheet","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Graphyne (GY) and graphdiyne (GDY)-based materials represent an intriguing\nclass of two-dimensional (2D) carbon-rich networks with tunable structures and\nproperties surpassing those of graphene. However, the challenge of fabricating\natomically well-defined crystalline GY/GDY-based systems largely hinders\ndetailed electronic structure characterizations. Here, we report the emergence\nof an unconventional band structure in mesoscopically regular (~1 {\\mu}m)\nmetallated GDY sheets featuring a honeycomb lattice on Ag(111) substrates.\nEmploying complementary scanning tunnelling and angle-resolved photoemission\nspectroscopies, electronic band formation with a gap of 2.5 eV is rigorously\ndetermined in agreement with real-space electronic characteristics. Extensive\ndensity functional theory calculations corroborate our observations as well as\nrecent theoretical predictions that doubly degenerate frontier molecular\norbitals on a honeycomb lattice give rise to flat, Dirac and Kagome bands close\nto Fermi level. These results illustrate the tremendous potential of\nengineering novel band structures via molecular orbital and lattice symmetries\nin atomically precise 2D carbon scaffolds.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:15:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Piquero-Zulaica","Ignacio",""],["Hu","Wenqi",""],["Seitsonen","Ari Paavo",""],["Haag","Felix",""],["K\u00fcchle","Johannes",""],["Allegretti","Francesco",""],["Lyu","Yuanhao",""],["Chen","Lan",""],["Wu","Kehui",""],["El-Fattah","Zakaria M. Abd",""],["Akt\u00fcrk","Ethem",""],["Klyatskaya","Svetlana",""],["Ruben","Mario",""],["Muntwiler","Matthias",""],["Barth","Johannes V.",""],["Zhang","Yi-Qi",""]]}
{"id":"2308.16050","submitter":"Adam Ginsburg","authors":"Adam Ginsburg, Ashley T. Barnes, Cara D. Battersby, Alyssa Bulatek,\n  Savannah Gramze, Jonathan D. Henshaw, Desmond Jeff, Xing Lu, E.A.C. Mills,\n  Daniel L. Walker","title":"JWST reveals widespread CO ice and gas absorption in the Galactic Center\n  cloud G0.253+0.015","comments":"Submitted to ApJ. Revised after first referee report. 16 pages, 11\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report JWST NIRCam observations of G0.253+0.015, the molecular cloud in\nthe Central Molecular Zone known as The Brick, with the F182M, F187N, F212N,\nF410M, F405N, and F466N filters. We catalog 56,146 stars detected in all 6\nfilters using the crowdsource package. Stars within and behind The Brick\nexhibit prodigious absorption in the F466N filter that is produced by a\ncombination of CO ice and gas. In support of this conclusion, and as a general\nresource, we present models of CO gas and ice and CO$_2$ ice in the F466N,\nF470N, and F410M filters. Both CO gas and ice may contribute to the observed\nstellar colors. We show, however, that CO gas does not absorb the Pf$\\beta$ and\nHu$\\epsilon$ lines in F466N, but that these lines show excess absorption,\nindicating that CO ice is also present and contributes to observed F466N\nabsorption. The most strongly absorbed stars in F466N are extincted by $\\sim$ 2\nmagnitudes, corresponding to $>$ 80\\% flux loss. This high observed absorption\nrequires very high column densities of CO, requiring total CO column that is in\ntension with standard CO abundance and/or gas-to-dust ratios. There is\ntherefore likely to be a greater CO/H$_2$ ratio (X$_{CO} > 10^{-4}$) and more\ndust per H$_2$ molecule ($>0.01$) in the Galactic Center than the Galactic\ndisk. Ice and/or gas absorption is observed even in the cloud outskirts,\nimplying that additional caution is needed when interpreting stellar photometry\nin filters that overlap with ice bands throughout our Galactic Center. The\nwidespread CO absorption in our Galactic Center hints that significant ice\nabsorption is likely present in other galactic centers.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:16:07 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ginsburg","Adam",""],["Barnes","Ashley T.",""],["Battersby","Cara D.",""],["Bulatek","Alyssa",""],["Gramze","Savannah",""],["Henshaw","Jonathan D.",""],["Jeff","Desmond",""],["Lu","Xing",""],["Mills","E. A. C.",""],["Walker","Daniel L.",""]]}
{"id":"2308.16051","submitter":"Robert Buckingham","authors":"Robert J. Buckingham and Peter D. Miller","title":"Differential equations for approximate solutions of Painlev\\'e\n  equations: Application to the algebraic solutions of the Painlev\\'e-III\n  (D$_7$) equation","comments":"22 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.CA math.MP nlin.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is well known that the Painlev\\'e equations can formally degenerate to\nautonomous differential equations with elliptic function solutions in suitable\nscaling limits. A way to make this degeneration rigorous is to apply Deift-Zhou\nsteepest-descent techniques to a Riemann-Hilbert representation of a family of\nsolutions. This method leads to an explicit approximation formula in terms of\ntheta functions and related algebro-geometric ingredients that is difficult to\ndirectly link to the expected limiting differential equation. However, the\napproximation arises from an outer parametrix that satisfies relatively simple\nconditions. By applying a method that we learned from Alexander Its, it is\npossible to use these simple conditions to directly obtain the limiting\ndifferential equation, bypassing the details of the algebro-geometric solution\nof the outer parametrix problem.\n  In this paper, we illustrate the use of this method to relate an\napproximation of the algebraic solutions of the Painlev\\'e-III (D$_7$) equation\nvalid in the part of the complex plane where the poles and zeros of the\nsolutions asymptotically reside to a form of the Weierstrass equation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:17:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Buckingham","Robert J.",""],["Miller","Peter D.",""]]}
{"id":"2308.16052","submitter":"Thomas H. Weisswange","authors":"Thomas H. Weisswange, Joel B. Schwartz, Aaron J. Horowitz, Jens\n  Schm\\\"udderich","title":"Telepresence Lantern -- Designing an Immersive Video-Mediated\n  Communication Device for Older Adults","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present the Telepresence Lantern concept, developed to provide\nopportunities for older adults to stay in contact with remote family and\nfriends. It provides a new approach to video-mediated communication, designed\nto facilitate natural and ambient interactions with simplified call setup.\nVideo communication is an established way to enhance social connectedness, but\ntraditional approaches create a high friction to frequent connection due to,\nfor example, technological barriers. Through interactive sessions with older\nadult users, we created design and function prototypes to suit their needs and\npreferences. The main features of our design are a curved, wide field-of-view\nscreen and corresponding camera and sound setup, and the affordance to easily\nmove the device from room-to-room. An interactive user session with a fully\nfunctional prototype validated the potential of this concept for improving\ncommunication among older adults and their families.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:19:09 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Weisswange","Thomas H.",""],["Schwartz","Joel B.",""],["Horowitz","Aaron J.",""],["Schm\u00fcdderich","Jens",""]]}
{"id":"2308.16053","submitter":"Yu Zhang","authors":"Yu Zhang, Ruike Jiang, Liwenhan Xie, Yuheng Zhao, Can Liu, Tianhong\n  Ding, Siming Chen, Xiaoru Yuan","title":"OldVisOnline: Curating a Dataset of Historical Visualizations","comments":"Accepted to IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.DL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the increasing adoption of digitization, more and more historical\nvisualizations created hundreds of years ago are accessible in digital\nlibraries online. It provides a unique opportunity for visualization and\nhistory research. Meanwhile, there is no large-scale digital collection\ndedicated to historical visualizations. The visualizations are scattered in\nvarious collections, which hinders retrieval. In this study, we curate the\nfirst large-scale dataset dedicated to historical visualizations. Our dataset\ncomprises 13K historical visualization images with corresponding processed\nmetadata from seven digital libraries. In curating the dataset, we propose a\nworkflow to scrape and process heterogeneous metadata. We develop a\nsemi-automatic labeling approach to distinguish visualizations from other\nartifacts. Our dataset can be accessed with OldVisOnline, a system we have\nbuilt to browse and label historical visualizations. We discuss our vision of\nusage scenarios and research opportunities with our dataset, such as textual\ncriticism for historical visualizations. Drawing upon our experience, we\nsummarize recommendations for future efforts to improve our dataset.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:19:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Yu",""],["Jiang","Ruike",""],["Xie","Liwenhan",""],["Zhao","Yuheng",""],["Liu","Can",""],["Ding","Tianhong",""],["Chen","Siming",""],["Yuan","Xiaoru",""]]}
{"id":"2308.16054","submitter":"T S S Satyanarayana Kurada Mr.","authors":"Kurada T S S Satyanarayana, Addada Narasimha Rao and Kumpatla jaya\n  surya","title":"Capital Structure Dynamics and Financial Performance in Indian Banks (An\n  Analysis of Mergers and Acquisitions)","comments":"12 pages, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This research investigates the multifaceted relationship underlying capital\nstructure dynamics along with financial performance as a result of mergers and\nacquisitions, or M&As, in Indian banks. In the face of increasing competition,\nbanks have deliberately embraced M&A as a strategy of improving commercial\nprospects and maintaining financial stability. The primary goal of this study\nis to examine the changes in the capital framework and financial results of\nbanks before and after M&A transactions. The investigation, which employs a\npaired t-test as a method of statistical analysis, is based on a review of\nannual reports from selected banks over a two-year period before and after M&A\ntransactions. The paired t-test approach allows for a thorough statistical\nanalysis of interconnected datasets, revealing the subtle influence of M&A\nattempts on both bank financial performance as well as capital structure\ndynamics. The study's findings have the potential to add to the current body of\nknowledge on organisational planning, managing finances, and capital structure\noptimisation. The research has practical significance for financial companies,\nlegislators, and scholars interested in understanding the profound effects of\nM&A inside the arena of financial institutions that operate within fiercely\ncompetitive landscapes because it provides comprehensive insights regarding the\ncomplex consequences of banking merger and acquisition (M&A) deals on capital\nstructure as well as financial performance. Finally, the goal of this research\nis to provide the banking sector with educated decision-making capabilities and\nstrategic guidance to businesses facing heightened competition while coping\nwith the complexities of capital structure.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:22:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Satyanarayana","Kurada T S S",""],["Rao","Addada Narasimha",""],["surya","Kumpatla jaya",""]]}
{"id":"2308.16055","submitter":"Yun-Cheng Wang","authors":"Yun-Cheng Wang, Xiou Ge, Bin Wang, C.-C. Jay Kuo","title":"AsyncET: Asynchronous Learning for Knowledge Graph Entity Typing with\n  Auxiliary Relations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Knowledge graph entity typing (KGET) is a task to predict the missing entity\ntypes in knowledge graphs (KG). Previously, KG embedding (KGE) methods tried to\nsolve the KGET task by introducing an auxiliary relation, 'hasType', to model\nthe relationship between entities and their types. However, a single auxiliary\nrelation has limited expressiveness for diverse entity-type patterns. We\nimprove the expressiveness of KGE methods by introducing multiple auxiliary\nrelations in this work. Similar entity types are grouped to reduce the number\nof auxiliary relations and improve their capability to model entity-type\npatterns with different granularities. With the presence of multiple auxiliary\nrelations, we propose a method adopting an Asynchronous learning scheme for\nEntity Typing, named AsyncET, which updates the entity and type embeddings\nalternatively to keep the learned entity embedding up-to-date and informative\nfor entity type prediction. Experiments are conducted on two commonly used KGET\ndatasets to show that the performance of KGE methods on the KGET task can be\nsubstantially improved by the proposed multiple auxiliary relations and\nasynchronous embedding learning. Furthermore, our method has a significant\nadvantage over state-of-the-art methods in model sizes and time complexity.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:24:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wang","Yun-Cheng",""],["Ge","Xiou",""],["Wang","Bin",""],["Kuo","C. -C. Jay",""]]}
{"id":"2308.16056","submitter":"Jiani Liu","authors":"Jiani Liu, Qinghua Tao, Ce Zhu, Yipeng Liu, Xiaolin Huang, Johan A.K.\n  Suykens","title":"Low-Rank Multitask Learning based on Tensorized SVMs and LSSVMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multitask learning (MTL) leverages task-relatedness to enhance performance.\nWith the emergence of multimodal data, tasks can now be referenced by multiple\nindices. In this paper, we employ high-order tensors, with each mode\ncorresponding to a task index, to naturally represent tasks referenced by\nmultiple indices and preserve their structural relations. Based on this\nrepresentation, we propose a general framework of low-rank MTL methods with\ntensorized support vector machines (SVMs) and least square support vector\nmachines (LSSVMs), where the CP factorization is deployed over the coefficient\ntensor. Our approach allows to model the task relation through a linear\ncombination of shared factors weighted by task-specific factors and is\ngeneralized to both classification and regression problems. Through the\nalternating optimization scheme and the Lagrangian function, each subproblem is\ntransformed into a convex problem, formulated as a quadratic programming or\nlinear system in the dual form. In contrast to previous MTL frameworks, our\ndecision function in the dual induces a weighted kernel function with a\ntask-coupling term characterized by the similarities of the task-specific\nfactors, better revealing the explicit relations across tasks in MTL.\nExperimental results validate the effectiveness and superiority of our proposed\nmethods compared to existing state-of-the-art approaches in MTL. The code of\nimplementation will be available at https://github.com/liujiani0216/TSVM-MTL.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:28:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liu","Jiani",""],["Tao","Qinghua",""],["Zhu","Ce",""],["Liu","Yipeng",""],["Huang","Xiaolin",""],["Suykens","Johan A. K.",""]]}
{"id":"2308.16057","submitter":"Chengmeng Wang","authors":"Chengmeng Wang, Peng Jin, Fubao Yang, Liujun Xu and Jiping Huang","title":"Click Metamaterials: Fast Acquisition of Thermal Conductivity and\n  Functionality Diversities","comments":"Here, click metamaterials have been proposed and swiftly generate\n  variable thermal conductivities and functionalities by using tunable\n  hollow-filled cells akin to the modified building blocks in click chemistry.\n  This breakthrough holds the promise to transform applications in a range of\n  diffusion and wave systems, thereby having a profound impact on the\n  development of materials science","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Material science is an important foundation of modern society development,\ncovering significant areas like chemosynthesis and metamaterials. Click\nchemistry provides a simple and efficient paradigm for achieving molecular\ndiversity by incorporating modified building blocks into compounds. In\ncontrast, most metamaterial designs are still case by case due to lacking a\nfundamental mechanism for achieving reconfigurable thermal conductivities,\nlargely hindering design flexibility and functional diversity. Here, we propose\na universal concept of click metamaterials for fast realizing various thermal\nconductivities and functionalities. Tunable hollow-filled unit cells are\nconstructed to mimic the modified building blocks in click chemistry. Different\nhollow-filled arrays can generate convertible thermal conductivities from\nisotropy to anisotropy, allowing click metamaterials to exhibit adaptive\nthermal functionalities. The straightforward structures enable full-parameter\nregulation and simplify engineering preparation, making click metamaterials a\npromising candidate for practical use in other diffusion and wave systems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:28:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wang","Chengmeng",""],["Jin","Peng",""],["Yang","Fubao",""],["Xu","Liujun",""],["Huang","Jiping",""]]}
{"id":"2308.16058","submitter":"Mario W\\\"uthrich V.","authors":"Jae Youn Ahn, Himchan Jeong, Yang Lu, Mario V. W\\\"uthrich","title":"A Classification of Observation-Driven State-Space Count Models for\n  Panel Data","comments":"28 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.AP stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  State-space models are widely used in many applications. In the domain of\ncount data, one such example is the model proposed by Harvey and Fernandes\n(1989). Unlike many of its parameter-driven alternatives, this model is\nobservation-driven, leading to closed-form expressions for the predictive\ndensity. In this paper, we demonstrate the need to extend the model of Harvey\nand Fernandes (1989) by showing that their model is not variance stationary.\nOur extension can accommodate for a wide range of variance processes that are\neither increasing, decreasing, or stationary, while keeping the tractability of\nthe original model. Simulation and numerical studies are included to illustrate\nthe performance of our method.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:30:58 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ahn","Jae Youn",""],["Jeong","Himchan",""],["Lu","Yang",""],["W\u00fcthrich","Mario V.",""]]}
{"id":"2308.16059","submitter":"Junren Chen","authors":"Junren Chen, Michael K. Ng","title":"A Parameter-Free Two-Bit Covariance Estimator with Improved Operator\n  Norm Error Rate","comments":"24 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.IT cs.LG math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A covariance matrix estimator using two bits per entry was recently developed\nby Dirksen, Maly and Rauhut [Annals of Statistics, 50(6), pp. 3538-3562]. The\nestimator achieves near minimax rate for general sub-Gaussian distributions,\nbut also suffers from two downsides: theoretically, there is an essential gap\non operator norm error between their estimator and sample covariance when the\ndiagonal of the covariance matrix is dominated by only a few entries;\npractically, its performance heavily relies on the dithering scale, which needs\nto be tuned according to some unknown parameters. In this work, we propose a\nnew 2-bit covariance matrix estimator that simultaneously addresses both\nissues. Unlike the sign quantizer associated with uniform dither in Dirksen et\nal., we adopt a triangular dither prior to a 2-bit quantizer inspired by the\nmulti-bit uniform quantizer. By employing dithering scales varying across\nentries, our estimator enjoys an improved operator norm error rate that depends\non the effective rank of the underlying covariance matrix rather than the\nambient dimension, thus closing the theoretical gap. Moreover, our proposed\nmethod eliminates the need of any tuning parameter, as the dithering scales are\nentirely determined by the data. Experimental results under Gaussian samples\nare provided to showcase the impressive numerical performance of our estimator.\nRemarkably, by halving the dithering scales, our estimator oftentimes achieves\noperator norm errors less than twice of the errors of sample covariance.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:31:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Junren",""],["Ng","Michael K.",""]]}
{"id":"2308.16060","submitter":"Raphael Schumann","authors":"Michael Staniek and Raphael Schumann and Maike Z\\\"ufle and Stefan\n  Riezler","title":"Text-to-OverpassQL: A Natural Language Interface for Complex Geodata\n  Querying of OpenStreetMap","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CY cs.DB cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present Text-to-OverpassQL, a task designed to facilitate a natural\nlanguage interface for querying geodata from OpenStreetMap (OSM). The Overpass\nQuery Language (OverpassQL) allows users to formulate complex database queries\nand is widely adopted in the OSM ecosystem. Generating Overpass queries from\nnatural language input serves multiple use-cases. It enables novice users to\nutilize OverpassQL without prior knowledge, assists experienced users with\ncrafting advanced queries, and enables tool-augmented large language models to\naccess information stored in the OSM database. In order to assess the\nperformance of current sequence generation models on this task, we propose\nOverpassNL, a dataset of 8,352 queries with corresponding natural language\ninputs. We further introduce task specific evaluation metrics and ground the\nevaluation of the Text-to-OverpassQL task by executing the queries against the\nOSM database. We establish strong baselines by finetuning sequence-to-sequence\nmodels and adapting large language models with in-context examples. The\ndetailed evaluation reveals strengths and weaknesses of the considered learning\nstrategies, laying the foundations for further research into the\nText-to-OverpassQL task.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:33:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Staniek","Michael",""],["Schumann","Raphael",""],["Z\u00fcfle","Maike",""],["Riezler","Stefan",""]]}
{"id":"2308.16061","submitter":"Estelle Ruellan","authors":"Estelle Ruellan, Masarah Paquet-Clouston, Sebastian Garcia","title":"Conti Inc.: Understanding the Internal Discussions of a large\n  Ransomware-as-a-Service Operator with Machine Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ransomware-as-a-service (RaaS) is increasing the scale and complexity of\nransomware attacks. Understanding the internal operations behind RaaS has been\na challenge due to the illegality of such activities. The recent chat leak of\nthe Conti RaaS operator, one of the most infamous ransomware operators on the\ninternational scene, offers a key opportunity to better understand the inner\nworkings of such organizations. This paper analyzes the main topic discussions\nin the Conti chat leak using machine learning techniques such as Natural\nLanguage Processing (NLP) and Latent Dirichlet Allocation (LDA), as well as\nvisualization strategies. Five discussion topics are found: 1) Business, 2)\nTechnical, 3) Internal tasking/Management, 4) Malware, and 5) Customer\nService/Problem Solving. Moreover, the distribution of topics among Conti\nmembers shows that only 4% of individuals have specialized discussions while\nalmost all individuals (96%) are all-rounders, meaning that their discussions\nrevolve around the five topics. The results also indicate that a significant\nproportion of Conti discussions are non-tech related. This study thus\nhighlights that running such large RaaS operations requires a workforce skilled\nbeyond technical abilities, with individuals involved in various tasks, from\nmanagement to customer service or problem solving. The discussion topics also\nshow that the organization behind the Conti RaaS oper5086933ator shares\nsimilarities with a large firm. We conclude that, although RaaS represents an\nexample of specialization in the cybercrime industry, only a few members are\nspecialized in one topic, while the rest runs and coordinates the RaaS\noperation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:36:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ruellan","Estelle",""],["Paquet-Clouston","Masarah",""],["Garcia","Sebastian",""]]}
{"id":"2308.16062","submitter":"Fatemeh Kayanikhoo","authors":"Fatemeh Kayanikhoo, Miljenko Cemeljic, Maciek Wielgus, Wlodek Kluzniak","title":"Energy distribution and substructure formation in astrophysical MHD\n  simulations","comments":"26 pages, 20 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":"  During substructure formation in magnetized astrophysical plasma, dissipation\nof magnetic energy facilitated by magnetic reconnection affects the system\ndynamics by heating and accelerating the ejected plasmoids. Numerical\nsimulations are a crucial tool for investigating such systems. In astrophysical\nsimulations, the energy dissipation, reconnection rate and substructure\nformation critically depend on the onset of reconnection of numerical or\nphysical origin. In this paper, we hope to assess the reliability of the\nstate-of-the-art numerical codes, PLUTO and KORAL by quantifying and discussing\nthe impact of dimensionality, resolution, and code accuracy on magnetic energy\ndissipation, reconnection rate, and substructure formation. We quantitatively\ncompare results obtained with relativistic and non-relativistic, resistive and\nnon-resistive, as well as two- and three-dimensional setups performing the\nOrszag-Tang test problem. We find the sufficient resolution in each model, for\nwhich numerical error is negligible and the resolution does not significantly\naffect the magnetic energy dissipation and reconnection rate. The\nnon-relativistic simulations show that at sufficient resolution, magnetic and\nkinetic energies convert to internal energy and heat up the plasma. The results\nshow that in the relativistic system, energy components undergo mutual\nconversion during the simulation time, which leads to a substantial increase in\nmagnetic energy at 20\\% and 90\\% of the total simulation time of $10$\nlight-crossing times -- the magnetic field is amplified by a factor of five due\nto relativistic shocks. We also show that the reconnection rate in all our\nsimulations is higher than $0.1$, indicating plasmoid-mediated regime. It is\nshown that in KORAL simulations magnetic energy is slightly larger and more\nsubstructures are captured than in PLUTO simulations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:36:45 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kayanikhoo","Fatemeh",""],["Cemeljic","Miljenko",""],["Wielgus","Maciek",""],["Kluzniak","Wlodek",""]]}
{"id":"2308.16063","submitter":"Oleg Ivrii","authors":"Oleg Ivrii, Mariusz Urba\\'nski","title":"Inner Functions, Composition Operators, Symbolic Dynamics and\n  Thermodynamic Formalism","comments":"84 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we use thermodynamic formalism to study the dynamics of inner\nfunctions $F$ acting on the unit disk. If the Denjoy-Wolff point of $F$ is in\nthe open unit disk, then without loss of generality, we can assume that $F(0) =\n0$ so that 0 is an attracting fixed point of $F$ and the Lebesgue measure on\nthe unit circle is invariant under $F$. Utilizing the connection between\ncomposition operators, Aleksandrov-Clark measures and Perron-Frobenius\noperators, we develop a rudimentary thermodynamic formalism which allows us to\nprove the Central Limit Theorem and the Law of Iterated Logarithm for Sobolev\nmultipliers and H\\\"older continuous observables.\n  Under the more restrictive, but natural hypothesis that $F$ is a one\ncomponent inner function, we develop a more complete thermodynamic formalism\nwhich is sufficient for orbit counting, assuming only the $(1+\\varepsilon)$\nintegrability of $\\log|F'|$. As one component inner functions admit countable\nMarkov partitions of the unit circle, we may work in the abstract symbolic\nsetting of countable alphabet subshifts of finite type. Due to the very weak\nhypotheses on the potential, we need to pay close attention to the regularity\nof the complex Perron-Frobenius operators $\\mathcal L_s$ with $\\text{Re }s > 1$\nnear the boundary.\n  Finally, we discuss inner functions with a Denjoy-Wolff point on the unit\ncircle. We assume a parabolic type behavior of $F$ around this point and we\nintroduce the class of parabolic one component inner functions. By making use\nof the first return map, we deduce various stochastic laws and orbit counting\nresults from the aforementioned abstract symbolic results.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:37:04 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ivrii","Oleg",""],["Urba\u0144ski","Mariusz",""]]}
{"id":"2308.16064","submitter":"Roland Bacon","authors":"Roland Bacon and Martin M. Roth and Paola Amico and Eloy Hernandez and\n  the WST Consortium","title":"Detector System Challenges of the Wide-field Spectroscopic Survey\n  Telescope (WST)","comments":"Proceeding of the Scientific Detector Workshop 2022, 5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The wide-field spectroscopic survey telescope (WST) is proposed to become the\nnext large optical/near infrared facility for the European Southern Observatory\n(ESO) once the Extremely Large Telescope (ELT) has become operational. While\nthe latter is optimized for unprecedented sensitivity and adaptive-optics\nassisted image quality over a small field-of-view, WST addresses the need for\nlarge survey volumes in spectroscopy with the light-collecting power of a 10 m\nclass telescope. Its unique layout will feature the combination of multi-object\nand integral field spectroscopy simultaneously. For the intended capacity of\nthis layout a very large number of detectors is needed. The complexity of the\ndetector systems presents a number of challenges that are discussed with a\nfocus on novel approaches and innovative detector designs that can be expected\nto emerge over the anticipated 20-year timeline of this project.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:38:29 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bacon","Roland",""],["Roth","Martin M.",""],["Amico","Paola",""],["Hernandez","Eloy",""],["Consortium","the WST",""]]}
{"id":"2308.16065","submitter":"Werner Schachinger","authors":"Werner Schachinger","title":"Asymptotics of Some Plancherel Averages via Polynomiality Results","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Consider Young diagrams of $n$ boxes distributed according to the Plancherel\nmeasure. So those diagrams could be the output of the RSK algorithm, when\napplied to random permutations of the set $\\{1,\\ldots,n\\}$. Here we are\ninterested in asymptotics, as $n\\to \\infty$, of expectations of certain\nfunctions of random Young diagrams, such as the number of bumping steps of the\nRSK algorithm that leads to that diagram, the side length of its Durfee square,\nor the logarithm of its probability. We can express these functions in terms of\nhook lengths or contents of the boxes of the diagram, which opens the door for\napplication of known polynomiality results for Plancherel averages. We thus\nobtain representations of expectations as binomial convolutions, that can be\nfurther analyzed with the help of Rice's integral or Poisson generating\nfunctions. Among our results is a very explicit expression for the constant\nappearing in the almost equipartition property of the Plancherel measure.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:40:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Schachinger","Werner",""]]}
{"id":"2308.16066","submitter":"Motoko Fujiwara","authors":"Motoko Fujiwara, Koichi Hamaguchi, Natsumi Nagata, and Maura E.\n  Ramirez-Quezada","title":"Vortex Creep Heating in Neutron Stars","comments":"37 pages, 7 figures, and 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent observations of old warm neutron stars suggest the presence of a\nheating source in these stars, requiring a paradigm beyond the standard\nneutron-star cooling theory. In this work, we study the scenario where this\nheating is caused by the friction associated with the creep motion of neutron\nsuperfluid vortex lines in the crust. As it turns out, the heating luminosity\nin this scenario is proportional to the time derivative of the angular velocity\nof the pulsar rotation, and the proportional constant $J$ has an approximately\nuniversal value for all neutron stars. This $J$ parameter can be determined\nfrom the temperature observation of old neutron stars because the heating\nluminosity is balanced with the photon emission at late times. We study the\nlatest data of neutron star temperature observation and find that these data\nindeed give similar values of $J$, in favor of the assumption that the\nfrictional motion of vortex lines heats these neutron stars. These values turn\nout to be consistent with the theoretical calculations of the vortex-nuclear\ninteraction.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:42:29 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fujiwara","Motoko",""],["Hamaguchi","Koichi",""],["Nagata","Natsumi",""],["Ramirez-Quezada","Maura E.",""]]}
{"id":"2308.16067","submitter":"Yola Jones Miss","authors":"Dr Yola Jones, Dr Fani Deligianni, Dr Jeff Dalton, Dr Pierpaolo\n  Pellicori, Professor John G F Cleland","title":"Consensus of state of the art mortality prediction models: From\n  all-cause mortality to sudden death prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Worldwide, many millions of people die suddenly and unexpectedly each year,\neither with or without a prior history of cardiovascular disease. Such events\nare sparse (once in a lifetime), many victims will not have had prior\ninvestigations for cardiac disease and many different definitions of sudden\ndeath exist. Accordingly, sudden death is hard to predict.\n  This analysis used NHS Electronic Health Records (EHRs) for people aged\n$\\geq$50 years living in the Greater Glasgow and Clyde (GG\\&C) region in 2010\n(n = 380,000) to try to overcome these challenges. We investigated whether\nmedical history, blood tests, prescription of medicines, and hospitalisations\nmight, in combination, predict a heightened risk of sudden death.\n  We compared the performance of models trained to predict either sudden death\nor all-cause mortality. We built six models for each outcome of interest: three\ntaken from state-of-the-art research (BEHRT, Deepr and Deep Patient), and three\nof our own creation. We trained these using two different data representations:\na language-based representation, and a sparse temporal matrix.\n  We used global interpretability to understand the most important features of\neach model, and compare how much agreement there was amongst models using Rank\nBiased Overlap. It is challenging to account for correlated variables without\nincreasing the complexity of the interpretability technique. We overcame this\nby clustering features into groups and comparing the most important groups for\neach model. We found the agreement between models to be much higher when\naccounting for correlated variables.\n  Our analysis emphasises the challenge of predicting sudden death and\nemphasises the need for better understanding and interpretation of machine\nlearning models applied to healthcare applications.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:44:04 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Jones","Dr Yola",""],["Deligianni","Dr Fani",""],["Dalton","Dr Jeff",""],["Pellicori","Dr Pierpaolo",""],["Cleland","Professor John G F",""]]}
{"id":"2308.16068","submitter":"Hatem Elshatlawy","authors":"Hatem Elshatlawy, Dean Rickles, Xerxes D. Arsiwalla","title":"Ruliology: Linking Computation, Observers and Physical Law","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Stephen Wolfram has recently outlined an unorthodox, multicomputational\napproach to fundamental theory, encompassing not only physics but also\nmathematics in a structure he calls The Ruliad, understood to be the entangled\nlimit of all possible computations. In this framework, physical laws arise from\nthe the sampling of the Ruliad by observers (including us). This naturally\nleads to several conceptual issues, such as what kind of object is the Ruliad?\nWhat is the nature of the observers carrying out the sampling, and how do they\nrelate to the Ruliad itself? What is the precise nature of the sampling? This\npaper provides a philosophical examination of these questions, and other\nrelated foundational issues, including the identification of a limitation that\nmust face any attempt to describe or model reality in such a way that the\nmodeller-observers are included\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:45:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Elshatlawy","Hatem",""],["Rickles","Dean",""],["Arsiwalla","Xerxes D.",""]]}
{"id":"2308.16069","submitter":"David Spierings Van Der Wolk","authors":"David C. Spierings, Joseph H. Thywissen, and Aephraim M. Steinberg","title":"Spin Rotations in a Bose-Einstein Condensate Driven by Counterflow and\n  Spin-independent Interactions","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We observe spin rotations caused by atomic collisions in a non-equilibrium\nBose-condensed gas of $^{87}$Rb. Reflection from a pseudomagnetic barrier\ncreates counterflow in which forward- and backward-propagating matter waves\nhave partly transverse spin directions. Even though inter-atomic interaction\nstrengths are state-independent, the indistinguishability of parallel spins\nleads to spin dynamics. A local magnetodynamic model, which captures the\nsalient features of the observed spin textures, highlights an essential\nconnection between four-wave mixing and collisional spin rotation. The observed\nphenomenon has previously been thought to exist only in nondegenerate gases;\nour observations and model clarify the nature of these effective-magnetic spin\nrotations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:46:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Spierings","David C.",""],["Thywissen","Joseph H.",""],["Steinberg","Aephraim M.",""]]}
{"id":"2308.16070","submitter":"Stefano Paolo Villani","authors":"Stefano Paolo Villani, Marco Campetella, Paolo Barone, and Francesco\n  Mauri","title":"Giant piezoelectricity driven by Thouless pump in conjugated polymers","comments":"20 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Piezoelectricity of organic polymers has attracted increasing interest\nbecause of several advantages they exhibit over traditional inorganic ceramics.\nWhile most organic piezoelectrics rely on the presence of intrinsic local\ndipoles, a highly nonlocal electronic polarization can be foreseen in\nconjugated polymers, characterised by delocalized and highly responsive\n${\\pi}$-electrons. These 1D systems represent a physical realization of a\nThouless pump, a mechanism of adiabatic charge transport of topological nature\nwhich results, as shown in this work, in anomalously large dynamical effective\ncharges, inversely proportional to the band gap energy. A structural\n(ferroelectric) phase transition further contributes to an enhancement of the\npiezoelectric response reminiscent of that observed in piezoelectric\nperovskites close to morphotropic phase boundaries. First-principles Density\nFunctional Theory (DFT) calculations performed in two representative conjugated\npolymers using hybrid functionals, show that state-of-the-art organic\npiezoelectric are outperformed by piezoelectric conjugated polymers, mostly\nthanks to strongly anomalous effective charges of carbon, larger than 5e -\nordinary values being of the order of 1e - and reaching the giant value of 30e\nfor band gaps of the order of 1 eV.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:48:33 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Villani","Stefano Paolo",""],["Campetella","Marco",""],["Barone","Paolo",""],["Mauri","Francesco",""]]}
{"id":"2308.16071","submitter":"Tomaso Fontanini","authors":"Tomaso Fontanini, Claudio Ferrari, Giuseppe Lisanti, Massimo Bertozzi,\n  Andrea Prati","title":"Semantic Image Synthesis via Class-Adaptive Cross-Attention","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":"  In semantic image synthesis, the state of the art is dominated by methods\nthat use spatially-adaptive normalization layers, which allow for excellent\nvisual generation quality and editing versatility. Granted their efficacy,\nrecent research efforts have focused toward finer-grained local style control\nand multi-modal generation. By construction though, such layers tend to\noverlook global image statistics leading to unconvincing local style editing\nand causing global inconsistencies such as color or illumination distribution\nshifts. Also, the semantic layout is required for mapping styles in the\ngenerator, putting a strict alignment constraint over the features. In\nresponse, we designed a novel architecture where cross-attention layers are\nused in place of de-normalization ones for conditioning the image generation.\nOur model inherits the advantages of both solutions, retaining state-of-the-art\nreconstruction quality, as well as improved global and local style transfer.\nCode and models available at https://github.com/TFonta/CA2SIS.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:49:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fontanini","Tomaso",""],["Ferrari","Claudio",""],["Lisanti","Giuseppe",""],["Bertozzi","Massimo",""],["Prati","Andrea",""]]}
{"id":"2308.16072","submitter":"Manuel Houzet","authors":"Manuel Houzet, Tsuyoshi Yamamoto, Leonid I. Glazman","title":"Microwave spectroscopy of Schmid transition","comments":"6+5 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Schmid transition was introduced first as a superconductor-insulator\ntransition in the zero-frequency response of a shunted Josephson junction in\nequilibrium at zero temperature. As it is typical for a quantum impurity\nproblem, at finite frequencies the transition is broadened to a crossover.\nModern attempts to find Schmid transition rely on finite-frequency measurements\nof a quantum circuit. We predict the frequency dependence of the admittance and\nreflection phase shift for a high-impedance transmission line terminated by a\nJosephson junction for a wide variety of devices, from a charge qubit to a\ntransmon. Our results identify the circuit parameters allowing for the\nuniversal scaling of the responses with frequency, thus helping to identify the\nSchmid transition from the finite-frequency measurements.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:50:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Houzet","Manuel",""],["Yamamoto","Tsuyoshi",""],["Glazman","Leonid I.",""]]}
{"id":"2308.16073","submitter":"Bo\\v{s}tjan Melinc","authors":"Bo\\v{s}tjan Melinc and \\v{Z}iga Zaplotnik","title":"Neural-Network Data Assimilation using Variational Autoencoder","comments":"23 pages, 17 figures. Submitted to QJRMS","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In numerical weather prediction, data assimilation of atmospheric\nobservations traditionally relies on variational and Kalman filter methods.\nHere, we propose an alternative full neural-network data assimilation (NNDA) in\nthe latent space with variational autoencoder (VAE). The 3D variational data\nassimilation (3D-Var) cost function is applied to find the latent space vector\nwhich optimally fuses simulated observations and the encoded short-range\npersistence forecast (background), accounting for their errors. We demonstrate\nthat the background-error covariance matrix, measured and represented in the\nlatent space, is quasi-diagonal. Data assimilation experiments with a single\ntemperature observation in the lower troposphere indicate that the same set of\nneural-network-derived basis functions is able to describe both tropical and\nextratropical background-error covariances. The background-error covariances\nevolve seasonally and also depend on the current state of the atmosphere. Our\nmethod mimics the 3D variational data assimilation (3D-Var), however, it can be\nfurther extended to resemble 4D-Var by including the neural network forecast\nmodel.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:50:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Melinc","Bo\u0161tjan",""],["Zaplotnik","\u017diga",""]]}
{"id":"2308.16074","submitter":"Nikolai Leopold","authors":"Nikolai Leopold and Chiara Saffirio","title":"Derivation of the Vlasov-Maxwell system from the Maxwell-Schr\\\"odinger\n  equations with extended charges","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 consider the Maxwell-Schr\\\"odinger equations in the Coulomb gauge\ndescribing the interaction of extended fermions with their self-generated\nelectromagnetic field. They heuristically emerge as mean-field equations from\nnon-relativistic quantum electrodynamics in a mean-field limit of many\nfermions. In the semiclassical regime, we establish the convergence of the\nMaxwell-Schr\\\"{o}dinger equations for extended charges towards the\nnon-relativistic Vlasov-Maxwell dynamics and provide explicit estimates on the\naccuracy of the approximation. To this end, we build a well-posedness and\nregularity theory for the Maxwell-Schr\\\"odinger equations and for the\nVlasov-Maxwell system for extended charges.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:52:06 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Leopold","Nikolai",""],["Saffirio","Chiara",""]]}
{"id":"2308.16075","submitter":"Baban Gain","authors":"Baban Gain, Dibyanayan Bandyopadhyay, Samrat Mukherjee, Chandranath\n  Adak, Asif Ekbal","title":"Impact of Visual Context on Noisy Multimodal NMT: An Empirical Study for\n  English to Indian Languages","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The study investigates the effectiveness of utilizing multimodal information\nin Neural Machine Translation (NMT). While prior research focused on using\nmultimodal data in low-resource scenarios, this study examines how image\nfeatures impact translation when added to a large-scale, pre-trained unimodal\nNMT system. Surprisingly, the study finds that images might be redundant in\nthis context. Additionally, the research introduces synthetic noise to assess\nwhether images help the model deal with textual noise. Multimodal models\nslightly outperform text-only models in noisy settings, even with random\nimages. The study's experiments translate from English to Hindi, Bengali, and\nMalayalam, outperforming state-of-the-art benchmarks significantly.\nInterestingly, the effect of visual context varies with source text noise: no\nvisual context works best for non-noisy translations, cropped image features\nare optimal for low noise, and full image features work better in high-noise\nscenarios. This sheds light on the role of visual context, especially in noisy\nsettings, opening up a new research direction for Noisy Neural Machine\nTranslation in multimodal setups. The research emphasizes the importance of\ncombining visual and textual information for improved translation in various\nenvironments.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:52:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gain","Baban",""],["Bandyopadhyay","Dibyanayan",""],["Mukherjee","Samrat",""],["Adak","Chandranath",""],["Ekbal","Asif",""]]}
{"id":"2308.16076","submitter":"Maurizio Gasperini","authors":"P. Conzinu, G. Fanizza, M. Gasperini, E. Pavone, L. Tedesco and G.\n  Veneziano","title":"From the string vacuum to FLRW or de Sitter via $\\alpha'$ corrections","comments":"30 pages, 13 figures","journal-ref":null,"doi":null,"report-no":"BA-TH/808-23, CERN-TH-2023-163","categories":"hep-th astro-ph.CO gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We first make more precise a recent \"Hamiltonian\" reformulation of the\nHohm-Zwiebach approach to the tree-level, $O(d,d)$-invariant string cosmology\nequations at all orders in the $\\alpha'$ expansion, and recall how it allows to\ngive a simple characterization of a large class of cosmological scenarios\nconnecting, through a non-singular bounce, two duality-related perturbative\nsolutions at early and late times. We then discuss the effects of adding to the\naction a non-perturbative, $O(d,d)$-breaking, dilaton potential $V(\\phi)$. The\nresulting cosmological solutions, assumed to approach at early times the\nperturbative string vacuum (with vanishing curvature and string coupling), can\nstabilize the dilaton at late times and simultaneously approach either a\nmatter-dominated FLRW cosmology or a de-Sitter-like inflationary phase,\ndepending on initial conditions and on the properties of $V(\\phi)$ at\nmoderate-coupling. We also identify a general mechanism for generating\nisotropic late-time attractors from a large basin of anisotropic initial\nconditions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:58:51 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Conzinu","P.",""],["Fanizza","G.",""],["Gasperini","M.",""],["Pavone","E.",""],["Tedesco","L.",""],["Veneziano","G.",""]]}
{"id":"2308.16077","submitter":"Alexander Schmaus","authors":"Alexander Schmaus, Felix Creutzig, Nicolas Koch, Nora Molkenthin","title":"Shared Mobility in Berlin: An Analysis of Ride-Pooling with Car Mobility\n  Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In face of the threat of a climate catastrophe and the resulting urgent need\nfor decarbonization together with the widespread emergence of the sharing\neconomy, shared pooled mobility has been suggested as an alternative to private\nvehicle use. However, until now all of its real-life implementations have\nserved a niche market, adjacent to taxi services. To better understand this\ndiscrepancy, as well as the potential of pooled mobility, we have here\nsimulated and analyzed pooled mobility on the street network of Berlin with car\ntrip data as input for ride requests. We measure the rate of sharable trips,\nthe relative travel time of passengers, the average occupancy of the vehicles,\nthe relatively driven distance compared to driving with a private vehicle. We\nobserve that for requests in the city center of Berlin it is possible to serve\nall mobility requests currently done by car, with around 4700 vehicles. The\ntravel time is around 1.34 higher than with a private vehicle, the vehicle's\noccupancy increases to 2.6. The driven distance is reduced by 65%. In the whole\narea of Berlin we observe that a ride-pooling system with 10000 vehicles can\nserve 60% of the trips. The travel time is 1.4 times higher than with a private\nvehicle, the occupancy gets three and the driven distance is reduced by 40%.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 14:59:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Schmaus","Alexander",""],["Creutzig","Felix",""],["Koch","Nicolas",""],["Molkenthin","Nora",""]]}
{"id":"2308.16078","submitter":"Antonio Mart\\'inez-Henares","authors":"Antonio Mart\\'inez-Henares, Izaskun Jim\\'enez-Serra, Jes\\'us\n  Mart\\'in-Pintado, Nuria Hu\\'elamo, Sirina Prasad, Qizhou Zhang, James Moran,\n  Yue Cao and Alejandro B\\'aez-Rubio","title":"Modeling of the high-velocity jet powered by the massive star MWC 349A","comments":"Accepted for publication in 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":"  MWC 349A is a massive star with a well-known circumstellar disk rotating\nfollowing a Keplerian law, and an ionized wind launched from the disk surface.\nRecent ALMA observations carried out toward this system have however revealed\nan additional high-velocity component in the strong, maser emission of hydrogen\nradio recombination lines (RRLs), suggesting the presence of a high-velocity\nionized jet. In this work, we present 3D non-LTE radiative transfer modeling of\nthe emission of the H30$\\alpha$ and H26$\\alpha$ maser lines, and of their\nassociated radio continuum emission, toward the MWC 349A massive star. By using\nthe MORELI code, we reproduce the spatial distribution and kinematics of the\nhigh-velocity emission of the H30$\\alpha$ and H26$\\alpha$ maser lines with a\nhigh-velocity ionized jet expanding at a velocity of $\\sim$ 250 km s$^{-1}$,\nsurrounded by MWC 349A's wide-angle ionized wind. The bipolar jet, which is\nlaunched from MWC 349A's disk, is poorly collimated and slightly miss-aligned\nwith respect to the disk rotation axis. Thanks to the unprecedented sensitivity\nand spatial accuracy provided by ALMA, we also find that the already known,\nwide-angle ionized wind decelerates as it expands radially from the ionized\ndisk. We briefly discuss the implications of our findings in understanding the\nformation and evolution of massive stars. Our results show the huge potential\nof RRL masers as powerful probes of the innermost ionized regions around\nmassive stars and of their high-velocity jets.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:02:37 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mart\u00ednez-Henares","Antonio",""],["Jim\u00e9nez-Serra","Izaskun",""],["Mart\u00edn-Pintado","Jes\u00fas",""],["Hu\u00e9lamo","Nuria",""],["Prasad","Sirina",""],["Zhang","Qizhou",""],["Moran","James",""],["Cao","Yue",""],["B\u00e1ez-Rubio","Alejandro",""]]}
{"id":"2308.16079","submitter":"Zhentao Zhang","authors":"Yi-Xi Zhang, Zhen-Tao Zhang, Xiao-Zhi Wei, Bao-Long Liang, Feng Mei,\n  and Zhen-Shan Yang","title":"Entanglement Dynamics of two Non-Hermitian Qubits","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The evolution of entanglement in a non-Hermitian quantum system may behave\ndifferently compared to its Hermitian counterpart. In this paper, we\ninvestigate the entanglement dynamics of two coupled and driven non-Hermitian\nqubits. Through calculating the concurrence of the system, we find that the\nevolution of the bipartite entanglement manifests two distinct patterns in the\nparameter space. In the low non-Hermiticity regime, the concurrence oscillates\nsignificantly, while in the opposite regime the same quantity would trend to a\nstable value. We attribute this phenomenon to parity-time ($ \\mathcal{PT}$)\nsymmetry phase transition. In addition, we have also studied the effect of\ndecoherence on the entanglement dynamics. Our research provides a method to\nstabilize entanglement by exploiting non-Hermiticity.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:04:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Yi-Xi",""],["Zhang","Zhen-Tao",""],["Wei","Xiao-Zhi",""],["Liang","Bao-Long",""],["Mei","Feng",""],["Yang","Zhen-Shan",""]]}
{"id":"2308.16080","submitter":"Kenza Hammam","authors":"Kenza Hammam, Gonzalo Manzano, and Gabriele De Chiara","title":"Quantum coherence enables hybrid multitask and multisource regimes in\n  autonomous thermal machines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-equilibrium effects may have a profound impact on the performance of\nthermal devices performing thermodynamic tasks such as refrigeration or heat\npumping. The possibility of enhancing the performance of thermodynamic\noperations by means of quantum coherence is of particular interest but requires\nan adequate characterization of heat and work at the quantum level. In this\nwork, we demonstrate that the presence of even small amounts of coherence in\nthe thermal reservoirs powering a three-terminal machine, enables the\nappearance of combined and hybrid modes of operation, where either different\nresources are combined to perform a single thermodynamic task, or more than one\ntask is performed at the same time. We determine the performance of such\ncoherence-enabled modes of operation obtaining their power and efficiency and\ndiscussing the beneficial or detrimental roles of coherence.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:12:09 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hammam","Kenza",""],["Manzano","Gonzalo",""],["De Chiara","Gabriele",""]]}
{"id":"2308.16081","submitter":"Dmytro Sytnyk","authors":"Dmytro Sytnyk, Barbara Wohlmuth","title":"Abstract Fractional Cauchy Problem: Existence of Propagators and\n  Inhomogeneous Solution Representation","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.AP math.DS math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a Cauchy problem for the inhomogeneous differential equation\ngiven in terms of an unbounded linear operator $A$ and the Caputo fractional\nderivative of order $\\alpha \\in (0, 2)$ in time. The previously known\nrepresentation of the mild solution to such a problem does not have a\nconventional variation-of-constants like form, with the propagator derived from\nthe associated homogeneous problem. Instead, it relies on the existence of two\npropagators with different analytical properties. This fact limits theoretical\nand especially numerical applicability of the existing solution representation.\nHere, we propose an alternative representation of the mild solution to the\ngiven problem that consolidates the solution formulas for sub-parabolic,\nparabolic and sub-hyperbolic equations with a positive sectorial operator $A$\nand non-zero initial data. The new representation is solely based on the\npropagator of the homogeneous problem and, therefore, can be considered as a\nmore natural fractional extension of the solution to the classical parabolic\nCauchy problem. By exploiting a trade-off between the regularity assumptions on\nthe initial data in terms of the fractional powers of $A$ and the regularity\nassumptions on the right-hand side in time, we show that the proposed solution\nformula is strongly convergent for $t \\geq 0$ under considerably weaker\nassumptions compared to the standard results from the literature. Crucially,\nthe achieved relaxation of space regularity assumptions ensures that the new\nsolution representation is practically feasible for any $\\alpha \\in (0, 2)$ and\nis amenable to the numerical evaluation using uniformly accurate\nquadrature-based algorithms.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:14:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sytnyk","Dmytro",""],["Wohlmuth","Barbara",""]]}
{"id":"2308.16082","submitter":"Sen Fang","authors":"Sen Fang, Chunyu Sui, Xuedong Zhang, Yapeng Tian","title":"SignDiff: Learning Diffusion Models for American Sign Language\n  Production","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The field of Sign Language Production (SLP) lacked a large-scale, pre-trained\nmodel based on deep learning for continuous American Sign Language (ASL)\nproduction in the past decade. This limitation hampers communication for all\nindividuals with disabilities relying on ASL. To address this issue, we\nundertook the secondary development and utilization of How2Sign, one of the\nlargest publicly available ASL datasets. Despite its significance, prior\nresearchers in the field of sign language have not effectively employed this\ncorpus due to the intricacies involved in American Sign Language Production\n(ASLP).\n  To conduct large-scale ASLP, we propose SignDiff based on the latest work in\nrelated fields, which is a dual-condition diffusion pre-training model that can\ngenerate human sign language speakers from a skeleton pose. SignDiff has a\nnovel Frame Reinforcement Network called FR-Net, similar to dense human pose\nestimation work, which enhances the correspondence between text lexical symbols\nand sign language dense pose frames reduce the occurrence of multiple fingers\nin the diffusion model. In addition, our ASLP method proposes two new improved\nmodules and a new loss function to improve the accuracy and quality of sign\nlanguage skeletal posture and enhance the ability of the model to train on\nlarge-scale data.\n  We propose the first baseline for ASL production and report the scores of\n17.19 and 12.85 on BLEU-4 on the How2Sign dev/test sets. We also evaluated our\nmodel on the previous mainstream dataset called PHOENIX14T, and the main\nexperiments achieved the results of SOTA. In addition, our image quality far\nexceeds all previous results by 10 percentage points on the SSIM indicator.\nFinally, we conducted ablation studies and qualitative evaluations for\ndiscussion.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:14:56 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fang","Sen",""],["Sui","Chunyu",""],["Zhang","Xuedong",""],["Tian","Yapeng",""]]}
{"id":"2308.16083","submitter":"Man Zhou","authors":"Man Zhou, Jie Huang, Naishan Zheng, Chongyi Li","title":"Learned Image Reasoning Prior Penetrates Deep Unfolding Network for\n  Panchromatic and Multi-Spectral Image Fusion","comments":"10 pages; Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The success of deep neural networks for pan-sharpening is commonly in a form\nof black box, lacking transparency and interpretability. To alleviate this\nissue, we propose a novel model-driven deep unfolding framework with image\nreasoning prior tailored for the pan-sharpening task. Different from existing\nunfolding solutions that deliver the proximal operator networks as the\nuncertain and vague priors, our framework is motivated by the content reasoning\nability of masked autoencoders (MAE) with insightful designs. Specifically, the\npre-trained MAE with spatial masking strategy, acting as intrinsic reasoning\nprior, is embedded into unfolding architecture. Meanwhile, the pre-trained MAE\nwith spatial-spectral masking strategy is treated as the regularization term\nwithin loss function to constrain the spatial-spectral consistency. Such\ndesigns penetrate the image reasoning prior into deep unfolding networks while\nimproving its interpretability and representation capability. The uniqueness of\nour framework is that the holistic learning process is explicitly integrated\nwith the inherent physical mechanism underlying the pan-sharpening task.\nExtensive experiments on multiple satellite datasets demonstrate the\nsuperiority of our method over the existing state-of-the-art approaches. Code\nwill be released at \\url{https://manman1995.github.io/}.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:15:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhou","Man",""],["Huang","Jie",""],["Zheng","Naishan",""],["Li","Chongyi",""]]}
{"id":"2308.16084","submitter":"Jiacheng Xu","authors":"Chen Zong, Jiacheng Xu, Jiantao Song, Shuangmin Chen, Shiqing Xin,\n  Wenping Wang, Changhe Tu","title":"P2M: A Fast Solver for Querying Distance from Point to Mesh Surface","comments":null,"journal-ref":"ACM Transactions on Graphics, Volume 42, Issue 4, July 2023","doi":"10.1145/3592439","report-no":null,"categories":"cs.GR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Most of the existing point-to-mesh distance query solvers, such as Proximity\nQuery Package (PQP), Embree and Fast Closest Point Query (FCPW), are based on\nbounding volume hierarchy (BVH). The hierarchical organizational structure\nenables one to eliminate the vast majority of triangles that do not help find\nthe closest point. In this paper, we develop a totally different algorithmic\nparadigm, named P2M, to speed up point-to-mesh distance queries. Our original\nintention is to precompute a KD tree (KDT) of mesh vertices to approximately\nencode the geometry of a mesh surface containing vertices, edges and faces.\nHowever, it is very likely that the closest primitive to the query point is an\nedge e (resp., a face f), but the KDT reports a mesh vertex \\u{psion} instead.\nWe call \\u{psion} an interceptor of e (resp., f). The main contribution of this\npaper is to invent a simple yet effective interception inspection rule and an\nefficient flooding interception inspection algorithm for quickly finding out\nall the interception pairs. Once the KDT and the interception table are\nprecomputed, the query stage proceeds by first searching the KDT and then\nlooking up the interception table to retrieve the closest geometric primitive.\nStatistics show that our query algorithm runs many times faster than the\nstate-of-the-art solvers.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:16:56 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zong","Chen",""],["Xu","Jiacheng",""],["Song","Jiantao",""],["Chen","Shuangmin",""],["Xin","Shiqing",""],["Wang","Wenping",""],["Tu","Changhe",""]]}
{"id":"2308.16085","submitter":"Touraj Soleymani","authors":"Touraj Soleymani and Deniz G\\\"und\\\"uz","title":"State Estimation over Broadcast and Multi-Access Channels in an\n  Unreliable Regime","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article examines the problem of state estimation over multi-terminal\nchannels in an unreliable regime. More specifically, we consider two canonical\nsettings. In the first setting, measurements of a common stochastic source need\nto be transmitted to two distinct remote monitors over a packet-erasure\nbroadcast channel. In the second setting, measurements of two distinct\nstochastic sources need to be transmitted to a common remote monitor over a\npacket-erasure multi-access channel. For these networked systems, we uncover\nthe fundamental performance limits in the sense of a causal tradeoff between\nthe estimation error and the communication cost by identifying optimal encoding\nand decoding strategies. In the course of our analysis, we introduce two novel\nsemantic metrics that play essential roles in state estimation over broadcast\nand multi-access channels. The first metric arising in the context of broadcast\nchannels is the dissemination value of information, which quantifies the\nvaluation of provisioning a piece of information to multiple receivers\nsimultaneously. The second metric arising in the context of multi-access\nchannels is the prioritization value of information, which quantifies the\nvaluation of provisioning a piece of information chosen from one out of\nmultiple transmitters. Our findings certify that the optimal encoding and\ndecoding strategies hinge on these semantic metrics.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:17:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Soleymani","Touraj",""],["G\u00fcnd\u00fcz","Deniz",""]]}
{"id":"2308.16086","submitter":"Ju-Yeon Gyhm","authors":"Ju-Yeon Gyhm, Dario Rosa, and Dominik \\v{S}afr\\'anek","title":"The minimal time it takes to charge a quantum system","comments":"15 pages, 4 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 a quantum charging distance as the minimal time that it takes to\nreach one state (charged state) from another state (depleted state) via a\nunitary evolution, assuming limits on the resources invested into the charging.\nWe show that for pure states it is equal to the Bures angle, while for mixed\nstates, its computation leads to an optimization problem. Thus, we also derive\neasily computable bounds on this quantity. The charging distance tightens the\nknown bound on the mean charging power of a quantum battery, it quantifies the\nquantum charging advantage, and it leads to an always achievable quantum speed\nlimit. In contrast with other similar quantities, the charging distance does\nnot depend on the eigenvalues of the density matrix, it depends only on the\ncorresponding eigenspaces. This research formalizes and interprets quantum\ncharging in a geometric way, and provides a measurable quantity that one can\noptimize for to maximize the speed of charging of future quantum batteries.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:19:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gyhm","Ju-Yeon",""],["Rosa","Dario",""],["\u0160afr\u00e1nek","Dominik",""]]}
{"id":"2308.16087","submitter":"Malte D\\\"ontgen","authors":"Malte D\\\"ontgen, K. Alexander Heufer","title":"Non-Boltzmann Heat Transfer Between a Monoatomic Gas and a Solid\n  Nanostructure","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The effect of non-Boltzmann energy distributions on the pressure, impingement\nrate, and heat flux of a monoatomic gas in contact with a solid surface is\ninvestigated via theory and simulation. First, microcanonical formulations of\nthe pressure, impingement rate, and heat flux are derived from first principles\nand integrated with prototypical energy distributions. Second, atomistic\nmolecular dynamics simulations of an iron nanowire in a low-pressure argon\natmosphere are used to test the non-Boltzmann heat flux theory. While pressure\nis found to be unaffected by the energy distribution of the gas, the\nimpingement rate increases by up to 8.5% in the non-Boltzmann case. Most\nintriguing, non-Boltzmann energy distributions can lead to a negative heat\nflux, meaning that heat flows from the cold solid to the hot gas. This\nnon-Boltzmann heat flux effect is validated via the molecular dynamics\nsimulations and the solid is found to be 46% colder than the gas in case of an\nhypothetical equilibrium for the upper limiting non-Boltzmann energy\ndistributions. The present fundamental findings provide novel insights into the\nproperties of non-Boltzmann gases and improve the understanding of\nnon-equilibrium dynamics.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:19:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["D\u00f6ntgen","Malte",""],["Heufer","K. Alexander",""]]}
{"id":"2308.16088","submitter":"Carsten Hartmann","authors":"Luigi Delle Site and Carsten Hartmann","title":"Scaling law for the size dependence of a short-ranged quantum gas","comments":"14 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a recent work [Reible {\\it et al.} Phys. Rev. Res. {\\bf 5}, 023156, 2023],\nit has been shown that the mean particle-particle interaction across an ideal\nsurface that divides a system into two parts, can be employed to estimate the\nsize dependence for the thermodynamic accuracy of the system. In this work we\npropose its application to systems with short range interactions that models a\ndense quantum gases and derive an approximate size-dependence scaling law. In\naddition, we show that the application of the criterion is equivalent to the\ndetermination of a free energy response to a perturbation. The latter result\ncomfirms the complementarity of the criterion to other estimates of finite-size\neffects based on direct simulations and empirical structure or energy\nconvergence criteria.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:26:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Site","Luigi Delle",""],["Hartmann","Carsten",""]]}
{"id":"2308.16089","submitter":"Ujjal Kr Dutta","authors":"Ujjal Kr Dutta, Aldo Lipani, Chuan Wang, Yukun Hu","title":"Application of Zone Method based Machine Learning and Physics-Informed\n  Neural Networks in Reheating Furnaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.NE cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the high economic relevance of Foundation Industries, certain\ncomponents like Reheating furnaces within their manufacturing chain are\nenergy-intensive. Notable energy consumption reduction could be obtained by\nreducing the overall heating time in furnaces. Computer-integrated Machine\nLearning (ML) and Artificial Intelligence (AI) powered control systems in\nfurnaces could be enablers in achieving the Net-Zero goals in Foundation\nIndustries for sustainable manufacturing.\n  In this work, due to the infeasibility of achieving good quality data in\nscenarios like reheating furnaces, classical Hottel's zone method based\ncomputational model has been used to generate data for ML and Deep Learning\n(DL) based model training via regression. It should be noted that the zone\nmethod provides an elegant way to model the physical phenomenon of Radiative\nHeat Transfer (RHT), the dominating heat transfer mechanism in high-temperature\nprocesses inside heating furnaces. Using this data, an extensive comparison\namong a wide range of state-of-the-art, representative ML and DL methods has\nbeen made against their temperature prediction performances in varying furnace\nenvironments. Owing to their holistic balance among inference times and model\nperformance, DL stands out among its counterparts. To further enhance the\nOut-Of-Distribution (OOD) generalization capability of the trained DL models,\nwe propose a Physics-Informed Neural Network (PINN) by incorporating prior\nphysical knowledge using a set of novel Energy-Balance regularizers. Our setup\nis a generic framework, is geometry-agnostic of the 3D structure of the\nunderlying furnace, and as such could accommodate any standard ML regression\nmodel, to serve as a Digital Twin of the underlying physical processes, for\ntransitioning Foundation Industries towards Industry 4.0.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:26:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dutta","Ujjal Kr",""],["Lipani","Aldo",""],["Wang","Chuan",""],["Hu","Yukun",""]]}
{"id":"2308.16090","submitter":"Leonid Positselski","authors":"Leonid Positselski","title":"Tensor-Hom formalism for modules over nonunital rings","comments":"LaTeX 2e with xy-pic; 16 pages, 4 commutative diagrams","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.CT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given an s-unital ring $R$, as defined by Tominaga in 1975, we show that the\ncategory of s-unital $R$-$R$-bimodules is a unital monoidal category with the\nunit object $R$ with respect to the tensor product operation $\\otimes_R$. For\nany ring $R$, the full subcategory of s-unital $R$-modules is a hereditary\ntorsion class in the category of nonunital $R$-modules. More generally, we say\nthat a ring $R$ is t-unital if the natural map $R\\otimes_RR\\rightarrow R$ is an\nisomorphism, and a left $R$-module $P$ is c-unital if the natural map\n$P\\rightarrow\\operatorname{Hom}_R(R,P)$ is an isomorphism. For a t-unital ring\n$R$, the category of t-unital left $R$-modules is a unital left module category\nover an associative, unital monoidal category of t-unital $R$-$R$-bimodules,\nwhile the category of c-unital left $R$-modules is opposite to a unital right\nmodule category over the same monoidal category. There is a natural pair of\nadjoint functors between the additive categories of t-unital and c-unital left\n$R$-modules. For rings $R$ arising from small preadditive categories, this\nadjoint pair is an abelian category equivalence. Our motivation comes from the\ntheory of semialgebras over coalgebras over fields.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:28:56 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Positselski","Leonid",""]]}
{"id":"2308.16091","submitter":"Chinonso Ugwumadu","authors":"C. Ugwumadu, R. Olson III, N. L. Smith, K. Nepal, Y. Al-Majali, J.\n  Trembly, D. A. Drabold","title":"Computer Simulation of Carbonization and Graphitization of Coal","comments":"The submission contains the manuscript and supplementary material\n  (provided after references)","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":"  This study describes computer simulations of carbonization and graphite\nformation, including the effects of hydrogen, nitrogen, oxygen, and sulfur. We\nintroduce a novel technique to simulate carbonization, \"Simulation of Thermal\nEmission of Atoms and Molecules (STEAM),\" designed to elucidate the removal of\nvolatiles and density variations in carbonization residue. The investigation\nextensively analyzes the functional groups that endure through high-temperature\ncarbonization and examines the graphitization processes in carbon-rich\nmaterials containing non-carbon \"impurity elements\". The physical, vibrational,\nand electronic attributes of impure amorphous graphite are analyzed, and the\nimpact of nitrogen on electronic conduction is investigated, revealing its\nsubstitutional integration into the sp$^2$ layered network.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:34:56 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ugwumadu","C.",""],["Olson","R.","III"],["Smith","N. L.",""],["Nepal","K.",""],["Al-Majali","Y.",""],["Trembly","J.",""],["Drabold","D. A.",""]]}
{"id":"2308.16092","submitter":"Dan Leonte","authors":"Dan Leonte, Almut E. D. Veraart","title":"Likelihood-based inference and forecasting for trawl processes: a\n  stochastic optimization approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.CO stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider trawl processes, which are stationary and infinitely divisible\nstochastic processes and can describe a wide range of statistical properties,\nsuch as heavy tails and long memory. In this paper, we develop the first\nlikelihood-based methodology for the inference of real-valued trawl processes\nand introduce novel deterministic and probabilistic forecasting methods. Being\nnon-Markovian, with a highly intractable likelihood function, trawl processes\nrequire the use of composite likelihood functions to parsimoniously capture\ntheir statistical properties. We formulate the composite likelihood estimation\nas a stochastic optimization problem for which it is feasible to implement\niterative gradient descent methods. We derive novel gradient estimators with\nvariances that are reduced by several orders of magnitude. We analyze both the\ntheoretical properties and practical implementation details of these estimators\nand release a Python library which can be used to fit a large class of trawl\nprocesses. In a simulation study, we demonstrate that our estimators outperform\nthe generalized method of moments estimators in terms of both parameter\nestimation error and out-of-sample forecasting error. Finally, we formalize a\nstochastic chain rule for our gradient estimators. We apply the new theory to\ntrawl processes and provide a unified likelihood-based methodology for the\ninference of both real-valued and integer-valued trawl processes.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:37:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Leonte","Dan",""],["Veraart","Almut E. D.",""]]}
{"id":"2308.16093","submitter":"William Duncan Martinson","authors":"W. Duncan Martinson, Alexandria Volkening, Markus Schmidtchen,\n  Chandrasekhar Venkataraman, Jos\\'e A. Carrillo","title":"Linking discrete and continuous models of cell birth and migration","comments":"23 pages, 11 figures in main manuscript. 16 pages, 8 figures in\n  supplementary information","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.CB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Self-organization of individuals within large collectives occurs throughout\nbiology, with examples including locust swarming and cell formation of\nembryonic tissues. Mathematical models can help elucidate the individual-level\nmechanisms behind these dynamics, but analytical tractability often comes at\nthe cost of biological intuition. Discrete models provide straightforward\ninterpretations by tracking each individual yet can be computationally\nexpensive. Alternatively, continuous models supply a large-scale perspective by\nrepresenting the \"effective\" dynamics of infinite agents, but their results are\noften difficult to translate into experimentally relevant insights. We address\nthis challenge by quantitatively linking spatio-temporal dynamics of discrete\nand continuous models in settings with biologically realistic, time-varying\ncell numbers. Motivated by zebrafish-skin pattern formation, we create a\ncontinuous framework describing the movement and proliferation of a single cell\npopulation by upscaling rules from a discrete model. We introduce and fit\nscaling parameters to account for discrepancies between these two frameworks in\nterms of cell numbers, considering movement and birth separately. Our resulting\ncontinuous models accurately depict ensemble average agent-based solutions when\nmigration or proliferation act alone. Interestingly, the same parameters are\nnot optimal when both processes act simultaneously, highlighting a rich\ndifference in how combining migration and proliferation affects discrete and\ncontinuous dynamics.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:38:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Martinson","W. Duncan",""],["Volkening","Alexandria",""],["Schmidtchen","Markus",""],["Venkataraman","Chandrasekhar",""],["Carrillo","Jos\u00e9 A.",""]]}
{"id":"2308.16094","submitter":"Paolo Simonetti","authors":"Paolo Simonetti, Giovanni Vladilo, Stavro L. Ivanovski, Laura Silva,\n  Lorenzo Biasiotti, Michele Maris, Giuseppe Murante, Erica Bisesi, Sergio\n  Monai","title":"Seasonal thaws under mid-to-low pressure atmospheres on Early Mars","comments":"25 pages, 10 figures, submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite decades of scientific research on the subject, the climate of the\nfirst 1.5 Gyr of Mars history has not been fully understood yet. Especially\nchallenging is the need to reconcile the presence of liquid water for extended\nperiods of time on the martian surface with the comparatively low insolation\nreceived by the planet, a problem which is known as the Faint Young Sun (FYS)\nParadox. In this paper we use ESTM, a latitudinal energy balance model with\nenhanced prescriptions for meridional heat diffusion, and the radiative\ntransfer code EOS to investigate how seasonal variations of temperature can\ngive rise to local conditions which are conductive to liquid water runoffs. We\ninclude the effects of the martian dichotomy, a northern ocean with either 150\nor 550 m of Global Equivalent Layer (GEL) and simplified CO$_2$ or H$_2$O\nclouds. We find that 1.3-to-2.0 bar CO$_2$-dominated atmospheres can produce\nseasonal thaws due to inefficient heat redistribution, provided that the\neccentricity and the obliquity of the planet are sufficiently different from\nzero. We also studied the impact of different values for the argument of\nperihelion. When local favorable conditions exist, they nearly always persist\nfor $>15\\%$ of the martian year. These results are obtained without the need\nfor additional greenhouse gases (e.g. H$_2$, CH$_4$) or transient\nheat-injecting phenomena (e.g. asteroid impacts, volcanic eruptions). Moderate\namounts (0.1 to 1\\%) of CH$_4$ significantly widens the parameter space region\nin which seasonal thaws are possible.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:40:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Simonetti","Paolo",""],["Vladilo","Giovanni",""],["Ivanovski","Stavro L.",""],["Silva","Laura",""],["Biasiotti","Lorenzo",""],["Maris","Michele",""],["Murante","Giuseppe",""],["Bisesi","Erica",""],["Monai","Sergio",""]]}
{"id":"2308.16095","submitter":"Kristina Gligoric","authors":"Kristina Gligoric, Arnaud Chiolero, Emre K{\\i}c{\\i}man, Ryen W. White,\n  Eric Horvitz, Robert West","title":"Food Choice Mimicry on a Large University Campus","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Social influence is a strong determinant of food consumption, which in turn\ninfluences health. Although consistent observations have been made on the role\nof social factors in driving similarities in food consumption, much less is\nknown about the precise governing mechanisms. We study social influence on food\nchoice through carefully designed causal analyses, leveraging the sequential\nnature of shop queues on a major university campus. In particular, we consider\na large number of adjacent purchases where a focal user immediately follows\nanother user (\"partner\") in the checkout queue and both make a purchase.\nIdentifying the partner's impact on the focal user, we find strong evidence of\na specific behavioral mechanism for how dietary similarities between\nindividuals arise: purchasing mimicry, a phenomenon where the focal user copies\nthe partner's purchases. For instance, across food additions purchased during\nlunchtime together with a meal, we find that the focal user is significantly\nmore likely to purchase the food item when the partner buys the item, v.s. when\nthe partner does not, increasing the purchasing probability by 14% in absolute\nterms, or by 83% in relative terms. The effect is observed across all food\ntypes, but largest for condiments, and smallest for soft drinks. We find that\nno such effect is observed when a focal user is compared to a random (rather\nthan directly preceding) partner. Furthermore, purchasing mimicry is present\nacross age, gender, and status subpopulations, but strongest for students and\nthe youngest persons. Finally, we find a dose-response relationship whereby\nmimicry decreases as proximity in the purchasing queue decreases. The results\nof this study elucidate the behavioral mechanism of purchasing mimicry and have\nfurther implications for understanding and improving dietary behaviors on\ncampus.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:44:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gligoric","Kristina",""],["Chiolero","Arnaud",""],["K\u0131c\u0131man","Emre",""],["White","Ryen W.",""],["Horvitz","Eric",""],["West","Robert",""]]}
{"id":"2308.16096","submitter":"Micha{\\l} Mi\\'skiewicz","authors":"Erik Hupp, Micha{\\l} Mi\\'skiewicz","title":"A new $p$-harmonic map flow with Struwe monotonicity","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct and analyze solutions to a regularized homogeneous $p$-harmonic\nmap flow equation for general $p \\geq 2$. The homogeneous version of the\nproblem is new and features a monotonicity formula extending the one found by\nStruwe for $p = 2$; such a formula is not available for the nonhomogeneous\nequation. The construction itself is via a Ginzburg-Landau-type approximation\n\\`a la Chen-Struwe, employing tools such as a Bochner-type formula and an\n$\\varepsilon$-regularity theorem. We similarly obtain strong subsequential\nconvergence of the approximations away from a concentration set with parabolic\ncodimension at least $p$. However, the quasilinear and non-divergence nature of\nthe equation presents new obstacles that do not appear in the classical case $p\n= 2$, namely uniform-time existence for the approximating problem, and thus our\nbasic existence result is stated conditionally.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:45:29 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hupp","Erik",""],["Mi\u015bkiewicz","Micha\u0142",""]]}
{"id":"2308.16097","submitter":"Stanislav Budzinskiy","authors":"Stanislav Budzinskiy","title":"Quasioptimal alternating projections and their use in low-rank\n  approximation of matrices and tensors","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 study the convergence of specific inexact alternating projections for two\nnon-convex sets in a Euclidean space. The $\\sigma$-quasioptimal metric\nprojection ($\\sigma \\geq 1$) of a point $x$ onto a set $A$ consists of points\nin $A$ the distance to which is at most $\\sigma$ times larger than the minimal\ndistance $\\mathrm{dist}(x,A)$. We prove that quasioptimal alternating\nprojections, when one or both projections are quasioptimal, converge locally\nand linearly under the usual regularity assumptions on the two sets and their\nintersection. The theory is motivated by the successful application of\nalternating projections to low-rank matrix and tensor approximation. We focus\non two problems -- nonnegative low-rank approximation and low-rank\napproximation in the maximum norm -- and develop fast alternating-projection\nalgorithms for matrices and tensor trains based on cross approximation and\nacceleration techniques. The numerical experiments confirm that the proposed\nmethods are efficient and suggest that they can be used to regularise various\nlow-rank computational routines.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:45:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Budzinskiy","Stanislav",""]]}
{"id":"2308.16098","submitter":"Axel Boeltzig","authors":"J. Skowronski, A. Boeltzig, G. F. Ciani, L. Csedreki, D. Piatti, M.\n  Aliotta, C. Ananna, F. Barile, D. Bemmerer, A. Best, C. Broggini, C. G.\n  Bruno, A. Caciolli, M. Campostrini, F. Cavanna, P. Colombetti, A.\n  Compagnucci, P. Corvisiero, T. Davinson, R. Depalo, A. Di Leva, Z. Elekes, F.\n  Ferraro, A. Formicola, Zs. F\\\"ul\\\"op, G. Gervino, R. M. Gesu\\`e, A.\n  Guglielmetti, C. Gustavino, Gy. Gy\\\"urky, G. Imbriani, M. Junker, M. Lugaro,\n  P. Marigo, E. Masha, R. Menegazzo, V. Paticchio, R. Perrino, P. Prati, D.\n  Rapagnani, V. Rigato, L. Schiavulli, R. S. Sidhu, O. Straniero, T. Sz\\\"ucs,\n  S. Zavatarelli","title":"New proton-capture rates on carbon isotopes and their impact on the\n  astrophysical $^{12}\\mathrm{C}/{}^{13}\\mathrm{C}$ ratio","comments":"Submitted to Phys. Rev. Lett","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ${}^{12}\\mathrm{C}/{}^{13}\\mathrm{C}$ ratio is a significant indicator of\nnucleosynthesis and mixing processes during hydrogen burning in stars. Its\nvalue mainly depends on the relative rates of the\n${}^{12}\\mathrm{C}(p,\\gamma){}^{13}\\mathrm{N}$ and\n${}^{13}\\mathrm{C}(p,\\gamma){}^{14}\\mathrm{N}$ reactions. Both reactions have\nbeen studied at the Laboratory for Underground Nuclear Astrophysics (LUNA) in\nItaly down to the lowest energies to date ($E_\\mathrm{c.m.} =\n60\\,\\mathrm{keV}$) reaching for the first time the high energy tail of hydrogen\nburning in the shell of giant stars. Our cross sections, obtained with both\nprompt $\\gamma$-ray detection and activation measurements, are the most precise\nto date with overall systematic uncertainties of $7-8\\%$. Compared with most of\nthe literature, our results are systematically lower, by $25\\%$ for the\n${}^{12}\\mathrm{C}(p,\\gamma){}^{13}\\mathrm{N}$ reaction and by $30\\%$ for\n${}^{13}\\mathrm{C}(p,\\gamma){}^{14}\\mathrm{N}$. We provide the most precise\nvalue up to now of $(3.6 \\pm 0.4)$ in the $20-140\\,\\mathrm{MK}$ range for the\nlowest possible ${}^{12}\\mathrm{C}/{}^{13}\\mathrm{C}$ ratio that can be\nproduced during H burning in giant stars.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:48:13 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Skowronski","J.",""],["Boeltzig","A.",""],["Ciani","G. F.",""],["Csedreki","L.",""],["Piatti","D.",""],["Aliotta","M.",""],["Ananna","C.",""],["Barile","F.",""],["Bemmerer","D.",""],["Best","A.",""],["Broggini","C.",""],["Bruno","C. G.",""],["Caciolli","A.",""],["Campostrini","M.",""],["Cavanna","F.",""],["Colombetti","P.",""],["Compagnucci","A.",""],["Corvisiero","P.",""],["Davinson","T.",""],["Depalo","R.",""],["Di Leva","A.",""],["Elekes","Z.",""],["Ferraro","F.",""],["Formicola","A.",""],["F\u00fcl\u00f6p","Zs.",""],["Gervino","G.",""],["Gesu\u00e8","R. M.",""],["Guglielmetti","A.",""],["Gustavino","C.",""],["Gy\u00fcrky","Gy.",""],["Imbriani","G.",""],["Junker","M.",""],["Lugaro","M.",""],["Marigo","P.",""],["Masha","E.",""],["Menegazzo","R.",""],["Paticchio","V.",""],["Perrino","R.",""],["Prati","P.",""],["Rapagnani","D.",""],["Rigato","V.",""],["Schiavulli","L.",""],["Sidhu","R. S.",""],["Straniero","O.",""],["Sz\u00fccs","T.",""],["Zavatarelli","S.",""]]}
{"id":"2308.16099","submitter":"Jiakang Zheng","authors":"Jiakang Zheng, Jiayi Zhang, Hongyang Du, Dusit Niyato, Dong In Kim,\n  and Bo Ai","title":"Rate-Splitting for CF Massive MIMO Systems With Channel Aging","comments":"6 pages, 5 figures, accepted by IEEE Transactions on Vehicular\n  Technology","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The cell-free (CF) massive multiple-input multiple-output (MIMO) system is\nconsidered a cutting-edge technology in next-generation mobile communication\ndue to its ability to provide high-performance coverage seamlessly and\nuniformly. This paper aims to mitigate the negative impact of channel aging due\nto the movement of user equipment in CF massive MIMO systems by utilizing\nrate-splitting (RS) technology. Taking into account the outdated channel state\ninformation, we obtain the achievable sum spectral efficiency (SE) of the\nRS-assisted CF massive MIMO system, where the private messages can directly\nadopt conventional maximum ratio, local minimum mean square error (MMSE), and\ncentralized MMSE precoding schemes. Moreover, we propose a bisection-based\nprecoding scheme that maximizes the minimum SE of common messages, which\noutperforms the superposition-based and random precoding schemes and exhibits\nstrong robustness in complex mobile scenarios. Furthermore, we derive a novel\nclosed-form sum SE expression for the considered system. The results\ndemonstrate that RS technology can mitigate interference in mobile CF massive\nMIMO systems, improving overall system performance.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:48:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zheng","Jiakang",""],["Zhang","Jiayi",""],["Du","Hongyang",""],["Niyato","Dusit",""],["Kim","Dong In",""],["Ai","Bo",""]]}
{"id":"2308.16100","submitter":"Andr\\'e Mota","authors":"L. F. Eleot\\'erio, G. A. Oliveira, E. W. Dias, H. Caldas and A. L.\n  Mota","title":"The Schwinger and Chiral Schwinger Models in a Non-perturbative Spectral\n  Regularization","comments":"20 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the employment of a non-perturbative regularization scheme --\nthe spectral regularization, which is based on the gauge technique, previously\nimplemented in the context of chiral quark models -- in the study of the gauge\nsymmetry preservation within the Schwinger model and violation in the chiral\nSchwinger model. We show that the spectral regularization provides mathematical\nconsistent and ambiguity free solutions for the two-point functions of both\nSchwinger and chiral Schwinger models in exact (1+1) dimensions, correctly\ndisplaying the gauge invariance in the Schwinger model and the axial anomaly in\nthe chiral Schwinger model. The employment of the spectral regularization\navoids any dependence on ambiguous amplitudes and/or unconventional $\\gamma^5$\nalgebra. Our results reinforce the strength of the spectral regularization as a\nmathematical consistent, divergence free, and ambiguity free regularization\nscheme that correctly implements symmetry conservation or violation in each\ncase.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:50:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Eleot\u00e9rio","L. F.",""],["Oliveira","G. A.",""],["Dias","E. W.",""],["Caldas","H.",""],["Mota","A. L.",""]]}
{"id":"2308.16101","submitter":"Wei Li","authors":"Xuemin Fan, Xiaoqi Sun, Penghao Zhu, Yuqiang Fang, Yongkang Ju,\n  Yonghao Yuan, Fuqiang Huang, Taylor L. Hughes, Peizhe Tang, Qi-Kun Xue and\n  Wei Li","title":"Stripe charge order driven manipulation of Majorana bound states in\n  2M-WS2 topological superconductor","comments":"20 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Majorana bound states (MBSs) are building blocks for topological quantum\ncomputing. They can be generated via the combination of electronic topology and\nsuperconductivity. To achieve logic operations via Majorana braiding,\npositional control of the MBS must be established. To this end, exotic\nco-existing phases or collective modes in an intrinsic topological\nsuperconductor can provide a tuning knob to manipulate the MBS. Here we report\nthe observation of a striped surface charge order coexisting with\nsuperconductivity and its controllable tuning of the MBS in the topological\nsuperconductor 2M-WS2 using low-temperature scanning tunneling microscopy. By\napplying an out-of-plane magnetic field, we observe that MBS is absent in\nvortices in the region with strong stripe order. This is in contrast to\nadjacent underlaying layers without charge order where vortex-bound MBSs are\nobserved. Via theoretical simulations, we show that the surface stripe order\ndoes not destroy the bulk topology, but it can effectively modify the spatial\ndistribution of MBS, i.e., it pushes them downward away from the 2M-WS2\nsurface. Our findings demonstrate that the interplay of charge order and\ntopological superconductivity can be used to manipulate the positions of the\nMBS, and to explore of new states of matter.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:50:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fan","Xuemin",""],["Sun","Xiaoqi",""],["Zhu","Penghao",""],["Fang","Yuqiang",""],["Ju","Yongkang",""],["Yuan","Yonghao",""],["Huang","Fuqiang",""],["Hughes","Taylor L.",""],["Tang","Peizhe",""],["Xue","Qi-Kun",""],["Li","Wei",""]]}
{"id":"2308.16102","submitter":"Yike Sun","authors":"Yike Sun, Xiaogang Chen, Bingchuan Liu, Liyan Liang, Yijun Wang,\n  Shangkai Gao, Xiaorong Gao","title":"A Surgery-Detection Two-Dimensional Panorama of Signal Acquisition\n  Technologies in Brain-Computer Interface","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Brain-computer interface (BCI) technology is an interdisciplinary field that\nallows individuals to connect with the external world. The performance of BCI\nsystems relies predominantly on the advancements of signal acquisition\ntechnology. This paper aims to present a comprehensive overview of signal\nacquisition technologies in BCI by examining research articles published in the\npast decade. Our review incorporates both clinician and engineer perspectives\nand presents a surgery-detection two-dimensional panorama of signal acquisition\ntechnologies in BCI. We classify the technologies into nine distinct\ncategories, providing representative examples and emphasizing the significant\nchallenges associated with each modality. Our review provides researchers and\npractitioners with a macroscopic understanding of BCI signal acquisition\ntechnologies and discuss the field's major issues today. Future development in\nBCI signal acquisition technology should prioritize the integration of diverse\ndisciplines and perspectives. Striking a balance among signal quality, trauma,\nbiocompatibility, and other relevant factors is crucial. This will promote the\nadvancement of BCI technology, enhancing its efficiency, safety, and\nreliability, and ultimately contributing to a promising future for humanity.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:51:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sun","Yike",""],["Chen","Xiaogang",""],["Liu","Bingchuan",""],["Liang","Liyan",""],["Wang","Yijun",""],["Gao","Shangkai",""],["Gao","Xiaorong",""]]}
{"id":"2308.16103","submitter":"Susanne Siebentritt","authors":"Thomas Paul Weiss, Mohit Sood, Aline Vanderhaegen, Susanne Siebentritt","title":"CuIn(Se,Te)2 absorbers with bandgaps < 1 eV for bottom cells in tandem\n  applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Thin-film solar cells reach high efficiencies and have a low carbon footprint\nin production. Tandem solar cells have the potential to significantly increase\nthe efficiency of this technology, where the bottom-cell is generally composed\nof a Cu(In,Ga)Se2 absorber layer with bandgaps around 1 eV or higher. Here, we\ninvestigate CuIn(Se1-xTex)2 absorber layers and solar cells with bandgaps below\n1 eV, which will bring the benefit of an additional degree of freedom for\ndesigning current-matched 2-terminal tandem devices. We report that\nCuIn(Se1-xTex)2 thin films can be grown single phase by co-evaporation and that\nthe bandgap can be reduced to the optimum range for a bottom cell (0.92 - 0.95\neV). From photoluminescence spectroscopy it is found that no additional\nnon-radiative losses are introduced to the absorber. However, Voc losses occur\nin the final solar cell due to non-optimised interfaces. Nevertheless, a record\ndevice with 9 % power conversion efficiency is demonstrated with a bandgap of\n0.96 eV and x=0.15. Interface recombination is identified as a major\nrecombination channel for larger Te contents. Thus, further efficiency\nimprovements are anticipated for improved absorber/buffer interfaces.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:51:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Weiss","Thomas Paul",""],["Sood","Mohit",""],["Vanderhaegen","Aline",""],["Siebentritt","Susanne",""]]}
{"id":"2308.16104","submitter":"Reena Urban","authors":"Rowan Hoogervorst, Evelien van der Hurk, Philine Schiewe, Anita\n  Sch\\\"obel, Reena Urban","title":"The Bus Rapid Transit Investment Problem","comments":"40 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bus Rapid Transit (BRT) systems can provide a fast and reliable service to\npassengers at low investment costs compared to tram, metro and train systems.\nTherefore, they can be of great value to attract more passengers to use public\ntransport. This paper thus focuses on the BRT investment problem: Which\nsegments of a single bus line should be upgraded such that the number of newly\nattracted passengers is maximized? Motivated by the construction of a new BRT\nline around Copenhagen, we consider a setting in which multiple parties are\nresponsible for different segments of the line. As each party has a limited\nwillingness to invest, we solve a bi-objective problem to quantify the\ntrade-off between the number of attracted passengers and the investment budget.\nWe model different problem variations: First, we consider two potential\npassenger responses to upgrades on the line. Second, to prevent scattered\nupgrades along the line, we consider different restrictions on the number of\nupgraded connected components on the line. We propose an\nepsilon-constraint-based algorithm to enumerate the complete set of\nnon-dominated points and investigate the complexity of this problem. Moreover,\nwe perform extensive numerical experiments on artificial instances and a case\nstudy based on the BRT line around Copenhagen. Our results show that we can\ngenerate the full Pareto front for real-life instances and that the resulting\ntrade-off between investment budget and attracted passengers depends both on\nthe origin-destination demand and on the passenger response to upgrades.\nMoreover, we illustrate how the generated Pareto plots can assist decision\nmakers in selecting from a set of geographical route alternatives in our case\nstudy.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:53:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hoogervorst","Rowan",""],["van der Hurk","Evelien",""],["Schiewe","Philine",""],["Sch\u00f6bel","Anita",""],["Urban","Reena",""]]}
{"id":"2308.16105","submitter":"Siavash Hosseini","authors":"Siavash Hosseini, Thangarajah Akilan","title":"Advanced Deep Regression Models for Forecasting Time Series Oil\n  Production","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Global oil demand is rapidly increasing and is expected to reach 106.3\nmillion barrels per day by 2040. Thus, it is vital for hydrocarbon extraction\nindustries to forecast their production to optimize their operations and avoid\nlosses. Big companies have realized that exploiting the power of deep learning\n(DL) and the massive amount of data from various oil wells for this purpose can\nsave a lot of operational costs and reduce unwanted environmental impacts. In\nthis direction, researchers have proposed models using conventional machine\nlearning (ML) techniques for oil production forecasting. However, these\ntechniques are inappropriate for this problem as they can not capture\nhistorical patterns found in time series data, resulting in inaccurate\npredictions. This research aims to overcome these issues by developing advanced\ndata-driven regression models using sequential convolutions and long short-term\nmemory (LSTM) units. Exhaustive analyses are conducted to select the optimal\nsequence length, model hyperparameters, and cross-well dataset formation to\nbuild highly generalized robust models. A comprehensive experimental study on\nVolve oilfield data validates the proposed models. It reveals that the\nLSTM-based sequence learning model can predict oil production better than the\n1-D convolutional neural network (CNN) with mean absolute error (MAE) and R2\nscore of 111.16 and 0.98, respectively. It is also found that the LSTM-based\nmodel performs better than all the existing state-of-the-art solutions and\nachieves a 37% improvement compared to a standard linear regression, which is\nconsidered the baseline model in this work.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:54:06 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hosseini","Siavash",""],["Akilan","Thangarajah",""]]}
{"id":"2308.16106","submitter":"Albert Bruch","authors":"Albert Bruch","title":"TESS light curves of cataclysmic variables -- III -- More superhump\n  systems among old novae and novalike variables","comments":null,"journal-ref":"Monthy Notices of the Royal Astronomical Socienty, 2023, Vol. 525,\n  pp 1953-1975","doi":"10.1093/mnras/stad2089","report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Continuing previous work on the identification and characterization of\nperiodic and non-periodic variations in long and almost uninterrupted high\ncadence light curves of cataclysmic variables observed by the TESS mission, the\nresults on 23 novalike variables and old novae out of sample of 127 suchsystems\ntaken from the Ritter & Kolb catalogue are presented. All of them exhibit at\nleast at some epochs either positive or negative (or both) superhumps, and in\n19 of them superhumps were detected for the first time. The basic properties of\nthe superhumps such as their periods, their appearance and disappearance, and\ntheir waveforms are explored. Together with recent reports in the literature,\nthis elevates the number of known novalike variables and old novae with\nsuperhumps by more than 50%. The previous census of superhumps and the\nStolz-Schoembs relation for these stars are updated. Attention is drawn to\nsuperhump properties in some stars which behave differently from the average,\nas well as to positive superhumps in high mass ratio systems which defy theory.\nAs a byproduct, the orbital periods of 13 stars are either improved or newly\nmeasured, correcting previously reported erroneous values.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:59:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bruch","Albert",""]]}
{"id":"2308.16107","submitter":"Lucy Yang","authors":"Lucy Yang","title":"On normed $\\mathbb{E}_\\infty$-rings in genuine equivariant $C_p$-spectra","comments":"37 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Genuine equivariant homotopy theory is equipped with a multitude of\ncoherently commutative multiplication structures generalizing the classical\nnotion of an $\\mathbb{E}_\\infty$-algebra. In this paper we study the\n$C_p$-$\\mathbb{E}_\\infty$-algebras of Nardin--Shah with respect to a cyclic\ngroup $C_p$ of prime power order. We show that many of the higher coherences\ninherent to the definition of parametrized algebras collapse; in particular,\nthey may be described more simply and conceptually in terms of ordinary\n$\\mathbb{E}_\\infty$-algebras as a diagram category which we call \\emph{normed\nalgebras}. Our main result provides a relatively straightforward criterion for\nidentifying $C_p$-$\\mathbb{E}_\\infty$-algebra structures. We visit some\napplications of our result to real motivic invariants.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:02:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yang","Lucy",""]]}
{"id":"2308.16108","submitter":"Jiang Zhou","authors":"Wenna Lu and Jiang Zhou","title":"A characterization of mixed $\\lambda$-central $\\mathrm{BMO}$ space via\n  the commutators of Hardy type operators","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we give a characterization of mixed $\\lambda$-central bounded\nmean oscillation space $\\mathrm{CBMO}^{\\vec{q},\\lambda}(\\mathbb{R}^{n})$ via\nthe boundedness of the commutators of $n$-dimensional Hardy operator\n$\\mathcal{H}$ and its dual operator $\\mathcal{H}^{*}$ on mixed Lebesgue space\n$L^{\\vec{p}}(\\mathbb{R}^{n})$. In addition, we also establish the boundedness\nof commutators $\\mathcal{H}_{b}$ and $\\mathcal{H}^{*}_{b}$ generated with\n$\\mathrm{CBMO}^{\\vec{q},\\lambda}(\\mathbb{R}^{n})$ function $b$ on mixed\n$\\lambda$-central Morrey space $\\mathcal{B}^{\\vec{q},\\lambda}(\\mathbb{R}^{n})$,\nrespectively.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:04:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lu","Wenna",""],["Zhou","Jiang",""]]}
{"id":"2308.16109","submitter":"Elena Volodina","authors":"Elena Volodina (University of Gothenburg), Simon Dobnik (University of\n  Gothenburg), Therese Lindstr\\\"om Tiedemann (University of Helsinki), Xuan-Son\n  Vu (Ume{\\aa} university)","title":"Grandma Karl is 27 years old -- research agenda for pseudonymization of\n  research data","comments":"Big DataService 2023 conference, 2023 Workshop on Big Data and\n  Machine Learning with Privacy Enhancing Tech, IEEE Catalog Number:\n  CFP23A91-ART, ISBN: 979-8-3503-3379-4","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Accessibility of research data is critical for advances in many research\nfields, but textual data often cannot be shared due to the personal and\nsensitive information which it contains, e.g names or political opinions.\nGeneral Data Protection Regulation (GDPR) suggests pseudonymization as a\nsolution to secure open access to research data, but we need to learn more\nabout pseudonymization as an approach before adopting it for manipulation of\nresearch data. This paper outlines a research agenda within pseudonymization,\nnamely need of studies into the effects of pseudonymization on unstructured\ndata in relation to e.g. readability and language assessment, as well as the\neffectiveness of pseudonymization as a way of protecting writer identity, while\nalso exploring different ways of developing context-sensitive algorithms for\ndetection, labelling and replacement of personal information in unstructured\ndata. The recently granted project on pseudonymization Grandma Karl is 27 years\nold addresses exactly those challenges.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:04:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Volodina","Elena","","University of Gothenburg"],["Dobnik","Simon","","University of\n  Gothenburg"],["Tiedemann","Therese Lindstr\u00f6m","","University of Helsinki"],["Vu","Xuan-Son","","Ume\u00e5 university"]]}
{"id":"2308.16110","submitter":"Mengping Yang","authors":"Mengping Yang, Zhe Wang, Wenyi Feng, Qian Zhang, Ting Xiao","title":"Improving Few-shot Image Generation by Structural Discrimination and\n  Textural Modulation","comments":"To appear in ACM MM 2023, code is available at\n  https://github.com/kobeshegu/SDTM-GAN-ACMMM-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Few-shot image generation, which aims to produce plausible and diverse images\nfor one category given a few images from this category, has drawn extensive\nattention. Existing approaches either globally interpolate different images or\nfuse local representations with pre-defined coefficients. However, such an\nintuitive combination of images/features only exploits the most relevant\ninformation for generation, leading to poor diversity and coarse-grained\nsemantic fusion. To remedy this, this paper proposes a novel textural\nmodulation (TexMod) mechanism to inject external semantic signals into internal\nlocal representations. Parameterized by the feedback from the discriminator,\nour TexMod enables more fined-grained semantic injection while maintaining the\nsynthesis fidelity. Moreover, a global structural discriminator (StructD) is\ndeveloped to explicitly guide the model to generate images with reasonable\nlayout and outline. Furthermore, the frequency awareness of the model is\nreinforced by encouraging the model to distinguish frequency signals. Together\nwith these techniques, we build a novel and effective model for few-shot image\ngeneration. The effectiveness of our model is identified by extensive\nexperiments on three popular datasets and various settings. Besides achieving\nstate-of-the-art synthesis performance on these datasets, our proposed\ntechniques could be seamlessly integrated into existing models for a further\nperformance boost.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:10:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yang","Mengping",""],["Wang","Zhe",""],["Feng","Wenyi",""],["Zhang","Qian",""],["Xiao","Ting",""]]}
{"id":"2308.16111","submitter":"Jakob Hofstad","authors":"Jakob Hofstad","title":"Behavior of the Minimum Degree Throughout the $d$-process","comments":"22 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.PR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The $d$-process generates a graph at random by starting with an empty graph\nwith $n$ vertices, then adding edges one at a time uniformly at random among\nall pairs of vertices which have degrees at most $d-1$ and are not mutually\njoined. We show that, in the evolution of a random graph with $n$ vertices\nunder the $d$-process, with high probability, for each $j \\in\n\\{0,1,\\dots,d-2\\}$, the minimum degree jumps from $j$ to $j+1$ when there are\n$\\Theta(\\ln(n)^{d-j-1})$ steps left. This answers a question of Ruci\\'nski.\nMore specifically, we show that, when the last vertex of degree $j$ disappears,\nthe number of steps left divided by $\\ln(n)^{d-j-1}$ converges in distribution\nto the exponential random variable of mean $\\frac{j!}{2(d-1)!}$; furthermore,\nthese $d-1$ distributions are independent.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:13:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hofstad","Jakob",""]]}
{"id":"2308.16112","submitter":"Weizhe Zhang","authors":"Weizhe Zhang, Max Makurat, Xue Liu, Xiaofang Kang, Xiaoting Liu,\n  Yanglizhi Li, Thomas J.F. Kock, Christopher Leist, Clement Maheu, Hikmet\n  Sezen, Lin Jiang, Dario Calvani, Andy Jiao, Ismail Eren, Francesco Buda,\n  Agnieszka Kuc, Thomas Heine, Haoyuan Qi, Xinliang Feng, Jan P. Hofmann, Ute\n  Kaiser, Luzhao Sun, Zhongfan Liu, Gregory F. Schneider","title":"Giant proton transmembrane transport through sulfophenylated graphene in\n  a direct methanol fuel cell","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An ideal proton exchange membrane should only permeate protons and be leak\ntight for fuels. Graphene is impermeable to water and poorly conducting to\nprotons. Here, we chemically functionalized monolayer graphene to install\nsulfophenylated sp3 dislocations by diazotization. Selective to protons,\ntransmembrane areal conductances are up to ~50 S/cm2, which is ~5000 fold\nhigher than in pristine graphene. Mounted in a direct methanol fuel cell,\nsulfophenylated graphene resulted in power densities up to 1.6 W/mg or 123\nmW/cm under standard cell operation (60 C), a value ~two-fold larger than\nmicron-thick films of Nafion 117. The combination of sp3 dislocations and polar\ngroups, therefore, allow the creation of hydrophilic ion paths through graphene\nand unveils a novel route to rationalize transmembrane hydron transport through\n2D materials.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:14:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Weizhe",""],["Makurat","Max",""],["Liu","Xue",""],["Kang","Xiaofang",""],["Liu","Xiaoting",""],["Li","Yanglizhi",""],["Kock","Thomas J. F.",""],["Leist","Christopher",""],["Maheu","Clement",""],["Sezen","Hikmet",""],["Jiang","Lin",""],["Calvani","Dario",""],["Jiao","Andy",""],["Eren","Ismail",""],["Buda","Francesco",""],["Kuc","Agnieszka",""],["Heine","Thomas",""],["Qi","Haoyuan",""],["Feng","Xinliang",""],["Hofmann","Jan P.",""],["Kaiser","Ute",""],["Sun","Luzhao",""],["Liu","Zhongfan",""],["Schneider","Gregory F.",""]]}
{"id":"2308.16113","submitter":"Miko{\\l}aj Spytek","authors":"Miko{\\l}aj Spytek and Mateusz Krzyzi\\'nski and Sophie Hanna Langbein\n  and Hubert Baniecki and Marvin N. Wright and Przemys{\\l}aw Biecek","title":"survex: an R package for explaining machine learning survival models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to their flexibility and superior performance, machine learning models\nfrequently complement and outperform traditional statistical survival models.\nHowever, their widespread adoption is hindered by a lack of user-friendly tools\nto explain their internal operations and prediction rationales. To tackle this\nissue, we introduce the survex R package, which provides a cohesive framework\nfor explaining any survival model by applying explainable artificial\nintelligence techniques. The capabilities of the proposed software encompass\nunderstanding and diagnosing survival models, which can lead to their\nimprovement. By revealing insights into the decision-making process, such as\nvariable effects and importances, survex enables the assessment of model\nreliability and the detection of biases. Thus, transparency and responsibility\nmay be promoted in sensitive areas, such as biomedical research and healthcare\napplications.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:14:20 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Spytek","Miko\u0142aj",""],["Krzyzi\u0144ski","Mateusz",""],["Langbein","Sophie Hanna",""],["Baniecki","Hubert",""],["Wright","Marvin N.",""],["Biecek","Przemys\u0142aw",""]]}
{"id":"2308.16114","submitter":"Giovanni Scala","authors":"Giovanni Scala, Seyed Arash Ghoreishi, Marcin Paw{\\l}owski","title":"Revisiting Hyperbit Limitations unveils Quantum Communication Advantages","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Paw\\l owski and Winter's Hyperbit Theory, proposed in 2012, presented itself\nas a captivating alternative to quantum theory, suggesting novel ways of\nredefining entanglement and classical communication paradigms. This research\nundertakes a meticulous reevaluation of Hyperbit Theory, uncovering significant\noperational constraints that question its equivalence with quantum mechanics.\nCrucially, the supposition that Hyperbit Theory and Quantum Theory are\nequivalent relies on the receiver having unattainable additional knowledge\nabout the sender's laboratory, indicating that the work by Paw\\l owski and\nWinter is incorrect. This study accentuates the constraints of hyperbits in\ninformation processing and sheds light on the superiority of quantum\ncommunication, thereby advancing the investigation at the intersection of\nclassical and quantum communication.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:14:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Scala","Giovanni",""],["Ghoreishi","Seyed Arash",""],["Paw\u0142owski","Marcin",""]]}
{"id":"2308.16115","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"System size dependence of hadronic rescattering effect at LHC energies","comments":"26 pages, 8 captioned figures, 2 tables, authors from page 20,\n  submitted to PRC, figures at http://alice-publications.web.cern.ch/node/9597","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-175","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The first measurements of $\\mathrm{K^{*}(892)^{0}}$ resonance production as a\nfunction of charged-particle multiplicity in Xe$-$Xe collisions at\n$\\sqrt{s_{\\mathrm{NN}}}=$ 5.44 TeV and pp collisions at $\\sqrt{s}=$ 5.02 TeV\nusing the ALICE detector are presented. The resonance is reconstructed at\nmidrapidity ($|y|< 0.5$) using the hadronic decay channel $\\mathrm{K^{*0}}\n\\rightarrow \\mathrm{K^{\\pm} \\pi^{\\mp}}$. Measurements of transverse-momentum\nintegrated yield, mean transverse-momentum, nuclear modification factor of\n$\\mathrm{K^{*0}}$, and yield ratios of resonance to stable hadron\n($\\mathrm{K^{*0}}$/K) are compared across different collision systems (pp,\np$-$Pb, Xe$-$Xe, and Pb$-$Pb) at similar collision energies to investigate how\nthe production of $\\mathrm{K^{*0}}$ resonances depends on the size of the\nsystem formed in these collisions. The hadronic rescattering effect is found to\nbe independent of the size of colliding systems and mainly driven by the\nproduced charged-particle multiplicity, which is a proxy of the volume of\nproduced matter at the chemical freeze-out. In addition, the production yields\nof $\\mathrm{K^{*0}}$ in Xe$-$Xe collisions are utilized to constrain the\ndependence of the kinetic freeze-out temperature on the system size using\nHRG-PCE model.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:14:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16116","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Multiplicity-dependent production of $\\Sigma(1385)^{\\pm}$ and\n  $\\Xi(1530)^{0}$ in pp collisions at $\\sqrt{s}=13$ TeV","comments":"30 pages, 10 captioned figures, 6 tables, authors from page 25,\n  submitted to JHEP, figures at http://alice-publications.web.cern.ch/node/9594","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-172","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The production yields of the $\\Sigma(1385)^{\\pm}$ and $\\Xi(1530)^{0}$\nresonances are measured in pp collisions at $\\sqrt{s}=13$ TeV with ALICE. The\nmeasurements are performed as a function of the charged particle multiplicity\n$\\langle \\mathrm{d}N_\\mathrm{ch}/\\mathrm{d}\\eta \\rangle$, which is related to\nthe energy density produced in the collision. The results include transverse\nmomentum ($p_{\\rm T}$) distributions, $p_{\\rm T}$-integrated yields, mean\ntransverse momenta of $\\Sigma(1385)^{\\pm}$ and $\\Xi(1530)^{0}$, as well as\nratios of the $p_{\\rm T}$-integrated resonance yields relative to yields of\nother hadron species. The $\\Sigma(1385)^{\\pm}/\\pi^{\\pm}$ and\n$\\Xi(1530)^{0}/\\pi^{\\pm}$ yield ratios are consistent with the trend of the\nenhancement of strangeness production from low to high multiplicity pp\ncollisions, which was previously observed for strange and multi-strange\nbaryons. The yield ratio between the measured resonances and the long-lived\nbaryons with the same strangeness content exhibits a hint of a mild increasing\ntrend at low multiplicity, despite too large uncertainties to exclude the flat\nbehaviour. The results are compared to predictions from models such as EPOS-LHC\nand PYTHIA 8 with Rope shoving. The latter provides the best description of the\nmultiplicity dependence of the $\\Sigma(1385)^{\\pm}$ and $\\Xi(1530)^{0}$\nproduction in pp collisions at $\\sqrt{s}=13$ TeV.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:15:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16117","submitter":"Timothy Rupert","authors":"Pulkit Garg, Daniel S. Gianola, Timothy J. Rupert","title":"Strengthening from dislocation restructuring and local climb at platelet\n  linear complexions in Al-Cu 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":"  Stress-driven segregation at dislocations can lead to structural transitions\nbetween different linear complexion states. In this work, we examine how\nplatelet array linear complexions influence dislocation motion and quantify the\nassociated strengthening effect in Al-Cu alloys using atomistic simulations.\nThe presence of platelet complexions leads to faceting of the dislocations,\nwith nanoscale segments climbing upwards along the platelet growth direction,\nresulting in a complex non-planar configuration that restricts subsequent\ndislocation motion. Upon deformation, the leading partial dislocation must\nclimb down from the platelet complexions first, followed by a similar sequence\nat the trailing partial dislocation, in order to overcome the precipitates and\ncommence plastic slip. The dislocation depinning mechanism of linear\ncomplexions is strikingly different from traditional precipitation-strengthened\nalloys, where dislocations overcome obstacles by either shearing through or\nlooping around obstacles. The critical shear stress required to unpin\ndislocations from platelet complexions is found to be inversely proportional to\nprecipitate spacing, which includes not just the open space (as observed in\nOrowan bowing) but also the region along the platelet particle where climb\noccurs. Thus, platelet linear complexions provide a new way to modify\ndislocation structure directly and improve the mechanical properties of metal\nalloys.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:16:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Garg","Pulkit",""],["Gianola","Daniel S.",""],["Rupert","Timothy J.",""]]}
{"id":"2308.16118","submitter":"Damian Hodel","authors":"Damian Hodel and Jevin West","title":"Response: Emergent analogical reasoning in large language models","comments":"Response to publication in Nature Human Behaviour titled \"Emergent\n  analogical reasoning in large language models,\" (Webb, Holyoak, and Lu, 2023,\n  arXiv:2212.09196). 9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In their recent Nature Human Behaviour paper, \"Emergent analogical reasoning\nin large language models,\" (Webb, Holyoak, and Lu, 2023) the authors argue that\n\"large language models such as GPT-3 have acquired an emergent ability to find\nzero-shot solutions to a broad range of analogy problems.\" In this response, we\nprovide counterexamples of the letter string analogies. In our tests, GPT-3\nfails to solve even the easiest variants of the problems presented in the\noriginal paper. Zero-shot reasoning is an extraordinary claim that requires\nextraordinary evidence. We do not see that evidence in our experiments. To\nstrengthen claims of humanlike reasoning such as zero-shot reasoning, it is\nimportant that the field develop approaches that rule out data memorization.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:17:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hodel","Damian",""],["West","Jevin",""]]}
{"id":"2308.16119","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"K$^{*}$(892)$^{\\pm}$ resonance production in Pb$-$Pb collisions at\n  $\\sqrt{s_{\\rm NN}}$ = 5.02 TeV","comments":"26 pages, 8 captioned figures, 3 tables, authors from page 21,\n  submitted to PRC, figures at http://alice-publications.web.cern.ch/node/9596","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-176","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The production of K$^*$(892)$^\\pm$ meson resonance is measured at midrapidity\n($|y|<0.5$) in Pb-Pb collisions at $\\sqrt{s_{\\rm NN}}=5.02$ TeV using the ALICE\ndetector at the LHC. The resonance is reconstructed via its hadronic decay\nchannel K$^*$(892)$^\\pm \\rightarrow \\rm{K^0_S \\pi^\\pm}$. The transverse\nmomentum distributions are obtained for various centrality intervals in the\n$p_{\\rm T}$ range of 0.4-16 GeV/$c$. The reported measurements of integrated\nyields, mean transverse momenta, and particle yield ratios are consistent with\nprevious ALICE measurements for K$^*$(892)$^0$. The $p_{\\rm T}$-integrated\nyield ratio 2K$^*$(892)$^\\pm$/($\\rm{K^+ + K^-}$) in central Pb-Pb collisions\nshows a significant suppression (9.3$\\sigma$) relative to pp collisions.\nThermal model calculations overpredict the particle yield ratio. Although both\nsimulations consider the hadronic phase, only HRG-PCE accurately represents the\nmeasurements, whereas MUSIC+SMASH tends to overpredict them. These\nobservations, along with the kinetic freeze-out temperatures extracted from the\nyields of light-flavored hadrons using the HRG-PCE model, indicate a finite\nhadronic phase lifetime, which increases towards central collisions. The\n$p_{\\rm T}$-differential yield ratios 2K$^*$(892)$^\\pm$/($\\rm{K^+ + K^-}$) and\n2K$^*$(892)$^\\pm$/($\\rm{\\pi^+ + \\pi^-}$) are suppressed by up to a factor of\nfive at $p_{\\rm T}<2$ GeV/$c$ in central Pb-Pb collisions compared to pp\ncollisions at $\\sqrt{s} =$ 5.02 TeV. Both particle ratios and are qualitatively\nconsistent with expectations for rescattering effects in the hadronic phase.\nThe nuclear modification factor shows a smooth evolution with centrality and is\nbelow unity at $p_{\\rm T}>8$ GeV/$c$, consistent with measurements for other\nlight-flavored hadrons. The smallest values are observed in most central\ncollisions, indicating larger energy loss of partons traversing the dense\nmedium.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:18:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16120","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Exploring the strong interaction of three-body systems at the LHC","comments":"24 pages, 3 captioned figures, 1 table, authors from page 18, figures\n  at http://alice-publications.web.cern.ch/node/9595","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-181","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deuterons are atomic nuclei composed of a neutron and a proton held together\nby the strong interaction. Unbound ensembles composed of a deuteron and a third\nnucleon have been investigated in the past using scattering experiments and\nthey constitute a fundamental reference in nuclear physics to constrain nuclear\ninteractions and the properties of nuclei. In this work K$^{+}-$d and p$-$d\nfemtoscopic correlations measured by the ALICE Collaboration in proton$-$proton\n(pp) collisions at $\\sqrt{s}=13$ TeV at the Large Hadron Collider (LHC) are\npresented. It is demonstrated that correlations in momentum space between\ndeuterons and kaons or protons allow us to study three-hadron systems at\ndistances comparable with the proton radius. The analysis of the K$^{+}-$d\ncorrelation shows that the relative distances at which deuterons and\nproton/kaons are produced are around 2 fm. The analysis of the p$-$d\ncorrelation shows that only a full three-body calculation that accounts for the\ninternal structure of the deuteron can explain the data. In particular, the\nsensitivity of the observable to the short-range part of the interaction is\ndemonstrated. These results indicate that correlations involving light nuclei\nin pp collisions at the LHC will also provide access to any three-body systems\nin the strange and charm sectors.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:19:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16121","submitter":"Adam Hennessy","authors":"A. Hennessy, R. L. C. Starling, A. Rowlinson, I. de Ruiter, A. Kumar,\n  R. A. J. Eyles-Ferris, A. K. Ror, G. E. Anderson, K. Gourdji, A. J. van der\n  Horst, S. B. Pandey, T. W. Shimwell, D. Steeghs, N. Stylianou, S. ter Veen,\n  K. Wiersema, R. A. M. J. Wijers","title":"A LOFAR prompt search for radio emission accompanying X-ray flares in\n  GRB 210112A","comments":"13 pages, 7 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":"  The composition of relativistic gamma-ray burst (GRB) jets and their emission\nmechanisms are still debated, and they could be matter or magnetically\ndominated. One way to distinguish these mechanisms arises because a Poynting\nflux dominated jet may produce low-frequency radio emission during the\nenergetic prompt phase, through magnetic reconnection at the shock front. We\npresent a search for radio emission coincident with three GRB X-ray flares with\nthe LOw Frequency ARray (LOFAR), in a rapid response mode follow-up of long GRB\n210112A (at z~2) with a 2 hour duration, where our observations began 511\nseconds after the initial swift-BAT trigger. Using timesliced imaging at\n120-168 MHz, we obtain upper limits at 3 sigma confidence of 42 mJy averaging\nover 320 second snapshot images, and 87 mJy averaging over 60 second snapshot\nimages. LOFAR's fast response time means that all three potential radio\ncounterparts to X-ray flares are observable after accounting for dispersion at\nthe estimated source redshift. Furthermore, the radio pulse in the magnetic\nwind model was expected to be detectable at our observing frequency and flux\ndensity limits which allows us to disfavour a region of parameter space for\nthis GRB. However, we note that stricter constraints on redshift and the\nfraction of energy in the magnetic field are required to further test jet\ncharacteristics across the GRB population.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:19:36 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hennessy","A.",""],["Starling","R. L. C.",""],["Rowlinson","A.",""],["de Ruiter","I.",""],["Kumar","A.",""],["Eyles-Ferris","R. A. J.",""],["Ror","A. K.",""],["Anderson","G. E.",""],["Gourdji","K.",""],["van der Horst","A. J.",""],["Pandey","S. B.",""],["Shimwell","T. W.",""],["Steeghs","D.",""],["Stylianou","N.",""],["ter Veen","S.",""],["Wiersema","K.",""],["Wijers","R. A. M. J.",""]]}
{"id":"2308.16122","submitter":"Yuta Sato","authors":"Yuta Sato, Pak Hei Lam, Shruti Gupta, Fareesah Hussain","title":"Spatial Graph Coarsening: Weather and Weekday Prediction with London's\n  Bike-Sharing Service using GNN","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study introduced the use of Graph Neural Network (GNN) for predicting\nthe weather and weekday of a day in London, from the dataset of Santander\nCycles bike-sharing system as a graph classification task. The proposed GNN\nmodels newly introduced (i) a concatenation operator of graph features with\ntrained node embeddings and (ii) a graph coarsening operator based on\ngeographical contiguity, namely \"Spatial Graph Coarsening\". With the node\nfeatures of land-use characteristics and number of households around the bike\nstations and graph features of temperatures in the city, our proposed models\noutperformed the baseline model in cross-entropy loss and accuracy of the\nvalidation dataset.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:21:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sato","Yuta",""],["Lam","Pak Hei",""],["Gupta","Shruti",""],["Hussain","Fareesah",""]]}
{"id":"2308.16123","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Probing the Chiral Magnetic Wave with charge-dependent flow measurements\n  in Pb-Pb collisions at the LHC","comments":"26 pages, 6 captioned figures, 2 tables, authors from page 20,\n  submitted to JHEP, figures at http://alice-publications.web.cern.ch/node/9603","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-191","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Chiral Magnetic Wave (CMW) phenomenon is essential to provide insights\ninto the strong interaction in QCD, the properties of the quark-gluon plasma,\nand the topological characteristics of the early universe, offering a deeper\nunderstanding of fundamental physics in high-energy collisions. Measurements of\nthe charge-dependent anisotropic flow coefficients are studied in Pb-Pb\ncollisions at center-of-mass energy per nucleon-nucleon collision\n$\\sqrt{s_{\\mathrm{NN}}}=$ 5.02 TeV to probe the CMW. In particular, the slope\nof the normalized difference in elliptic ($v_{2}$) and triangular ($v_{3}$)\nflow coefficients of positively and negatively charged particles as a function\nof their event-wise normalized number difference, is reported for inclusive and\nidentified particles. The slope $r_{3}^{\\rm Norm}$ is found to be larger than\nzero and to have a magnitude similar to $r_{2}^{\\rm Norm}$, thus pointing to a\nlarge background contribution for these measurements. Furthermore, $r_{2}^{\\rm\nNorm}$ can be described by a blast wave model calculation that incorporates\nlocal charge conservation. In addition, using the event shape engineering\ntechnique yields a fraction of CMW ($f_{\\rm CMW}$) contribution to this\nmeasurement which is compatible with zero. This measurement provides the very\nfirst upper limit for $f_{\\rm CMW}$, and in the 10-60% centrality interval it\nis found to be 26% (38%) at 95% (99.7%) confidence level.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:21:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16124","submitter":"Vandana Dwarka","authors":"Alex Quinlan, Vandana Dwarka, Ihor Holod and Matthias Hoelzl","title":"Towards Robust Solvers for Nuclear Fusion Simulations Using JOREK: A\n  Numerical Analysis Perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the most well-established codes for modeling non-linear\nMagnetohydrodynamics (MHD) for tokamak reactors is JOREK, which solves these\nequations with a B\\'ezier surface based finite element method. This code\nproduces a highly sparse but also very large linear system. The main solver\nbehind the code uses the Generalized Minimum Residual Method (GMRES) with a\nphysics-based preconditioner, but even with the preconditioner there are issues\nwith memory and computation costs and the solver does not always converge well.\nThis work contains the first thorough study of the mathematical properties of\nthe underlying linear system. It enables us to diagnose and pinpoint the cause\nof hampered convergence. In particular, analyzing the spectral properties of\nthe matrix and the preconditioned system with numerical linear algebra\ntechniques, will open the door to research and investigate more performant\nsolver strategies, such as projection methods.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:21:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Quinlan","Alex",""],["Dwarka","Vandana",""],["Holod","Ihor",""],["Hoelzl","Matthias",""]]}
{"id":"2308.16125","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Prompt and non-prompt J$/\\psi$ production at midrapidity in Pb$-$Pb\n  collisions at $\\sqrt{s_{\\mathrm{NN}}}$ = 5.02 TeV","comments":"35 pages, 12 captioned figures, 3 tables, authors from page 29,\n  submitted to JHEP, figures at http://alice-publications.web.cern.ch/node/9601","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-190","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The transverse momentum ($p_{\\rm T}$) and centrality dependence of the\nnuclear modification factor $R_{\\rm AA}$ of prompt and non-prompt J$/\\psi$, the\nlatter originating from the weak decays of beauty hadrons, have been measured\nby the ALICE collaboration in Pb$-$Pb collisions at $\\sqrt{s_{\\mathrm{NN}}}$ =\n5.02 TeV. The measurements are carried out through the ${\\rm e}^{+}{\\rm e}^{-}$\ndecay channel at midrapidity ($|y| < 0.9$) in the transverse momentum region\n$1.5 < p_{\\rm T} < 10$ GeV/$c$. Both prompt and non-prompt J$/\\psi$\nmeasurements indicate a significant suppression for $p_{\\rm T} >$ 5 GeV/$c$,\nwhich becomes stronger with increasing collision centrality. The results are\nconsistent with similar LHC measurements in the overlapping $p_{\\rm T}$\nintervals, and cover the kinematic region down to $p_{\\rm T}$ = 1.5 GeV/$c$ at\nmidrapidity, not accessible by other LHC experiments. The suppression of prompt\nJ$/\\psi$ in central and semicentral collisions exhibits a decreasing trend\ntowards lower transverse momentum, described within uncertainties by models\nimplementing J$/\\psi$ production from recombination of c and $\\overline{\\rm c}$\nquarks produced independently in different partonic scatterings. At high\ntransverse momentum, transport models including quarkonium dissociation are\nable to describe the suppression for prompt J$/\\psi$. For non-prompt J$/\\psi$,\nthe suppression predicted by models including both collisional and radiative\nprocesses for the computation of the beauty-quark energy loss inside the\nquark$-$gluon plasma is consistent with measurements within uncertainties.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:22:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16126","submitter":"Karl Audun Borgersen","authors":"Karl Audun Kagnes Borgersen, Morten Goodwin, Jivitesh Sharma, Tobias\n  Aasmoe, Mari Leonhardsen, Gro Herredsvela R{\\o}rvik","title":"CorrEmbed: Evaluating Pre-trained Model Image Similarity Efficacy with a\n  Novel Metric","comments":"Accepted to AI-2023 Forty-third SGAI International Conference on\n  Artificial Intelligence","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Detecting visually similar images is a particularly useful attribute to look\nto when calculating product recommendations. Embedding similarity, which\nutilizes pre-trained computer vision models to extract high-level image\nfeatures, has demonstrated remarkable efficacy in identifying images with\nsimilar compositions. However, there is a lack of methods for evaluating the\nembeddings generated by these models, as conventional loss and performance\nmetrics do not adequately capture their performance in image similarity search\ntasks.\n  In this paper, we evaluate the viability of the image embeddings from\nnumerous pre-trained computer vision models using a novel approach named\nCorrEmbed. Our approach computes the correlation between distances in image\nembeddings and distances in human-generated tag vectors. We extensively\nevaluate numerous pre-trained Torchvision models using this metric, revealing\nan intuitive relationship of linear scaling between ImageNet1k accuracy scores\nand tag-correlation scores. Importantly, our method also identifies deviations\nfrom this pattern, providing insights into how different models capture\nhigh-level image features.\n  By offering a robust performance evaluation of these pre-trained models,\nCorrEmbed serves as a valuable tool for researchers and practitioners seeking\nto develop effective, data-driven approaches to similar item recommendations in\nfashion retail.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:23:07 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Borgersen","Karl Audun Kagnes",""],["Goodwin","Morten",""],["Sharma","Jivitesh",""],["Aasmoe","Tobias",""],["Leonhardsen","Mari",""],["R\u00f8rvik","Gro Herredsvela",""]]}
{"id":"2308.16127","submitter":"Chukiat Saksurakan","authors":"Sutawas Janreung, Tatpon Siripraparat, Chukiat Saksurakan","title":"On $L_{p}$- theory for integro-differential operators with spatially\n  dependent coefficients","comments":"arXiv admin note: text overlap with arXiv:1901.03830 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The parabolic integro-differential Cauchy problem with spatially dependent\ncoefficients is considered in generalized Bessel potential spaces where\nsmoothness is defined by L\\'evy measures with O-regularly varying profile. The\ncoefficients are assumed to be bounded and H\\\"older continuous in the spatial\nvariable. Our results can cover interesting classes of L\\'evy measures that go\nbeyond those comparable to $dy/\\left|y\\right|^{d+\\alpha}$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:23:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Janreung","Sutawas",""],["Siripraparat","Tatpon",""],["Saksurakan","Chukiat",""]]}
{"id":"2308.16128","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Measurements of jet quenching using semi-inclusive hadron+jet\n  distributions in pp and central Pb$-$Pb collisions at $\\sqrt{s_{\\rm\n  NN}}=5.02$ TeV","comments":"53 pages, 21 captioned figures, 4 tables, authors from page 47,\n  submitted to PRC, figures at http://alice-publications.web.cern.ch/node/9599","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-188","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ALICE Collaboration reports measurements of the semi-inclusive\ndistribution of charged-particle jets recoiling from a high transverse momentum\n(high $p_{\\rm T}$) charged hadron, in pp and central Pb$-$Pb collisions at\ncenter of mass energy per nucleon$-$nucleon collision $\\sqrt{s_{\\rm NN}}=5.02$\nTeV. The large uncorrelated background in central Pb$-$Pb collisions is\ncorrected using a data-driven statistical approach, which enables precise\nmeasurement of recoil jet distributions over a broad range in $p_{\\rm\nT,ch\\,jet}$ and jet resolution parameter $R$. Recoil jet yields are reported\nfor $R=0.2$, 0.4, and 0.5 in the range $7 < p_{\\rm T,ch\\, jet} < 140$ GeV$/c$\nand $\\pi/2<\\Delta\\varphi<\\pi$, where $\\Delta\\varphi$ is the azimuthal angular\nseparation between hadron trigger and recoil jet. The low $p_{\\rm T,ch\\,jet}$\nreach of the measurement explores unique phase space for studying jet\nquenching, the interaction of jets with the quark-gluonnplasma generated in\nhigh-energy nuclear collisions. Comparison of $p_{\\rm T,ch\\,jet}$ distributions\nfrom pp and central Pb$-$Pb collisions probes medium-induced jet energy loss\nand intra-jet broadening, while comparison of their acoplanarity distributions\nexplores in-medium jet scattering and medium response. The measurements are\ncompared to theoretical calculations incorporating jet quenching.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:25:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16129","submitter":"Francesco Petitta","authors":"Francesco Balducci, Francescantonio Oliva, Francesco Petitta","title":"Finite energy solutions for nonlinear elliptic equations with competing\n  gradient, singular and $L^1$ terms","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 deal with the following boundary value problem\n  \\begin{equation*}\n  \\begin{cases}\n  -\\Delta_{p}u + g(u) | \\nabla u|^{p} = h(u)f & \\text{in $\\Omega$,} \\newline\n  u\\geq 0 & \\text{in $\\Omega$,} \\newline\n  u=0 & \\text{on $\\partial \\Omega$,} \\\n  \\end{cases}\n  \\end{equation*}\n  in a domain $\\Omega \\subset \\mathbb{R}^{N}$ $(N \\geq 2)$, where $1\\leq p<N $,\n$g$ is a positive and continuous function on $[0,\\infty)$, and $h$ is a\ncontinuous function on $[0,\\infty)$ (possibly blowing up at the origin). We\nshow how the presence of regularizing terms $h$ and $g$ allows to prove\nexistence of finite energy solutions for nonnegative data $f$ only belonging to\n$L^1(\\Omega)$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:25:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Balducci","Francesco",""],["Oliva","Francescantonio",""],["Petitta","Francesco",""]]}
{"id":"2308.16130","submitter":"Haocheng Hua","authors":"Haocheng Hua, Jie Xu, Yonina C. Eldar","title":"Near-Field 3D Localization via MIMO Radar: Cram\\'er-Rao Bound Analysis\n  and Estimator Design","comments":"13 pages (14 pages in Arxiv version..), 16 figures, submitted for\n  journal publication. arXiv admin note: substantial text overlap with\n  arXiv:2305.10986","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 a near-field multiple-input multiple-output (MIMO) radar\nsensing system, in which the transceivers with massive antennas aim to localize\nmultiple near-field targets in the three-dimensional (3D) space over unknown\ncluttered environments. We consider a spherical wavefront propagation with both\nchannel phase and amplitude variations over different antennas. Under this\nsetup, the unknown parameters include the 3D coordinates and complex reflection\ncoefficients of the targets, as well as the noise and interference covariance\nmatrix. First, by considering general transmit signal waveforms, we derive the\nFisher information matrix (FIM) corresponding to the 3D coordinates and the\ncomplex reflection coefficients of the targets and accordingly obtain the\nCram\\'er-Rao bound (CRB) for the 3D coordinates. This provides a performance\nbound for 3D near-field target localization. For the special single-target\ncase, we obtain the CRB in an analytical form, and analyze its asymptotic\nscaling behaviors with respect to the target distance and antenna size of the\ntransceiver. Next, to facilitate practical localization, we propose two\nestimators to localize targets based on the maximum likelihood (ML) criterion,\nnamely the 3D approximate cyclic optimization (3D-ACO) and the 3D cyclic\noptimization with white Gaussian noise (3D-CO-WGN), respectively. Numerical\nresults validate the asymptotic CRB analysis and show that the consideration of\nvarying channel amplitudes is vital to achieve accurate CRB and localization\nwhen the targets are close to the transceivers. It is also shown that the\nproposed estimators achieve localization performance close to the derived CRB\nunder various cluttered environments, thus validating their effectiveness in\npractical implementation. Furthermore, it is shown that transmit waveforms have\na significant impact on CRB and the localization performance.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:26:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hua","Haocheng",""],["Xu","Jie",""],["Eldar","Yonina C.",""]]}
{"id":"2308.16131","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Observation of medium-induced yield enhancement and acoplanarity\n  broadening of low-$p_\\mathrm{T}$ jets from measurements in pp and central\n  Pb$-$Pb collisions at $\\sqrt{s_{\\rm NN}}=5.02$ TeV","comments":"19 pages, 3 captioned figures, authors from page 13, submitted to\n  PRL, figures at http://alice-publications.web.cern.ch/node/9600","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-189","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ALICE Collaboration reports the measurement of semi-inclusive\ndistributions of charged-particle jets recoiling from a high transverse\nmomentum (high $p_{\\rm T}$) hadron trigger in proton$-$proton and central\nPb$-$Pb collisions at $\\sqrt{s_{\\rm NN}} = 5.02$ TeV. A data-driven statistical\nmethod is used to mitigate the large uncorrelated background in central Pb$-$Pb\ncollisions. Recoil jet distributions are reported for jet resolution parameter\n$R=0.2$, 0.4, and 0.5 in the range $7 < p_{\\rm T,jet} < 140$ GeV$/c$ and\ntrigger$-$recoil jet azimuthal separation $\\pi/2 < \\Delta\\varphi < \\pi$. The\nmeasurements exhibit a marked medium-induced jet yield enhancement at low\n$p_{\\rm T}$ and at large azimuthal deviation from $\\Delta\\varphi\\sim\\pi$. The\nenhancement is characterized by its dependence on $\\Delta\\varphi$, which has a\nslope that differs from zero by 4.7$\\sigma$. Comparisons to model calculations\nincorporating different formulations of jet quenching are reported. These\ncomparisons indicate that the observed yield enhancement arises from the\nresponse of the QGP medium to jet propagation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:26:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16132","submitter":"Silvain Rideau-Kikuchi","authors":"Silvain Rideau-Kikuchi","title":"Sur un th\\'eor\\`eme de Lang-Weil tordu, d'apr\\`es E. Hrushovski, K. V.\n  Shuddhodan et Y. Varshavsky","comments":"20 pages (in French language)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG math.LO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  These are the notes (in French) for a Bourbaki talk on the twisted Lang-Weil\nestimates of Hrushovski, following a recent proof of Shuddhodan and Varshavsky.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:27:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rideau-Kikuchi","Silvain",""]]}
{"id":"2308.16133","submitter":"Santiago Pinzon","authors":"Santiago Pinzon","title":"Strongly minimal reducts of ACVF","comments":"arXiv admin note: text overlap with arXiv:2211.00267","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\mathbb K=(K,+,\\cdot,v,\\Gamma)$ be an algebraically closed valued field\nand let $(G,\\+)$ be a $\\mathbb K$-definable group that is either the\nmultiplicative group or contains a finite index subgroup that is $\\mathbb\nK$-definably isomorphic to a $\\mathbb K$-definable subgroup of $(K,+)$. Then if\n$\\mathcal G=(G,\\+,\\ldots)$ is a strongly minimal non locally modular structure\ndefinable in $\\mathbb K$ and expanding $(G,\\oplus)$, it interprets an infinite\nfield.\n  This document is the PhD thesis of the author and it was advised by\nprofessors Assaf Hasson and Alf Onshuus.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:28:22 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pinzon","Santiago",""]]}
{"id":"2308.16134","submitter":"Bhavesh Chauhan","authors":"Bhavesh Chauhan, Mary Hall Reno, Carsten Rott, Ina Sarcevic","title":"Neutrino constraints on inelastic dark matter captured in the Sun","comments":"28 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The flux of neutrinos from annihilation of gravitationally captured dark\nmatter in the Sun has significant constraints from direct-detection\nexperiments. However, these constraints are relaxed for inelastic dark matter\nas inelastic dark matter interactions generate less energetic nuclear recoils\ncompared to elastic dark matter interactions. In this paper, we explore the\npossibility for large volume underground neutrino experiments to detect the\nneutrino flux from captured inelastic dark matter in the Sun. The neutrino\nspectrum has two components: a mono-energetic \"spike\" from pion and kaon decays\nat rest and a broad-spectrum \"shoulder\" from prompt primary meson decays. We\nfocus on detecting the shoulder neutrinos from annihilation of hadrophilic\ninelastic dark matter with masses in the range 4-100 GeV and the mass\nsplittings in up to 300 keV. We determine the event selection criterion for\nDUNE to identify GeV-scale muon neutrinos and anti-neutrinos originating from\nhadrophilic dark matter annihilation in the Sun, and forecast the sensitivity\nfrom contained events. We also map the current bounds from Super-Kamiokande and\nIceCube on elastic dark matter, as well as the projected limits from\nHyper-Kamiokande, to the parameter space of inelastic dark matter. We find that\nthere is a region of parameter space that these neutrino experiments are more\nsensitive to than the direct-detection experiments. For dark matter\nannihilation to heavy-quarks, the projected sensitivity of DUNE is weaker than\ncurrent (future) Super (Hyper) Kamiokande experiments. However, for the\nlight-quark channel, only the spike is observable and DUNE will be the most\nsensitive experiment.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:40:56 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chauhan","Bhavesh",""],["Reno","Mary Hall",""],["Rott","Carsten",""],["Sarcevic","Ina",""]]}
{"id":"2308.16135","submitter":"Philip S{\\o}rensen","authors":"Luca Di Luzio, Hector Gisbert, Philip S{\\o}rensen","title":"On the oscillating electric dipole moment induced by axion-fermion\n  couplings","comments":"17 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It has been recently claimed that the axion coupling to fermions is\nresponsible for an oscillating electric dipole moment (EDM) in the background\nof axion dark matter. In this work, we re-examine the derivation of this\neffect. Contrary to previous studies, we point out the physical relevance of an\naxion boundary term, which is crucial in restoring the axion shift symmetry and\ndrastically affects the EDM phenomenology. To describe the latter, we introduce\nthe notion of a time-integrated effective axion EDM, which encodes the boundary\nterm and whose magnitude depends on the oscillating regime. For slow\noscillations the boundary term washes out the standard oscillating EDM,\nresulting in an exact cancellation in the static limit. Conversely, during fast\noscillations, the boundary term amplifies the effective EDM. This new\nobservable is especially interesting in the case of the electron EDM.\nRemarkably, for an $\\mathcal{O}(1)$ axion-electron coupling, the overall size\nof the effective EDM in the intermediate oscillations regime is comparable to\nthe present static EDM limit.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:45:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Di Luzio","Luca",""],["Gisbert","Hector",""],["S\u00f8rensen","Philip",""]]}
{"id":"2308.16136","submitter":"Ursula Hamenst\\\"adt","authors":"Ursula Hamenst\\\"adt","title":"Actions of finitely generated groups on compact metric spaces","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\Gamma$ be a finitely generated group which admits an action by\nhomeomorphisms on a compact metrizable space $X$. We show that there is a\nmetric on $X$ defining the original topology such that for this metric, the\naction is by bi-Lipschitz transformations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:47:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hamenst\u00e4dt","Ursula",""]]}
{"id":"2308.16137","submitter":"Chi Han","authors":"Chi Han, Qifan Wang, Wenhan Xiong, Yu Chen, Heng Ji, Sinong Wang","title":"LM-Infinite: Simple On-the-Fly Length Generalization for Large Language\n  Models","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, there have been remarkable advancements in the performance\nof Transformer-based Large Language Models (LLMs) across various domains. As\nthese LLMs are deployed for increasingly complex tasks, they often face the\nneeds to conduct longer reasoning processes or understanding larger contexts.\nIn these situations, the length generalization failure of LLMs on long\nsequences become more prominent. Most pre-training schemes truncate training\nsequences to a fixed length (such as 2048 for LLaMa). LLMs often struggle to\ngenerate fluent texts, let alone carry out downstream tasks, after longer\ncontexts, even with relative positional encoding which is designed to cope with\nthis problem. Common solutions such as finetuning on longer corpora often\ninvolves daunting hardware and time costs and requires careful training process\ndesign. To more efficiently leverage the generation capacity of existing LLMs,\nwe theoretically and empirically investigate the main out-of-distribution (OOD)\nfactors contributing to this problem. Inspired by this diagnosis, we propose a\nsimple yet effective solution for on-the-fly length generalization,\nLM-Infinite, which involves only a $\\Lambda$-shaped attention mask and a\ndistance limit while requiring no parameter updates or learning. We find it\napplicable to a variety of LLMs using relative-position encoding methods.\nLM-Infinite is computational efficient with $O(n)$ time and space, and\ndemonstrates consistent fluency and generation quality to as long as 32k tokens\non ArXiv and OpenWebText2 datasets, with 2.72x decoding speedup. On downstream\ntask such as passkey retrieval, it continues to work on inputs much longer than\ntraining lengths where vanilla models fail immediately.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:47:51 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Han","Chi",""],["Wang","Qifan",""],["Xiong","Wenhan",""],["Chen","Yu",""],["Ji","Heng",""],["Wang","Sinong",""]]}
{"id":"2308.16138","submitter":"Brenden Ortiz","authors":"Brenden R. Ortiz, Hu Miao, Fazhi Yang, Eleanor M. Clements, David S.\n  Parker, Jiaqiang Yan, Andrew F. May, and Michael A. McGuire","title":"Evolution of highly anisotropic magnetism in the titanium-based kagome\n  metals LnTi$_3$Bi$_4$ (Ln: La...Gd$^{3+}$, Eu$^{2+}$, Yb$^{2+}$)","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":"  Here we present the family of titanium-based kagome metals of the form\nLnTi$_3$Bi$_4$ (Ln: La...Gd$^{3+}$, Eu$^{2+}$, Yb$^{2+}$). Single crystal\ngrowth methods are presented alongside detailed magnetic and thermodynamic\nmeasurements. The orthorhombic (\\textit{Fmmm}) LnTi$_3$Bi$_4$ family of\ncompounds exhibit slightly distorted titanium-based kagome nets interwoven with\nzig-zag lanthanide-based (Ln) chains. Crystals are easily exfoliated parallel\nto the kagome sheets and angular resolved photoemission (ARPES) measurements\nhighlight the intricacy of the electronic structure in these compounds, with\nDirac points existing at the Fermi level. The magnetic properties and the\nassociated anisotropy emerge from the quasi-1D zig-zag chains of Ln, and impart\na wide array of magnetic ground states ranging from anisotropic ferromagnetism\nto complex antiferromagnetism with a cascade of metamagnetic transitions.\nKagome metals continue to provide a rich direction for the exploration of\nmagnetic, topologic, and highly correlated behavior. Our work here introduces\nthe LnTi$_3$Bi$_4$ compounds to augment the continuously expanding suite of\ncomplex and interesting kagome materials.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:50:33 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ortiz","Brenden R.",""],["Miao","Hu",""],["Yang","Fazhi",""],["Clements","Eleanor M.",""],["Parker","David S.",""],["Yan","Jiaqiang",""],["May","Andrew F.",""],["McGuire","Michael A.",""]]}
{"id":"2308.16139","submitter":"Jan Egger","authors":"Jianning Li, Antonio Pepe, Christina Gsaxner, Gijs Luijten, Yuan Jin,\n  Narmada Ambigapathy, Enrico Nasca, Naida Solak, Gian Marco Melito, Afaque R.\n  Memon, Xiaojun Chen, Jan Stefan Kirschke, Ezequiel de la Rosa, Patrich\n  Ferndinand Christ, Hongwei Bran Li, David G. Ellis, Michele R. Aizenberg,\n  Sergios Gatidis, Thomas Kuestner, Nadya Shusharina, Nicholas Heller, Vincent\n  Andrearczyk, Adrien Depeursinge, Mathieu Hatt, Anjany Sekuboyina, Maximilian\n  Loeffler, Hans Liebl, Reuben Dorent, Tom Vercauteren, Jonathan Shapey, Aaron\n  Kujawa, Stefan Cornelissen, Patrick Langenhuizen, Achraf Ben-Hamadou, Ahmed\n  Rekik, Sergi Pujades, Edmond Boyer, Federico Bolelli, Costantino Grana, Luca\n  Lumetti, Hamidreza Salehi, Jun Ma, Yao Zhang, Ramtin Gharleghi, Susann Beier,\n  Arcot Sowmya, Eduardo A. Garza-Villarreal, Thania Balducci, Diego\n  Angeles-Valdez, Roberto Souza, Leticia Rittner, Richard Frayne, Yuanfeng Ji,\n  Soumick Chatterjee, Andreas Nuernberger, Joao Pedrosa, Carlos Ferreira,\n  Guilherme Aresta, Antonio Cunha, Aurelio Campilho, Yannick Suter, Jose\n  Garcia, Alain Lalande, Emmanuel Audenaert, Claudia Krebs, Timo Van Leeuwen,\n  Evie Vereecke, Rainer Roehrig, Frank Hoelzle, Vahid Badeli, Kathrin Krieger,\n  Matthias Gunzer, Jianxu Chen, Amin Dada, Miriam Balzer, Jana Fragemann,\n  Frederic Jonske, Moritz Rempe, Stanislav Malorodov, Fin H. Bahnsen,\n  Constantin Seibold, Alexander Jaus, Ana Sofia Santos, Mariana Lindo, Andre\n  Ferreira, Victor Alves, Michael Kamp, Amr Abourayya, Felix Nensa, Fabian\n  Hoerst, Alexander Brehmer, Lukas Heine, Lars E. Podleska, Matthias A. Fink,\n  Julius Keyl, Konstantinos Tserpes, Moon-Sung Kim, Shireen Elhabian, Hans\n  Lamecker, Dzenan Zukic, Beatriz Paniagua, Christian Wachinger, Martin\n  Urschler, Luc Duong, Jakob Wasserthal, Peter F. Hoyer, Oliver Basu, Thomas\n  Maal, Max J. H. Witjes, Ping Luo, Bjoern Menze, Mauricio Reyes, Christos\n  Davatzikos, Behrus Puladi, Jens Kleesiek, Jan Egger","title":"MedShapeNet -- A Large-Scale Dataset of 3D Medical Shapes for Computer\n  Vision","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.DB cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present MedShapeNet, a large collection of anatomical shapes (e.g., bones,\norgans, vessels) and 3D surgical instrument models. Prior to the deep learning\nera, the broad application of statistical shape models (SSMs) in medical image\nanalysis is evidence that shapes have been commonly used to describe medical\ndata. Nowadays, however, state-of-the-art (SOTA) deep learning algorithms in\nmedical imaging are predominantly voxel-based. In computer vision, on the\ncontrary, shapes (including, voxel occupancy grids, meshes, point clouds and\nimplicit surface models) are preferred data representations in 3D, as seen from\nthe numerous shape-related publications in premier vision conferences, such as\nthe IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), as\nwell as the increasing popularity of ShapeNet (about 51,300 models) and\nPrinceton ModelNet (127,915 models) in computer vision research. MedShapeNet is\ncreated as an alternative to these commonly used shape benchmarks to facilitate\nthe translation of data-driven vision algorithms to medical applications, and\nit extends the opportunities to adapt SOTA vision algorithms to solve critical\nmedical problems. Besides, the majority of the medical shapes in MedShapeNet\nare modeled directly on the imaging data of real patients, and therefore it\ncomplements well existing shape benchmarks comprising of computer-aided design\n(CAD) models. MedShapeNet currently includes more than 100,000 medical shapes,\nand provides annotations in the form of paired data. It is therefore also a\nfreely available repository of 3D models for extended reality (virtual reality\n- VR, augmented reality - AR, mixed reality - MR) and medical 3D printing. This\nwhite paper describes in detail the motivations behind MedShapeNet, the shape\nacquisition procedures, the use cases, as well as the usage of the online shape\nsearch portal: https://medshapenet.ikim.nrw/\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:52:20 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 07:26:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Jianning",""],["Pepe","Antonio",""],["Gsaxner","Christina",""],["Luijten","Gijs",""],["Jin","Yuan",""],["Ambigapathy","Narmada",""],["Nasca","Enrico",""],["Solak","Naida",""],["Melito","Gian Marco",""],["Memon","Afaque R.",""],["Chen","Xiaojun",""],["Kirschke","Jan Stefan",""],["de la Rosa","Ezequiel",""],["Christ","Patrich Ferndinand",""],["Li","Hongwei Bran",""],["Ellis","David G.",""],["Aizenberg","Michele R.",""],["Gatidis","Sergios",""],["Kuestner","Thomas",""],["Shusharina","Nadya",""],["Heller","Nicholas",""],["Andrearczyk","Vincent",""],["Depeursinge","Adrien",""],["Hatt","Mathieu",""],["Sekuboyina","Anjany",""],["Loeffler","Maximilian",""],["Liebl","Hans",""],["Dorent","Reuben",""],["Vercauteren","Tom",""],["Shapey","Jonathan",""],["Kujawa","Aaron",""],["Cornelissen","Stefan",""],["Langenhuizen","Patrick",""],["Ben-Hamadou","Achraf",""],["Rekik","Ahmed",""],["Pujades","Sergi",""],["Boyer","Edmond",""],["Bolelli","Federico",""],["Grana","Costantino",""],["Lumetti","Luca",""],["Salehi","Hamidreza",""],["Ma","Jun",""],["Zhang","Yao",""],["Gharleghi","Ramtin",""],["Beier","Susann",""],["Sowmya","Arcot",""],["Garza-Villarreal","Eduardo A.",""],["Balducci","Thania",""],["Angeles-Valdez","Diego",""],["Souza","Roberto",""],["Rittner","Leticia",""],["Frayne","Richard",""],["Ji","Yuanfeng",""],["Chatterjee","Soumick",""],["Nuernberger","Andreas",""],["Pedrosa","Joao",""],["Ferreira","Carlos",""],["Aresta","Guilherme",""],["Cunha","Antonio",""],["Campilho","Aurelio",""],["Suter","Yannick",""],["Garcia","Jose",""],["Lalande","Alain",""],["Audenaert","Emmanuel",""],["Krebs","Claudia",""],["Van Leeuwen","Timo",""],["Vereecke","Evie",""],["Roehrig","Rainer",""],["Hoelzle","Frank",""],["Badeli","Vahid",""],["Krieger","Kathrin",""],["Gunzer","Matthias",""],["Chen","Jianxu",""],["Dada","Amin",""],["Balzer","Miriam",""],["Fragemann","Jana",""],["Jonske","Frederic",""],["Rempe","Moritz",""],["Malorodov","Stanislav",""],["Bahnsen","Fin H.",""],["Seibold","Constantin",""],["Jaus","Alexander",""],["Santos","Ana Sofia",""],["Lindo","Mariana",""],["Ferreira","Andre",""],["Alves","Victor",""],["Kamp","Michael",""],["Abourayya","Amr",""],["Nensa","Felix",""],["Hoerst","Fabian",""],["Brehmer","Alexander",""],["Heine","Lukas",""],["Podleska","Lars E.",""],["Fink","Matthias A.",""],["Keyl","Julius",""],["Tserpes","Konstantinos",""],["Kim","Moon-Sung",""],["Elhabian","Shireen",""],["Lamecker","Hans",""],["Zukic","Dzenan",""],["Paniagua","Beatriz",""],["Wachinger","Christian",""],["Urschler","Martin",""],["Duong","Luc",""],["Wasserthal","Jakob",""],["Hoyer","Peter F.",""],["Basu","Oliver",""],["Maal","Thomas",""],["Witjes","Max J. H.",""],["Luo","Ping",""],["Menze","Bjoern",""],["Reyes","Mauricio",""],["Davatzikos","Christos",""],["Puladi","Behrus",""],["Kleesiek","Jens",""],["Egger","Jan",""]]}
{"id":"2308.16140","submitter":"Kohei Nishi","authors":"Kohei Nishi","title":"Intergroup Bias in Attitudes Toward Restrictions on Uncivil Political\n  Expression and Its Underlying Mechanisms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There appears to be a dilemma between the freedom of expression and\nprotection from the adverse effects of uncivil political expression online.\nWhile previous studies have revealed various factors that affect attitudes\ntoward freedom of expression and speech restrictions, it is less clear whether\npeople have intergroup biases when forming these attitudes. To address this\ngap, the present study conducted a pre-registered online survey experiment and\ninvestigated people's attitudes toward uncivil political expression by\nrandomizing its in-group and out-group affiliations. The results revealed that\npeople tend to perceive uncivil political expression directed from an out-group\ntoward an in-group as more uncivil, compared to the expression originating from\nan in-group toward an out-group. This difference subsequently influences their\ninclination to endorse speech restrictions when faced with uncivil political\ncomments: stronger support for restrictions on expressions from the out-group\ntoward the in-group as opposed to those from the in-group toward the out-group.\nThese findings should serve as a wake-up call to public opinion that advocates\nfor restrictions on uncivil political expression.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:52:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Nishi","Kohei",""]]}
{"id":"2308.16141","submitter":"Harriet {\\AA}hlgren Dr","authors":"D. Propst and J. Kotakoski and E. H. {\\AA}hlgren","title":"Impurity atom configurations in diamond and their visibility via\n  scanning transmission electron microscopy imaging","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dispersed impurities in diamond present a flourishing platform for research\nin quantum informatics, spintronics and single phonon emitters. Based on the\nvast pool of experimental and theoretical work describing impurity atoms in\ndiamond, we review the configurations by the chemical element discussing the\nrelevant atomic configurations and most important properties. Dopant structures\nexpand from single to co-doping configurations, also combined with carbon\nvacancies. Despite of their importance, not much is known about the exact\natomic configurations associated with the dopant structures beyond\ncomputational models, partially due to difficulties in their microscopic\nobservation. To assess the visibility of these structures, we carry out image\nsimulations to show that the heavier dopants may be easily discernible in\nscanning transmission electron microscopy annular dark field images, with a\nwindow of visibility of up to over $\\pm$ 10 nm in defocus. We further present\nthe first atomic resolution images of an impurity atom configuration\n(substitutional Er atom) in the diamond lattice, confirmed by a comparison to\nthe simulated images. Overall, our results demonstrate that there is a vast\nresearch field waiting for the microscopy community in resolving the exact\natomic structure of various impurity atom configurations in diamond.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:53:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Propst","D.",""],["Kotakoski","J.",""],["\u00c5hlgren","E. H.",""]]}
{"id":"2308.16142","submitter":"Jaroslav Scheinpflug","authors":"Jaroslav Scheinpflug and Martin Schnabl","title":"Closed string tachyon condensation revisited","comments":"35 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider condensation of nearly marginal matter tachyons in closed string\nfield theory and observe that upon restricting to a subspace of states not\ncontaining the ghost dilaton, the on-shell value of the action is proportional\nto the shift of the central charge of the matter CFT. This correspondence lets\nus find a novel conformal perturbation theory formula for the next-to-leading\norder shift of the central charge for a generic theory, which we test on\nZamolodchikov's flow between consecutive minimal models. Upon reintroduction of\nthe dilaton couplings, it is plausible to have a vanishing value of the\non-shell action.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:56:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Scheinpflug","Jaroslav",""],["Schnabl","Martin",""]]}
{"id":"2308.16143","submitter":"Jiandi Zou","authors":"Jiandi Zou","title":"Simple type theory for metaplectic covers of $\\mathrm{GL}(r)$ over a\n  non-archimedean local field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $F$ be a non-archimedean locally compact field of residual characteristic\n$p$, let $G=\\mathrm{GL}_{r}(F)$ and let $\\widetilde{G}$ be an $n$-fold\nmetaplectic cover of $G$ with $\\mathrm{gcd}(n,p)=1$. We study the category\n$\\mathrm{Rep}_{\\mathfrak{s}}(\\widetilde{G})$ of complex smooth representations\nof $\\widetilde{G}$ having inertial equivalence class\n$\\mathfrak{s}=(\\widetilde{M},\\mathcal{O})$, which is a block of the category\n$\\mathrm{Rep}(\\widetilde{G})$, following the \"type theoretical\" strategy of\nBushnell-Kutzko.\n  Precisely, first we construct a \"maximal simple type\"\n$(\\widetilde{J_{M}},\\widetilde{\\lambda}_{M})$ of $\\widetilde{M}$ as an\n$\\mathfrak{s}_{M}$-type, where $\\mathfrak{s}_{M}=(\\widetilde{M},\\mathcal{O})$\nis the related cuspidal inertial equivalence class of $\\widetilde{M}$. Along\nthe way, we prove the forklore conjecture that every cuspidal representation of\n$\\widetilde{M}$ could be constructed explicitly by a compact induction.\nSecondly, we construct \"simple types\" $(\\widetilde{J},\\widetilde{\\lambda})$ of\n$\\widetilde{G}$, and prove that each of them is an $\\mathfrak{s}$-type of a\ncertain block $\\mathrm{Rep}_{\\mathfrak{s}}(\\widetilde{G})$. When\n$\\widetilde{G}$ is either a Kazhdan-Patterson cover or Savin's cover, the\ncorresponding blocks turn out to be those containing discrete series\nrepresentations of $\\widetilde{G}$. Finally, for a simple type\n$(\\widetilde{J},\\widetilde{\\lambda})$ of $\\widetilde{G}$ we describe the\nrelated Hecke algebra $\\mathcal{H}(\\widetilde{G},\\widetilde{\\lambda})$, which\nturns out to be not far from an affine Hecke algebra of type A, and is exactly\nso if $\\widetilde{G}$ is one of the two special covers mentioned above.\n  We leave the construction of a \"semi-simple type\" related to a general block\n$\\mathrm{Rep}_{\\mathfrak{s}}(\\widetilde{G})$ to a future phase of the work.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:57:06 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zou","Jiandi",""]]}
{"id":"2308.16144","submitter":"Eric Mortenson","authors":"Eric T. Mortenson","title":"Short proofs of Ramanujan-like identities for the eighth order mock\n  theta function $V_{0}(q)$","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using Appell function properties we give short proofs of Ramanujan-like\nidentities for the eighth order mock theta function $V_0(q)$ after work of Chan\nand Mao; Mao; and Brietzke, da Silva, and Sellars. We also present a\ngeneralization of the identities in the spirit of celebrated results of\nBringmann, Ono, and Rhoades on Dyson's ranks and Maass forms.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:57:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mortenson","Eric T.",""]]}
{"id":"2308.16145","submitter":"Erkang Cheng","authors":"Hengxu Zhang, Pengpeng Liang, Zhiyong Sun, Bo Song, Erkang Cheng","title":"CircleFormer: Circular Nuclei Detection in Whole Slide Images with\n  Circle Queries and Attention","comments":"Accepted at MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Both CNN-based and Transformer-based object detection with bounding box\nrepresentation have been extensively studied in computer vision and medical\nimage analysis, but circular object detection in medical images is still\nunderexplored. Inspired by the recent anchor free CNN-based circular object\ndetection method (CircleNet) for ball-shape glomeruli detection in renal\npathology, in this paper, we present CircleFormer, a Transformer-based circular\nmedical object detection with dynamic anchor circles. Specifically, queries\nwith circle representation in Transformer decoder iteratively refine the\ncircular object detection results, and a circle cross attention module is\nintroduced to compute the similarity between circular queries and image\nfeatures. A generalized circle IoU (gCIoU) is proposed to serve as a new\nregression loss of circular object detection as well. Moreover, our approach is\neasy to generalize to the segmentation task by adding a simple segmentation\nbranch to CircleFormer. We evaluate our method in circular nuclei detection and\nsegmentation on the public MoNuSeg dataset, and the experimental results show\nthat our method achieves promising performance compared with the\nstate-of-the-art approaches. The effectiveness of each component is validated\nvia ablation studies as well. Our code is released at\nhttps://github.com/zhanghx-iim-ahu/CircleFormer.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:01:01 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 01:29:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Hengxu",""],["Liang","Pengpeng",""],["Sun","Zhiyong",""],["Song","Bo",""],["Cheng","Erkang",""]]}
{"id":"2308.16146","submitter":"John Peca-Medlin","authors":"John Peca-Medlin","title":"Growth factors of orthogonal matrices and local behavior of Gaussian\n  elimination with partial and complete pivoting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gaussian elimination (GE) is the most used dense linear solver. Error\nanalysis of GE with selected pivoting strategies on well-conditioned systems\ncan focus on studying the behavior of growth factors. Although exponential\ngrowth is possible with GE with partial pivoting (GEPP), growth tends to stay\nmuch smaller in practice. Support for this behavior was provided last year by\nHuang and Tikhomirov's average-case analysis of GEPP, which showed GEPP growth\nfactors stay at most polynomial with very high probability when using small\nGaussian perturbations. GE with complete pivoting (GECP) has also seen a lot of\nrecent interest, with recent improvements to lower bounds on worst-case GECP\ngrowth provided by Edelman and Urschel earlier this year. We are interested in\nstudying how GEPP and GECP behave on the same linear systems as well as\nstudying large growth on particular subclasses of matrices, including\northogonal matrices. We will also study systems when GECP leads to larger\ngrowth than GEPP, which will lead to new empirical lower bounds on how much\nworse GECP can behave compared to GEPP in terms of growth. We also present an\nempirical study on a family of exponential GEPP growth matrices whose\npolynomial behavior in small neighborhoods limits to the initial GECP growth\nfactor.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:01:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Peca-Medlin","John",""]]}
{"id":"2308.16147","submitter":"Javier Gonzalez-Conde","authors":"Javier Gonzalez-Conde, Andrew T. Sornborger","title":"Mixed Quantum-Semiclassical Simulation","comments":null,"journal-ref":null,"doi":null,"report-no":"LA-UR-23-29904","categories":"quant-ph gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the quantum simulation of mixed quantum-semiclassical (MQS) systems,\nof fundamental interest in many areas of physics, such as molecular scattering\nand gravitational backreaction. A basic question for these systems is whether\nquantum algorithms of MQS systems would be valuable at all, when one could\ninstead study the full quantum-quantum system. We study MQS simulations in the\ncontext where a semiclassical system is encoded in a Koopman-von Neumann (KvN)\nHamiltonian and a standard quantum Hamiltonian describes the quantum system. In\nthis case, because KvN and quantum Hamiltonians are constructed with the same\noperators on a Hilbert space, standard theorems guaranteeing simulation\nefficiency apply. We show that, in this context, $\\textit{many-body}$ MQS\nparticle simulations give only nominal improvements in qubit resources over\nquantum-quantum simulations due to logarithmic scaling in the ratio, $S_q/S_c$,\nof actions between quantum and semiclassical systems. However, $\\textit{field}$\nsimulations can give improvements proportional to the ratio of quantum to\nsemiclassical actions, $S_q/S_c$. Of particular note, due to the ratio $S_q/S_c\n\\sim 10^{-18}$ of particle and gravitational fields, this approach could be\nimportant for semiclassical gravity. We demonstrate our approach in a model of\ngravitational interaction, where a harmonic oscillator mediates the interaction\nbetween two spins. In particular, we demonstrate a lack of distillable\nentanglement generation between spins due to classical mediators, a distinct\ndifference in dynamics relative to the fully quantum case.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:02:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gonzalez-Conde","Javier",""],["Sornborger","Andrew T.",""]]}
{"id":"2308.16148","submitter":"Lei Du","authors":"Lei Du, Lingzhen Guo, Yan Zhang, and Anton Frisk Kockum","title":"Giant Emitters in a Structured Bath with Non-Hermitian Skin Effect","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Giant emitters derive their name from nonlocal field-emitter interactions and\nfeature diverse self-interference effects. Most of the existing works on giant\nemitters have considered Hermitian waveguides or photonic lattices. In this\nwork, we unveil how giant emitters behave if they are coupled to a\nnon-Hermitian bath, i.e., a Hatano-Nelson (HN) model which features a\nnon-Hermitian skin effect due to the asymmetric inter-site tunneling rates. We\nshow that the behaviors of the giant emitters are closely related to the\nstability of the bath. In the convectively unstable regime, where the HN model\ncan be mapped to a pseudo-Hermitian lattice, a giant emitter can either behave\nas in a Hermitian bath or undergo excitation amplification, depending on the\nrelative strength of different emitter-bath coupling paths. Based on this\nmechanism, we can realize protected nonreciprocal interactions between giant\nemitters, with nonreciprocity opposite to that of the bath. Such giant-emitter\neffects are not allowed, however, if the HN model enters the absolutely\nunstable regime, where the coupled emitters always show secular energy growth.\nOur proposal provides a new paradigm of non-Hermitian quantum optics, which may\nbe useful for, e.g., engineering effective interactions between quantum\nemitters and performing many-body simulations in the non-Hermitian framework.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:02:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Du","Lei",""],["Guo","Lingzhen",""],["Zhang","Yan",""],["Kockum","Anton Frisk",""]]}
{"id":"2308.16149","submitter":"Preslav Nakov","authors":"Neha Sengupta, Sunil Kumar Sahu, Bokang Jia, Satheesh Katipomu, Haonan\n  Li, Fajri Koto, Osama Mohammed Afzal, Samta Kamboj, Onkar Pandit, Rahul Pal,\n  Lalit Pradhan, Zain Muhammad Mujahid, Massa Baali, Alham Fikri Aji,\n  Zhengzhong Liu, Andy Hock, Andrew Feldman, Jonathan Lee, Andrew Jackson,\n  Preslav Nakov, Timothy Baldwin, Eric Xing","title":"Jais and Jais-chat: Arabic-Centric Foundation and Instruction-Tuned Open\n  Generative Large Language Models","comments":"Arabic-centric, foundation model, large-language model, LLM,\n  generative model, instruction-tuned, Jais, Jais-chat","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 Jais and Jais-chat, new state-of-the-art Arabic-centric\nfoundation and instruction-tuned open generative large language models (LLMs).\nThe models are based on the GPT-3 decoder-only architecture and are pretrained\non a mixture of Arabic and English texts, including source code in various\nprogramming languages. With 13 billion parameters, they demonstrate better\nknowledge and reasoning capabilities in Arabic than any existing open Arabic\nand multilingual models by a sizable margin, based on extensive evaluation.\nMoreover, the models are competitive in English compared to English-centric\nopen models of similar size, despite being trained on much less English data.\nWe provide a detailed description of the training, the tuning, the safety\nalignment, and the evaluation of the models. We release two open versions of\nthe model -- the foundation Jais model, and an instruction-tuned Jais-chat\nvariant -- with the aim of promoting research on Arabic LLMs. Available at\nhttps://huggingface.co/inception-mbzuai/jais-13b-chat\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:07:17 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sengupta","Neha",""],["Sahu","Sunil Kumar",""],["Jia","Bokang",""],["Katipomu","Satheesh",""],["Li","Haonan",""],["Koto","Fajri",""],["Afzal","Osama Mohammed",""],["Kamboj","Samta",""],["Pandit","Onkar",""],["Pal","Rahul",""],["Pradhan","Lalit",""],["Mujahid","Zain Muhammad",""],["Baali","Massa",""],["Aji","Alham Fikri",""],["Liu","Zhengzhong",""],["Hock","Andy",""],["Feldman","Andrew",""],["Lee","Jonathan",""],["Jackson","Andrew",""],["Nakov","Preslav",""],["Baldwin","Timothy",""],["Xing","Eric",""]]}
{"id":"2308.16150","submitter":"Ziyun Liang","authors":"Ziyun Liang, Harry Anthony, Felix Wagner, Konstantinos Kamnitsas","title":"Modality Cycles with Masked Conditional Diffusion for Unsupervised\n  Anomaly Segmentation in MRI","comments":"Accepted in Multiscale Multimodal Medical Imaging workshop in MICCAI\n  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":"  Unsupervised anomaly segmentation aims to detect patterns that are distinct\nfrom any patterns processed during training, commonly called abnormal or\nout-of-distribution patterns, without providing any associated manual\nsegmentations. Since anomalies during deployment can lead to model failure,\ndetecting the anomaly can enhance the reliability of models, which is valuable\nin high-risk domains like medical imaging. This paper introduces Masked\nModality Cycles with Conditional Diffusion (MMCCD), a method that enables\nsegmentation of anomalies across diverse patterns in multimodal MRI. The method\nis based on two fundamental ideas. First, we propose the use of cyclic modality\ntranslation as a mechanism for enabling abnormality detection.\nImage-translation models learn tissue-specific modality mappings, which are\ncharacteristic of tissue physiology. Thus, these learned mappings fail to\ntranslate tissues or image patterns that have never been encountered during\ntraining, and the error enables their segmentation. Furthermore, we combine\nimage translation with a masked conditional diffusion model, which attempts to\n`imagine' what tissue exists under a masked area, further exposing unknown\npatterns as the generative model fails to recreate them. We evaluate our method\non a proxy task by training on healthy-looking slices of BraTS2021\nmulti-modality MRIs and testing on slices with tumors. We show that our method\ncompares favorably to previous unsupervised approaches based on image\nreconstruction and denoising with autoencoders and diffusion models.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:16:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Liang","Ziyun",""],["Anthony","Harry",""],["Wagner","Felix",""],["Kamnitsas","Konstantinos",""]]}
{"id":"2308.16151","submitter":"Rujun Gao","authors":"Rujun Gao, Hillary E. Merzdorf, Saira Anwar, M. Cynthia Hipwell, Arun\n  Srinivasa","title":"Automatic assessment of text-based responses in post-secondary\n  education: A systematic review","comments":"26 pages, 4 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text-based open-ended questions in academic formative and summative\nassessments help students become deep learners and prepare them to understand\nconcepts for a subsequent test conceptually. However, grading text-based\nquestions, especially in large (>50 enrolled students) courses, is a tedious\nand time-costing process for instructors. Text processing models continue\nprogressing with the rapid development of Artificial Intelligence (AI) tools\nand Natural Language Processing (NLP) algorithms. Especially after\nbreakthroughs in Large Language Models (LLM), there is immense potential to\nautomate rapid assessment and feedback of text-based responses in education.\nThis systematic review adopts a scientific and reproducible literature search\nstrategy based on the PRISMA process using explicit inclusion and exclusion\ncriteria to study text-based automatic assessment systems in post-secondary\neducation, screening 838 papers and synthesizing 93 studies. To understand how\ntext-based automatic assessment systems have been developed and applied in\neducation in recent years, all included studies are summarized and categorized\naccording to a proposed comprehensive theoretical framework, including the\ninput and output of the automatic assessment system, research motivation, and\nresearch outcome, aiming to answer three research questions accordingly.\nAdditionally, the typical studies of automated assessment systems and\napplication domains in these studies are investigated and summarized. This\nsystematic review will provide an overview of recent educational applications\nof text-based assessment systems for understanding the latest AI/NLP\ndevelopments assisting in text-based assessments in higher education. We expect\nit will particularly benefit researchers and educators incorporating LLMs such\nas ChatGPT into their educational activities.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:16:45 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gao","Rujun",""],["Merzdorf","Hillary E.",""],["Anwar","Saira",""],["Hipwell","M. Cynthia",""],["Srinivasa","Arun",""]]}
{"id":"2308.16152","submitter":"Jyoti Yadav","authors":"Jyoti Yadav (IIA), Mousumi Das (IIA), Sudhanshu Barway (IIA) and\n  Francoise Combes (Obs-Paris, LERMA)","title":"A FUV and optical study of star formation in closely interacting\n  galaxies: star forming rings, tidal arms and nuclear outflows","comments":"20 pages, 16 figures, accepted in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a study of the morphology of star formation and the associated\nnuclear activity in a sample of 8 closely interacting southern galaxies, which\nare in different stages of interaction, starting with nearly merged nuclei that\nhave one prominent bulge to more widely spaced interacting galaxies. We have\nused Far-Ultraviolet (FUV) observations from the Ultraviolet Imaging telescope\n(UVIT), near-Infrared observations from the infrared survey facility telescope\n(IRSF) and archival optical data from the VLT/MUSE integral field spectrograph.\nAnalysing resolved stellar populations across the disk of the interacting\ngalaxies can provide unique insights into how interactions affect galaxy\nproperties, such as morphology, star formation rates and chemical composition.\nWe take advantage of the unprecedented capabilities of MUSE and UVIT to carry\nout a highly detailed spatially and spectrally resolved study of star formation\nrate, star formation histories, metallicity and AGN activity in the sample of\neight interacting galaxies which are in different stages of interaction. Most\nof our sample galaxies are gas-rich and show evidence of recent, massive star\nformation in tidal tails, rings and spiral arms. This is evident from their FUV\nand H$\\alpha$ emissions, which trace young, massive star-forming regions. We\ncompared the star formation rate in the barred and unbarred galaxies in our\nsample and found that the barred galaxies do not show significant enhancement\nin star formation rate or large-scale difference in star formation morphology\ncompared to unbarred galaxies. IC5250 and NGC7733N, show extended nuclear\noutflows of size $\\sim$ 5 kpc and 8 kpc respectively.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:18:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yadav","Jyoti","","IIA"],["Das","Mousumi","","IIA"],["Barway","Sudhanshu","","IIA"],["Combes","Francoise","","Obs-Paris, LERMA"]]}
{"id":"2308.16153","submitter":"Wai-Keong Mok","authors":"Wai-Keong Mok, Hui Zhang, Tobias Haug, Xianshu Luo, Guo-Qiang Lo, Hong\n  Cai, M. S. Kim, Ai Qun Liu and Leong-Chuan Kwek","title":"Rigorous noise reduction with quantum autoencoders","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reducing noise in quantum systems is a major challenge towards the\napplication of quantum technologies. Here, we propose and demonstrate a scheme\nto reduce noise using a quantum autoencoder with rigorous performance\nguarantees. The quantum autoencoder learns to compresses noisy quantum states\ninto a latent subspace and removes noise via projective measurements. We find\nvarious noise models where we can perfectly reconstruct the original state even\nfor high noise levels. We apply the autoencoder to cool thermal states to the\nground state and reduce the cost of magic state distillation by several orders\nof magnitude. Our autoencoder can be implemented using only unitary\ntransformations without ancillas, making it immediately compatible with the\nstate of the art. We experimentally demonstrate our methods to reduce noise in\na photonic integrated circuit. Our results can be directly applied to make\nquantum technologies more robust to noise.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:19:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mok","Wai-Keong",""],["Zhang","Hui",""],["Haug","Tobias",""],["Luo","Xianshu",""],["Lo","Guo-Qiang",""],["Cai","Hong",""],["Kim","M. S.",""],["Liu","Ai Qun",""],["Kwek","Leong-Chuan",""]]}
{"id":"2308.16154","submitter":"Yiqi Zhong","authors":"Yiqi Zhong, Luming Liang, Ilya Zharkov, Ulrich Neumann","title":"MMVP: Motion-Matrix-based Video Prediction","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":"  A central challenge of video prediction lies where the system has to reason\nthe objects' future motions from image frames while simultaneously maintaining\nthe consistency of their appearances across frames. This work introduces an\nend-to-end trainable two-stream video prediction framework, Motion-Matrix-based\nVideo Prediction (MMVP), to tackle this challenge. Unlike previous methods that\nusually handle motion prediction and appearance maintenance within the same set\nof modules, MMVP decouples motion and appearance information by constructing\nappearance-agnostic motion matrices. The motion matrices represent the temporal\nsimilarity of each and every pair of feature patches in the input frames, and\nare the sole input of the motion prediction module in MMVP. This design\nimproves video prediction in both accuracy and efficiency, and reduces the\nmodel size. Results of extensive experiments demonstrate that MMVP outperforms\nstate-of-the-art systems on public data sets by non-negligible large margins\n(about 1 db in PSNR, UCF Sports) in significantly smaller model sizes (84% the\nsize or smaller).\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:20:46 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 00:51:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhong","Yiqi",""],["Liang","Luming",""],["Zharkov","Ilya",""],["Neumann","Ulrich",""]]}
{"id":"2308.16155","submitter":"Xi Zhang","authors":"Xi Zhang","title":"The Inhomogeneity Effect I: Inhomogeneous Surface and Atmosphere\n  Accelerate Planetary Cooling","comments":"26 pages, 8 figures, part one of a series of papers, accepted for\n  publication in The Astrophysical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.ao-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We propose a general principle that under the radiative-convective\nequilibrium, the spatial and temporal variations in a planet's surface and\natmosphere tend to increase its cooling. This principle is based on Jensen's\ninequality and the curvature of the response functions of surface temperature\nand outgoing cooling flux to changes in incoming stellar flux and atmospheric\nopacity. We use an analytical model to demonstrate that this principle holds\nfor various planet types: (1) on an airless planet, the mean surface\ntemperature is lower than its equilibrium temperature; (2) on terrestrial\nplanets with atmospheres, the inhomogeneity of incoming stellar flux and\natmospheric opacity reduces the mean surface temperature; (3) on giant planets,\ninhomogeneously distributed stellar flux and atmospheric opacity increase the\noutgoing infrared flux, cooling the interior. Although the inhomogeneity of\nvisible opacity might sometimes heat the atmosphere, the effect is generally\nmuch smaller than the inhomogeneous cooling effect of infrared opacity.\nCompared with the homogeneous case, the mean surface temperature on\ninhomogeneous terrestrial planets can decrease by more than 20\\%, and the\ninternal heat flux on giant planets can increase by over an order of magnitude.\nDespite simplifications in our analytical framework, the effect of stellar flux\ninhomogeneity appears to be robust, while further research is needed to fully\nunderstand the effects of opacity inhomogeneity in more realistic situations.\nThis principle impacts our understanding of planetary habitability and the\nevolution of giant planets using low-resolution and one-dimensional frameworks\nthat may have previously overlooked the role of inhomogeneity.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:21:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Xi",""]]}
{"id":"2308.16156","submitter":"Xi Zhang","authors":"Xi Zhang","title":"The Inhomogeneity Effect II: Rotational and Orbital States Impact\n  Planetary Cooling","comments":"25 pages, 11 figures, part two of a series of papers, accepted for\n  publication in The Astrophysical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.ao-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We generalize the theory of the inhomogeneity effect to enable comparison\namong different inhomogeneous planets. A metric of inhomogeneity based on the\ncumulative distribution function is applied to investigate the dependence of\nplanetary cooling on previously overlooked parameters. The mean surface\ntemperature of airless planets increases with rotational rate and surface\nthermal inertia, which bounds the value in the tidally locked configuration and\nthe equilibrium temperature. Using an analytical model, we demonstrate that the\ninternal heat flux of giant planets exhibits significant spatial variability,\nprimarily emitted from the nightside and high-latitude regions acting as\n``radiator fins.\" Given a horizontally uniform interior temperature in the\nconvective zone, the outgoing internal flux increases up to several folds as\nthe inhomogeneity of the incoming stellar flux increases. The enhancement\ndecreases with increasing heat redistribution through planetary dynamics or\nrotation. The outgoing internal flux on rapidly rotating planets generally\nincreases with planetary obliquity and orbital eccentricity. The radiative\ntimescale and true anomaly of the vernal equinox also play significant roles.\nIf the radiative timescale is long, the outgoing internal flux shows a slightly\ndecreasing but nonlinear trend with obliquity. Our findings indicate that\nrotational and orbital states greatly influence the cooling of planets and\nimpact the interior evolution of giant planets, particularly for tidally locked\nplanets and planets with high eccentricity and obliquity (such as Uranus), as\nwell as the spatial and temporal variations of their cooling fluxes.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:21:48 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Xi",""]]}
{"id":"2308.16157","submitter":"Mani A","authors":"Mani A","title":"Algebraic, Topological, and Mereological Foundations of Existential\n  Granules","comments":"15 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.AI cs.LG math.LO math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this research, new concepts of existential granules that determine\nthemselves are invented, and are characterized from algebraic, topological, and\nmereological perspectives. Existential granules are those that determine\nthemselves initially, and interact with their environment subsequently.\nExamples of the concept, such as those of granular balls, though inadequately\ndefined, algorithmically established, and insufficiently theorized in earlier\nworks by others, are already used in applications of rough sets and soft\ncomputing. It is shown that they fit into multiple theoretical frameworks\n(axiomatic, adaptive, and others) of granular computing. The characterization\nis intended for algorithm development, application to classification problems\nand possible mathematical foundations of generalizations of the approach.\nAdditionally, many open problems are posed and directions provided.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:22:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["A","Mani",""]]}
{"id":"2308.16158","submitter":"Arturo C. Mart\\'i","authors":"Jos\\'e Luis Di Laccio, Andr\\'es Monetta, Rodrigo Alonso-Su\\'arez,\n  Mart\\'in Monteiro, Arturo C. Marti","title":"Utilizing smartphone sensors for accurate solar irradiance measurement\n  and educational purposes","comments":"26 pags, 9 figs, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The global transition towards cleaner and more sustainable energy production\nis a major challenge. We present an innovative solution by utilizing smartphone\nlight sensors to measure direct normal solar irradiance, the primary component\nof ground-level solar radiation. We provide comprehensive guidelines for\ncalibrating the sensor using two methods: a professional reference measurement\nand clear-sky satellite estimates. The latter method is particularly\nadvantageous in resource-constrained environments. Once calibrated, the\nsmartphone becomes a valuable tool for measuring the solar resource. We propose\nan instructional laboratory focusing on the physics of solar radiation and its\ninteraction with the Earth's atmosphere, exploring solar variations across\nlocations, cloud conditions, and time scales. By integrating irradiance values\nmeasured throughout a day the daily irradiation can be estimated. This approach\nenhances students' understanding of solar radiation attenuation and its\nrelationship with atmospheric interactions. This method offers a practical and\neducational solution for promoting renewable energy knowledge and addressing\nthe challenges of the energy transition.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:23:07 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Di Laccio","Jos\u00e9 Luis",""],["Monetta","Andr\u00e9s",""],["Alonso-Su\u00e1rez","Rodrigo",""],["Monteiro","Mart\u00edn",""],["Marti","Arturo C.",""]]}
{"id":"2308.16159","submitter":"Radoslava Hristova","authors":"Ivan Hristov, Radoslava Hristova, Veljko Dmitra\\v{s}inovi\\'c, Kiyotaka\n  Tanikawa","title":"Three-body periodic collisionless equal-mass free-fall orbits revisited","comments":"21 pages, 15 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph astro-ph.EP nlin.CD physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Li and Liao announced (2019) discovery of 313 periodic collisionless orbits'\ninitial conditions (i.c.s), 30 of which have equal masses, and 18 of these 30\norbits have physical periods (scale-invariant periods) $T^{*}=T|E|^{3/2}<80$.\nThat work left a lot to be desired, however, both in terms of logical\nconsistency and of numerical efficiency. We have conducted a new search for\nperiodic free-fall orbits, limited to the equal-mass case. Our search produced\n24,582 i.c.s of equal-mass periodic orbits with scale-invariant period\n$T^{*}<80$, corresponding to 12,409 distinct solutions, 236 of which are\nself-dual.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:28:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hristov","Ivan",""],["Hristova","Radoslava",""],["Dmitra\u0161inovi\u0107","Veljko",""],["Tanikawa","Kiyotaka",""]]}
{"id":"2308.16160","submitter":"Miao Fan","authors":"Miao Fan, Mingrui Chen, Chen Hu, Shuchang Zhou","title":"Occ$^2$Net: Robust Image Matching Based on 3D Occupancy Estimation for\n  Occluded Regions","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":"  Image matching is a fundamental and critical task in various visual\napplications, such as Simultaneous Localization and Mapping (SLAM) and image\nretrieval, which require accurate pose estimation. However, most existing\nmethods ignore the occlusion relations between objects caused by camera motion\nand scene structure. In this paper, we propose Occ$^2$Net, a novel image\nmatching method that models occlusion relations using 3D occupancy and infers\nmatching points in occluded regions. Thanks to the inductive bias encoded in\nthe Occupancy Estimation (OE) module, it greatly simplifies bootstrapping of a\nmulti-view consistent 3D representation that can then integrate information\nfrom multiple views. Together with an Occlusion-Aware (OA) module, it\nincorporates attention layers and rotation alignment to enable matching between\noccluded and visible points. We evaluate our method on both real-world and\nsimulated datasets and demonstrate its superior performance over\nstate-of-the-art methods on several metrics, especially in occlusion scenarios.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:09:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Fan","Miao",""],["Chen","Mingrui",""],["Hu","Chen",""],["Zhou","Shuchang",""]]}
{"id":"2308.16161","submitter":"Ulrich Mosel","authors":"U. Mosel and K. Gallmeister","title":"Lepton-induced reactions on nuclei in a wide kinematical regime","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ex hep-ph nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inclusive differential cross sections for various $e A$ and $\\nu A$ reactions\nare analyzed within the GiBUU theoretical framework and code. The treatment of\nelectron-nuclus reactions has been significantly improved by implementing a\nparametrized description of electron-nucleon interactions for a nucleon. Using\nthe momentum of a nucleon inside the Fermi sea the electron-nucleon cross\nsections are then Lorentz-boosted to obtain the electron structure functions\nfor nuclei. The neutrino structure functions are obtained from the ones for\nelectrons by a transformation that involves the axial formfactors and\nkinematical factors that account for the difference of vector and axial\ncurrents. Special emphasis is put on analyzing data from various different\nexperiments in different neutrino energy regimes with one and the same\ntheoretical input.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:31:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mosel","U.",""],["Gallmeister","K.",""]]}
{"id":"2308.16162","submitter":"Mengxuan Yang","authors":"Jared Wunsch, Mengxuan Yang, and Yuzhou Zou","title":"The Morse index theorem for mechanical systems with reflections","comments":"29 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math-ph math.CA math.DS math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove a Morse index theorem for action functionals on paths that are\nallowed to reflect at a hypersurface (either in the interior or at the boundary\nof a manifold). Both fixed and periodic boundary conditions are treated.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:31:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wunsch","Jared",""],["Yang","Mengxuan",""],["Zou","Yuzhou",""]]}
{"id":"2308.16163","submitter":"Abhishek Methuku","authors":"Domagoj Brada\\v{c} and Abhishek Methuku and Benny Sudakov","title":"The extremal number of cycles with all diagonals","comments":"14 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In 1975, Erd\\H{o}s asked the following natural question: What is the maximum\nnumber of edges that an $n$-vertex graph can have without containing a cycle\nwith all diagonals? Erd\\H{o}s observed that the upper bound $O(n^{5/3})$ holds\nsince the complete bipartite graph $K_{3,3}$ can be viewed as a cycle of length\nsix with all diagonals.\n  In this paper, we resolve this old problem. We prove that there exists a\nconstant $C$ such that every $n$-vertex with $Cn^{3/2}$ edges contains a cycle\nwith all diagonals. Since any cycle with all diagonals contains cycles of\nlength four, this bound is best possible using well-known constructions of\ngraphs without a four-cycle based on finite geometry.\n  Among other ideas, our proof involves a novel lemma about finding an\n`almost-spanning' robust expander which might be of independent interest.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:32:57 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Brada\u010d","Domagoj",""],["Methuku","Abhishek",""],["Sudakov","Benny",""]]}
{"id":"2308.16164","submitter":"Tobias Kreutz","authors":"Tobias Kreutz","title":"Hodge structures not coming from geometry","comments":"Comments welcome!","journal-ref":null,"doi":null,"report-no":"MPIM-Bonn-2023","categories":"math.AG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hodge theory associates to a smooth projective variety over $\\mathbb{C}$ a\npiece of linear algebra information, called a $\\mathbb{Q}$-Hodge structure.\nConversely, it is a natural question which abstract $\\mathbb{Q}$-Hodge\nstructures arise from the cohomology of a smooth projective complex variety, or\nmore generally, from a pure motive over $\\mathbb{C}$. By a classical argument\ninvolving Griffiths transversality and a Baire category argument, it is well\nknown that there are many Hodge structures which do not come from geometry in\nthis sense. However, the argument is not constructive, and does not seem to\ngive a criterion to decide whether a given Hodge structure comes from geometry.\nWe formulate an intrinsic condition on a $\\mathbb{Q}$-Hodge structure that we\nexpect to be satisfied for all Hodge structures coming from geometry. We prove\nthat this expectation follows from the conjunction of two fundamental\nconjectures in Hodge theory and transcendence theory: the conjecture that Hodge\ncycles are motivated and Andr\\'e's generalized Grothendieck period conjecture.\nBy doing so, we exhibit explicit examples of $\\mathbb{Q}$-Hodge structures\nwhich should not come from geometry.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:33:59 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kreutz","Tobias",""]]}
{"id":"2308.16165","submitter":"Xi Zhang","authors":"Xi Zhang, Cheng Li, Huazhi Ge, Tianhao Le","title":"The Inhomogeneity Effect III: Weather Impacts on the Heat Flow of Hot\n  Jupiters","comments":"36 pages, 13 figures, part three of a series of papers, accepted for\n  publication in The Astrophysical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.ao-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The interior flux of a giant planet impacts atmospheric motion, and the\natmosphere dictates the interior's cooling. Here we use a non-hydrostatic\ngeneral circulation model (SNAP) coupled with a multi-stream multi-scattering\nradiative module (HARP) to simulate the weather impacts on the heat flow of hot\nJupiters. We found that the vertical heat flux is primarily transported by\nconvection in the lower atmosphere and regulated by dynamics and radiation in\nthe overlying ``radiation-circulation\" zone. The temperature inversion occurs\non the dayside and reduces the upward radiative flux. The atmospheric dynamics\nrelay the vertical heat transport until the radiation becomes efficient in the\nupper atmosphere. The cooling flux increases with atmospheric drag due to\nincreased day-night contrast and spatial inhomogeneity. The temperature\ndependence of the infrared opacity greatly amplifies the opacity inhomogeneity.\nAlthough atmospheric circulation could transport heat downward in a narrow\nregion above the radiative-convective boundary, the opacity inhomogeneity\neffect overcomes the dynamical effect and leads to a larger overall interior\ncooling than the local simulations with the same interior entropy and stellar\nflux. The enhancement depends critically on the equilibrium temperature, drag,\nand atmospheric opacity. In a strong-drag atmosphere hotter than 1600 K, a\nsignificant inhomogeneity effect in three-dimensional (3D) models can boost\ninterior cooling several-fold compared to the 1D radiative-convection\nequilibrium models. This study confirms the analytical argument of the\ninhomogeneity effect in Zhang (2023ab). It highlights the importance of using\n3D atmospheric models in understanding the inflation mechanisms of hot Jupiters\nand giant planet evolution in general.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:34:45 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Xi",""],["Li","Cheng",""],["Ge","Huazhi",""],["Le","Tianhao",""]]}
{"id":"2308.16166","submitter":"Gauree Shanker","authors":"A. Zaidi, G. Shanker and J. Yadav","title":"Conformal pointwise slant Riemannian maps from or to K\\\"{a}hler\n  manifolds","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this article, we study Conformal pointwise-slant Riemannian maps\n(\\textit{CPSRM}) from or to K\\\"{a}hler manifolds to or from Riemannian\nmanifolds. To check the existence of such maps, we provide some non-trivial\nexamples. We derive some important results for these maps. We discuss the\nintegrability and totally geodesicness of the distributions. Further, we\ninvestigate the conditions for homotheticity and harmonicity of these maps.\nFinally, we study some inequalities for these maps.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:40:26 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zaidi","A.",""],["Shanker","G.",""],["Yadav","J.",""]]}
{"id":"2308.16167","submitter":"Alp\\'ar R. M\\'esz\\'aros","authors":"Mohit Bansil, Alp\\'ar R. M\\'esz\\'aros, Chenchen Mou","title":"Global Well-Posedness of Displacement Monotone Degenerate Mean Field\n  Games Master Equations","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this manuscript we construct global in time classical solutions to mean\nfield games master equations in the lack of idiosyncratic noise in the\nindividual agents' dynamics. These include both deterministic models and\ndynamics driven solely by a Brownian common noise. We consider a general class\nof non-separable Hamiltonians and final data functions that are supposed to be\ndisplacement monotone. Our main results unify and generalize in particular some\nof the well-posedness results on displacement monotone master equations\nobtained recently by Gangbo--M\\'esz\\'aros and Gangbo--M\\'esz\\'aros--Mou--Zhang.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:41:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bansil","Mohit",""],["M\u00e9sz\u00e1ros","Alp\u00e1r R.",""],["Mou","Chenchen",""]]}
{"id":"2308.16168","submitter":"Sergey Bocharov","authors":"Sergey Bocharov and Simon C. Harris","title":"Long edges in Galton-Watson trees","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR q-bio.PE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we will establish a number of results concerning the\nlimiting behaviour of the longest edges in the genealogical tree generated by a\ncontinuous-time Galton-Watson (GW) process. Separately, we consider the large\ntime behaviour of the longest pendant edges, the longest (strictly) interior\nedges, and the longest of all the edges. These results extend the special case\nof long pendant edges of birth-death processes established in Bocharov, Harris,\nKominek, Mooers, and Steel [1] .\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:42:06 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bocharov","Sergey",""],["Harris","Simon C.",""]]}
{"id":"2308.16169","submitter":"Claudio Melis","authors":"Antonio Cappai, Luciano Colombo, Claudio Melis","title":"Understanding coupled mass-heat transport in fluids by\n  approach-to-equilibrium molecular dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a generalization of AEMD approach, routinely applied to estimate\nthermal conductivity, to the more general case in which Soret and Dufour\neffects determine a coupled heat-mass transfer. We show that, by starting from\nmicroscopical definitions of heat and mass currents, conservation laws dictates\nthe form of the differential equations governing the time evolution. In\nparticular, we focus to the well specific case in which a closed-form solution\nof the system is possible and derive the analytical form of time-evolution of\ntemperature and concentration scalar fields in the case in which step-like\ninitial profiles are imposed across a rectangular simulation cell. The validity\nof this new generalized expression is finally validated using as benchamrk\nsystem a two-component Lennard-Jones liquid system, for which generalized\ndiffusivities are estimated in different reduced temperature and density region\nof phase diagram.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:44:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cappai","Antonio",""],["Colombo","Luciano",""],["Melis","Claudio",""]]}
{"id":"2308.16170","submitter":"Werner Heil","authors":"M. Beck, W. Heil, C. Schmidt, S. Bae{\\ss}ler, F. Gl\\\"uck, G. Konrad,\n  U. Schmidt","title":"Reanalysis of the $\\beta-\\bar\\nu_e$ angular correlation measurement\n  aSPECT with new constrains on Fierz interference","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  On the basis of revisions of some of the systematic errors, we reanalyzed the\nmeasurement of the $\\beta-\\bar\\nu_e$ angular correlation ($a$ coefficient) in\nfree neutron beta decay from the aSPECT experiment. With $a = -0.10402(82)$ the\nnew value differs only marginally from the one published in 2020. The\nexperiment has also sensitivity to $b$, the Fierz interference term. From a\ncorrelated $(b,a)$ fit to the proton recoil spectrum, we derive a limit of $b=\n-0.0098(193)$ which translates into a somewhat improved 90% CL region of\n$-0.041 < b < 0.022$ on this hypothetical term.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:45:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Beck","M.",""],["Heil","W.",""],["Schmidt","C.",""],["Bae\u00dfler","S.",""],["Gl\u00fcck","F.",""],["Konrad","G.",""],["Schmidt","U.",""]]}
{"id":"2308.16171","submitter":"Sean O'Rourke","authors":"Sean O'Rourke, Zhi Yin, and Ping Zhong","title":"Spectrum of Laplacian matrices associated with large random elliptic\n  matrices","comments":"41 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A Laplacian matrix is a square matrix whose row sums are zero. We study the\nlimiting eigenvalue distribution of a Laplacian matrix formed by taking a\nrandom elliptic matrix and subtracting the diagonal matrix containing its row\nsums. Under some mild assumptions, we show that the empirical spectral\ndistribution of the Laplacian matrix converges to a deterministic probability\ndistribution as the size of the matrix tends to infinity. The limiting measure\ncan be interpreted as the Brown measure of the sum of an elliptic operator and\na freely independent normal operator with a Gaussian distribution.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:46:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["O'Rourke","Sean",""],["Yin","Zhi",""],["Zhong","Ping",""]]}
{"id":"2308.16172","submitter":"Carlos Misael Madrid Padilla","authors":"Carlos Misael Madrid Padilla, Oscar Hernan Madrid Padilla, Daren Wang","title":"Temporal-spatial model via Trend Filtering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This research focuses on the estimation of a non-parametric regression\nfunction designed for data with simultaneous time and space dependencies. In\nsuch a context, we study the Trend Filtering, a nonparametric estimator\nintroduced by \\cite{mammen1997locally} and \\cite{rudin1992nonlinear}. For\nunivariate settings, the signals we consider are assumed to have a kth weak\nderivative with bounded total variation, allowing for a general degree of\nsmoothness. In the multivariate scenario, we study a $K$-Nearest Neighbor fused\nlasso estimator as in \\cite{padilla2018adaptive}, employing an ADMM algorithm,\nsuitable for signals with bounded variation that adhere to a piecewise\nLipschitz continuity criterion. By aligning with lower bounds, the minimax\noptimality of our estimators is validated. A unique phase transition\nphenomenon, previously uncharted in Trend Filtering studies, emerges through\nour analysis. Both Simulation studies and real data applications underscore the\nsuperior performance of our method when compared with established techniques in\nthe existing literature.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:50:00 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 12:18:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Padilla","Carlos Misael Madrid",""],["Padilla","Oscar Hernan Madrid",""],["Wang","Daren",""]]}
{"id":"2308.16173","submitter":"Yi-Fan Wang","authors":"Yi-Fan Wang, Alexander H. Nitz","title":"First Targeted Search for Gravitational Waves from Highly Spinning Light\n  Compact Binaries","comments":"6 pages, 5 figures. Data and scripts are released at\n  https://github.com/gwastro/high-spin-light-binary. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Searches for gravitational waves from compact-binary mergers, which to date\nhave reported nearly 100 observations, have previously ignored binaries whose\ncomponents are both light ($< 2 M_\\odot$) and have high dimensionless spin ($>$\n0.05). While previous searches targeted sources that are representative of\nobserved double neutron star binaries in the galaxy, it is already known that\nneutron stars can regularly be spun up to a dimensionless spin of $\\sim$ 0.4,\nand in principle reach up to $\\sim$ 0.7 before breakup would occur.\nFurthermore, there may be primordial black hole binaries or exotic formation\nmechanisms to produce subsolar mass black holes. In these cases, it is possible\nfor the binary constituent to be spun up beyond that achievable by a neutron\nstar. A single detection of this type of source would reveal a novel formation\nchannel for compact binaries. To determine if there is evidence for any such\nsources, we conduct the first search of LIGO and Virgo data from three\nobserving runs for light compact objects with high spin. Our analysis detects\npreviously known observations e.g. GW170817 and GW200115; however, we report no\nadditional mergers. The most significant candidate, not previously known, is\nconsistent with the noise distribution, and so we constrain the merger rate of\nspinning light binaries.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:51:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wang","Yi-Fan",""],["Nitz","Alexander H.",""]]}
{"id":"2308.16174","submitter":"William Cunningham","authors":"W. Streit Cunningham, Jungho Shin, Tianjiao Lei, Timothy J Rupert,\n  Daniel S. Gianola","title":"High-throughput assessment of the microstructural stability of\n  segregation-engineered nanocrystalline Al-Ni-Y alloys","comments":"12 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Segregation engineering has emerged as a promising pathway towards designing\nthermally stable nanocrystalline alloys with enhanced mechanical properties.\nHowever, the compositional and processing space for solute stabilized\nmicrostructures is vast, thus the application of high-throughput techniques to\naccelerate optimal material development is increasingly attractive. In this\nwork, combinatorial synthesis is combined with high-throughput characterization\ntechniques to explore microstructural transitions through annealing of a\nnanocrystalline ternary Al-base alloy containing a transition metal (TM=Ni) and\nrare earth dopant (RE=Y). A down-selected optimal composition with the highest\nthermal stability is annealed through in situ transmission electron microscopy,\nrevealing that the removal of the RE species is correlated to a reduction in\nthe microstructural stability at high temperatures as a result of variations in\nintermetallic phase formation. Results demonstrate the benefits of\nco-segregation for enhancing mechanical hardness and delaying the onset of\nmicrostructural instability.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:51:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cunningham","W. Streit",""],["Shin","Jungho",""],["Lei","Tianjiao",""],["Rupert","Timothy J",""],["Gianola","Daniel S.",""]]}
{"id":"2308.16175","submitter":"Jiuhai Chen","authors":"Jiuhai Chen, Jonas Mueller","title":"Quantifying Uncertainty in Answers from any Language Model via Intrinsic\n  and Extrinsic Confidence Assessment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce BSDetector, a method for detecting bad and speculative answers\nfrom a pretrained Large Language Model by estimating a numeric confidence score\nfor any output it generated. Our uncertainty quantification technique works for\nany LLM accessible only via a black-box API, and combines intrinsic and\nextrinsic assessments of confidence into a single trustworthiness estimate for\nany LLM response to a given prompt. Our method is extremely general and can\napplied to all of the best LLMs available today (whose training data remains\nunknown). By expending a bit of extra computation, users of any LLM API can now\nget the same response as they would ordinarily, as well as a confidence\nestimate that caution when not to trust this response. Experiments on both\nclosed and open-form Question-Answer benchmarks reveal that BSDetector more\naccurately identifies incorrect LLM responses than alternative uncertainty\nestimation procedures (for both GPT-3 and ChatGPT). By sampling multiple\nresponses from the LLM and considering the one with the highest confidence\nscore, we can additionally obtain more accurate responses from the same LLM,\nwithout any extra training steps.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:53:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Jiuhai",""],["Mueller","Jonas",""]]}
{"id":"2308.16176","submitter":"Albert Ai","authors":"Albert Ai","title":"Improved low regularity theory for gravity-capillary waves","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article concerns the Cauchy problem for the gravity-capillary water\nwaves system in general dimensions. We establish local well-posedness for\ninitial data in $H^s$, with $s > \\frac{d}{2} + 2 - \\mu$, with $\\mu =\n\\frac{3}{14}$ and $\\mu = \\frac37$ in the cases $d = 1$ and $d \\geq 2$\nrespectively. This represents an improvement over the the state-of-the-art low\nregularity theory in $d \\geq 2$ dimensions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:54:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ai","Albert",""]]}
{"id":"2308.16177","submitter":"Christian Steinmetz","authors":"Matthew Rice and Christian J. Steinmetz and George Fazekas and Joshua\n  D. Reiss","title":"General Purpose Audio Effect Removal","comments":"Preprint. Accepted to IEEE Workshop on Applications of Signal\n  Processing to Audio and Acoustics (WASPAA) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although the design and application of audio effects is well understood, the\ninverse problem of removing these effects is significantly more challenging and\nfar less studied. Recently, deep learning has been applied to audio effect\nremoval; however, existing approaches have focused on narrow formulations\nconsidering only one effect or source type at a time. In realistic scenarios,\nmultiple effects are applied with varying source content. This motivates a more\ngeneral task, which we refer to as general purpose audio effect removal. We\ndeveloped a dataset for this task using five audio effects across four\ndifferent sources and used it to train and evaluate a set of existing\narchitectures. We found that no single model performed optimally on all effect\ntypes and sources. To address this, we introduced RemFX, an approach designed\nto mirror the compositionality of applied effects. We first trained a set of\nthe best-performing effect-specific removal models and then leveraged an audio\neffect classification model to dynamically construct a graph of our models at\ninference. We found our approach to outperform single model baselines, although\nexamples with many effects present remain challenging.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:55:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rice","Matthew",""],["Steinmetz","Christian J.",""],["Fazekas","George",""],["Reiss","Joshua D.",""]]}
{"id":"2308.16178","submitter":"Laurence Mayther","authors":"Laurence H. Mayther","title":"Spectral invariants of Joyce orbifolds","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces two new spectral invariants of torsion-free\n$\\mathrm{G}_2$-structures on closed orbifolds and computes their values on all\nJoyce orbifolds. These invariants are shown to be more discerning than the\n$\\overline{\\nu}$-invariant of Crowley-Goette-Nordstr\\\"{o}m when applied to\nJoyce orbifolds, and thus provide candidate tools for distinguishing between\nJoyce manifolds. The invariants may be viewed as regularisations of the\nclassical Morse indices of the critical points of the Hitchin functionals on\nclosed and coclosed $\\mathrm{G}_2$-structures respectively. In the case of\nJoyce orbifolds, an interesting link with twisted Epstein $\\zeta$-functions is\nalso observed.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:56:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mayther","Laurence H.",""]]}
{"id":"2308.16179","submitter":"Xiao Li","authors":"Ke Huang, Xiao Li, David A. Huse, and Amos Chan","title":"Out-of-time-order correlator, many-body quantum chaos, light-like\n  generators, and singular values","comments":"6 + 15 pages, 3 + 11 figures. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech hep-th nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study out-of-time-order correlators (OTOCs) of local operators in\nspatial-temporal invariant or random quantum circuits using light-like\ngenerators (LLG) -- many-body operators that exist in and act along the\nlight-like directions. We demonstrate that the OTOC can be approximated by the\nleading singular value of the LLG, which, for the case of generic many-body\nchaotic circuits, is increasingly accurate as the size of the LLG, $w$,\nincreases. We analytically show that the OTOC has a decay with a universal form\nin the light-like direction near the causal light cone, as dictated by the\nsub-leading eigenvalues of LLG, $z_2$, and their degeneracies. Further, we\nanalytically derive and numerically verify that the sub-leading eigenvalues of\nLLG of any size can be accessibly extracted from those of LLG of the smallest\nsize, i.e., $z_2(w)= z_2(w=1)$. Using symmetries and recursive structures of\nLLG, we propose two conjectures on the universal aspects of generic many-body\nquantum chaotic circuits, one on the algebraic degeneracy of eigenvalues of\nLLG, and another on the geometric degeneracy of the sub-leading eigenvalues of\nLLG. As corollaries of the conjectures, we analytically derive the asymptotic\nform of the leading singular state, which in turn allows us to postulate and\nefficiently compute a product-state variational ansatz away from the asymptotic\nlimit. We numerically test the claims with four generic circuit models of\nmany-body quantum chaos, and contrast these statements against the cases of a\ndual unitary system and an integrable system.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:57:06 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Huang","Ke",""],["Li","Xiao",""],["Huse","David A.",""],["Chan","Amos",""]]}
{"id":"2308.16180","submitter":"Akash Dhruv","authors":"Akash Dhruv, Rajeev Jain, Jared O'Neal, Klaus Weide, Anshu Dubey","title":"Framework and Methodology for Verification of a Complex Scientific\n  Simulation Software, Flash-X","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computational science relies on scientific software as its primary instrument\nfor scientific discovery. Therefore, similar to the use of other types of\nscientific instruments, correct software and the correct operation of the\nsoftware is necessary for executing rigorous scientific investigations.\nScientific software verification can be especially difficult, as users\ntypically need to modify the software as part of a scientific study. Systematic\nmethodologies for building test suites for scientific software are rare in the\nliterature. Here, we describe a methodology that we have developed for Flash-X,\na community simulation software for multiple scientific domains, that has\ncomposable components that can be permuted and combined in a multitude of ways\nto generate a wide range of applications. Ensuring sufficient code coverage by\na test suite is particularly challenging due to this composability. Our\nmethodology includes a consideration of trade-offs between meeting software\nquality goals, developer productivity, and meeting the scientific goals of the\nFlash-X user community.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:57:37 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dhruv","Akash",""],["Jain","Rajeev",""],["O'Neal","Jared",""],["Weide","Klaus",""],["Dubey","Anshu",""]]}
{"id":"2308.16181","submitter":"Clara Wanjura","authors":"Clara C. Wanjura and Florian Marquardt","title":"Fully Non-Linear Neuromorphic Computing with Linear Wave Scattering","comments":"18 pages, 6 figures; comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cs.ET physics.data-an","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The increasing complexity of neural networks and the energy consumption\nassociated with training and inference create a need for alternative\nneuromorphic approaches, e.g. using optics. Current proposals and\nimplementations rely on physical non-linearities or opto-electronic conversion\nto realise the required non-linear activation function. However, there are\nsignificant challenges with these approaches related to power levels, control,\nenergy-efficiency, and delays. Here, we present a scheme for a neuromorphic\nsystem that relies on linear wave scattering and yet achieves non-linear\nprocessing with a high expressivity. The key idea is to inject the input via\nphysical parameters that affect the scattering processes. Moreover, we show\nthat gradients needed for training can be directly measured in scattering\nexperiments. We predict classification accuracies on par with results obtained\nby standard artificial neural networks. Our proposal can be readily implemented\nwith existing state-of-the-art, scalable platforms, e.g. in optics, microwave\nand electrical circuits, and we propose an integrated-photonics implementation\nbased on racetrack resonators that achieves high connectivity with a minimal\nnumber of waveguide crossings.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:58:06 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wanjura","Clara C.",""],["Marquardt","Florian",""]]}
{"id":"2308.16182","submitter":"Henghui Ding","authors":"Shuting He, Henghui Ding, Chang Liu, Xudong Jiang","title":"GREC: Generalized Referring Expression Comprehension","comments":"GREC Technical Report, Project Page:\n  https://henghuiding.github.io/GRES","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The objective of Classic Referring Expression Comprehension (REC) is to\nproduce a bounding box corresponding to the object mentioned in a given textual\ndescription. Commonly, existing datasets and techniques in classic REC are\ntailored for expressions that pertain to a single target, meaning a sole\nexpression is linked to one specific object. Expressions that refer to multiple\ntargets or involve no specific target have not been taken into account. This\nconstraint hinders the practical applicability of REC. This study introduces a\nnew benchmark termed as Generalized Referring Expression Comprehension (GREC).\nThis benchmark extends the classic REC by permitting expressions to describe\nany number of target objects. To achieve this goal, we have built the first\nlarge-scale GREC dataset named gRefCOCO. This dataset encompasses a range of\nexpressions: those referring to multiple targets, expressions with no specific\ntarget, and the single-target expressions. The design of GREC and gRefCOCO\nensures smooth compatibility with classic REC. The proposed gRefCOCO dataset, a\nGREC method implementation code, and GREC evaluation code are available at\nhttps://github.com/henghuiding/gRefCOCO.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:58:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["He","Shuting",""],["Ding","Henghui",""],["Liu","Chang",""],["Jiang","Xudong",""]]}
{"id":"2308.16183","submitter":"Meng-Xiang Lin","authors":"Meng-Xiang Lin, Bhuvnesh Jain, Marco Raveri, Eric J. Baxter, Chihway\n  Chang, Marco Gatti, Sujeong Lee, Jessica Muir","title":"Late Time Modification of Structure Growth and the S8 Tension","comments":"6 pages, 5 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":"  The $S_8$ tension between low-redshift galaxy surveys and the primary CMB\nsignals a possible breakdown of the $\\Lambda$CDM model. Recently differing\nresults have been obtained using low-redshift galaxy surveys and the higher\nredshifts probed by CMB lensing, motivating a possible time-dependent\nmodification to the growth of structure. We investigate a simple\nphenomenological model in which the growth of structure deviates from the\n$\\Lambda$CDM prediction at late times, in particular as a simple function of\nthe dark energy density. Fitting to galaxy lensing, CMB lensing, BAO, and\nSupernovae datasets, we find significant evidence - 2.5 - 3$\\sigma$, depending\non analysis choices - for a non-zero value of the parameter quantifying a\ndeviation from $\\Lambda$CDM. The preferred model, which has a slower growth of\nstructure below $z\\sim 1$, improves the joint fit to the data over\n$\\Lambda$CDM. While the overall fit is improved, there is weak evidence for\ngalaxy and CMB lensing favoring different changes in the growth of structure.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:59:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lin","Meng-Xiang",""],["Jain","Bhuvnesh",""],["Raveri","Marco",""],["Baxter","Eric J.",""],["Chang","Chihway",""],["Gatti","Marco",""],["Lee","Sujeong",""],["Muir","Jessica",""]]}
{"id":"2308.16184","submitter":"Junlong Cheng","authors":"Junlong Cheng, Jin Ye, Zhongying Deng, Jianpin Chen, Tianbin Li, Haoyu\n  Wang, Yanzhou Su, Ziyan Huang, Jilong Chen, Lei Jiang, Hui Sun, Junjun He,\n  Shaoting Zhang, Min Zhu, Yu Qiao,","title":"SAM-Med2D","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Segment Anything Model (SAM) represents a state-of-the-art research\nadvancement in natural image segmentation, achieving impressive results with\ninput prompts such as points and bounding boxes. However, our evaluation and\nrecent research indicate that directly applying the pretrained SAM to medical\nimage segmentation does not yield satisfactory performance. This limitation\nprimarily arises from significant domain gap between natural images and medical\nimages. To bridge this gap, we introduce SAM-Med2D, the most comprehensive\nstudies on applying SAM to medical 2D images. Specifically, we first collect\nand curate approximately 4.6M images and 19.7M masks from public and private\ndatasets, constructing a large-scale medical image segmentation dataset\nencompassing various modalities and objects. Then, we comprehensively fine-tune\nSAM on this dataset and turn it into SAM-Med2D. Unlike previous methods that\nonly adopt bounding box or point prompts as interactive segmentation approach,\nwe adapt SAM to medical image segmentation through more comprehensive prompts\ninvolving bounding boxes, points, and masks. We additionally fine-tune the\nencoder and decoder of the original SAM to obtain a well-performed SAM-Med2D,\nleading to the most comprehensive fine-tuning strategies to date. Finally, we\nconducted a comprehensive evaluation and analysis to investigate the\nperformance of SAM-Med2D in medical image segmentation across various\nmodalities, anatomical structures, and organs. Concurrently, we validated the\ngeneralization capability of SAM-Med2D on 9 datasets from MICCAI 2023\nchallenge. Overall, our approach demonstrated significantly superior\nperformance and generalization capability compared to SAM.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:59:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cheng","Junlong",""],["Ye","Jin",""],["Deng","Zhongying",""],["Chen","Jianpin",""],["Li","Tianbin",""],["Wang","Haoyu",""],["Su","Yanzhou",""],["Huang","Ziyan",""],["Chen","Jilong",""],["Jiang","Lei",""],["Sun","Hui",""],["He","Junjun",""],["Zhang","Shaoting",""],["Zhu","Min",""],["Qiao","Yu",""]]}
{"id":"2308.16185","submitter":"Antonio Loquercio","authors":"Andrea Bajcsy, Antonio Loquercio, Ashish Kumar, Jitendra Malik","title":"Learning Vision-based Pursuit-Evasion Robot Policies","comments":"Includes Supplementary. Project webpage at\n  https://abajcsy.github.io/vision-based-pursuit/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning strategic robot behavior -- like that required in pursuit-evasion\ninteractions -- under real-world constraints is extremely challenging. It\nrequires exploiting the dynamics of the interaction, and planning through both\nphysical state and latent intent uncertainty. In this paper, we transform this\nintractable problem into a supervised learning problem, where a\nfully-observable robot policy generates supervision for a partially-observable\none. We find that the quality of the supervision signal for the\npartially-observable pursuer policy depends on two key factors: the balance of\ndiversity and optimality of the evader's behavior and the strength of the\nmodeling assumptions in the fully-observable policy. We deploy our policy on a\nphysical quadruped robot with an RGB-D camera on pursuit-evasion interactions\nin the wild. Despite all the challenges, the sensing constraints bring about\ncreativity: the robot is pushed to gather information when uncertain, predict\nintent from noisy measurements, and anticipate in order to intercept. Project\nwebpage: https://abajcsy.github.io/vision-based-pursuit/\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:59:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bajcsy","Andrea",""],["Loquercio","Antonio",""],["Kumar","Ashish",""],["Malik","Jitendra",""]]}
{"id":"2308.16186","submitter":"Miguel Angel Aragon-Calvo","authors":"M.A. Aragon-Calvo","title":"Hierarchical Reconstruction of the Cosmic Web, The H-Spine method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The cosmic web consists of a nested hierarchy of structures: voids, walls,\nfilaments, and clusters. These structures interconnect and can encompass one\nanother, collectively shaping an intricate network. Here we introduce the\nHierarchical Spine (H-Spine) method, a framework designed to hierarchically\nidentify and characterize voids, walls, and filaments. Inspired by the\ngeometrical and dynamical constraints imposed by anisotropic gravitational\ncollapse, the H-Spine method captures the geometry and interconnectivity\nbetween cosmic structures as well as their nesting relations, offering a more\ncomplete description of the cosmic web compared to single-scale or multi-scale\napproaches.\n  To illustrate the method's utility, we present the distribution of densities\nand sizes of voids, walls and filaments identified in a 3-level hierarchical\nspace. This analysis demonstrates how each level within the hierarchy unveils\ndistinctive densities and scales inherent to cosmic web elements.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:59:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Aragon-Calvo","M. A.",""]]}
{"id":"2308.16187","submitter":"Fengyu Yang","authors":"Shaokai Wu, Fengyu Yang","title":"Boosting Detection in Crowd Analysis via Underutilized Output Features","comments":"project page: https://fredfyyang.github.io/Crowd-Hat/","journal-ref":"CVPR 2023","doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Detection-based methods have been viewed unfavorably in crowd analysis due to\ntheir poor performance in dense crowds. However, we argue that the potential of\nthese methods has been underestimated, as they offer crucial information for\ncrowd analysis that is often ignored. Specifically, the area size and\nconfidence score of output proposals and bounding boxes provide insight into\nthe scale and density of the crowd. To leverage these underutilized features,\nwe propose Crowd Hat, a plug-and-play module that can be easily integrated with\nexisting detection models. This module uses a mixed 2D-1D compression technique\nto refine the output features and obtain the spatial and numerical distribution\nof crowd-specific information. Based on these features, we further propose\nregion-adaptive NMS thresholds and a decouple-then-align paradigm that address\nthe major limitations of detection-based methods. Our extensive evaluations on\nvarious crowd analysis tasks, including crowd counting, localization, and\ndetection, demonstrate the effectiveness of utilizing output features and the\npotential of detection-based methods in crowd analysis.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:59:11 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wu","Shaokai",""],["Yang","Fengyu",""]]}
{"id":"2308.16188","submitter":"Marco Ridenti","authors":"Marco A. Ridenti, Paulo R. Pascholati, Suzana Botelho, Josemary A. C.\n  Gon\\c{c}alves and Carmen C. Bueno","title":"Decay of $^{99m}$Tc as part of calibration procedure for $^{192}$Ir\n  activity measurements using a well type ionization chamber","comments":"This is a proceedings manuscript published in print in 2008 by the\n  Brazilian Physical Society. The name of the issue is Proceedings of the XXX\n  RTFNB, and it has not been published online as far as the authors are aware.\n  The ISBN of the issue is ISBN 978-85-89064-13-2","journal-ref":"In: XXX RTFNB Proceedings, \\'Aguas de Lind\\'oia, S\\~ao Paulo,\n  2008. v. 1. p. 110-111","doi":null,"report-no":null,"categories":"physics.ins-det nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work the linearity in the response of an ionization-chamber as a\nfunction of $^{99m}$Tc activity was checked as part of a calibration procedure\nfor $^{192}$Ir activity measurements. The non-linearity was found to be caused\nmainly by the electrometer range switching. A model based on the hypothesis\nthat the non-linear effect did not influence the decay constant was tested.\nThis method allowed to correct the non-linear effect and obtain the 99mTc\nactivity with good acuracy.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:18:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ridenti","Marco A.",""],["Pascholati","Paulo R.",""],["Botelho","Suzana",""],["Gon\u00e7alves","Josemary A. C.",""],["Bueno","Carmen C.",""]]}
{"id":"2308.16189","submitter":"Rajapboy Saparbayev","authors":"Ravshan Ashurov, Rajapboy Saparbayev","title":"Time-dependent identification problem for a fractional Telegraph\n  equation with the Caputo derivative","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study investigates the inverse problem of determining the right-hand\nside of a telegraph equation given in a Hilbert space. The main equation under\nconsideration has the form $(D_{t}^{\\rho})^{2}u(t)+2\\alpha\nD_{t}^{\\rho}u(t)+Au(t)=p( t)q+f(t)$, where $0<t\\leq T$, $0<\\rho<1$ and\n$D_{t}^{\\rho}$ is the Caputo derivative. The equation contains a self-adjoint\npositive operator $A$ and a time-varying multiplier $p(t)$ in the source\nfunction, which, like the solution of the equation, is unknown. To solve the\ninverse problem, an additional condition $B[u(t)] = \\psi(t)$ is imposed, where\n$B$ is an arbitrary bounded linear functional. The existence and uniqueness of\na solution to the problem are established and stability inequalities are\nderived. It should be noted that, as far as we know, such an inverse problem\nfor the telegraph equation is considered for the first time. Examples of the\noperator $A$ and the functional $B$ are discussed.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 09:15:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ashurov","Ravshan",""],["Saparbayev","Rajapboy",""]]}
{"id":"2308.16190","submitter":"Yiqiu Ma","authors":"Xiang Lin and Hao Yan and Yiqiu Ma and Zebing Zhou","title":"A construction method of the quasi-monolithic compact interferometer\n  based on UV-adhesives bonding","comments":"7 pages, 11 figures","journal-ref":"Rev Sci Instrum 94, 074501 (2023)","doi":null,"report-no":null,"categories":"physics.ins-det physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quasi-monolithic interferometers play a crucial role in high-precision\nmeasurement experiments, including gravitational wave detection, inertial\nsensing, vibrometry, and seismology. Achieving high stability and accuracy in\nsuch interferometers requires a method for bonding optical components to a\nbaseplate. While optical contact bonding and silicate bonding are common\nmethods, UV adhesives offer advantages such as controlled curing and low\ngeometrical requirements for optical components and baseplates. This paper\npresents a detailed construction method for a quasi-monolithic compact\ninterferometer based on UV-adhesive bonding. We built two types of\ninterferometers using this method: a $100\\,{\\rm mm} \\times 100\\,{\\rm mm}\\times\n20\\,{\\rm mm}$ Mach-Zender homodyne interferometer with unequal arm lengths of\nabout $100\\,{\\rm mm}$ for laser frequency noise monitoring, and a heterodyne\ninterferometer as a displacement sensing head sizing $20\\,{\\rm mm} \\times\n30\\,{\\rm mm}\\times 20\\,{\\rm mm}$. Our Mach-Zender interferometer achieved a\nphase noise level of $2\\,\\mu{\\rm rad}\\sqrt{{\\rm Hz}}$ at $1\\,{\\rm Hz}$ and a\nequivalent laser frequency noise monitoring sensitivity of about $1\\,{\\rm\nkHz}/\\sqrt{{\\rm Hz}}$ at $1\\,{\\rm Hz}$. The compact heterodyne interferometer\nsensing head showed a sensitivity level of $1\\,{\\rm pm}/\\sqrt{{\\rm Hz}}$ in\ntranslation and $0.2\\,{\\rm nrad}/\\sqrt{{\\rm Hz}}$ in two tilts above $0.4\\,{\\rm\nHz}$. Our tests demonstrate that quasi-monolithic compact interferometers based\non UV-adhesive bonding can achieve high sensitivity levels at the pico-meter\nand nano-radian scales.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:27:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lin","Xiang",""],["Yan","Hao",""],["Ma","Yiqiu",""],["Zhou","Zebing",""]]}
{"id":"2308.16191","submitter":"Solomon Manukure","authors":"Solomon Manukure, Morgan McAnally, Yuan Zhou, Demetrius Rowland, Gina\n  Pantano","title":"Explicit lump and line rogue wave solutions to a modified Hietarinta\n  equation","comments":"14 pages, 20 figures, to be published as a book chapter in a Springer\n  book titled \"Mathematical Analysis and Computation - 1st SGMC, Statesboro,\n  Georgia, U.S., April 2-3, 2021 (Virtual)\"","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lump solutions are spatially rationally localized solutions which usually\narise as solutions to higher dimensional nonlinear partial differential\nequations often possessing Hirota bilinear forms. Under some parameter\nconstraint, these solutions may lead to rogue wave solutions. In this article,\nwe study lump and rogue wave solutions of a new nonlinear non-evolutionary\nequation in 2+1 dimensions with the aid of a computer algebra system. We\npresent illustrative examples and analyze the dynamical behavior of the\nsolutions using graphical representations\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:27:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Manukure","Solomon",""],["McAnally","Morgan",""],["Zhou","Yuan",""],["Rowland","Demetrius",""],["Pantano","Gina",""]]}
{"id":"2308.16192","submitter":"Christis Katsouris","authors":"Christis Katsouris","title":"High Dimensional Time Series Regression Models: Applications to\n  Statistical Learning Methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  These lecture notes provide an overview of existing methodologies and recent\ndevelopments for estimation and inference with high dimensional time series\nregression models. First, we present main limit theory results for high\ndimensional dependent data which is relevant to covariance matrix structures as\nwell as to dependent time series sequences. Second, we present main aspects of\nthe asymptotic theory related to time series regression models with many\ncovariates. Third, we discuss various applications of statistical learning\nmethodologies for time series analysis purposes.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:53:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Katsouris","Christis",""]]}
{"id":"2308.16193","submitter":"Itsuko Hashimoto","authors":"Itsuko Hashimoto, Akitaka Matsumura","title":"Inviscid Limit Problem of radially symmetric stationary solutions for\n  compressible Navier-Stokes equation","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 is concerned with an inviscid limit problem of radially\nsymmetric stationary solutions for an exterior problem in $\\mathbb{R}^n (n\\ge\n2)$ to compressible Navier-Stokes equation, describing the motion of viscous\nbarotropic gas without external forces, where boundary and far field data are\nprescribed. For both inflow and outflow problems, the inviscid limit is\nconsidered in a suitably small neighborhood of the far field state. For the\noutflow problem, we prove the uniform convergence of the Navier-Stokes flow\ntoward the corresponding Euler flow in the inviscid limit. On the other hand,\nfor the inflow problem, we show that the Navier-Stokes flow uniformly converges\ntoward a linear superposition of the corresponding boundary layer profile and\nthe Euler flow in the inviscid limit. The estimates of algebraic rate toward\nthe inviscid limit are also obtained.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 23:49:54 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hashimoto","Itsuko",""],["Matsumura","Akitaka",""]]}
{"id":"2308.16194","submitter":"Romeo Mestrovic","authors":"Romeo Mestrovic","title":"The harmonic h-index: an impromevement of the Hirsch h-index and the\n  Egghe g-index","comments":"Submitted, 23 pages, two tables, no figures. arXiv admin note: text\n  overlap with arXiv:2307.12110","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In order to characterize the scientific output of scientists, in this paper\nwe define the harmonic har-index whose values are positive integers. It is\nproved that $h \\leq har \\leq g$, where h is the Hirsch index and g is the Egghe\nindex. Despite the fact that the har-index is defined in a completely different\nway (including sum of reciprocals of citations of a researcher), based on our\ncomputatioanl results, we get the surprising fact that this index is highly\ncorrelated with the hg-index ($hg=\\sqrt{hg}$ ) introduced by Alonso et al.\n(2010). Accordingly, we believe that the har-index keep the advantages of both\nmeasures as well as to minimize their disadvantages. In addition, it is much\neasier to calculate the values of har-index than those of g-index and hg-index.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:33:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mestrovic","Romeo",""]]}
{"id":"2308.16195","submitter":"Samiru Alhassan","authors":"Samiru Alhassan, Sergey V. Beliavskii, Vladimir N. Nesterov","title":"Evaluation of neutronic parameters for RITM-200 reactor unit considering\n  (238U+235U)O2, (232Th+235U)O2 and (232Th+233U)O2 dispersed fuel using MCU-PTR","comments":"The 5 pages and 5 figures for this manuscript as published as\n  conference proceeding at the International Youth Forum Russia - Africa:\n  Nuclear education-potential for successful regional development","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Simulation tools have become an integral tool in the analysis of neutronic\nparameters of reactor units. These simulation tools are built to solve the\nneutron transport equation. In this article, the MCU-PTR simulation tool is\nused in the evaluation of the possibility of achieving extra-long fuel lifetime\nin the RITM-200 reactor unit with consideration to the fuel composition. The\nthree dispersed fuel compositions (238U+235U)O2, (232Th+235U)O2 and\n(232Th+233U)O2 are simulated at varying fuel element diameter of 4.9 mm to 8.9\nmm with 1 mm interval. From the simulation, the dependence of reactivity margin\non the fuel burnup of the three dispersed fuels were established. The\ndependence of the effective multiplication factor (keff) on the reactor\noperation time for the three dispersed fuel composition were also determined.\nFrom the results, it can be deduced that transition of the fuel from (238U +\n235U)O2 to (232Th + 235U)O2 results in a 12% increase in the fuel burnup and no\nchange in fuel campaign. While the transition from (238U + 235U)O2 to (232Th +\n233U)O2 leads to a 32.4% increase in the fuel campaign and 45.6% increase in\nthe fuel burnup. It has also been shown that the optimal fuel element diameter\nis 7.9 mm for (232Th + 233U)O2 dispersed fuel. At this diameter, it is possible\nto increase the duration of the fuel campaign by 85.3% and achieve a fuel\nburnup of 51.9% in comparison to the design fuel diameter of 6.9 mm for (238U +\n235U)O2 dispersed fuel.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:00:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Alhassan","Samiru",""],["Beliavskii","Sergey V.",""],["Nesterov","Vladimir N.",""]]}
{"id":"2308.16196","submitter":"Fabien Panloup","authors":"Fabien Panloup (LAREMA), Julien Reygner (ENPC)","title":"Asymptotically unbiased approximation of the QSD of diffusion processes\n  with a decreasing time step Euler scheme","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We build and study a recursive algorithm based on the occupation measure of\nan Euler scheme with decreasing step for the numerical approximation of the\nquasistationary distribution (QSD) of an elliptic diffusion in a bounded\ndomain. We prove the almost sure convergence of the procedure for a family of\nredistributions and show that we can also recover the approximation of the rate\nof survival and the convergence in distribution of the algorithm. This last\npoint follows from some new bounds on the weak error related to diffusion\ndynamics with renewal.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:16:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Panloup","Fabien","","LAREMA"],["Reygner","Julien","","ENPC"]]}
{"id":"2308.16197","submitter":"Yuliia Kominko","authors":"Yuliia Kominko","title":"Frequency Dependence of Subsurface Flaws Detection Efficiency via The\n  Total Internal Reflection Ultrasonic Sensor","comments":"2 pages, 2 figures, APHYS 2021 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Total Internal Reflection Ultrasonic Sensor (TIRUS) is a device\nespecially aimed at detecting subsurface flaws in a tested specimen based on\nthe frustrated total internal reflection of bulk ultrasonic waves in the sensor\nbody [1]. In the fabricated experimental sample of the TIRUS a transducer of\nthe sensor emitted a slow shear wave with the velocity ~600 m/s (SSW) into the\n[110] direction of the TeO2 crystal (Fig. 1) [2]. The sensor design was such\nthat the displacement vector of the SSW lay in the planes of reflecting\nsurfaces of the crystal, that is, it was a shear horizontal (SH) wave with\nrespect to these planes. It was assumed that with such a design no other waves\nshould exist in the crystal except those polarized as the SSW [3]. The total\ninternal reflection of a probing ultrasonic wave incident at the interface\nbetween the sensor and a tested object is frustrated if there is a subsurface\nflaw in the evanescent field under the interface (Fig. 1, a). As a result, the\nreflected wave is affected, and the sensor output changes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:32:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kominko","Yuliia",""]]}
{"id":"2308.16198","submitter":"Raffaele Galliera","authors":"Raffaele Galliera, Kristen Brent Venable, Matteo Bassani, Niranjan\n  Suri","title":"Learning Collaborative Information Dissemination with Graph-based\n  Multi-Agent Reinforcement Learning","comments":"13 pages (4 of Supplementary Materials), 6 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.MA cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In modern communication systems, efficient and reliable information\ndissemination is crucial for supporting critical operations across domains like\ndisaster response, autonomous vehicles, and sensor networks. This paper\nintroduces a Multi-Agent Reinforcement Learning (MARL) approach as a\nsignificant step forward in achieving more decentralized, efficient, and\ncollaborative solutions. We propose a Decentralized-POMDP formulation for\ninformation dissemination, empowering each agent to independently decide on\nmessage forwarding. This constitutes a significant paradigm shift from\ntraditional heuristics based on Multi-Point Relay (MPR) selection. Our approach\nharnesses Graph Convolutional Reinforcement Learning, employing Graph Attention\nNetworks (GAT) with dynamic attention to capture essential network features. We\npropose two approaches, L-DGN and HL-DGN, which differ in the information that\nis exchanged among agents. We evaluate the performance of our decentralized\napproaches, by comparing them with a widely-used MPR heuristic, and we show\nthat our trained policies are able to efficiently cover the network while\nbypassing the MPR set selection process. Our approach promises a first step\ntoward bolstering the resilience of real-world broadcast communication\ninfrastructures via learned, collaborative information dissemination.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:30:16 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Galliera","Raffaele",""],["Venable","Kristen Brent",""],["Bassani","Matteo",""],["Suri","Niranjan",""]]}
{"id":"2308.16199","submitter":"Hiroshi Koibuchi","authors":"Gildas Diguet, Benjamin Ducharne, Sahbi El Hog, Fumitake Kato, Hiroshi\n  Koibuchi, Tetsuya Uchimoto and Hung The Diep","title":"Finsler Geometry Modeling and Monte Carlo Study on Geometrically\n  Confined skyrmions in Nanodots","comments":"4 pages, 9 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":"  Using the Finsler geometry modeling (FG) technique without spontaneous\nmagnetic anisotropy, we numerically study the stability and morphology of\ngeometrically confined skyrmions (skys) experimentally observed in nanodots. We\nfind a confinement effect that stabilizes skys for a low external magnetic\nfield without mechanical stresses by decreasing the diameter of the cylindrical\nlattice and strain effects that cause the sky and vortex to emerge under the\nzero magnetic field. Moreover, the obtained MC data on the morphological\nchanges are also consistent with the reported experimental data.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:27:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Diguet","Gildas",""],["Ducharne","Benjamin",""],["Hog","Sahbi El",""],["Kato","Fumitake",""],["Koibuchi","Hiroshi",""],["Uchimoto","Tetsuya",""],["Diep","Hung The",""]]}
{"id":"2308.16200","submitter":"Kian Tehranian","authors":"Kian Tehranian","title":"Can Machine Learning Catch Economic Recessions Using Economic and Market\n  Sentiments?","comments":"The full dataset is available from the corresponding authors on\n  reasonable request","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Quantitative models are an important decision-making factor for policy makers\nand investors. Predicting an economic recession with high accuracy and\nreliability would be very beneficial for the society. This paper assesses\nmachine learning technics to predict economic recessions in United States using\nmarket sentiment and economic indicators (seventy-five explanatory variables)\nfrom Jan 1986 - June 2022 on a monthly basis frequency. In order to solve the\nissue of missing time-series data points, Autoregressive Integrated Moving\nAverage (ARIMA) method used to backcast explanatory variables. Analysis started\nwith reduction in high dimensional dataset to only most important characters\nusing Boruta algorithm, correlation matrix and solving multicollinearity issue.\nAfterwards, built various cross-validated models, both probability regression\nmethods and machine learning technics, to predict recession binary outcome. The\nmethods considered are Probit, Logit, Elastic Net, Random Forest, Gradient\nBoosting, and Neural Network. Lastly, discussed different models performance\nbased on confusion matrix, accuracy and F1 score with potential reasons for\ntheir weakness and robustness.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:35:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tehranian","Kian",""]]}
{"id":"2308.16201","submitter":"Zurab Silagadze","authors":"Bikram Keshari Parida, Abhijit Sen, Shailesh Dhasmana and Zurab K.\n  Silagadze","title":"L\\'{e}vy-Leblond Equation and Eisenhart-Duval lift in Koopman-von\n  Neumann Mechanics","comments":"5 two-column pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Koopman-von Neumann (KvN) mechanics is an approach that was formulated\nlong ago to answer the question regarding the existence of a Hilbert space\nrepresentation of classical mechanics. KvN mechanics is a non-relativistic\ntheory, and it is not clear how spin can be included in it, since spin is\nwidely regarded as a relativistic property. In Eur. Phys. J. Spec. Top. {\\bf\n227}, 2195 (2019) it was argued that the Spohn equation [Ann. Phys. {\\bf 282},\n420 (2000)] is the correct classical framework for the Koopman-von Neumann\ntheory corresponding to the Dirac equation. However, after L\\'{e}vy-Leblond's\nseminal work on this topic, it became clear that spin naturally arises also\nfrom the Galilean invariant wave equations, without any need of relativistic\nconsiderations. Inspired by this, we propose another possibility of including\nspin in the KvN formalism: the L\\'{e}vy-Leblond equation in the Koopman-von\nNeumann formalism can be obtained as a null reduction of the massless Dirac\nequation in the Eisenhart-Duval lift metric. To illustrate the idea, we\nimplement it for a one-dimensional classical system without magnetic\ninteractions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:30:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Parida","Bikram Keshari",""],["Sen","Abhijit",""],["Dhasmana","Shailesh",""],["Silagadze","Zurab K.",""]]}
{"id":"2308.16202","submitter":"Xiaojun Yao","authors":"Lukas Ebner, Berndt M\\\"uller, Andreas Sch\\\"afer, Clemens Seidl and\n  Xiaojun Yao","title":"Eigenstate Thermalization in 2+1 dimensional SU(2) Lattice Gauge Theory","comments":"18 pages, 27 figures","journal-ref":null,"doi":null,"report-no":"IQuS@UW-21-062","categories":"cond-mat.stat-mech cond-mat.str-el hep-lat hep-ph nucl-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present preliminary numerical evidence for the hypothesis that the\nHamiltonian SU(2) gauge theory discretized on a lattice obeys the Eigenstate\nThermalization Hypothesis (ETH). To do so we study three approximations: (a) a\nlinear plaquette chain in a reduced Hilbert space limiting the electric field\nbasis to $j=0,\\frac{1}{2}$ , (b) a two-dimensional honeycomb lattice with\nperiodic or closed boundary condition and the same Hilbert space constraint,\nand (c) a chain of only three plaquettes but such a sufficiently large electric\nfield Hilbert space ($j \\leq \\frac{7}{2})$ that convergence of all energy\neigenvalues in the analyzed energy window is observed. While an unconstrained\nHilbert space is required to reach the continuum limit of SU(2) gauge theory,\nnumerical resource constraints do not permit us to realize this requirement for\nall values of the coupling constant and large lattices. In each of the three\nstudied cases we check first for RMT behavior and then analyse the diagonal as\nwell as the off-diagonal matrix elements between energy eigenstates for a few\noperators. Within current uncertainties all results for (b) and (c) agree with\nETH predictions while for case (a) deviations are found to be large for one of\nthe analyzed observables. To unambiguously establish ETH behavior and determine\nfor which class of operators it applies, an extension of our investigations is\nnecessary.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ebner","Lukas",""],["M\u00fcller","Berndt",""],["Sch\u00e4fer","Andreas",""],["Seidl","Clemens",""],["Yao","Xiaojun",""]]}
{"id":"2308.16203","submitter":"Tarik A. Rashid","authors":"Fatih Ozyurt, Jafar Majidpour, Tarik A. Rashid, Amir Majidpour, Canan\n  Koc","title":"Multi-Transfer Learning Techniques for Detecting Auditory Brainstem\n  Response","comments":"19","journal-ref":"Applied Acoustics, 2023","doi":"10.1016/j.apacoust.2023.109604","report-no":null,"categories":"eess.AS cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The assessment of the well-being of the peripheral auditory nerve system in\nindividuals experiencing hearing impairment is conducted through auditory\nbrainstem response (ABR) testing. Audiologists assess and document the results\nof the ABR test. They interpret the findings and assign labels to them using\nreference-based markers like peak latency, waveform morphology, amplitude, and\nother relevant factors. Inaccurate assessment of ABR tests may lead to\nincorrect judgments regarding the integrity of the auditory nerve system;\ntherefore, proper Hearing Loss (HL) diagnosis and analysis are essential. To\nidentify and assess ABR automation while decreasing the possibility of human\nerror, machine learning methods, notably deep learning, may be an appropriate\noption. To address these issues, this study proposed deep-learning models using\nthe transfer-learning (TL) approach to extract features from ABR testing and\ndiagnose HL using support vector machines (SVM). Pre-trained convolutional\nneural network (CNN) architectures like AlexNet, DenseNet, GoogleNet,\nInceptionResNetV2, InceptionV3, MobileNetV2, NASNetMobile, ResNet18, ResNet50,\nResNet101, ShuffleNet, and SqueezeNet are used to extract features from the\ncollected ABR reported images dataset in the proposed model. It has been\ndecided to use six measures accuracy, precision, recall, geometric mean (GM),\nstandard deviation (SD), and area under the ROC curve to measure the\neffectiveness of the proposed model. According to experimental findings, the\nShuffleNet and ResNet50 models' TL is effective for ABR to diagnose HL using an\nSVM classifier, with a high accuracy rate of 95% when using the 5-fold\ncross-validation method.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:40:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ozyurt","Fatih",""],["Majidpour","Jafar",""],["Rashid","Tarik A.",""],["Majidpour","Amir",""],["Koc","Canan",""]]}
{"id":"2308.16204","submitter":"Raimundo Rocha dos Santos","authors":"Raimundo R. dos Santos, Lucas Alves Oliveira, Natanael C. Costa","title":"Four interacting spins: addition of angular momenta, spin-spin\n  correlation functions, and entanglement","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study four spins on a ring coupled through competing Heisenberg\ninteractions between nearest neighbors, $J$, and next-nearest neighbors,\n$J_2\\equiv\\alpha J>0$. The spectrum is obtained in a simple way by using the\nrules for addition of 4 angular momenta. This allows us to follow the evolution\nof the ground state with $\\alpha$, characterized by level crossings and by\nanalyses of spin-spin correlation functions. Further insight is obtained by\nexamining the entanglement between different parts of the system: we observe\nthat the entanglement entropy is strongly dependent on how the system is\npartitioned.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 21:34:22 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Santos","Raimundo R. dos",""],["Oliveira","Lucas Alves",""],["Costa","Natanael C.",""]]}
{"id":"2308.16205","submitter":"Bifeng Guo","authors":"B. F. Guo, Q. Y. Peng, X. Q. Fang, F. R. Lin","title":"An Astrometric Approach to Measuring the Color of an Object","comments":"10 pages, 5 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The color of a star is a critical feature to reflect its physical property\nsuch as the temperature. The color index is usually obtained via absolute\nphotometry, which is demanding for weather conditions and instruments. In this\nwork, we present an astrometric method to measure the catalog-matched color\nindex of an object based on the effect of differential color refraction (DCR).\nSpecifically, we can observe an object using only one filter or alternately\nusing two different filters. Through the difference of the DCR effect compared\nwith reference stars, the catalog-matched color index of an object can be\nconveniently derived. Hence, we can perform DCR calibration and obtain its\naccurate and precise positions even if observed with Null filter during a large\nrange of zenith distances, by which the limiting magnitude and observational\nefficiency of the telescope can be significantly improved. This method takes\nadvantage of the DCR effect and builds a link between astrometry and\nphotometry. In practice, we measure the color indices and positions of Himalia\n(the sixth satellite of Jupiter) using 857 CCD frames over 8 nights by two\ntelescopes. Totally, the mean color index BP-RP (Gaia photometric system) of\nHimalia is 0.750 \\pm 0.004 magnitude. Through the rotational phased color index\nanalysis, we find two places with their color indices exceeding the mean \\pm 3\n\\sigma.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:25:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Guo","B. F.",""],["Peng","Q. Y.",""],["Fang","X. Q.",""],["Lin","F. R.",""]]}
{"id":"2308.16206","submitter":"Jincan Chen","authors":"Xiaohang Chen, Yinghui Zhou, Jincan Chen","title":"Innovative insights into which statements the third law of\n  thermodynamics includes exactly","comments":"16pages, 0 figure, 43 references","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  It is found from textbooks and literature that the third law of\nthermodynamics has three different statements, i.e., the Nernst theorem,\nunattainability statement of absolute zero temperature, and heat capacity\nstatement. It is pointed out that such three statements correspond to three\nthermodynamic parameters, which are, respectively, the entropy, temperature,\nand heat capacity, and can be obtained by extrapolating the experimental\nresults of different parameters at ultra-low temperatures to absolute zero. It\nis expounded that because there's no need for additional assumptions in the\nderivation of the Nernst equation, the Nernst theorem should be renamed as the\nNernst statement. Moreover, it is proved that both the Nernst statement and the\nheat capacity statement are mutually deducible and equivalent, while the\nunattainability of absolute zero temperature is only a corollary of the Nernst\nstatement or the heat capacity statement so that it is unsuitably referred to\nas one statement of the third law of thermodynamics. The conclusion is that the\nNernst statement and the heat capacity statement are two equivalent statements\nof the third law of thermodynamics.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 02:50:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Xiaohang",""],["Zhou","Yinghui",""],["Chen","Jincan",""]]}
{"id":"2308.16207","submitter":"Yi Ding","authors":"Yi Ding, Su Zhang, Chuangao Tang, Cuntai Guan","title":"MASA-TCN: Multi-anchor Space-aware Temporal Convolutional Neural\n  Networks for Continuous and Discrete EEG Emotion Recognition","comments":"11 pages, 4 figures. This work has been submitted to the IEEE for\n  possible publication. Copyright may be transferred without notice, after\n  which this version may no longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Emotion recognition using electroencephalogram (EEG) mainly has two\nscenarios: classification of the discrete labels and regression of the\ncontinuously tagged labels. Although many algorithms were proposed for\nclassification tasks, there are only a few methods for regression tasks. For\nemotion regression, the label is continuous in time. A natural method is to\nlearn the temporal dynamic patterns. In previous studies, long short-term\nmemory (LSTM) and temporal convolutional neural networks (TCN) were utilized to\nlearn the temporal contextual information from feature vectors of EEG. However,\nthe spatial patterns of EEG were not effectively extracted. To enable the\nspatial learning ability of TCN towards better regression and classification\nperformances, we propose a novel unified model, named MASA-TCN, for EEG emotion\nregression and classification tasks. The space-aware temporal layer enables TCN\nto additionally learn from spatial relations among EEG electrodes. Besides, a\nnovel multi-anchor block with attentive fusion is proposed to learn dynamic\ntemporal dependencies. Experiments on two publicly available datasets show\nMASA-TCN achieves higher results than the state-of-the-art methods for both EEG\nemotion regression and classification tasks. The code is available at\nhttps://github.com/yi-ding-cs/MASA-TCN.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 04:49:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ding","Yi",""],["Zhang","Su",""],["Tang","Chuangao",""],["Guan","Cuntai",""]]}
{"id":"2308.16208","submitter":"Christopher Timms","authors":"Christopher I. Timms","title":"Testing Models of 'Gravity' Using a Quantum Computer","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article begins by putting forth a model that shows how the storage and\nretrieval of information on a wave function that involves quantum entanglement\nbehaves similarly to the concepts of length contraction and time dilation,\nrespectively. An exploration is then made to see if another model can be\ngenerated based on the one previously mentioned that guides the time evolution\nof a quantum system in a manner similar to that of gravity. The answer is made\nin the affirmative, after testing a series of models, by producing a field that\nis mediated solely by the transfer of quantum information using both quantum\nentanglement and wave function collapse. While it is readily acknowledged that\nthe effective field produced may not be gravity, the study provides arguments\nabout why the concepts presented do in fact provide fundamental insights about\nthe true nature of gravity as opposed to merely generating similar behavior to\ngravity. The study moves on to study how a system with uniform effective\npotential behaves similarly to dark energy, albeit with a system whose\nconstruction is severely limited by computational resources. Finally, an\nexploration is made as to whether a negative gravitational mass can be\nproduced. It is found that while an isolated particle with negative\ngravitational mass proves to be problematic according to this model, it seems\nas though a local region with negative gravitational mass can be produced as\nlong as the resulting fields are cancelled out at larger distances.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 06:40:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Timms","Christopher I.",""]]}
{"id":"2308.16209","submitter":"Manouchehr Amiri","authors":"Manouchehr Amiri","title":"A New Generating Function for Hermite Polynomials","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a new generating function for Hermite polynomials of one\nvariable in the form of $g(x,t)=\\sum_{n=0}^{\\infty }t^{n}H^{e}_{n}(x)$ and\nreveals its connection with incomplete gamma function.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 08:24:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Amiri","Manouchehr",""]]}
{"id":"2308.16210","submitter":"EPTCS","authors":"Andreas Bueff (University of Edinburgh), Vaishak Belle (University of\n  Edinburgh)","title":"Deep Inductive Logic Programming meets Reinforcement Learning","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 339-352","doi":"10.4204/EPTCS.385.37","report-no":null,"categories":"cs.LG cs.LO cs.SC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One approach to explaining the hierarchical levels of understanding within a\nmachine learning model is the symbolic method of inductive logic programming\n(ILP), which is data efficient and capable of learning first-order logic rules\nthat can entail data behaviour. A differentiable extension to ILP, so-called\ndifferentiable Neural Logic (dNL) networks, are able to learn Boolean functions\nas their neural architecture includes symbolic reasoning. We propose an\napplication of dNL in the field of Relational Reinforcement Learning (RRL) to\naddress dynamic continuous environments. This represents an extension of\nprevious work in applying dNL-based ILP in RRL settings, as our proposed model\nupdates the architecture to enable it to solve problems in continuous RL\nenvironments. The goal of this research is to improve upon current ILP methods\nfor use in RRL by incorporating non-linear continuous predicates, allowing RRL\nagents to reason and make decisions in dynamic and continuous environments.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 09:08:46 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bueff","Andreas","","University of Edinburgh"],["Belle","Vaishak","","University of\n  Edinburgh"]]}
{"id":"2308.16211","submitter":"Raoni Wohnrath Arroyo","authors":"Raoni Arroyo and Jonas R. B. Arenhart and D\\'ecio Krause","title":"The elimination of metaphysics through the epistemological analysis:\n  lessons (un)learned from metaphysical underdetermination","comments":"Forthcoming in: Probing the Meaning of Quantum Mechanics. Aerts, D. &\n  Arenhart, J. R. B. & de Ronde, C. & Sergioli, G. (eds.) World Scientific,\n  2023","journal-ref":null,"doi":"10.1142/13602","report-no":null,"categories":"physics.hist-ph quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This chapter argues that the general philosophy of science should learn\nmetaphilosophical lessons from the case of metaphysical underdetermination, as\nit occurs in non-relativistic quantum mechanics. Section 2 presents the\ntraditional discussion of metaphysical underdetermination regarding the\nindividuality and non-individuality of quantum particles. Section 3 discusses\nthree reactions to it found in the literature: eliminativism about\nindividuality; conservatism about individuality; eliminativism about objects.\nSection 4 wraps it all up with metametaphysical considerations regarding the\nepistemology of metaphysics of science.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 12:51:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Arroyo","Raoni",""],["Arenhart","Jonas R. B.",""],["Krause","D\u00e9cio",""]]}
{"id":"2308.16212","submitter":"Ilia Igashov","authors":"Ilia Igashov, Arne Schneuing, Marwin Segler, Michael Bronstein and\n  Bruno Correia","title":"RetroBridge: Modeling Retrosynthesis with Markov Bridges","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-nc-nd/4.0/","abstract":"  Retrosynthesis planning is a fundamental challenge in chemistry which aims at\ndesigning reaction pathways from commercially available starting materials to a\ntarget molecule. Each step in multi-step retrosynthesis planning requires\naccurate prediction of possible precursor molecules given the target molecule\nand confidence estimates to guide heuristic search algorithms. We model\nsingle-step retrosynthesis planning as a distribution learning problem in a\ndiscrete state space. First, we introduce the Markov Bridge Model, a generative\nframework aimed to approximate the dependency between two intractable discrete\ndistributions accessible via a finite sample of coupled data points. Our\nframework is based on the concept of a Markov bridge, a Markov process pinned\nat its endpoints. Unlike diffusion-based methods, our Markov Bridge Model does\nnot need a tractable noise distribution as a sampling proxy and directly\noperates on the input product molecules as samples from the intractable prior\ndistribution. We then address the retrosynthesis planning problem with our\nnovel framework and introduce RetroBridge, a template-free retrosynthesis\nmodeling approach that achieves state-of-the-art results on standard evaluation\nbenchmarks.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:09:22 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Igashov","Ilia",""],["Schneuing","Arne",""],["Segler","Marwin",""],["Bronstein","Michael",""],["Correia","Bruno",""]]}
{"id":"2308.16213","submitter":"Andrea Paglietti","authors":"A. Paglietti","title":"On the impossibility of isothermal heat transfer and its implications\n  for thermal physics","comments":"22 pages, 1 figure","journal-ref":"Current Physical Chemistry 13 (3), 233-245 (2023)","doi":"10.2174/1877946813666230622161503","report-no":null,"categories":"cond-mat.stat-mech physics.class-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The physical impossibility of heat transfer under isothermal conditions\nimplies that the classical expression for the entropy of the ideal gas may not\nbe compatible with the internal energy of the gas itself. A corrected\nexpression of the ideal gas entropy is derived here. It is independent on\nvolume. This result is shown to be at a variance with the statistical\ninterpretations of entropy as a quantity that is related to the number of\nmicrostates compatible with the macroscopic state of the system. It also offers\na better understanding of the thermodynamic notion of entropy. The present\nanalysis also establishes a general equation that links the entropy of a system\nto its internal energy.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 15:43:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Paglietti","A.",""]]}
{"id":"2308.16214","submitter":"Jiang Zhou","authors":"Wenna Lu and Jiang Zhou","title":"Characterizations of the mixed central Campanato spaces via the\n  commutator operators of Hardy type","comments":"22 pages. arXiv admin note: text overlap with arXiv:2308.16108","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The purpose of this paper is to establish some characterizations of mixed\ncentral Campanato space $\\mathfrak{C}^{\\vec{p},\\lambda}(\\mathbb{R}^{n})$, via\nthe boundedness of the commutator operators of Hardy type. Unlike the case\n$\\lambda\\geq0$, there are some technical difficulties caused by $\\lambda<0$ to\nbe overcome. In addition, an extra assumption called as the mixed version of\nthe reverse H\\\"{o}lder class be required in the proof of the converse\ncharacterization. Moreover, some further interesting conclusions for the Hardy\ntype operators on mixed $\\lambda$-central Morrey space\n$\\mathcal{B}^{\\vec{p},\\lambda}(\\mathbb{R}^{n})$ are also derived.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:10:37 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lu","Wenna",""],["Zhou","Jiang",""]]}
{"id":"2308.16215","submitter":"Christoph Reich","authors":"Christoph Reich, Biplob Debnath, Deep Patel, Tim Prangemeier, Srimat\n  Chakradhar","title":"Deep Video Codec Control","comments":"22 pages, 26 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG cs.MM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Lossy video compression is commonly used when transmitting and storing video\ndata. Unified video codecs (e.g., H.264 or H.265) remain the \\emph{de facto}\nstandard, despite the availability of advanced (neural) compression approaches.\nTransmitting videos in the face of dynamic network bandwidth conditions\nrequires video codecs to adapt to vastly different compression strengths. Rate\ncontrol modules augment the codec's compression such that bandwidth constraints\nare satisfied and video distortion is minimized. While, both standard video\ncodes and their rate control modules are developed to minimize video distortion\nw.r.t. human quality assessment, preserving the downstream performance of deep\nvision models is not considered. In this paper, we present the first end-to-end\nlearnable deep video codec control considering both bandwidth constraints and\ndownstream vision performance, while not breaking existing standardization. We\ndemonstrate for two common vision tasks (semantic segmentation and optical flow\nestimation) and on two different datasets that our deep codec control better\npreserves downstream performance than using 2-pass average bit rate control\nwhile meeting dynamic bandwidth constraints and adhering to standardizations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:44:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Reich","Christoph",""],["Debnath","Biplob",""],["Patel","Deep",""],["Prangemeier","Tim",""],["Chakradhar","Srimat",""]]}
{"id":"2308.16216","submitter":"Tejinder P. Singh","authors":"Tejinder P. Singh","title":"Gravitation, and quantum theory, as emergent phenomena","comments":"19 pages, 8 figures, based on a talk given at DICE2022: Spacetime,\n  Matter, Quantum Mechanics (Castiglioncello, Italy, Sep. 19-23, 2022),\n  published in the conference proceedings","journal-ref":"J. Phys.: Conf. Series 2533, 012013 (2023)","doi":"10.1088/1742-6596/2533/1/012013","report-no":null,"categories":"physics.gen-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There must exist a reformulation of quantum field theory, even at low\nenergies, which does not depend on classical time. The octonionic theory\nproposes such a reformulation, leading to a pre-quantum pre-spacetime theory.\nThe ingredients for constructing such a theory, which is also a unification of\nthe standard model with gravitation, are : (i) the pre-quantum theory of trace\ndynamics: a matrix-valued Lagrangian dynamics, (ii) the spectral action\nprinciple of non-commutative geometry, (iii) the number system known as the\noctonions, for constructing a non-commutative manifold and for defining\nelementary particles via Clifford algebras, (iv) a Lagrangian with $E_8 \\times\nE_8$ symmetry. The split bioctonions define a sixteen dimensional space (with\nleft-right symmetry) whose geometry (evolving in Connes time) relates to the\nfour known fundamental forces, while predicting two new forces, $SU(3)_{grav}$\nand $U(1)_{grav}$. This latter interaction is possibly the theoretical origin\nof MOND. Coupling constants of the standard model result from left-right\nsymmetry breaking, and their values are theoretically determined by the\ncharacteristic equation of the exceptional Jordan algebra of the octonions. The\nquantum-to-classical transition, precipitated by the entanglement of a critical\nnumber of fermions, is responsible for the emergence of classical spacetime,\nand also for the familiar formulation of quantum theory on a spacetime\nbackground.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 16:59:13 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Singh","Tejinder P.",""]]}
{"id":"2308.16217","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Skewness and kurtosis of mean transverse momentum fluctuations at the\n  LHC energies","comments":"24 pages, 5 captioned figures, 1 table, authors from page 18,\n  submitted to PLB, figures at http://alice-publications.web.cern.ch/node/9598","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-187","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The first measurements of skewness and kurtosis of mean transverse momentum\n($\\langle p_\\mathrm{T}\\rangle$) fluctuations are reported in Pb$-$Pb collisions\nat $\\sqrt{s_\\mathrm{NN}}$ = 5.02 TeV, Xe$-$Xe collisions at\n$\\sqrt{s_\\mathrm{NN}}$ $=$ 5.44 TeV and pp collisions at $\\sqrt{s} = 5.02$ TeV\nusing the ALICE detector. The measurements are carried out as a function of\nsystem size $\\langle\n\\mathrm{d}N_\\mathrm{ch}/\\mathrm{d}\\eta\\rangle_{|\\eta|<0.5}^{1/3}$, using\ncharged particles with transverse momentum ($p_\\mathrm{T}$) and pseudorapidity\n($\\eta$), in the range $0.2 < p_\\mathrm{T} < 3.0$ GeV/$c$ and $|\\eta| < 0.8$,\nrespectively. In Pb$-$Pb and Xe$-$Xe collisions, positive skewness is observed\nin the fluctuations of $\\langle p_\\mathrm{T}\\rangle$ for all centralities,\nwhich is significantly larger than what would be expected in the scenario of\nindependent particle emission. This positive skewness is considered a crucial\nconsequence of the hydrodynamic evolution of the hot and dense nuclear matter\ncreated in heavy-ion collisions. Furthermore, similar observations of positive\nskewness for minimum bias pp collisions are also reported here. Kurtosis of\n$\\langle p_\\mathrm{T}\\rangle$ fluctuations is found to be in good agreement\nwith the kurtosis of Gaussian distribution, for most central Pb$-$Pb\ncollisions. Hydrodynamic model calculations with MUSIC using Monte Carlo\nGlauber initial conditions are able to explain the measurements of both\nskewness and kurtosis qualitatively from semicentral to central collisions in\nPb--Pb system. Color reconnection mechanism in PYTHIA8 model seems to play a\npivotal role in capturing the qualitative behavior of the same measurements in\npp collisions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 17:50:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16218","submitter":"Natalia Toro","authors":"Philip Schuster, Natalia Toro","title":"Quantum Electrodynamics Mediated by a Photon with Generalized\n  (Continuous) Spin","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present rules for computing scattering amplitudes of charged scalar matter\nand photons, where the photon has non-zero spin Casimir $\\rho$, and is\ntherefore a continuous spin particle (CSP). The amplitudes reduce to familiar\nscalar QED when $\\rho\\rightarrow 0$. As a concrete example, we compute the pair\nannihilation and Compton scattering amplitudes in this theory and comment on\ntheir physical properties, including unitarity and scaling behavior at small\nand large $\\rho$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Schuster","Philip",""],["Toro","Natalia",""]]}
{"id":"2308.16219","submitter":"Ameen Ismail","authors":"Steven Ferrante, Ameen Ismail, Seung J. Lee, Yunha Lee","title":"Forbidden conformal dark matter at a GeV","comments":"16 + 8 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 introduce a model of dark matter (DM) where the DM is a composite of a\nspontaneously broken conformal field theory. The DM is a thermal relic with its\nabundance determined by the freeze-out of annihilations to dilatons, the\nGoldstone boson of broken conformal symmetry. If the dilaton is heavier than\nthe DM this is an example of forbidden DM. We explore the phenomenology of this\nmodel in its 5D dual description, corresponding to a warped extra dimension\nwith the Standard Model on the ultraviolet brane and the DM on the infrared\nbrane. We find the model is compatible with theoretical and experimental\nconstraints for DM masses in the $0.1$-$10$ GeV range. The conformal phase\ntransition is supercooled and strongly first-order. It can source large\nstochastic gravitational wave signals consistent with those recently observed\nat pulsar timing arrays like NANOGrav. The majority of the viable parameter\nspace will be probed by future detectors designed to search for long-lived\nparticles, including most of the region favored by the NANOGrav signal. The\nrest of the parameter space can be probed at future direct detection\nexperiments.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ferrante","Steven",""],["Ismail","Ameen",""],["Lee","Seung J.",""],["Lee","Yunha",""]]}
{"id":"2308.16220","submitter":"David Schmid","authors":"David Schmid, Y\\`il\\`e Y\\=ing, Matthew Leifer","title":"A review and analysis of six extended Wigner's friend arguments","comments":"30 pages, 9 figures; comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Wigner's friend thought experiment was intended to illustrate the\ndifficulty one has in describing an agent as a quantum system when that agent\nperforms a measurement. While it does pose a challenge to the orthodox\ninterpretation of quantum theory, most modern interpretations have no trouble\nin resolving the difficulty. Recently, a number of extensions of Wigner's ideas\nhave been proposed. We provide a gentle introduction to six such arguments,\nmodifying the specifics of many of them so that they are as simple and unified\nas possible. In particular, we show that all of the arguments hinge on\nassumptions about correlations between measurement outcomes that are not\naccessible to any observer, even in principle. We then provide a critical\nanalysis of each argument, focusing especially on how well one can motivate the\nrequired assumptions regarding these inaccessible correlations. Although we\nargue that some of these assumptions are not entirely well-motivated, all of\nthe arguments do shed light on the nature of quantum theory, especially when\nconcerning the description of agents and their measurements. Although there are\nother possible responses, the most compelling of these no-go theorems can be\ntaken to support the view that measurement outcomes are perspectival rather\nthan absolute.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Schmid","David",""],["Y\u012bng","Y\u00ecl\u00e8",""],["Leifer","Matthew",""]]}
{"id":"2308.16221","submitter":"\\`Oscar Lara Crosas","authors":"\\`Oscar L. Crosas, Christopher J. Monahan, Matthew D. Rizik, Andrea\n  Shindler, Peter Stoffer","title":"One-loop matching of the $CP$-odd three-gluon operator to the gradient\n  flow","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":"PSI-PR-23-32, ZU-TH 48/23","categories":"hep-lat hep-ex hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The calculation of the neutron electric dipole moment within effective field\ntheories for physics beyond the Standard Model requires non-perturbative\nhadronic matrix elements of effective operators composed of quark and gluon\nfields. In order to use input from lattice computations, these matrix elements\nmust be translated from a scheme suitable for lattice QCD to the\nminimal-subtraction scheme used in the effective-field-theory framework. The\naccuracy goal in the context of the neutron electric dipole moment necessitates\nat least a one-loop matching calculation. Here, we provide the one-loop\nmatching coefficients for the $CP$-odd three-gluon operator between two\ndifferent minimally subtracted 't Hooft-Veltman schemes and the gradient flow.\nThis completes our program to obtain the one-loop gradient-flow matching\ncoefficients for all $CP$-violating and flavor-conserving operators in the\nlow-energy effective field theory up to dimension six.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Crosas","\u00d2scar L.",""],["Monahan","Christopher J.",""],["Rizik","Matthew D.",""],["Shindler","Andrea",""],["Stoffer","Peter",""]]}
{"id":"2308.16222","submitter":"Mohammad Mirakhor","authors":"M. S. Mirakhor, S. A. Walker, M. Sundquist and D. Chandra","title":"Two large-scale sloshing cold fronts in the outskirts of the galaxy\n  cluster Abell 3558","comments":"5 pages, 4 figures. Accepted for publication in MNRAS Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Previous studies of the massive nearby galaxy cluster Abell 3558 reported a\ncold front around the cluster core, which is attributed to the sloshing of the\ncore as it responds to the gravitational disturbance created by a past minor\nmerger. Here, using XMM-Newton mosaic, we report the detection of two rare\nlarge-scale sloshing cold fronts far outside the cooling radius of Abell 3558.\nOne of the detected cold fronts is located 600 kpc from the cluster core to the\nsouth-east, while the other is located 1.2 Mpc from the cluster core to the\nnorth-west. The latter cold front is one of the most distant cold fronts ever\nobserved in a galaxy cluster. Our findings are in agreement with previous\nstudies that sloshing can extend well beyond the cooling radius, on scales\nexceeding half the virial radius, suggesting that sloshing is a cluster-wide\nphenomenon and may affect the cluster's global properties.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mirakhor","M. S.",""],["Walker","S. A.",""],["Sundquist","M.",""],["Chandra","D.",""]]}
{"id":"2308.16223","submitter":"Yifan Zhou","authors":"Yifan Zhou, Brendan P. Bowler, Haifeng Yang, Aniket Sanghi, Gregory J.\n  Herczeg, Adam L. Kraus, Jaehan Bae, Feng Long, Katherine B. Follette,\n  Kimberley Ward-Duong, Zhaohuan Zhu, Lauren I. Biddle, Laird M. Close, Lillian\n  Yushu Jiang, and Ya-Lin Wu","title":"UV-Optical Emission of AB Aur b is Consistent with Scattered Stellar\n  Light","comments":"11 pages, 6 figures. Accepted for publication in AJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The proposed protoplanet AB Aur b is a spatially concentrated emission source\nimaged in the mm-wavelength disk gap of the Herbig Ae/Be star AB Aur. Its\nnear-infrared spectrum and absence of strong polarized light have been\ninterpreted as evidence supporting the protoplanet interpretation. However, the\ncomplex scattered light structures in the AB Aur disk pose challenges in\nresolving the emission source and interpreting the true nature of AB Aur b. We\npresent new images of the AB Aur system obtained using the Hubble Space\nTelescope Wide Field Camera 3 in the ultraviolet (UV) and optical bands. AB Aur\nb and the known disk spirals are recovered in the F336W, F410M, and F645N\nbands. The spectral energy distribution of AB Aur b shows absorption in the\nBalmer jump, mimicking those of early-type stars. By comparing the colors of AB\nAur b to those of the host star, the disk spirals, and predictions from\nscattered light and self-luminous models, we find that the emission from AB Aur\nb is inconsistent with planetary photospheric or accretion shock models.\nInstead, it is consistent with those measured in the circumstellar disks that\ntrace scattered light. We conclude that the UV and visible emission from AB Aur\nb does not necessitate the presence of a protoplanet. We synthesize\nobservational constraints on AB Aur b and discuss inconsistent interpretations\nof AB Aur b among different datasets. Considering the significance of the AB\nAur b discovery, we advocate for further observational evidence to verify its\nplanetary nature.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhou","Yifan",""],["Bowler","Brendan P.",""],["Yang","Haifeng",""],["Sanghi","Aniket",""],["Herczeg","Gregory J.",""],["Kraus","Adam L.",""],["Bae","Jaehan",""],["Long","Feng",""],["Follette","Katherine B.",""],["Ward-Duong","Kimberley",""],["Zhu","Zhaohuan",""],["Biddle","Lauren I.",""],["Close","Laird M.",""],["Jiang","Lillian Yushu",""],["Wu","Ya-Lin",""]]}
{"id":"2308.16224","submitter":"Bibhushan Shakya","authors":"Bibhushan Shakya","title":"Aspects of Particle Production from Bubble Dynamics at a First Order\n  Phase Transition","comments":"20 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"DESY 23-125","categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  First order phase transitions (FOPTs) constitute an active area of\ncontemporary research as a promising cosmological source of observable\ngravitational waves. The spacetime dynamics of the background scalar field\nundergoing the phase transition can also directly produce quanta of particles\nthat couple to the scalar, which has not been studied as extensively in the\nliterature. This paper provides the first careful examination of various\nimportant aspects of this phenomenon. In particular, the contributions from\nvarious stages of FOPTs (bubble nucleation, expansion, collision) are\ndisentangled. It is demonstrated that heavy particles primarily originate from\nthe relative motion of bubble walls at distances comparable to the Compton\nwavelength of the particle rather than from the bubble collision itself.\nSubtleties related to non-universality of particle interactions and masses in\ndifferent vacua are discussed, and a prescription to choose the correct vacuum\nfor the calculation is provided. The suppression of non-perturbative effects\nsuch as tachyonic instability and parametric resonance due to the inhomegeneous\nnature of the process is examined.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shakya","Bibhushan",""]]}
{"id":"2308.16225","submitter":"Marco Muzio","authors":"Marco Stein Muzio, No\\'emie Globus","title":"Neutrino anisotropy as a probe of extreme astrophysical accelerators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider how the cutoff of the ultrahigh energy neutrino spectrum\nintroduces an effective neutrino horizon, allowing for future neutrino\ndetectors to measure an anisotropy in neutrino arrival directions driven by the\nlocal large-scale structure. We show that measurement of the level of this\nanisotropy along with features of the neutrino spectrum will allow for a\nmeasurement of the evolution of ultrahigh energy neutrino sources, which are\nexpected to also be the sources of ultrahigh energy cosmic rays.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Muzio","Marco Stein",""],["Globus","No\u00e9mie",""]]}
{"id":"2308.16226","submitter":"Arvin Shahbazi-Moghaddam","authors":"Netta Engelhardt, Geoff Penington, Arvin Shahbazi-Moghaddam","title":"Twice Upon a Time: Timelike-Separated Quantum Extremal Surfaces","comments":"39 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Python's Lunch conjecture for the complexity of bulk reconstruction\ninvolves two types of nonminimal quantum extremal surfaces (QESs): bulges and\nthroats, which differ by their local properties. The conjecture relies on the\nconnection between bulk spatial geometry and quantum codes: a constricting\ngeometry from bulge to throat encodes the bulk state nonisometrically, and so\nrequires an exponentially complex Grover search to decode. However, thus far,\nthe Python's Lunch conjecture is only defined for spacetimes where all QESs are\nspacelike-separated from one another. Here we explicitly construct\n(time-reflection symmetric) spacetimes featuring both timelike-separated bulges\nand timelike-separated throats. Interestingly, all our examples also feature a\nthird type of QES, locally resembling a de Sitter bifurcation surface, which we\nname a bounce. By analyzing the Hessian of generalized entropy at a QES, we\nargue that this classification into throats, bulges and bounces is exhaustive.\nWe then propose an updated Python's Lunch conjecture that can accommodate\ngeneral timelike-separated QESs and bounces. Notably, our proposal suggests\nthat the gravitational analogue of a tensor network is not necessarily the\ntime-reflection symmetric slice, even when one exists.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Engelhardt","Netta",""],["Penington","Geoff",""],["Shahbazi-Moghaddam","Arvin",""]]}
{"id":"2308.16227","submitter":"Kyriakos Destounis Dr.","authors":"Kyriakos Destounis and Francisco Duque","title":"Black-hole spectroscopy: quasinormal modes, ringdown stability and the\n  pseudospectrum","comments":"34 pages, 24 figures, Topical review presented on the 11th Aegean\n  Summer School, Syros, Greece","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE hep-th math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Black-hole spectroscopy is a powerful tool to probe the Kerr nature of\nastrophysical compact objects and their environment. The observation of\nmultiple ringdown modes in gravitational waveforms could soon lead to\nhigh-precision gravitational-wave spectroscopy, thus it is critical to\nunderstand if the quasinormal mode spectrum itself is affected by astrophysical\nenvironments, quantum corrections, and other generic modifications. In this\nchapter, we will review the black-hole spectroscopy program and its challenges\nregarding quasinormal mode detection, the overtone status and the recent\nevidence that supports the existence of nonlinearities in the spectrum of black\nholes. We will then discuss a newly introduced non-modal tool in black-hole\nphysics, namely the pseudospectrum; a mathematical notion that can shed light\non the spectral stability of quasinormal modes, and discuss its novel\napplications in black holes and exotic horizonless compact objects. We will\nshow that quasinormal modes generically suffer from spectral instabilities,\nexplore how such phenomena can further affect black-hole spectroscopy, and\ndiscuss potential ringdown imprints and waveform stability issues in current\nand future gravitational-wave detectors.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Destounis","Kyriakos",""],["Duque","Francisco",""]]}
{"id":"2308.16228","submitter":"Andi Gu","authors":"Andi Gu, Lorenzo Leone, Soumik Ghosh, Jens Eisert, Susanne Yelin,\n  Yihui Quek","title":"A little magic means a lot","comments":"29 pages, 2 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Notions of so-called magic quantify how non-classical quantum states are in a\nprecise sense: high values of magic are necessary to demonstrate a quantum\nadvantage in quantum computing; they also play a key role in quantum error\ncorrection. In this work, we introduce the phenomenon of 'pseudomagic' --\nwherein certain ensembles of quantum states with low magic are computationally\nindistinguishable from quantum states with high magic. Previously, such\ncomputational indistinguishability has been studied with respect to\nentanglement, by introducing the notion of pseudoentanglement. However, we show\nthat pseudomagic neither follows from pseudoentanglement, nor implies it. In\nterms of applications, pseudomagic sheds new light on the theory of quantum\nchaos: it reveals the existence of states that, although built from non-chaotic\nunitaries, cannot be distinguished from random chaotic states by any physical\nobserver. Further applications include new lower bounds on state synthesis\nproblems, property testing protocols, as well as implications for quantum\ncryptography. Our results have the conceptual implication that magic is a\n'hide-able' property of quantum states: some states have a lot more magic than\nmeets the (computationally-bounded) eye. From the physics perspective, it\nadvocates the mindset that the only physical properties that can be measured in\na laboratory are those that are efficiently computationally detectable.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gu","Andi",""],["Leone","Lorenzo",""],["Ghosh","Soumik",""],["Eisert","Jens",""],["Yelin","Susanne",""],["Quek","Yihui",""]]}
{"id":"2308.16229","submitter":"Yuxuan Zhang","authors":"Yuxuan Zhang, Shahin Jahanbani, Ameya Riswadkar, S. Shankar, and\n  Andrew C. Potter","title":"Sequential quantum simulation of spin chains with a single circuit QED\n  device","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.str-el","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Quantum simulation of many-body systems in materials science and chemistry\nare promising application areas for quantum computers. However, the limited\nscale and coherence of near-term quantum processors pose a significant obstacle\nto realizing this potential. Here, we theoretically outline how a\nsingle-circuit quantum electrodynamics (cQED) device, consisting of a transmon\nqubit coupled to a long-lived cavity mode, can be used to simulate the ground\nstate of a highly-entangled quantum many-body spin chain. We exploit recently\ndeveloped methods for implementing quantum operations to sequentially build up\na matrix product state (MPS) representation of a many-body state. This approach\nre-uses the transmon qubit to read out the state of each spin in the chain and\nexploits the large state space of the cavity as a quantum memory encoding\ninter-site correlations and entanglement. We show, through simulation, that\nanalog (pulse-level) control schemes can accurately prepare a known MPS\nrepresentation of a quantum critical spin chain in significantly less time than\ndigital (gate-based) methods, thereby reducing the exposure to decoherence. We\nthen explore this analog-control approach for the variational preparation of an\nunknown ground state. We demonstrate that the large state space of the cavity\ncan be used to replace multiple qubits in a qubit-only architecture, and could\ntherefore simplify the design of quantum processors for materials simulation.\nWe explore the practical limitations of realistic noise and decoherence and\ndiscuss avenues for scaling this approach to more complex problems that\nchallenge classical computational methods.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Yuxuan",""],["Jahanbani","Shahin",""],["Riswadkar","Ameya",""],["Shankar","S.",""],["Potter","Andrew C.",""]]}
{"id":"2308.16230","submitter":"Sebasti\\'an Roca-Jerat","authors":"Sebasti\\'an Roca-Jerat, Juan Rom\\'an-Roche, David Zueco","title":"Qudit Machine Learning","comments":"21 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a comprehensive investigation into the learning capabilities of a\nsimple d-level system (qudit). Our study is specialized for classification\ntasks using real-world databases, specifically the Iris, breast cancer, and\nMNIST datasets. We explore various learning models in the metric learning\nframework, along with different encoding strategies. In particular, we employ\ndata re-uploading techniques and maximally orthogonal states to accommodate\ninput data within low-dimensional systems.\n  Our findings reveal optimal strategies, indicating that when the dimension of\ninput feature data and the number of classes are not significantly larger than\nthe qudit's dimension, our results show favorable comparisons against the best\nclassical models. This trend holds true even for small quantum systems, with\ndimensions d<5 and utilizing algorithms with a few layers (L=1,2). However, for\nhigh-dimensional data such as MNIST, we adopt a hybrid approach involving\ndimensional reduction through a convolutional neural network. In this context,\nwe observe that small quantum systems often act as bottlenecks, resulting in\nlower accuracy compared to their classical counterparts.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Roca-Jerat","Sebasti\u00e1n",""],["Rom\u00e1n-Roche","Juan",""],["Zueco","David",""]]}
{"id":"2308.16231","submitter":"Mathias Pierre","authors":"Marcos A. G. Garcia, Mathieu Gross, Yann Mambrini, Keith A. Olive,\n  Mathias Pierre and Jong-Hyun Yoon","title":"Effects of Fragmentation on Post-Inflationary Reheating","comments":"29 pages, 9 figures","journal-ref":null,"doi":null,"report-no":"UMN--TH--4223/23, FTPI--MINN--23/15, DESY-23-122","categories":"hep-ph astro-ph.CO gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the effects of fragmentation on the post-inflationary epoch of\nreheating. In simple single field models of inflation, an inflaton condensate\nundergoes an oscillatory phase once inflationary expansion ends. The equation\nof state of the condensate depends on the shape of the scalar potential,\n$V(\\phi)$, about its minimum. Assuming $V(\\phi) \\sim \\phi^k$, the equation of\nstate parameter is given by $w = P_\\phi/\\rho_\\phi = (k-2)/(k+2)$. The evolution\nof condensate and the reheating process depend on $k$. For $k \\ge 4$, inflaton\nself-interactions may lead to the fragmentation of the condensate and alter the\nreheating process. Indeed, these self-interactions lead to the production of a\nmassless gas of inflaton particles as $w$ relaxes to 1/3. If reheating occurs\nbefore fragmentation, the effects of fragmentation are harmless. We find,\nhowever, that the effects of fragmentation depend sensitively to the specific\nreheating process. Reheating through the decays to fermions is largely excluded\nsince perturbative couplings would imply that fragmentation occurs before\nreheating and in fact could prevent reheating from completion. Reheating\nthrough the decays to boson is relatively unaffected by fragmentation and\nreheating through scatterings results in a lower reheating temperature.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Garcia","Marcos A. G.",""],["Gross","Mathieu",""],["Mambrini","Yann",""],["Olive","Keith A.",""],["Pierre","Mathias",""],["Yoon","Jong-Hyun",""]]}
{"id":"2308.16232","submitter":"Eleonore Faber","authors":"Eleonore Faber, Bethany Rose Marsh, Matthew Pressland","title":"Reduction of Frobenius extriangulated categories","comments":"39 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CO math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe a reduction technique for stably 2-Calabi--Yau Frobenius\nextriangulated categories $\\mathcal{F}$ with respect to a functorially finite\nrigid subcategory $\\mathcal{X}$. The reduction of such a category is another\ncategory $\\mathcal{X}^{\\perp_1}\\subseteq\\mathcal{F}$ of the same kind, whose\ncluster-tilting subcategories are those cluster-tilting subcategories\n$\\mathcal{T}\\subseteq\\mathcal{F}$ such that $\\mathcal{X}\\subseteq\\mathcal{T}$.\nThis reduction operation generalises Iyama--Yoshino's reduction for\n2-Calabi--Yau triangulated categories, which is recovered by passing to stable\ncategories. Moreover, for a certain class of categories $\\mathcal{F}$ and rigid\nobjects $M$, we show that the relationship between $\\mathcal{F}$ and\n$M^{\\perp_1}$ may also be expressed in terms of internally Calabi--Yau\nalgebras, in the sense of the third author. As an application, we give a\nconceptual proof of a result on frieze patterns originally obtained by the\nfirst author with Baur, Gratz, Serhiyenko, and Todorov.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Faber","Eleonore",""],["Marsh","Bethany Rose",""],["Pressland","Matthew",""]]}
{"id":"2308.16233","submitter":"Oles Shtanko","authors":"Oles Shtanko, Yu-Jie Liu, Simon Lieu, Alexey V. Gorshkov, Victor V.\n  Albert","title":"Bounds on Autonomous Quantum Error Correction","comments":"51 pages, 8 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous quantum memories are a way to passively protect quantum\ninformation using engineered dissipation that creates an \"always-on'' decoder.\nWe analyze Markovian autonomous decoders that can be implemented with a wide\nrange of qubit and bosonic error-correcting codes, and derive several upper\nbounds and a lower bound on the logical error rate in terms of correction and\nnoise rates. For many-body quantum codes, we show that, to achieve error\nsuppression comparable to active error correction, autonomous decoders\ngenerally require correction rates that grow with code size. For codes with a\nthreshold, we show that it is possible to achieve faster-than-polynomial decay\nof the logical error rate with code size by using superlogarithmic scaling of\nthe correction rate. We illustrate our results with several examples. One\nexample is an exactly solvable global dissipative toric code model that can\nachieve an effective logical error rate that decreases exponentially with the\nlinear lattice size, provided that the recovery rate grows proportionally with\nthe linear lattice size.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shtanko","Oles",""],["Liu","Yu-Jie",""],["Lieu","Simon",""],["Gorshkov","Alexey V.",""],["Albert","Victor V.",""]]}
{"id":"2308.16234","submitter":"Jonathan Nilsson Hall\\'en","authors":"Jonathan N. Hall\\'en, Claudio Castelnovo and Roderich Moessner","title":"Thermodynamics and fractal dynamics of nematic spin ice, a doubly\n  frustrated pyrochlore Ising magnet","comments":"20 pages, 18 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":"  The Ising antiferromagnets on the triangular and on the pyrochlore lattices\nare two of the most iconic examples of magnetic frustration, paradigmatically\nillustrating many exotic properties such as emergent gauge fields,\nfractionalisation, and topological order. In this work, we show that the two\ninstances of frustration can, remarkably, be combined in a single system, where\nthey coexist without inducing conventional long range ordering. We show that\nthe system undergoes a first order phase transition upon lowering the\ntemperature, into a yet different frustrated phase that we characterise to\nexhibit nematic order. We argue that an extensive degeneracy survives down to\nzero temperature, at odds with a customary Pauling estimate. Dynamically, we\nfind evidence of anomalous noise in the power spectral density, arising from an\neffectively anisotropic fractal motion of monopoles at low temperature.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hall\u00e9n","Jonathan N.",""],["Castelnovo","Claudio",""],["Moessner","Roderich",""]]}
{"id":"2308.16235","submitter":"Crisel Suarez","authors":"Crisel Suarez and Christopher S. Moore","title":"Estimations of Elemental Abundances During Solar Flares Observed in Soft\n  X-rays by the MinXSS-1 CubeSat Mission","comments":"Accepted to APJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Solar flares are complex phenomena emitting all types of electromagnetic\nradiation, and accelerating particles on timescales of minutes, converting\nmagnetic energy to thermal, radiative, and kinetic energy through magnetic\nreconnections. As a result, local plasma can be heated to temperatures in\nexcess of 20 MK. During the soft X-ray (SXR) solar flare peak, the elemental\nabundance of low first-ionization potential (FIP) elements are typically\nobserved to be depleted from coronal values. We explored the abundance\nvariations using disk-integrated solar spectra from the Miniature X-ray Solar\nSpectrometer CubeSat-1 (MinXSS-1). MinXSS-1 is sensitive to the 1-12 keV energy\nrange with an effective 0.25 keV full-width at half-maximum (FWHM) resolution\nat 5.9 keV. During the year-long mission of MinXSS-1, between May 2016 - May\n2017, 21 flares with intermittent data downlinks were observed ranging from C\nto M class. We examine the time evolution of temperature, volume emission\nmeasure, and elemental abundances of Fe, Ca, Si, S, and Ar with CHIANTI\nspectral models near the peak SXR emission times observed in the MinXSS-1 data.\nWe determined the average absolute abundance of A(Fe) = 7.81, A(Ca) = 6.84,\nA(S) = 7.28, A(Si) = 7.90, and A(Ar) = 6.56. These abundances are depleted from\ncoronal values during the SXR peak compared to non-flaring times. The elemental\nabundance values that are depleted from their coronal values are consistent\nwith the process of chromospheric evaporation, in which the lower atmospheric\nplasma fills the coronal loops.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Suarez","Crisel",""],["Moore","Christopher S.",""]]}
{"id":"2308.16236","submitter":"Sakil Khan","authors":"Sakil Khan, Dipankar Home, Urbasi Sinha, and Sachin Jain","title":"Statistical Correlators and Tripartite Entanglement","comments":"14 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It has recently been argued that among the various suggested measures of\ntripartite entanglement, the two particular measures, viz. the Concurrence Fill\nand the Genuine Multipartite Concurrence are the only 'genuine' tripartite\nentanglement measures based on certain suitably specified criteria. In this\ncontext, we show that these two genuine tripartite entanglement measures can be\nempirically determined for the two important classes of tripartite entangled\nstates, viz. the generalized GHZ and the generalized W states using the derived\nrelationships of these two measures with the observable statistical correlators\nlike the Pearson correlator and mutual information. Such a formulated scheme\nwould therefore provide for the first time the means to exactly quantify\ntripartite entanglement, crucial for the proper assessment of its efficacy as\nresource. We also point out two specific applications of this scheme, viz. a)\nEnabling empirical demonstration of the potentially significant feature of\ninequivalence between Concurrence Fill and Genuine Multipartite Concurrence in\nquantitatively assessing which of the two given tripartite states is more\nentangled than the other one. b) Enabling experimental detection of the\nrecently predicted phenomenon of entanglement sudden death for a tripartite\nsystem.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Khan","Sakil",""],["Home","Dipankar",""],["Sinha","Urbasi",""],["Jain","Sachin",""]]}
{"id":"2308.16237","submitter":"Steven Fahlman","authors":"Steven Fahlman, Rodrigo Fern\\'andez, Sharon Morsink","title":"Secular Outflows from 3D-MHD Hypermassive Neutron Star Accretion Disk\n  Systems","comments":"15 pages, 10 figures. Accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Magnetized hypermassive neutron stars (HMNSs) have been proposed as a way for\nneutron star (NS) mergers to produce high electron fraction, high velocity\nejecta, as required by kilonova models to explain the observed light curve of\nGW170817. The HMNS drives outflows through neutrino energy deposition and\nmechanical oscillations, and raises the electron fraction of outflows through\nneutrino interactions before collapsing to a black hole (BH). Here we perform\n3D numerical simulations of HMNS-torus systems in ideal magnetohydrodynamics,\nusing a leakage/absorption scheme for neutrino transport, the nuclear APR\nequation of state, and Newtonian self-gravity, with a pseudo-Newtonian\npotential added after BH formation. Due to the uncertainty in the HMNS collapse\ntime, we choose two different parameterized times to induce collapse. We also\nexplore two initial magnetic field geometries in the torus, and evolve the\nsystems until the outflows diminish significantly ($\\sim 1 - 2$ $\\mathrm{s}$).\nWe find bluer, faster outflows as compared to equivalent BH-torus systems,\nproducing $M\\sim 10^{-3} M_\\odot$ of ejecta with $Y_e \\geq 0.25$ and $v \\geq\n0.25c$ by the simulation end. Approximately half the outflows are launched in\ndisk winds at times $t\\lesssim 500$ $\\mathrm{ms}$, with a broad distribution of\nelectron fractions and velocities, depending on the initial condition. The\nremaining outflows are thermally-driven, characterized by lower velocities and\nelectron fractions. Nucleosynthesis with tracer particles shows patterns\nresembling solar abundances in all models. Although outflows from our\nsimulations do not match those inferred from two-component modelling of the\nGW170817 kilonova, self-consistent multidimensional detailed kilonova models\nare required to determine if our outflows can power the blue kilonova.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fahlman","Steven",""],["Fern\u00e1ndez","Rodrigo",""],["Morsink","Sharon",""]]}
{"id":"2308.16238","submitter":"Emmet Golden-Marx","authors":"Emmet Golden-Marx, Emily Moravec, Lu Shen, Zheng Cai, Elizabeth\n  Blanton, Marie-Lou Gendron-Marsolais, Huub Rottgering, Reinout van Weeren,\n  Victorine Buiten, Richard Grumitt, Jesse Golden-Marx, Siddhant Pinjarkar, and\n  Honming Tang","title":"The High-Redshift Clusters Occupied by Bent Radio AGN (COBRA) Survey:\n  Investigating the Role of Environment on Bent Radio AGNs using LOFAR","comments":"Accepted to ApJ on 08/24/2023. 37 pages, 23 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bent radio AGN morphology depends on the density of the surrounding gas.\nHowever, bent sources are found inside and outside clusters, raising the\nquestion of how environment impacts bent AGN morphology. We analyze new\nLOw-Frequency Array Two-metre Sky Survey (LoTSS) Data Release II observations\nof 20 bent AGNs in clusters and 15 not in clusters from the high-$z$ Clusters\nOccupied by Bent Radio AGN (COBRA) survey (0.35 $<$ $z$ $<$ 2.35). We measure\nthe impact of environment on size, lobe symmetry, and radio luminosity. We find\nthat the most asymmetric radio lobes lie outside of clusters and we uncover a\ntentative correlation between the total projected physical area and cluster\noverdensity. Additionally, we, for the first time, present spectral index\nmeasurements of a large sample of high-$z$ bent sources using LoTSS and Very\nLarge Array Faint Images of the Radio Sky at Twenty-centimeters (VLA FIRST)\nobservations. We find that the median spectral index for the cluster sample is\n-0.76 $\\pm$ 0.01, while the median spectral index for the non-cluster sample\nmedian is -0.81 $\\pm$ 0.02. Furthermore, 13 of 20 cluster bent AGNs have flat\ncores ($\\alpha$ $\\geq$ -0.6) compared to 4 of 15 of non-clusters, indicating a\nkey environmental signature. Beyond core spectral index, bent AGNs inside and\noutside clusters are remarkably similar. We conclude that the non-cluster\nsample may be more representative of bent AGNs at large offsets from the\ncluster center ($>$ 1.2Mpc) or bent AGNs in weaker groups rather than the\nfield.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Golden-Marx","Emmet",""],["Moravec","Emily",""],["Shen","Lu",""],["Cai","Zheng",""],["Blanton","Elizabeth",""],["Gendron-Marsolais","Marie-Lou",""],["Rottgering","Huub",""],["van Weeren","Reinout",""],["Buiten","Victorine",""],["Grumitt","Richard",""],["Golden-Marx","Jesse",""],["Pinjarkar","Siddhant",""],["Tang","Honming",""]]}
{"id":"2308.16239","submitter":"Soumavo Ghosh Dr.","authors":"Soumavo Ghosh, Francesca Fragkoudi, Paola Di Matteo, Kanak Saha","title":"Bars and boxy/peanut bulges in thin and thick discs III. Boxy/peanut\n  bulge formation and evolution in presence of thick discs","comments":"18 pages, 1 table, 17 figures (including appendix), comments are\n  welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Boxy/peanut (b/p) bulges, the vertically extended inner part of a bar, are\nubiquitous in barred disc galaxies in the local Universe, including our own\nMilky Way. A majority of external galaxies and the Milky Way also possess a\nthick-disc. However, the dynamical effect of thick-discs in the b/p formation\nand evolution is not fully understood. Here, we investigate the effect of\nthick-discs in the formation and evolution of b/p by using a suite of $N$-body\nmodels of (kinematically cold) thin and (kinematically hot) thick discs. Within\nthe suite of models, we systematically vary the mass fraction of the thick\ndisc, and the thin-to-thick disc scale length ratio. This allows one to examine\nthe b/p formation in discs with different ratios of cold and hot disc\ncomponents. The b/ps form in almost all our models via a vertical buckling\ninstability, even in the presence of a massive thick disc. The thin disc b/p is\nmuch stronger than the thick disc b/p. With increasing thick disc mass\nfraction, the final b/p structure gets progressively weaker in strength and\nlarger in extent. Furthermore, the time-interval between the bar formation and\nthe onset of buckling instability gets progressively shorter with increasing\nthick-disc mass fraction. These trends remain true for all three geometric\nconfigurations considered here. The breaking and restoration of the vertical\nsymmetry (during and after the b/p formation) show a spatial variation -- the\ninner bar region restores vertical symmetry rather quickly (after the buckling)\nwhile in the outer bar region, the vertical asymmetry persists long after the\nbuckling happens. Our findings also predict that at higher redshifts, when\ndiscs are thought to be thicker, b/ps would have more `boxy-shaped' appearance\nthan more `X-shaped' appearance. This remains to be tested from future\nobservations at higher redshifts.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ghosh","Soumavo",""],["Fragkoudi","Francesca",""],["Di Matteo","Paola",""],["Saha","Kanak",""]]}
{"id":"2308.16240","submitter":"Bhubanjyoti Bhattacharya","authors":"Bhubanjyoti Bhattacharya, Mirjam Fines-Neuschild, Andrea Houck, Maxime\n  Imbeault, Alexandre Jean, and David London","title":"Charmless $B\\to PPP$ Decays: the Fully-Antisymmetric Final State","comments":"13 pages, 4 tables","journal-ref":null,"doi":null,"report-no":"UdeM-GPP-TH-23-298","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Under flavor $SU(3)$ symmetry (SU(3)$_F$), the final-state particles in $B\\to\nPPP$ decays ($P$ is a pseudoscalar meson) are treated as identical, and the\n$PPP$ must be in a fully-symmetric (FS) state, a fully-antisymmetric (FA)\nstate, or in one of four mixed states. In this paper, we present the formalism\nfor the FA states. We write the amplitudes for the 22 $B\\to PPP$ decays that\ncan be in an FA state in terms of both SU(3)$_F$ reduced matrix elements and\ndiagrams. This shows the equivalence of diagrams and SU(3)$_F$. We also give 15\nrelations among the amplitudes in the SU(3)$_F$ limit, as well as the\nadditional four that appear when the diagrams $E$/$A$/$PA$ are neglected. We\npresent sets of $B \\to PPP$ decays that can be used to extract $\\gamma$ using\nthe FA amplitudes. The value(s) of $\\gamma$ found in this way can be compared\nwith the value(s) found using the FS states.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bhattacharya","Bhubanjyoti",""],["Fines-Neuschild","Mirjam",""],["Houck","Andrea",""],["Imbeault","Maxime",""],["Jean","Alexandre",""],["London","David",""]]}
{"id":"2308.16241","submitter":"Abhinav Prem","authors":"Fiona J. Burnell, Sanjay Moudgalya, Abhinav Prem","title":"Filling constraints on translation invariant dipole conserving systems","comments":"5 pages + 11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Systems with conserved dipole moment have drawn considerable interest in\nlight of their realization in recent experiments on tilted optical lattices. An\nimportant question for such systems is delineating the conditions under which\nthey admit a unique gapped ground state that is consistent with all symmetries.\nHere, we study one-dimensional translation-invariant lattices that conserve\nU(1) charge and $\\mathbb{Z}_L$ dipole moment, where discreteness of the dipole\nsymmetry is enforced by periodic boundary conditions, with $L$ the system size.\nWe show that in these systems, a symmetric, gapped, and non-degenerate ground\nstate requires not only integer charge filling, but also a fixed value of the\ndipole filling, while other fractional dipole fillings enforce either a gapless\nor symmetry-breaking ground state. In contrast with prior results in the\nliterature, we find that the dipole filling constraint depends both on the\ncharge filling as well as the system size, emphasizing the subtle interplay of\ndipole symmetry with boundary conditions. We support our results with numerical\nsimulations and exact results.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Burnell","Fiona J.",""],["Moudgalya","Sanjay",""],["Prem","Abhinav",""]]}
{"id":"2308.16242","submitter":"Robert Wiley Deal","authors":"Robert Wiley Deal, Kishan Sankharva, Kuver Sinha, Scott Watson","title":"Multi-component Dark Matter and Small Scale Structure Formation","comments":"32 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 consider the evolution of non-thermal dark matter perturbations in models\nwhich contain both Weakly Interacting Massive Particles (WIMPs) and axions.\nUsing constraints from existing observations we examine the percentage of WIMPs\nand axions that may comprise the cosmological dark matter budget in models with\nan Early Matter Dominated Epoch (EMDE) -- where entropy production is\nimportant. After carefully tracking the thermal evolution of the various\nspecies by solving the Boltzmann equations, we consider the enhancement of\nperturbations that may have led to early structure formation for axions and\nWIMPs. We investigate the impact of enhanced perturbations on the parameter\nspace of both species, after imposing existing constraints from indirect\ndetection experiments. Given these constraints we establish the feasibility of\naxions to form miniclusters in the early universe in EMDEs for a given\npercentage of allowed WIMPs. We find that EMDEs with low reheat temperatures\nnear the BBN limit are preferred for axion minicluster formation. When the EMDE\nis caused by string moduli, the WIMP contribution to the relic density is set\nby the moduli branching to dark matter at the level of $\\lesssim\n\\mathcal{O}(10^{-4})$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:00:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Deal","Robert Wiley",""],["Sankharva","Kishan",""],["Sinha","Kuver",""],["Watson","Scott",""]]}
{"id":"2308.16243","submitter":"Pavel Dolgirev","authors":"Pavel E. Dolgirev, Ilya Esterlis, Alexander A. Zibrov, Mikhail D.\n  Lukin, Thierry Giamarchi, Eugene Demler","title":"Local noise spectroscopy of Wigner crystals in two-dimensional materials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose to use local electromagnetic noise spectroscopy as a versatile and\nnoninvasive tool to study Wigner crystal phases of strongly-interacting\ntwo-dimensional electronic systems. In-plane imaging of the local noise is\npredicted to enable single-site resolution of the electron crystal when the\nsample-probe distance is less than the inter-electron separation. At larger\nsample-probe distances, noise spectroscopy encodes information about the\nlow-energy Wigner crystal phonons, including the dispersion of the transverse\nshear mode, the pinning resonance due to disorder, and optical modes emerging,\nfor instance, in bilayer crystals. We discuss the potential utility of local\nnoise probes in analyzing the rich set of phenomena expected to occur in the\nvicinity of the melting transition.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:02:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dolgirev","Pavel E.",""],["Esterlis","Ilya",""],["Zibrov","Alexander A.",""],["Lukin","Mikhail D.",""],["Giamarchi","Thierry",""],["Demler","Eugene",""]]}
{"id":"2308.16244","submitter":"Fabian Rennecke","authors":"Maximilian Haensch, Fabian Rennecke and Lorenz von Smekal","title":"Medium Induced Mixing and Critical Modes in QCD","comments":"14 pages, 6 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":"  The chiral crossover of QCD is expected to turn into a critical point at\nfinite density. This is signaled by the emergence of an exactly massless\ncritical mode which drives the critical behavior of the system. Based on\nphenomenological arguments, this mode is expected to be a mixture of chiral\ncondensate and baryon number density fluctuations. We clarify the microscopic\nnature of this critical mode. Due to mixing induced at finite temperature and\ndensity, it turns out that this massless mode is composed of fluctuations in\nthe chiral condensate, the neutral isoscalar omega vector-meson channel and the\nPolyakov loops. This is established using general arguments based on the\nanalytic structure of the quark determinant at a critical point, and\nillustrated through explicit model calculations. Due to charge-conjugation\nsymmetry breaking at finite density, the Hessian of the QCD effective action is\nnon-Hermitian, but retains a symmetry under combined charge- and complex\nconjugation. This can give rise to a rich structure, potentially involving\ndisorder lines, regimes with spatial modulations and instabilities in the phase\ndiagram.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:02:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Haensch","Maximilian",""],["Rennecke","Fabian",""],["von Smekal","Lorenz",""]]}
{"id":"2308.16245","submitter":"Ulf Johansson","authors":"Tuwe L\\\"ofstr\\\"om, Helena L\\\"ofstr\\\"om, Ulf Johansson, Cecilia\n  S\\\"onstr\\\"od","title":"Calibrated Explanations for Regression","comments":"30 pages, 11 figures","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":"  Artificial Intelligence (AI) is often an integral part of modern decision\nsupport systems (DSSs). The best-performing predictive models used in AI-based\nDSSs lack transparency. Explainable Artificial Intelligence (XAI) aims to\ncreate AI systems that can explain their rationale to human users. Local\nexplanations in XAI can provide information about the causes of individual\npredictions in terms of feature importance. However, a critical drawback of\nexisting local explanation methods is their inability to quantify the\nuncertainty associated with a feature's importance. This paper introduces an\nextension of a feature importance explanation method, Calibrated Explanations\n(CE), previously only supporting classification, with support for standard\nregression and probabilistic regression, i.e., the probability that the target\nis above an arbitrary threshold. The extension for regression keeps all the\nbenefits of CE, such as calibration of the prediction from the underlying model\nwith confidence intervals, uncertainty quantification of feature importance,\nand allows both factual and counterfactual explanations. CE for standard\nregression provides fast, reliable, stable, and robust explanations. CE for\nprobabilistic regression provides an entirely new way of creating probabilistic\nexplanations from any ordinary regression model and with a dynamic selection of\nthresholds. The performance of CE for probabilistic regression regarding\nstability and speed is comparable to LIME. The method is model agnostic with\neasily understood conditional rules. An implementation in Python is freely\navailable on GitHub and for installation using pip making the results in this\npaper easily replicable.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:06:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["L\u00f6fstr\u00f6m","Tuwe",""],["L\u00f6fstr\u00f6m","Helena",""],["Johansson","Ulf",""],["S\u00f6nstr\u00f6d","Cecilia",""]]}
{"id":"2308.16246","submitter":"Zike Yan","authors":"Zike Yan, Haoxiang Yang, Hongbin Zha","title":"Active Neural Mapping","comments":"ICCV 2023, project page:\n  https://zikeyan.github.io/active-INR/index.html","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We address the problem of active mapping with a continually-learned neural\nscene representation, namely Active Neural Mapping. The key lies in actively\nfinding the target space to be explored with efficient agent movement, thus\nminimizing the map uncertainty on-the-fly within a previously unseen\nenvironment. In this paper, we examine the weight space of the\ncontinually-learned neural field, and show empirically that the neural\nvariability, the prediction robustness against random weight perturbation, can\nbe directly utilized to measure the instant uncertainty of the neural map.\nTogether with the continuous geometric information inherited in the neural map,\nthe agent can be guided to find a traversable path to gradually gain knowledge\nof the environment. We present for the first time an active mapping system with\na coordinate-based implicit neural representation for online scene\nreconstruction. Experiments in the visually-realistic Gibson and Matterport3D\nenvironment demonstrate the efficacy of the proposed method.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:07:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yan","Zike",""],["Yang","Haoxiang",""],["Zha","Hongbin",""]]}
{"id":"2308.16247","submitter":"Shraiyance Jain","authors":"Abhijit Gadde, Shraiyance Jain, Vineeth Krishna, Harshal Kulkarni,\n  Trakshu Sharma","title":"Monotonicity conjecture for multi-party entanglement I","comments":"40 Pages, 10 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we conjecture a monotonicity property that we call\nmonotonicity under coarse-graining for a class of multi-partite entanglement\nmeasures. We check these properties by computing the measures for various types\nof states using different methods.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:10:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gadde","Abhijit",""],["Jain","Shraiyance",""],["Krishna","Vineeth",""],["Kulkarni","Harshal",""],["Sharma","Trakshu",""]]}
{"id":"2308.16248","submitter":"Danai Korre","authors":"Danai Korre and Andrew Sherlock","title":"Augmented Reality in Higher Education: a Case Study in Medical Education","comments":"4 pages, 2 figures, 9th International Conference of the Immersive\n  Learning Research Network (iLRN2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  During lockdown, we piloted a variety of augmented reality (AR) experiences\nin collaboration with subject matter experts from different fields aiming at\ncreating remote teaching and training experiences. In this paper, we present a\ncase study on how AR can be used as a teaching aid for medical education with\npertinent focus on remote and social distanced learning. We describe the\nprocess of creating an AR experience that can enhance the knowledge and\nunderstanding of anatomy for medical students. The Anatomy Experience is an AR\nenhanced learning experience developed in collaboration with the Medical School\nof the University of Edinburgh aiming to assist medical students understand the\ncomplex geometry of different parts of the human body. After conducting a focus\ngroup study with medical students, trainees, and trainers, we received very\npositive feedback on the Anatomy Experience and its effects on understanding\nanatomy, enriching the learning process, and using it as a tool for anatomy\nteaching.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:11:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Korre","Danai",""],["Sherlock","Andrew",""]]}
{"id":"2308.16249","submitter":"Jos\\'e Abel Hoyos Neto","authors":"Francisco C. Alcaraz, Jos\\'e A. Hoyos, and Rodrigo A. Pimenta","title":"A random free-fermion quantum spin chain with multi-spin interactions","comments":"22 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the effects of quenched disorder in a class of quantum chains with\n(p + 1)-multi-spin interactions exhibiting a free fermionic spectrum, paying\nspecial attention to the case p = 2. Depending if disorder couples to (i) all\nthe couplings or just to (ii) some of them, we have two distinct physical\nscenarios. In case (i), we find that the transitions of the model are governed\nby a universal infinite-randomness critical point surrounded by quantum\nGriffiths phases similarly as happens to the random transverse-field Ising\nchain. In case (ii), we find that quenched disorder becomes an irrelevant\nperturbation: the clean critical behavior is stable and Griffiths phases are\nabsent. Beyond the perturbative regime, disorder stabilizes a line of\nfinite-randomness critical points (with non-universal critical exponents), that\nends in a multi-critical point of infinite-randomness type. In that case,\nquantum Griffiths phases also appear surrounding the finite-disorder transition\npoint. We have characterized the correlation functions and the low-temperature\nthermodynamics of these chains. Our results are derived from a strong-disorder\nrenormalization-group technique and from finite-size scaling analysis of the\nspectral gap computed exactly (up to sizes $\\sim 10^7$) via an efficient new\nnumerical method recently introduced in the literature [Alcaraz et al., Phys.\nRev. B 104, 174206 (2021)].\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:13:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Alcaraz","Francisco C.",""],["Hoyos","Jos\u00e9 A.",""],["Pimenta","Rodrigo A.",""]]}
{"id":"2308.16250","submitter":"Danai Korre","authors":"Danai Korre","title":"It Takes a Village: Multidisciplinarity and Collaboration for the\n  Development of Embodied Conversational Agents","comments":"5 pages, 1 figure, ACM CUI 2023: Proceedings of the 5th Conference on\n  Conversational User Interfaces - Is CUI ready yet?, This paper discusses the\n  challenges of ECA development and how they can be tackled via\n  multidisciplinary collaboration","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.MM","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Embodied conversational agent (ECA) development is a time-consuming and\ncostly process that calls for knowledge in a plethora of different and not\nnecessarily adjacent disciplines. Engaging in activities outside of one's core\nresearch to acquire peripheral skills can impede innovation and potentially\nrestrict the outcomes within the boundaries of those acquired skills. A\nproposal to tackle this challenge is creating collaborative communities of\nexperts from the contributing disciplines to the field of ECAs that via clearly\ndefined roles, expectations and communication channels can help extend the\nfield of ECA research.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:14:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Korre","Danai",""]]}
{"id":"2308.16251","submitter":"Oliver Mehling","authors":"Oliver Mehling, Reyk B\\\"orner, Valerio Lucarini","title":"Limits to predictability of the asymptotic state of the Atlantic\n  Meridional Overturning Circulation in a conceptual climate model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD cond-mat.stat-mech physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Anticipating critical transitions in the Earth system is of great societal\nrelevance, yet there may be intrinsic limitations to their predictability. For\ninstance, from the theory of dynamical systems possessing multiple chaotic\nattractors, it is known that the asymptotic state depends sensitively on the\ninitial condition in the proximity of a fractal basin boundary. Here, we\napproach the problem of final-state sensitivity of the Atlantic Meridional\nOverturning Circulation (AMOC) using a conceptual climate model, composed of a\nslow bistable ocean coupled to a fast chaotic atmosphere. First, we explore the\noccurrence of long chaotic transients in the monostable regime, which can mask\na loss of stability near bifurcations. In the bistable regime, we explicitly\nconstruct the chaotic saddle using the edge tracking technique. Quantifying the\nfinal-state sensitivity through the maximum Lyapunov exponent and the lifetime\nof the saddle, we find that the system exhibits a fractal basin boundary with\nalmost full phase space dimension, implying vanishing predictability of the\nsecond kind near the basin boundary. Our results demonstrate the usefulness of\nstudying non-attracting chaotic sets in the context of predicting climatic\ntipping points, and provide guidance for the interpretation of\nhigher-dimensional models such as general circulation models.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:15:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mehling","Oliver",""],["B\u00f6rner","Reyk",""],["Lucarini","Valerio",""]]}
{"id":"2308.16252","submitter":"Alan H. Guth","authors":"Alan H. Guth and Mohammad Hossein Namjoo","title":"Bayesian questions with frequentist answers","comments":"11 pages, 1 figure","journal-ref":null,"doi":null,"report-no":"MIT-CTP/5602","categories":"physics.data-an astro-ph.CO gr-qc hep-ph hep-th stat.OT","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The two statistical methods, namely the frequentist and the Bayesian methods,\nare both commonly used for probabilistic inference in many scientific\nsituations. However, it is not straightforward to interpret the result of one\napproach in terms of the concepts of the other. In this paper we explore the\npossibility of finding a Bayesian significance for the frequentist's main\nobject of interest, the $p$-value, which is the probability assigned to the\nproposition -- which we call the {\\it extremity proposition} -- that a\nmeasurement will result in a value that is at least as extreme as the value\nthat was actually obtained. To make contact with the frequentist language, the\nBayesian can choose to update probabilities based on the {\\it extremity\nproposition}, which is weaker than the standard Bayesian update proposition,\nwhich uses the actual observed value. We then show that the posterior\nprobability (or probability density) of a theory is equal to the prior\nprobability (or probability density) multiplied by the ratio of the $p$-value\nfor the data obtained, given that theory, to the mean $p$-value -- averaged\nover all theories weighted by their prior probabilities. Thus, we provide\nfrequentist answers to Bayesian questions. Our result is generic -- it does not\nrely on restrictive assumptions about the situation under consideration or\nspecific properties of the likelihoods or the priors.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:15:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Guth","Alan H.",""],["Namjoo","Mohammad Hossein",""]]}
{"id":"2308.16253","submitter":"Neil Ash","authors":"Neil Ash and Monica Valluri","title":"Figure Rotation of IllustrisTNG Halos","comments":"18 pages, 11 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use the TNG50 and TNG50 dark matter (DM)-only simulations from the\nIllustrisTNG simulation suite to conduct an updated survey of halo figure\nrotation in the presence of baryons. We develop a novel methodology to detect\ncoherent figure rotation about an arbitrary axis and for arbitrary durations\nand apply it to a catalog of 1,577 DM halos from the DM-only run and 1,396 DM\nhalos from the DM+baryons (DM+B) run that are free of major mergers. Figure\nrotation was detected in $94\\%$ of DM-only halos and $82\\%$ of the DM+B halos.\nThe pattern speeds of rotations lasting $\\gtrsim 1h^{-1}$ Gyr were log-normally\ndistributed with medians of $0.25~h$ km s$^{-1}$ kpc$^{-1}$ for DM-only in\nagreement with past results, but $14\\%$ higher at $0.29~h$ km s$^{-1}$\nkpc$^{-1}$ in the DM+B halos. We find that rotation axes are typically aligned\nwith the halo minor or major axis, in $57\\%$ of DM-only halos and in $62\\%$ of\nDM+B halos. The remaining rotation axes were not strongly aligned with any\nprincipal axis but typically lay in the plane containing the halo minor and\nmajor axes. Longer-lived rotations showed greater alignment with the halo minor\naxis in both simulations. Our results show that in the presence of baryons,\nfigure rotation is marginally less common, shorter-lived, faster, and better\naligned with the minor axis than in DM-only halos. This updated understanding\nwill be consequential for future efforts to constrain figure rotation in the\nMilky Way dark halo using the morphology and kinematics of tidal streams.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:17:15 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ash","Neil",""],["Valluri","Monica",""]]}
{"id":"2308.16254","submitter":"Jonas Antor","authors":"Jonas Antor","title":"Canonical bases via pairing monomials","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For any quantum group of finite ADE type, we prove a new formula for the\nstandard bilinear form evaluated at monomials. Combining this with ideas from\nthe Lusztig-Shoji algorithm, we obtain a new algorithm that computes the\ncanonical basis. In type A, the algorithm also computes composition\nmultiplicities of standard modules for the affine Hecke algebra of\n$\\text{GL}_n$ and we explain how the algorithm can be extended to compute the\ndimensions of simple modules.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:23:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Antor","Jonas",""]]}
{"id":"2308.16255","submitter":"Wei-Che Hsu","authors":"Wei-Che Hsu, Nabila Nujhat, Benjamin Kupp, John F. Conley Jr, Haisheng\n  Rong, Ranjeet Kumar and Alan X. Wang","title":"Sub-Volt High-Speed Silicon MOSCAP Microring Modulator Driven by High\n  Mobility Conductive Oxide","comments":"Main text: 16 pages, Supplementary Information: 5 pages, 11 figures,\n  2 tables","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":"  Low driving voltage (Vpp), high-speed silicon microring modulator plays a\ncritical role in energy-efficient optical interconnect and optical computing\nsystems owing to its ultra-compact footprint and capability for on-chip\nwavelength-division multiplexing. However, existing silicon microring\nmodulators usually require more than 2 V of Vpp, which is limited by the\nrelatively weak plasma dispersion effect of silicon and the small capacitance\ndensity of the reversed PN-junction. Here we present a highly efficient\nmetal-oxide semiconductor capacitor (MOSCAP) microring modulator through\nheterogeneous integration between silicon photonics and titanium-doped indium\noxide, which is a high-mobility transparent conductive oxide (TCO) material\nwith a strong plasma dispersion effect. The device is co-fabricated by Intel's\nphotonics fab and TCO patterning processes at Oregon State University, which\nexhibits a high electro-optic modulation efficiency of 117 pm/V with a low VpiL\nof 0.12 Vcm, and consequently can be driven by an extremely low Vpp of 0.8 V.\nAt a 11 GHz modulation bandwidth where the modulator is limited by the high\nparasitic capacitance, we obtained 25 Gb/s clear eye diagrams with energy\nefficiency of 53 fJ/bit and demonstrated 35 Gb/s open eyes with a higher\ndriving voltage. Further optimization of the device is expected to increase the\nmodulation bandwidth up to 52 GHz that can encode data at 100 Gb/s for\nnext-generation, energy-efficient optical communication and computation with\nsub-volt driving voltage without using any high voltage swing amplifier.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:25:22 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hsu","Wei-Che",""],["Nujhat","Nabila",""],["Kupp","Benjamin",""],["Conley","John F.","Jr"],["Rong","Haisheng",""],["Kumar","Ranjeet",""],["Wang","Alan X.",""]]}
{"id":"2308.16256","submitter":"Chester Bella","authors":"Chester Bella, Danny Boahen, and Sudeep Biswas","title":"A new adaptive pricing framework for perpetual protocols using liquidity\n  curves and on-chain oracles","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.TR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This whitepaper introduces an innovative mechanism for pricing perpetual\ncontracts and quoting fees to traders based on current market conditions. The\napproach employs liquidity curves and on-chain oracles to establish a new\nadaptive pricing framework that considers various factors, ensuring pricing\nstability and predictability. The framework utilizes parabolic and sigmoid\nfunctions to quote prices and fees, accounting for liquidity, active long and\nshort positions, and utilization. This whitepaper provides a detailed\nexplanation of how the adaptive pricing framework, in conjunction with\nliquidity curves, operates through mathematical modeling and compares it to\nexisting solutions. Furthermore, we explore additional features that enhance\nthe overall efficiency of the decentralized perpetual protocol.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:26:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bella","Chester",""],["Boahen","Danny",""],["Biswas","Sudeep",""]]}
{"id":"2308.16257","submitter":"Carlos Miguel Soto","authors":"Nicol\\'as \\'Alvarez, Ver\\'onica Becher, Mart\\'in Mereb, Ivo Pajor and\n  Carlos Miguel Soto","title":"On extremal factors of de Bruijn-like graphs","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 1972 Mykkeltveit proved that the maximum number of vertex-disjoint cycles\nin the de Bruijn graphs of order $n$ is attained by the pure cycling register\nrule, as conjectured by Golomb. We generalize this result to the tensor product\nof the de Bruijn graph of order $n$ and a simple cycle of size $k$, when $n$\ndivides $k$ or vice versa. We also develop counting formulae for a large family\nof cycling register rules, including the linear register rules proposed by\nGolomb.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:26:52 GMT"}],"update_date":"2023-09-01","authors_parsed":[["\u00c1lvarez","Nicol\u00e1s",""],["Becher","Ver\u00f3nica",""],["Mereb","Mart\u00edn",""],["Pajor","Ivo",""],["Soto","Carlos Miguel",""]]}
{"id":"2308.16258","submitter":"ShengYun Peng","authors":"ShengYun Peng, Weilin Xu, Cory Cornelius, Matthew Hull, Kevin Li,\n  Rahul Duggal, Mansi Phute, Jason Martin, Duen Horng Chau","title":"Robust Principles: Architectural Design Principles for Adversarially\n  Robust CNNs","comments":"Published at BMVC'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our research aims to unify existing works' diverging opinions on how\narchitectural components affect the adversarial robustness of CNNs. To\naccomplish our goal, we synthesize a suite of three generalizable robust\narchitectural design principles: (a) optimal range for depth and width\nconfigurations, (b) preferring convolutional over patchify stem stage, and (c)\nrobust residual block design through adopting squeeze and excitation blocks and\nnon-parametric smooth activation functions. Through extensive experiments\nacross a wide spectrum of dataset scales, adversarial training methods, model\nparameters, and network design spaces, our principles consistently and markedly\nimprove AutoAttack accuracy: 1-3 percentage points (pp) on CIFAR-10 and\nCIFAR-100, and 4-9 pp on ImageNet. The code is publicly available at\nhttps://github.com/poloclub/robust-principles.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:31:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Peng","ShengYun",""],["Xu","Weilin",""],["Cornelius","Cory",""],["Hull","Matthew",""],["Li","Kevin",""],["Duggal","Rahul",""],["Phute","Mansi",""],["Martin","Jason",""],["Chau","Duen Horng",""]]}
{"id":"2308.16259","submitter":"Hongshuo Huang","authors":"Hongshuo Huang, Rishikesh Magar, Changwen Xu and Amir Bariti Farimani","title":"Materials Informatics Transformer: A Language Model for Interpretable\n  Materials Properties Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cond-mat.mtrl-sci physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, the remarkable capabilities of large language models (LLMs) have\nbeen illustrated across a variety of research domains such as natural language\nprocessing, computer vision, and molecular modeling. We extend this paradigm by\nutilizing LLMs for material property prediction by introducing our model\nMaterials Informatics Transformer (MatInFormer). Specifically, we introduce a\nnovel approach that involves learning the grammar of crystallography through\nthe tokenization of pertinent space group information. We further illustrate\nthe adaptability of MatInFormer by incorporating task-specific data pertaining\nto Metal-Organic Frameworks (MOFs). Through attention visualization, we uncover\nthe key features that the model prioritizes during property prediction. The\neffectiveness of our proposed model is empirically validated across 14 distinct\ndatasets, hereby underscoring its potential for high throughput screening\nthrough accurate material property prediction.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:34:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Huang","Hongshuo",""],["Magar","Rishikesh",""],["Xu","Changwen",""],["Farimani","Amir Bariti",""]]}
{"id":"2308.16260","submitter":"Fiona McCarthy","authors":"Fiona McCarthy and J. Colin Hill","title":"Cross-correlation of the thermal Sunyaev--Zel'dovich and CMB lensing\n  signals in Planck PR4 data with robust CIB decontamination","comments":"32 pages, 17 Figures. Companion paper to arXiv:2307.01043 . Public\n  code is available to reproduce theory calculations at\n  https://github.com/fmccarthy/tSZ_kappa_halomodel_classsz","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 use the full-mission Planck PR4 data to measure the CMB lensing\nconvergence ($\\kappa$)--thermal Sunyaev-Zel'dovich (tSZ, $y$)\ncross-correlation, $C_\\ell^{y\\kappa}$. This is only the second measurement to\ndate of this signal, following Hill \\& Spergel (2014). We perform the\nmeasurement using foreground-cleaned tSZ maps built from the PR4 frequency maps\nvia a tailored needlet internal linear combination (NILC) code in our companion\npaper, in combination with the Planck PR4 $\\kappa$ maps and various\nsystematic-mitigated PR3 $\\kappa$ maps. A serious systematic is the residual\ncosmic infrared background (CIB) in the tSZ map, as the high CIB--$\\kappa$\ncorrelation can significantly bias the inferred tSZ--$\\kappa$\ncross-correlation. We mitigate this by deprojecting the CIB in our NILC, using\na moment-deprojection approach to avoid leakage due to incorrect modelling of\nthe CIB frequency dependence. We validate our method on mm-sky simulations. We\nfit a theoretical halo model to our measurement, finding a best-fit amplitude\nof $A=0.82\\pm0.21$ (for the highest signal-to-noise PR4 $\\kappa$ map) or\n$A=0.56\\pm0.24$ (for a PR3 $\\kappa$ map built from a tSZ-deprojected CMB map),\nindicating that the data are consistent with our model within $\\sim\n1$-$2\\sigma$. Although our error bars are similar to those of the 2014\nmeasurement, our method is significantly more robust to CIB contamination. Our\nmoment-deprojection approach lays the foundation for future measurements of\nthis signal with higher signal-to-noise maps from ground-based telescopes,\nwhich will precisely probe the astrophysics of the intracluster medium of\ngalaxy groups and clusters in the intermediate-mass ($M\\sim 10^{13} -10^{14}\nh^{-1} M_\\odot$), high-$z$ ($z<\\sim1.5$, c.f. $z<\\sim0.8$ for the tSZ\nauto-power signal) regime, as well as CIB-decontaminated measurements of tSZ\ncross-correlations with other large-scale structure probes.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:38:37 GMT"}],"update_date":"2023-09-01","authors_parsed":[["McCarthy","Fiona",""],["Hill","J. Colin",""]]}
{"id":"2308.16261","submitter":"David Coria","authors":"David R. Coria, Ian J. M. Crossfield, Joshua Lothringer, Becky Flores,\n  Nikos Prantzos, Richard Freedman","title":"The Missing Link: Testing Galactic Chemical Evolution Models with the\n  First Multi-Isotopic Abundances in Solar Twin Stars","comments":"21 pages, 6 figures. Published in ApJ 8/29/2023","journal-ref":"The Astrophysical Journal (ApJ 2023) Volume 954 Number 2 Page 121","doi":"10.3847/1538-4357/acea5f","report-no":null,"categories":"astro-ph.SR astro-ph.EP astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the first isotopic abundances of both $^{13}$CO and C$^{18}$O in\nsolar twin stars and test the results against several galactic chemical\nevolution (GCE) models with different nucleosynthesis prescriptions. First, we\ncompare M-band spectra from IRTF/iSHELL to synthetic spectra generated from\ncustom solar atmosphere models using the PHOENIX atmosphere code. Next, we\ncompare our calculated abundances to GCE models that consider isotopic yields\nfrom massive stars, asymptotic giant branch (AGB) stars and fast-rotating\nstars. The $^{12}$C/$^{13}$C ratios determined for this sample of solar twins\nare consistent with predictions from the selected GCE models; however, the\n$^{16}$O/$^{18}$O ratios tentatively contradict these predictions. This project\nconstitutes the first in a stellar chemical abundance series seeking to: (1)\nsupport the James Webb Space Telescope (JWST) as it characterizes exoplanet\natmospheres, interiors, and biosignatures by providing host star abundances (2)\nidentify how unexplored stellar abundances reveal the process of galactic\nchemical evolution and correlate with star formation, interior, age,\nmetallicity, and activity; and (3) provide improved stellar ages using stellar\nabundance measurements. By measuring elemental and isotopic abundances in a\nvariety of stars, we not only supply refined host star parameters, but also\nprovide the necessary foundations for complementary exoplanet characterization\nstudies and ultimately contribute to the exploration of galactic, stellar, and\nplanetary origins and evolution.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:38:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Coria","David R.",""],["Crossfield","Ian J. M.",""],["Lothringer","Joshua",""],["Flores","Becky",""],["Prantzos","Nikos",""],["Freedman","Richard",""]]}
{"id":"2308.16262","submitter":"Kiet Vo","authors":"Kiet Q. H. Vo, Muneeb Aadil, Siu Lun Chau, Krikamol Muandet","title":"Causal Strategic Learning with Competitive Selection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of agent selection in causal strategic learning under\nmultiple decision makers and address two key challenges that come with it.\nFirstly, while much of prior work focuses on studying a fixed pool of agents\nthat remains static regardless of their evaluations, we consider the impact of\nselection procedure by which agents are not only evaluated, but also selected.\nWhen each decision maker unilaterally selects agents by maximising their own\nutility, we show that the optimal selection rule is a trade-off between\nselecting the best agents and providing incentives to maximise the agents'\nimprovement. Furthermore, this optimal selection rule relies on incorrect\npredictions of agents' outcomes. Hence, we study the conditions under which a\ndecision maker's optimal selection rule will not lead to deterioration of\nagents' outcome nor cause unjust reduction in agents' selection chance. To that\nend, we provide an analytical form of the optimal selection rule and a\nmechanism to retrieve the causal parameters from observational data, under\ncertain assumptions on agents' behaviour. Secondly, when there are multiple\ndecision makers, the interference between selection rules introduces another\nsource of biases in estimating the underlying causal parameters. To address\nthis problem, we provide a cooperative protocol which all decision makers must\ncollectively adopt to recover the true causal parameters. Lastly, we complement\nour theoretical results with simulation studies. Our results highlight not only\nthe importance of causal modeling as a strategy to mitigate the effect of\ngaming, as suggested by previous work, but also the need of a benevolent\nregulator to enable it.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:43:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vo","Kiet Q. H.",""],["Aadil","Muneeb",""],["Chau","Siu Lun",""],["Muandet","Krikamol",""]]}
{"id":"2308.16263","submitter":"Daniel Vaz","authors":"Daniel Vaz, Jarle Brinchmann, Sebastiaan L. Zoutendijk, Leindert A.\n  Boogaard, Sebastian Kamann, Justin I. Read, Martin M. Roth, Peter M.\n  Weilbacher, and Matthias Steinmetz","title":"The MUSE-Faint survey. IV. Dissecting Leo T, a gas-rich relic with\n  recent star formation","comments":"Accepted for publication in A&A on 04-08-2023. 17 pages, 17 figures,\n  3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Leo T ($M_V = -8.0$) is both the faintest and the least massive galaxy known\nto contain neutral gas and to display signs of recent star formation. We\nanalyse photometry and stellar spectra to identify member stars and to better\nunderstand the overall dynamics and stellar content of the galaxy and to\ncompare the properties of its young and old stars. We use data from the Multi\nUnit Spectroscopic Explorer (MUSE) on the VLT. We supplement this information\nwith spectroscopic data from the literature and with Hubble Space Telescope\n(HST) photometry. Our analysis reveals two distinct populations of stars in Leo\nT. The first population, with an age of $\\lesssim 500~\\mathrm{Myr}$, includes\nthree emission-line Be stars comprising 15% of the total number of young stars.\nThe second population of stars is much older, with ages ranging from\n$>5~\\mathrm{Gyr}$ to as high as $10~\\mathrm{Gyr}$. We combine MUSE data with\nliterature data to obtain an overall velocity dispersion of $\\sigma_{v} =\n7.07^{+1.29}_{-1.12}~\\mathrm{km\\ s^{-1}}$ for Leo T. When we divide the sample\nof stars into young and old populations, we find that they have distinct\nkinematics. Specifically, the young population has a velocity dispersion of\n$2.31^{+2.68}_{-1.65}\\,\\mathrm{km\\ s^{-1}}$, contrasting with that of the old\npopulation, of $8.14^{+1.66}_{-1.38}\\,\\mathrm{km\\ s^{-1}}$. The fact that the\nkinematics of the cold neutral gas is in good agreement with the kinematics of\nthe young population suggests that the recent star formation in Leo T is linked\nwith the cold neutral gas. We assess the existence of extended emission-line\nregions and find none to a surface brightness limit of~$< 1\\times\n10^{-20}\\,\\mathrm{erg}\\,\\mathrm{s}^{-1}\\,\\mathrm{cm}^{-2}~\\mathrm{arcsec}^{-2}$\nwhich corresponds to an upper limit on star formation of $\\sim\n10^{-11}~\\mathrm{M_\\odot~yr^{-1}~pc^{-2}}$, implying that the star formation in\nLeo T has ended.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:44:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vaz","Daniel",""],["Brinchmann","Jarle",""],["Zoutendijk","Sebastiaan L.",""],["Boogaard","Leindert A.",""],["Kamann","Sebastian",""],["Read","Justin I.",""],["Roth","Martin M.",""],["Weilbacher","Peter M.",""],["Steinmetz","Matthias",""]]}
{"id":"2308.16264","submitter":"Shahrooz Pouryousef","authors":"Shahrooz Pouryousef, Hassan Shapourian, Alireza Shabani, Ramana\n  Kompella, and Don Towsley","title":"Quantum Network Planning for Utility Maximization","comments":"18 pages, 8 figures, 3 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing classical optical network infrastructure cannot be immediately used\nfor quantum network applications due to photon loss. The first step towards\nenabling quantum networks is the integration of quantum repeaters into optical\nnetworks. However, the expenses and intrinsic noise inherent in quantum\nhardware underscore the need for an efficient deployment strategy that\noptimizes the allocation of quantum repeaters and memories. In this paper, we\npresent a comprehensive framework for network planning, aiming to efficiently\ndistributing quantum repeaters across existing infrastructure, with the\nobjective of maximizing quantum network utility within an entanglement\ndistribution network. We apply our framework to several cases including a\npreliminary illustration of a dumbbell network topology and real-world cases of\nthe SURFnet and ESnet. We explore the effect of quantum memory multiplexing\nwithin quantum repeaters, as well as the influence of memory coherence time on\nquantum network utility. We further examine the effects of different fairness\nassumptions on network planning, uncovering their impacts on real-time network\nperformance.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:45:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pouryousef","Shahrooz",""],["Shapourian","Hassan",""],["Shabani","Alireza",""],["Kompella","Ramana",""],["Towsley","Don",""]]}
{"id":"2308.16265","submitter":"Meghna Kalra","authors":"Meghna Kalra, Kiryung Lee","title":"Stable estimation of pulses of unknown shape from multiple snapshots via\n  ESPRIT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of resolving overlapping pulses from noisy\nmulti-snapshot measurements, which has been a problem central to various\napplications including medical imaging and array signal processing. ESPRIT\nalgorithm has been used to estimate the pulse locations. However, existing\ntheoretical analysis is restricted to ideal assumptions on signal and\nmeasurement models. We present a novel perturbation analysis that overcomes the\nprevious theoretical limitation, which is derived without a stringent\nassumption on the signal model. Our unifying analysis applies to various\nsub-array designs of the ESPRIT algorithm. We demonstrate the usefulness of the\nperturbation analysis by specifying the result in two practical scenarios. In\nthe first scenario, we quantify how the number of snapshots for stable recovery\nscales when the number of Fourier measurements per snapshot is sufficiently\nlarge. In the second scenario, we propose compressive blind array calibration\nby ESPRIT with random sub-arrays and provide the corresponding non-asymptotic\nerror bound. Furthermore, we demonstrate that the empirical performance of\nESPRIT corroborates the theoretical analysis through extensive numerical\nresults.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:47:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kalra","Meghna",""],["Lee","Kiryung",""]]}
{"id":"2308.16266","submitter":"Alessandro Lovato","authors":"A. Gnech, B. Fore, and A. Lovato","title":"Distilling the essential elements of nuclear binding via neural-network\n  quantum states","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In pursuing the essential elements of nuclear binding, we compute\nground-state properties of atomic nuclei with up to $A=20$ nucleons, using as\ninput a leading order pionless effective field theory Hamiltonian. A\nvariational Monte Carlo method based on a new, highly-expressive,\nneural-network quantum state ansatz is employed to solve the many-body\nSchr\\\"odinger equation in a systematically improvable fashion. In addition to\nbinding energies and charge radii, we accurately evaluate the magnetic moments\nof these nuclei, as they reveal the self-emergence of the shell structure,\nwhich is not a priori encoded in the neural-network ansatz. To this aim, we\nintroduce a novel computational protocol based on adding an external magnetic\nfield to the nuclear Hamiltonian, which allows the neural network to learn the\npreferred polarization of the nucleus within the given magnetic field.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:50:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gnech","A.",""],["Fore","B.",""],["Lovato","A.",""]]}
{"id":"2308.16267","submitter":"Zu-Jian Ying","authors":"Zu-Jian Ying","title":"Spin Winding and Topological Nature of Transitions in Jaynes-Cummings\n  Model with Stark Non-linear Coupling","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Besides exploring novel transition patterns, acquiring a full understanding\nof the transition nature is an ultimate pursuit in studies of phase\ntransitions. The fundamental models of light-matter interactions manifest\nsingle-qubit topological phase transitions, which is calling for an analytical\ndemonstration apart from numerical studies. We present a rigorous study for\ntopological transitions in Jaynes-Cummings Model generally with Stark\nnon-linear Coupling. In terms of the properties of Hermite polynomials, we show\nthat the topological structure of the eigen wave function has an exact\ncorrespondence to the spin winding by nodes, which yields a full spin winding\nwithout anti-winding nodes. The spurious fractional contribution to the winding\nnumber of the winding angle at infinity is found to be actually integer. Thus,\nthe phase transitions in the model have a nature of topological phase\ntransitions and the excitation number is endowed as a topological quantum\nnumber. The principal transition establishes a paradigmatic case that a\ntransition is both symmetry-breaking Landau class of transition and\nsymmetry-protected topological class of transition simultaneously, while\nconventionally these two classes of transitions are incompatible due to the\ncontrary symmetry requirements. We also give an understanding for the origin of\nunconventional topological transitions in the presence of counter-rotating\nterms. Our results may provide a deeper insight for the few-body phase\ntransitions in light-matter interactions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:51:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ying","Zu-Jian",""]]}
{"id":"2308.16268","submitter":"Michael Grudi\\'c","authors":"Michael Y. Grudi\\'c, Philip F. Hopkins","title":"The opacity limit","comments":"To be submitted to the Open Journal of Astrophysics. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The opacity limit is an important concept in star formation: isothermal\ncollapse cannot proceed without limit, because eventually cooling radiation is\ntrapped and the temperature rises quasi-adiabatically, setting a minimum Jeans\nmass $M_{\\rm J}^{\\rm min}$. Various works have considered this scenario and\nderived expressions for $M_{\\rm J}^{\\rm min}$, generally $\\sim\n10^{-3}-10^{-2}M_\\odot$ in normal star-forming conditions, but with conflicting\nresults about the scaling with ambient conditions and material properties. We\nderive expressions for the thermal evolution of dust-cooled collapsing gas\nclumps in various limiting cases, given a general ambient radiation field\n($u_{\\rm rad}$, $T_{\\rm rad}$) and a general power-law dust opacity law\n$\\sigma_{\\rm d} = A_{\\rm d} T^{\\beta}$. By accounting for temperature evolution\nself-consistently we rule out a previously-proposed regime in which the\nadiabatic transition occurs while the core is still optically-thin. If the\nradiation field is weak or dust opacity is small, $M_{\\rm J}^{\\rm min}$ is\ninsensitive to dust properties/abundance ($\\sim A_{\\rm\nd}^{-\\frac{1}{11}}-A_{\\rm d}^{-\\frac{1}{15}}$), but if the radiation field is\nstrong and dust is abundant it scales $\\propto A_{\\rm d}^{1/3}$. This could\nmake the IMF less bottom-heavy in dust-rich and/or radiation-dense\nenvironments, e.g. galactic centers, starburst galaxies, massive high-$z$\ngalaxies, and proto-star clusters that are already luminous.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:57:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Grudi\u0107","Michael Y.",""],["Hopkins","Philip F.",""]]}
{"id":"2308.16269","submitter":"Jun Wang","authors":"Jun Wang, Lixing Zhu, Abhir Bhalerao and Yulan He","title":"Can Prompt Learning Benefit Radiology Report Generation?","comments":"8 pages with 6 pages supplementary file","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Radiology report generation aims to automatically provide clinically\nmeaningful descriptions of radiology images such as MRI and X-ray. Although\ngreat success has been achieved in natural scene image captioning tasks,\nradiology report generation remains challenging and requires prior medical\nknowledge. In this paper, we propose PromptRRG, a method that utilizes prompt\nlearning to activate a pretrained model and incorporate prior knowledge. Since\nprompt learning for radiology report generation has not been explored before,\nwe begin with investigating prompt designs and categorise them based on varying\nlevels of knowledge: common, domain-specific and disease-enriched prompts.\nAdditionally, we propose an automatic prompt learning mechanism to alleviate\nthe burden of manual prompt engineering. This is the first work to\nsystematically examine the effectiveness of prompt learning for radiology\nreport generation. Experimental results on the largest radiology report\ngeneration benchmark, MIMIC-CXR, demonstrate that our proposed method achieves\nstate-of-the-art performance. Code will be available upon the acceptance.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:58:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Jun",""],["Zhu","Lixing",""],["Bhalerao","Abhir",""],["He","Yulan",""]]}
{"id":"2308.16270","submitter":"Rafal Kulik","authors":"Zaoli Chen and Rafal Kulik","title":"Limit theorems for unbounded cluster functionals of regularly varying\n  time series","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A blocks method is used to define clusters of extreme values in stationary\ntime series. The cluster starts at the first large value in the block and ends\nat the last one. The block cluster measure (the point measure at clusters)\nencodes different aspects of extremal properties. Its limiting behaviour is\nhandled by vague convergence, hence the set of test functions consists of\nbounded, shift-invariant functionals that vanish around zero. If unbounded or\nnon shift-invariant functionals are considered, we may obtain convergence at a\ndifferent rate, depending on the type of the functional and the block size\n(small vs. large blocks). There are two prominent examples of such functionals:\nthe locations of large jumps and the cluster length. We obtain a comprehensive\ncharacterization of the limiting behaviour of the block cluster measure\nevaluated at such functionals for stationary, regularly varying time series.\nOnce the convergence of the block cluster measure is established, we can\nproceed with consistency of the empirical cluster measure. Consistency holds in\nthe small and moderate blocks scenario, while fails in the large blocks\nsituation. Next, we continue with weak convergence of the empirical cluster\nprocesses. The starting point is the seminal paper by Drees and Rootzen (2010).\nUnder the appropriate uniform integrability condition (related to small blocks)\nthe results in the latter paper are still valid. In the moderate and large\nblocks scenario, the Drees and Rootzen empirical cluster process diverges, but\nconverges weakly when re-normalized properly.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 18:59:52 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Zaoli",""],["Kulik","Rafal",""]]}
{"id":"2308.16271","submitter":"Yaodong Yu","authors":"Yaodong Yu, Tianzhe Chu, Shengbang Tong, Ziyang Wu, Druv Pai, Sam\n  Buchanan, Yi Ma","title":"Emergence of Segmentation with Minimalistic White-Box Transformers","comments":"Code: https://github.com/Ma-Lab-Berkeley/CRATE","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transformer-like models for vision tasks have recently proven effective for a\nwide range of downstream applications such as segmentation and detection.\nPrevious works have shown that segmentation properties emerge in vision\ntransformers (ViTs) trained using self-supervised methods such as DINO, but not\nin those trained on supervised classification tasks. In this study, we probe\nwhether segmentation emerges in transformer-based models solely as a result of\nintricate self-supervised learning mechanisms, or if the same emergence can be\nachieved under much broader conditions through proper design of the model\narchitecture. Through extensive experimental results, we demonstrate that when\nemploying a white-box transformer-like architecture known as CRATE, whose\ndesign explicitly models and pursues low-dimensional structures in the data\ndistribution, segmentation properties, at both the whole and parts levels,\nalready emerge with a minimalistic supervised training recipe. Layer-wise\nfiner-grained analysis reveals that the emergent properties strongly\ncorroborate the designed mathematical functions of the white-box network. Our\nresults suggest a path to design white-box foundation models that are\nsimultaneously highly performant and mathematically fully interpretable. Code\nis at \\url{https://github.com/Ma-Lab-Berkeley/CRATE}.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:02:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yu","Yaodong",""],["Chu","Tianzhe",""],["Tong","Shengbang",""],["Wu","Ziyang",""],["Pai","Druv",""],["Buchanan","Sam",""],["Ma","Yi",""]]}
{"id":"2308.16272","submitter":"Nicol\\'as Valenzuela","authors":"Nicol\\'as Valenzuela","title":"A numerical approach for the fractional Laplacian via deep neural\n  networks","comments":"32 pages, 21 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP cs.LG cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the fractional elliptic problem with Dirichlet boundary\nconditions on a bounded and convex domain $D$ of $\\mathbb{R}^d$, with $d \\geq\n2$. In this paper, we perform a stochastic gradient descent algorithm that\napproximates the solution of the fractional problem via Deep Neural Networks.\nAdditionally, we provide four numerical examples to test the efficiency of the\nalgorithm, and each example will be studied for many values of $\\alpha \\in\n(1,2)$ and $d \\geq 2$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:02:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Valenzuela","Nicol\u00e1s",""]]}
{"id":"2308.16273","submitter":"Alexey Ovchinnikov","authors":"Alexey Ovchinnikov, Anand Pillay, Gleb Pogudin, and Thomas Scanlon","title":"Identifiable specializations for ODE models","comments":"Maple code for the examples from the paper is available here:\n  https://github.com/alexeyovchinnikov/Identifiable-specializations-for-ODE-models","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.DS q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The parameter identifiability problem for a dynamical system is to determine\nwhether the parameters of the system can be found from data for the outputs of\nthe system. Verifying whether the parameters are identifiable is a necessary\nfirst step before a meaningful parameter estimation can take place.\nNon-identifiability occurs in practical models. To reparametrize a model to\nachieve identifiability is a challenge. The existing approaches have been shown\nto be useful for many important examples. However, these approaches are either\nlimited to linear models and scaling parametrizations or are not guaranteed to\nfind a reparametrization even if it exists. In the present paper, we prove that\nthere always exists a locally identifiable model with the same input-output\nbehaviour as the original one obtained from a given one by a partial\nspecialization of the parameters. Furthermore, we give a sufficient\nobservability condition for the existence of a state space transformation from\nthe original model to the new one. Our proof is constructive and can be\ntranslated to an algorithm, which we illustrate by several examples.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:02:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ovchinnikov","Alexey",""],["Pillay","Anand",""],["Pogudin","Gleb",""],["Scanlon","Thomas",""]]}
{"id":"2308.16274","submitter":"Damien Teney","authors":"Armand Mihai Nicolicioiu, Andrei Liviu Nicolicioiu, Bogdan Alexe,\n  Damien Teney","title":"Learning Diverse Features in Vision Transformers for Improved\n  Generalization","comments":"2023 ICML Workshop on Spurious Correlations, Invariance and Stability","journal-ref":null,"doi":null,"report-no":"R01","categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning models often rely only on a small set of features even when\nthere is a rich set of predictive signals in the training data. This makes\nmodels brittle and sensitive to distribution shifts. In this work, we first\nexamine vision transformers (ViTs) and find that they tend to extract robust\nand spurious features with distinct attention heads. As a result of this\nmodularity, their performance under distribution shifts can be significantly\nimproved at test time by pruning heads corresponding to spurious features,\nwhich we demonstrate using an \"oracle selection\" on validation data. Second, we\npropose a method to further enhance the diversity and complementarity of the\nlearned features by encouraging orthogonality of the attention heads' input\ngradients. We observe improved out-of-distribution performance on diagnostic\nbenchmarks (MNIST-CIFAR, Waterbirds) as a consequence of the enhanced diversity\nof features and the pruning of undesirable heads.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:04:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nicolicioiu","Armand Mihai",""],["Nicolicioiu","Andrei Liviu",""],["Alexe","Bogdan",""],["Teney","Damien",""]]}
{"id":"2308.16275","submitter":"Dennis Volpano","authors":"Dennis Volpano, Drew Malzahn, Andrew Pareles, Mark Thober","title":"Quantitative Toolchain Assurance","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The software bill of materials (SBOM) concept aims to include more\ninformation about a software build such as copyrights, dependencies and\nsecurity references. But SBOM lacks visibility into the process for building a\npackage. Efforts such as Supply-chain Levels for Software Artifacts (SLSA) try\nto remedy this by focusing on the quality of the build process. But they lack\nquantitative assessment of that quality. They are purely qualitative. A new\nform of assurance case and new technique for structuring it, called process\nreduction, are presented. An assurance case for a toolchain is quantitative and\nwhen structured as a process reduction can measure the strength of the\ntoolchain via the strength of the reduction. An example is given for a simple\ntoolchain.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:05:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Volpano","Dennis",""],["Malzahn","Drew",""],["Pareles","Andrew",""],["Thober","Mark",""]]}
{"id":"2308.16276","submitter":"Corey Switzer","authors":"Hiroshi Sakai, Corey Bacal Switzer","title":"Separating Subversion Forcing Principles","comments":"16 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a family of variants of Jensen's subcomplete forcing axiom,\n$\\mathsf{SCFA}$ and subproper forcing axiom, $\\mathsf{SubPFA}$. Using these we\ndevelop a general technique for proving non-implications of $\\mathsf{SCFA}$,\n$\\mathsf{SubPFA}$ and their relatives and give several applications. For\ninstance we show that $\\mathsf{SCFA}$ does not imply\n$\\mathsf{MA}^+(\\sigma$-closed$)$ and $\\mathsf{SubPFA}$ does not imply Martin's\nMaximum.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:05:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sakai","Hiroshi",""],["Switzer","Corey Bacal",""]]}
{"id":"2308.16277","submitter":"Gergely Kiss","authors":"Thomas Fallon, Gergely Kiss, Azita Mayeli, G\\'abor Somlai","title":"Spectral Tile Direction in the Group $\\mathbb{Z}_{p^2} \\times\n  \\mathbb{Z}_{q^2} \\times \\mathbb{Z}_r$","comments":"14","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.GR math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we investigate the Fuglede's conjecture for\n$\\mathbb{Z}_{p^2q^2r}$ and provide a proof of it under the condition $p^2q^2\n\\le r$. We develop a new technique by studying the divisibility of the mask\npolynomial of a given set by some system of cyclotomic polynomials. This\ncombined with a so-called mod-p-method gives a strong tool to study Fuglede's\nconjecture in this and some other cases.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:09:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fallon","Thomas",""],["Kiss","Gergely",""],["Mayeli","Azita",""],["Somlai","G\u00e1bor",""]]}
{"id":"2308.16278","submitter":"Xiao Pan","authors":"Sina Tavasoli, Xiao Pan, T. Y. Yang, Saudah Gazi, Mohsen Azimi","title":"Autonomous damage assessment of structural columns using low-cost micro\n  aerial vehicles and multi-view computer vision","comments":"12 pages, 11 figures, accepted in the Canadian Conference - Pacific\n  Conference on Earthquake Engineering 2023, Vancouver, British Columbia","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Structural columns are the crucial load-carrying components of buildings and\nbridges. Early detection of column damage is important for the assessment of\nthe residual performance and the prevention of system-level collapse. This\nresearch proposes an innovative end-to-end micro aerial vehicles (MAVs)-based\napproach to automatically scan and inspect columns. First, an MAV-based\nautomatic image collection method is proposed. The MAV is programmed to sense\nthe structural columns and their surrounding environment. During the\nnavigation, the MAV first detects and approaches the structural columns. Then,\nit starts to collect image data at multiple viewpoints around every detected\ncolumn. Second, the collected images will be used to assess the damage types\nand damage locations. Third, the damage state of the structural column will be\ndetermined by fusing the evaluation outcomes from multiple camera views. In\nthis study, reinforced concrete (RC) columns are selected to demonstrate the\neffectiveness of the approach. Experimental results indicate that the proposed\nMAV-based inspection approach can effectively collect images from multiple\nviewing angles, and accurately assess critical RC column damages. The approach\nimproves the level of autonomy during the inspection. In addition, the\nevaluation outcomes are more comprehensive than the existing 2D vision methods.\nThe concept of the proposed inspection approach can be extended to other\nstructural columns such as bridge piers.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:09:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tavasoli","Sina",""],["Pan","Xiao",""],["Yang","T. Y.",""],["Gazi","Saudah",""],["Azimi","Mohsen",""]]}
{"id":"2308.16279","submitter":"Tristan Glatard","authors":"Korantin Bordeau-Aubert, Justin Whatley, Sylvain Nadeau, Tristan\n  Glatard, Brigitte Jaumard","title":"Classification of Anomalies in Telecommunication Network KPI Time Series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The increasing complexity and scale of telecommunication networks have led to\na growing interest in automated anomaly detection systems. However, the\nclassification of anomalies detected on network Key Performance Indicators\n(KPI) has received less attention, resulting in a lack of information about\nanomaly characteristics and classification processes. To address this gap, this\npaper proposes a modular anomaly classification framework. The framework\nassumes separate entities for the anomaly classifier and the detector, allowing\nfor a distinct treatment of anomaly detection and classification tasks on time\nseries. The objectives of this study are (1) to develop a time series simulator\nthat generates synthetic time series resembling real-world network KPI\nbehavior, (2) to build a detection model to identify anomalies in the time\nseries, (3) to build classification models that accurately categorize detected\nanomalies into predefined classes (4) to evaluate the classification framework\nperformance on simulated and real-world network KPI time series. This study has\ndemonstrated the good performance of the anomaly classification models trained\non simulated anomalies when applied to real-world network time series data.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:13:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bordeau-Aubert","Korantin",""],["Whatley","Justin",""],["Nadeau","Sylvain",""],["Glatard","Tristan",""],["Jaumard","Brigitte",""]]}
{"id":"2308.16280","submitter":"Xiao Pan","authors":"Yifei Xiao, T.Y. Yang, Xiao Pan, Fan Xie and Zhongwei Chen","title":"A reinforcement learning based construction material supply strategy\n  using robotic crane and computer vision for building reconstruction after an\n  earthquake","comments":"12 pages, 7 figures, accepted in the Canadian Conference - Pacific\n  Conference on Earthquake Engineering 2023, Vancouver, British Columbia","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  After an earthquake, it is particularly important to provide the necessary\nresources on site because a large number of infrastructures need to be repaired\nor newly constructed. Due to the complex construction environment after the\ndisaster, there are potential safety hazards for human labors working in this\nenvironment. With the advancement of robotic technology and artificial\nintelligent (AI) algorithms, smart robotic technology is the potential solution\nto provide construction resources after an earthquake. In this paper, the\nrobotic crane with advanced AI algorithms is proposed to provide resources for\ninfrastructure reconstruction after an earthquake. The proximal policy\noptimization (PPO), a reinforcement learning (RL) algorithm, is implemented for\n3D lift path planning when transporting the construction materials. The state\nand reward function are designed in detail for RL model training. Two models\nare trained through a loading task in different environments by using PPO\nalgorithm, one considering the influence of obstacles and the other not\nconsidering obstacles. Then, the two trained models are compared and evaluated\nthrough an unloading task and a loading task in simulation environments. For\neach task, two different cases are considered. One is that there is no obstacle\nbetween the initial position where the construction material is lifted and the\ntarget position, and the other is that there are obstacles between the initial\nposition and the target position. The results show that the model that\nconsidering the obstacles during training can generate proper actions for the\nrobotic crane to execute so that the crane can automatically transport the\nconstruction materials to the desired location with swing suppression, short\ntime consumption and collision avoidance.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:13:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xiao","Yifei",""],["Yang","T. Y.",""],["Pan","Xiao",""],["Xie","Fan",""],["Chen","Zhongwei",""]]}
{"id":"2308.16281","submitter":"Olga Gelfond","authors":"O. A. Gelfond","title":"Moderately non-local $\\eta \\bar\\eta$ vertices in the $AdS_4$ higher-spin\n  gauge theory","comments":"41 pages","journal-ref":null,"doi":null,"report-no":"FIAN/TD/14-23","categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A new concept of moderate non-locality in higher-spin gauge theory is\nintroduced. Based on the recently proposed differential homotopy approach, a\nmoderately non-local scheme, that issofter than those resulting from the\nshifted homotopy approach available in the literature so far, is worked out in\nthe mixed $\\eta\\bar\\eta$ sector of the Vasiliev higher-spin theory. To\ncalculate moderately non-local vertices $\\Upsilon^{\\eta\\bar \\eta}(\\omega,\nC,C,C)$ for all ordering of the fields $\\omega$ and $C$ we apply an\ninterpolating homotopy, that respects the moderate non-locality in the\nperturbative analysis of the higher-spin equations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:22:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gelfond","O. A.",""]]}
{"id":"2308.16282","submitter":"Anna Childs","authors":"Anna C. Childs, Aaron M. Geller, Ted von Hippel, Erin Motherway, and\n  Claire Zwicker","title":"Goodbye to Chi-by-Eye: A Bayesian Analysis of Photometric Binaries in\n  Six Open Clusters","comments":"20 pages, 11 figures, and 5 tables. Submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using Gaia DR3, Pan-STARRS and 2MASS data, we self-consistently define the\ncluster parameters and binary demographics for the open clusters (OCs) NGC 2168\n(M35), NGC 7789, NGC 6819, NGC 2682 (M67), NGC 188, and NGC 6791. These\nclusters span in age from ~200 Myr (NGC 2168) to more than ~8 Gyr (NGC 6791)\nand have all been extensively studied in the literature. We use the Bayesian\nAnalysis of Stellar Evolution software suite (BASE-9) to derive the age,\ndistance, reddening, metallicity, binary fraction, and binary mass-ratio\nposterior distributions for each cluster. We perform a careful analysis of our\ncompleteness and also compare our results to previous spectroscopic surveys.\nFor our sample of main-sequence stars with masses between 0.6 - 1 M_Sun, we\nfind that these OCs have similar binary fractions that are also broadly\nconsistent with the field multiplicity fraction. Within the clusters, the\nbinary fraction increases dramatically toward the cluster centers, likely a\nresult of mass segregation. Furthermore nearly all clusters show evidence of\nmass segregation within the single and binary populations, respectively. The OC\nbinary fraction increases significantly with cluster age in our sample,\npossibly due to a combination of mass-segregation and cluster dissolution\nprocesses. We also find a hint of an anti-correlation between binary fraction\nand cluster central density as well as total cluster mass, possibly due to an\nincreasing frequency of higher energy close stellar encounters that inhibit\nlong-period binary survival and/or formation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:22:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Childs","Anna C.",""],["Geller","Aaron M.",""],["von Hippel","Ted",""],["Motherway","Erin",""],["Zwicker","Claire",""]]}
{"id":"2308.16283","submitter":"Henry Lin","authors":"Jan Boruch, Henry W. Lin, Cynthia Yan","title":"Exploring supersymmetric wormholes in $\\cal{N} = 2$ SYK with chords","comments":"41 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A feature the $\\mathcal{N}=2$ supersymmetric Sachdev-Ye-Kitaev (SYK) model\nshares with extremal black holes is an exponentially large number of ground\nstates that preserve supersymmetry. In fact, the dimension of the ground state\nsubsector is a finite fraction of the total dimension of the SYK Hilbert space.\nThis fraction has a remarkably simple bulk interpretation as the probability\nthat the zero-temperature wormhole -- a supersymmetric Einstein-Rosen bridge --\nhas vanishing length. Using chord techniques, we compute the zero-temperature\nHartle-Hawking wavefunction; the results reproduce the ground state count\nobtained from boundary index computations, including non-perturbative\ncorrections. Along the way, we improve the construction [arXiv:2003.04405] of\nthe super-chord Hilbert space and show that the transfer matrix of the empty\nwormhole enjoys an enhanced $\\mathcal{N} = 4 $ supersymmetry. We also obtain\nexpressions for various two point functions at zero temperature. Finally, we\nfind the expressions for the supercharges acting on more general wormholes with\nmatter and present the superchord algebra.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:23:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Boruch","Jan",""],["Lin","Henry W.",""],["Yan","Cynthia",""]]}
{"id":"2308.16284","submitter":"Vladimir Tkachev G.","authors":"Vladimir G. Tkachev","title":"Inner isotopes associated with automorphisms of commutative associative\n  algebras, I","comments":"submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The principal observation of the paper is that an inner isotopy (i.e. a\nprincipal isotopy defined by an algebra endomorphism) is a very helpful\ninstrument in constructing and studying of interesting classes of\nnonassociative algebras. By using methods developed in the paper, we define a\nnew class of commutative nonassociative algebras obtained by inner isotopy from\ncommutative associative polynomial algebras. There is a natural bijection\nbetween isomorphy classes of our algebras and integer partitions. One of the\nintriguing features of the constructed nonassociative algebras is that these\nalgebras are generic, axial and metrized. We completely describe both the set\nof algebra idempotents and their spectra.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:24:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tkachev","Vladimir G.",""]]}
{"id":"2308.16285","submitter":"Hsuan-Hao Lu","authors":"Hsuan-Hao Lu, Muneer Alshowkan, Karthik V. Myilswamy, Andrew M.\n  Weiner, Joseph M. Lukens, and Nicholas A. Peters","title":"Generation and characterization of ultrabroadband polarization-frequency\n  hyperentangled photons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We generate ultrabroadband photon pairs entangled in both polarization and\nfrequency bins through an all-waveguided Sagnac source covering the entire\noptical C- and L-bands (1530--1625 nm). We perform comprehensive\ncharacterization of high-fidelity states in multiple dense wavelength-division\nmultiplexed channels, achieving full tomography of effective four-qubit\nsystems. Additionally, leveraging the inherent high dimensionality of frequency\nencoding and our electro-optic measurement approach, we demonstrate the\nscalability of our system to higher dimensions, reconstructing states in a\n36-dimensional Hilbert space consisting of two polarization qubits and two\nfrequency-bin qutrits. Our findings hold potential significance for quantum\nnetworking, particularly dense coding and entanglement distillation in\nwavelength-multiplexed quantum networks.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:26:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lu","Hsuan-Hao",""],["Alshowkan","Muneer",""],["Myilswamy","Karthik V.",""],["Weiner","Andrew M.",""],["Lukens","Joseph M.",""],["Peters","Nicholas A.",""]]}
{"id":"2308.16286","submitter":"Cynthia J. Olson Reichhardt","authors":"C. Reichhardt and C.J.O. Reichhardt","title":"Collective Dynamics and Defect Generation for Wigner Crystal Ratchets","comments":"16 pages, 21 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":"  We consider a two-dimensional Wigner crystal coupled to a\nquasi-one-dimensional asymmetric potential under ac or dc driving. As a\nfunction of electron density, substrate strength, and ac amplitude, we find\nthat the system exhibits ordered and disordered pinned and dynamical states.\nRatchet effects can appear under an applied ac drive and can be associated with\npronounced structural changes from a disordered state to a one-dimensional\nsmectic-like state. We observe a pinned phase, a diode-like ratchet where\nmotion only occurs along the easy direction of the substrate asymmetry, a\nplastic ratchet where motion occurs in both directions but there is only a net\ndrift in the easy direction, and an elastic ratchet where the system forms a\ncrystal without plastic deformation that can still undergo ratcheting. At high\nfilling, we find that there can be a ratchet reversal in which the net drift is\nalong the hard direction of the substrate asymmetry. For weak disorder, there\nis an Aubry transition to a floating phase where the ratchet effects are lost.\nWe map out the different dynamical phases as a function of substrate strength,\nfilling, ac amplitude, and ac frequency. The ratchet effect on strong\nsubstrates is enhanced by thermal fluctuations, but is destroyed when the\nfluctuations become too large. Based on our results, we suggest new ways to\ndetect Wigner crystals as well as methods for creating new types of devices to\ncontrol disordered charge flow.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:32:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Reichhardt","C.",""],["Reichhardt","C. J. O.",""]]}
{"id":"2308.16287","submitter":"Nikolaos Dedes","authors":"Nikolaos Dedes, Jack Saywell, Max Carey, Ilya Kuprov, Tim Freegarde","title":"Optimizing beam-splitter pulses for atom interferometry: a geometric\n  approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a methodology for the design of optimal Raman beam-splitter pulses\nsuitable for cold atom inertial sensors. The methodology, based on\ntime-dependent perturbation theory, links optimal control and the sensitivity\nfunction formalism in the Bloch sphere picture, thus providing a geometric\ninterpretation of the optimization problem. Optimized pulse waveforms are found\nto be more resilient than conventional beam-splitter pulses and ensure a\nnear-flat superposition phase for a range of detunings approaching the Rabi\nfrequency. As a practical application, we have simulated the performance of an\noptimized Mach-Zehnder interferometer in terms of scale-factor error and bias\ninduced by inter-pulse laser intensity variations. Our findings reveal\nenhancements compared to conventional interferometers operating with\nconstant-power beam-splitter pulses.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:34:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dedes","Nikolaos",""],["Saywell","Jack",""],["Carey","Max",""],["Kuprov","Ilya",""],["Freegarde","Tim",""]]}
{"id":"2308.16288","submitter":"Rayleigh Lei","authors":"Rayleigh Lei, Abel Rodriguez","title":"A Novel Class of Unfolding Models for Binary Preference Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop a new class of spatial voting models for binary preference data\nthat can accommodate both monotonic and non-monotonic response functions, and\nare more flexible than alternative \"unfolding\" models previously introduced in\nthe literature. We then use these models to estimate revealed preferences for\nlegislators in the U.S. House of Representatives and justices on the U.S.\nSupreme Court. The results from these applications indicate that the new models\nprovide superior complexity-adjusted performance to various alternatives and\nalso that the additional flexibility leads to preferences' estimates that are\ncloser matches to the perceived ideological positions of legislators and\njustices.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:36:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lei","Rayleigh",""],["Rodriguez","Abel",""]]}
{"id":"2308.16289","submitter":"Marta Misiaszek-Schreyner","authors":"Marta Misiaszek-Schreyner, Miriam Kosik, Mirek Sopek","title":"Time-Bin CKA as a tool for blockchain technology","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore the potential of Time-Bin Conference Key Agreement (TB CKA)\nprotocol as a means to achieve consensus among multiple parties. We provide an\nexplanation of the underlying physical implementation, i.e. TB CKA fundamentals\nand illustrate how this process can be seen as a natural realization of the\nglobal common coin primitive. Next, we present how TB CKA could be embodied in\nclassical consensus algorithms to create hybrid classical-quantum solutions to\nthe Byzantine Agreement problem.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:36:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Misiaszek-Schreyner","Marta",""],["Kosik","Miriam",""],["Sopek","Mirek",""]]}
{"id":"2308.16290","submitter":"Luke Lozenski","authors":"Luke Lozenski, Hanchen Wang, Fu Li, Mark A. Anastasio, Brendt\n  Wohlberg, Youzuo Lin, Umberto Villa","title":"Learned Full Waveform Inversion Incorporating Task Information for\n  Ultrasound Computed Tomography","comments":"13 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV physics.med-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Ultrasound computed tomography (USCT) is an emerging imaging modality that\nholds great promise for breast imaging. Full-waveform inversion (FWI)-based\nimage reconstruction methods incorporate accurate wave physics to produce high\nspatial resolution quantitative images of speed of sound or other acoustic\nproperties of the breast tissues from USCT measurement data. However, the high\ncomputational cost of FWI reconstruction represents a significant burden for\nits widespread application in a clinical setting. The research reported here\ninvestigates the use of a convolutional neural network (CNN) to learn a mapping\nfrom USCT waveform data to speed of sound estimates. The CNN was trained using\na supervised approach with a task-informed loss function aiming at preserving\nfeatures of the image that are relevant to the detection of lesions. A large\nset of anatomically and physiologically realistic numerical breast phantoms\n(NBPs) and corresponding simulated USCT measurements was employed during\ntraining. Once trained, the CNN can perform real-time FWI image reconstruction\nfrom USCT waveform data. The performance of the proposed method was assessed\nand compared against FWI using a hold-out sample of 41 NBPs and corresponding\nUSCT data. Accuracy was measured using relative mean square error (RMSE),\nstructural self-similarity index measure (SSIM), and lesion detection\nperformance (DICE score). This numerical experiment demonstrates that a\nsupervised learning model can achieve accuracy comparable to FWI in terms of\nRMSE and SSIM, and better performance in terms of task performance, while\nsignificantly reducing computational time.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:38:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lozenski","Luke",""],["Wang","Hanchen",""],["Li","Fu",""],["Anastasio","Mark A.",""],["Wohlberg","Brendt",""],["Lin","Youzuo",""],["Villa","Umberto",""]]}
{"id":"2308.16291","submitter":"Haowei Xu","authors":"Haowei Xu, Hao Tang, Guoqing Wang, Changhao Li, Boning Li, Paola\n  Cappellaro, and Ju Li","title":"Solid-State $\\rm ^{229}Th$ Nuclear Laser with Two-Photon Pumping","comments":"11 pages, 3 figures","journal-ref":"Phys. Rev. A 108, L021502 (2023)","doi":"10.1103/PhysRevA.108.L021502","report-no":null,"categories":"nucl-th cond-mat.mtrl-sci physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The radiative excitation of the 8.3 eV isomeric state of thorium-229 is an\noutstanding challenge due to the lack of tunable far-ultraviolet (F-UV)\nsources. In this work, we propose an efficient two-photon pumping scheme for\nthorium-229 using the optonuclear quadrupolar effect, which only requires a 300\nnm UV-B pumping laser. We further demonstrate that population inversion between\nthe nuclear isomeric and ground states can be achieved at room temperature\nusing a two-step pumping process. The nuclear laser, which has been pursued for\ndecades, may be realized using a Watt-level UV-B pumping laser and ultrawide\nbandgap thorium compounds (e.g., $\\rm ThF_4$, $\\rm Na_2ThF_6$, or $\\rm\nK_2ThF_6$) as the gain medium.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:40:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xu","Haowei",""],["Tang","Hao",""],["Wang","Guoqing",""],["Li","Changhao",""],["Li","Boning",""],["Cappellaro","Paola",""],["Li","Ju",""]]}
{"id":"2308.16292","submitter":"Bj{\\o}rn Kjos-Hanssen","authors":"Bj{\\o}rn Kjos-Hanssen","title":"Conditional automatic complexity and its metrics","comments":"29th International Computing and Combinatorics Conference (COCOON\n  2023), Lecture Notes in Computer Science","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Li, Chen, Li, Ma, and Vit\\'anyi (2004) introduced a similarity metric based\non Kolmogorov complexity. It followed work by Shannon in the 1950s on a metric\nbased on entropy. We define two computable similarity metrics, analogous to the\nJaccard distance and Normalized Information Distance, based on conditional\nautomatic complexity and show that they satisfy all axioms of metric spaces.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:40:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kjos-Hanssen","Bj\u00f8rn",""]]}
{"id":"2308.16293","submitter":"Corinne Fletcher","authors":"C. Fletcher, C. M. Hui, A. Goldstein, The MoonBEAM Team","title":"The Scientific Performance of the MoonBurst Energetics All-sky\n  Monitor(MoonBEAM)","comments":"ICRC Conference Proceedings","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":"  MoonBEAM is a SmallSat concept placed in cislunar orbit developed to study\nthe progenitors and multimessenger/multiwavelength signals of transient\nrelativistic jets and outflows and determine the conditions that lead to the\nlaunching of a transient relativistic jet. The advantage of MoonBEAM is the\ninstantaneous all-sky coverage due to its orbit, which maximizes the\ngamma-raytransient observations and provides upperlimits for non-detections.\nEarth blockage and detector downtime from the high particle activity in the\nSouth Atlantic Anomaly region prevent gamma-ray observatories in low Earth\norbit from surveying the entire sky at a given time. In addition, the long\nbaseline provided from a cislunar orbit allows MoonBEAM to constrain the\nlocalization annulus when combined with a gamma-ray instrument in low Earth\norbit utilizing the timing triangulation technique. We present the scientific\nperformance of MoonBEAM including the expected effective area, localization\nability and duty cycle. MoonBEAM provides many advantages to the gamma-ray and\ngravitational-wave follow up community by reducing the search region needed to\nidentify the afterglow and kilanova emission. In addition, the all-sky coverage\nwill provide insight into the conditions that lead to a successful relativistic\njet, instead of a shock breakout event, or a completely failed jet in the case\nof core collapse supernovae.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:41:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fletcher","C.",""],["Hui","C. M.",""],["Goldstein","A.",""],["Team","The MoonBEAM",""]]}
{"id":"2308.16294","submitter":"Dario Trevisan","authors":"Andrea Carbonaro, Luca Tamanini, Dario Trevisan","title":"Boundedness of Riesz transforms on $\\RCD(K, \\infty)$ spaces","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":"  For $1<p<\\infty$, we prove the $L^p$-boundedness of the Riesz transform\noperators on metric measure spaces with Riemannian Ricci curvature bounded from\nbelow, without any restriction on their dimension. This large class of spaces\ninclude e.g. that of Hilbert spaces endowed with a log-concave probability\nmeasure. As a consequence, we extend the range of the validity of the\nLusin-type approximation of Sobolev by Lipschitz functions, previously obtained\nby L. Ambrosio, E. Bru\\`e and the third author in the quadratic case, i.e.\n$p=2$. The proofs are analytic and rely on computations on an explicit Bellman\nfunction.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:43:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Carbonaro","Andrea",""],["Tamanini","Luca",""],["Trevisan","Dario",""]]}
{"id":"2308.16295","submitter":"Andres Prada","authors":"Andres F. Prada, Avram Distler, Shyuan Cheng, John W. Scott, Leonardo\n  P. Chamorro, Ganesh Subramanian, Vishal Verma, Andrew Turner","title":"Disposable face masks: a direct source for inhalation of microplastics","comments":"11 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Surgical masks have played a crucial role in healthcare facilities to protect\nagainst respiratory and infectious diseases, particularly during the COVID-19\npandemic. However, the synthetic fibers, mainly made of polypropylene, used in\ntheir production may adversely affect the environment and human health. Recent\nstudies have confirmed the presence of microplastics and fibers in human lungs\nand have related these synthetic particles with the occurrence of pulmonary\nground glass nodules. Using a piston system to simulate human breathing, this\nstudy investigates the role of surgical masks as a direct source of inhalation\nof microplastics. Results reveal the release of particles of sizes ranging from\nnanometers (300 nm) to millimeters (~2 mm) during normal breathing conditions,\nraising concerns about the potential health risks. Notably, large visible\nparticles (> 1 mm) were observed to be ejected from masks with limited wear\nafter only a few breathing cycles. Given the widespread use of masks by\nhealthcare workers and the potential future need for mask usage by the general\npopulation during seasonal infectious diseases or new pandemics, developing\nface masks using safe materials for both users and the environment is\nimperative.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:44:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Prada","Andres F.",""],["Distler","Avram",""],["Cheng","Shyuan",""],["Scott","John W.",""],["Chamorro","Leonardo P.",""],["Subramanian","Ganesh",""],["Verma","Vishal",""],["Turner","Andrew",""]]}
{"id":"2308.16296","submitter":"Santosh Kumar","authors":"Sunidhi Sen, Himanshu Shekhar, Santosh Kumar","title":"Spectral statistics of interpolating random circulant matrix","comments":"16 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a versatile matrix model of the form ${\\bf A}+i {\\bf B}$, where\n${\\bf A}$ and ${\\bf B}$ are real random circulant matrices with independent\nbut, in general, non-identically distributed Gaussian entries. For this model,\nwe derive exact result for the joint probability density function and find that\nit is a multivariate Gaussian. Consequently, exact expression for arbitrary\norder marginal density also ensues. It is demonstrated that by adjusting the\naverages and variances of the Gaussian elements of ${\\bf A}$ and ${\\bf B}$, we\ncan interpolate between a remarkably wide range of eigenvalue distributions in\nthe complex plane. In particular, we can examine the crossover between a random\nreal circulant matrix and a random complex circulant matrix. We also extend our\nstudy to include Wigner-like and Wishart-like matrices constructed from our\ngeneral random circulant matrix. To validate our analytical findings, Monte\nCarlo simulations are conducted, which confirm the accuracy of our results.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:47:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sen","Sunidhi",""],["Shekhar","Himanshu",""],["Kumar","Santosh",""]]}
{"id":"2308.16297","submitter":"Arlene Cristina Aguilar","authors":"A. C. Aguilar, M .N. Ferreira, D. Iba\\~nez, J. Papavassiliou","title":"Schwinger displacement of the quark-gluon vertex","comments":"41 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat hep-th nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The action of the Schwinger mechanism in pure Yang-Mills theories endows\ngluons with an effective mass, and, at the same time, induces a measurable\ndisplacement to the Ward identity satisfied by the three-gluon vertex. In the\npresent work we turn to Quantum Chromodynamics with two light quark flavors,\nand explore the appearance of this characteristic displacement at the level of\nthe quark-gluon vertex. When the Schwinger mechanism is activated, this vertex\nacquires massless poles, whose momentum-dependent residues are determined by a\nset of coupled integral equations. The main effect of these residues is to\ndisplace the Ward identity obeyed by the pole-free part of the vertex, causing\nmodifications to its form factors, and especially the one associated with the\ntree-level tensor. The comparison between the available lattice data for this\nform factor and the Ward identity prediction reveals a marked deviation, which\nis completely compatible with the theoretical expectation for the attendant\nresidue. This analysis corroborates further the self-consistency of this\nmass-generating scenario in the general context of real-world strong\ninteractions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:49:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Aguilar","A. C.",""],["Ferreira","M . N.",""],["Iba\u00f1ez","D.",""],["Papavassiliou","J.",""]]}
{"id":"2308.16298","submitter":"Hal Triedman","authors":"Temilola Adeleye, Skye Berghel, Damien Desfontaines, Michael Hay,\n  Isaac Johnson, Cl\\'eo Lemoisson, Ashwin Machanavajjhala, Tom Magerlein,\n  Gabriele Modena, David Pujol, Daniel Simmons-Marengo, and Hal Triedman","title":"Publishing Wikipedia usage data with strong privacy guarantees","comments":"11 pages, 10 figures, Theory and Practice of Differential Privacy\n  (TPDP) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For almost 20 years, the Wikimedia Foundation has been publishing statistics\nabout how many people visited each Wikipedia page on each day. This data helps\nWikipedia editors determine where to focus their efforts to improve the online\nencyclopedia, and enables academic research. In June 2023, the Wikimedia\nFoundation, helped by Tumult Labs, addressed a long-standing request from\nWikipedia editors and academic researchers: it started publishing these\nstatistics with finer granularity, including the country of origin in the daily\ncounts of page views. This new data publication uses differential privacy to\nprovide robust guarantees to people browsing or editing Wikipedia. This paper\ndescribes this data publication: its goals, the process followed from its\ninception to its deployment, the algorithms used to produce the data, and the\noutcomes of the data release.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 19:58:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Adeleye","Temilola",""],["Berghel","Skye",""],["Desfontaines","Damien",""],["Hay","Michael",""],["Johnson","Isaac",""],["Lemoisson","Cl\u00e9o",""],["Machanavajjhala","Ashwin",""],["Magerlein","Tom",""],["Modena","Gabriele",""],["Pujol","David",""],["Simmons-Marengo","Daniel",""],["Triedman","Hal",""]]}
{"id":"2308.16299","submitter":"M. White","authors":"M. White (1), J. Theilacker (1), M. Barba (1) ((1) Fermi National\n  Accelerator Laboratory)","title":"Conservation of Helium while Maintaining High System Purity","comments":"2023 Cryogenic Engineering Conference and International Cryogenic\n  Materials Conference (CEC/ICMC)","journal-ref":null,"doi":null,"report-no":"FERMILAB-CONF-23-360-TD","categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent helium shortages and helium price increases have lead to an increased\nemphasis being placed on conserving helium. The need to conserve helium must be\nbalanced with need to maintain the high levels of purity necessary to prevent\noperational problems caused by contamination. Helium losses and contamination\ncontrol are especially important for test stands that have cryogenic\ndistribution systems operating continuously with frequent changeover of\ncryogenic temperature components that are being tested. This paper describes a\nmathematical model to estimate the quantity of helium lost and the purity of\nthe helium after the pump and backfill procedure is complete. The process to\ndetermine the optimal time during pump down to cut off pumping and start\nbackfilling is described. There is a tradeoff between trying to achieve the\nlowest possible pressure during pumping and the quantity of air leaking into\nthe volume while pumping is occurring. An additional benefit of careful\nselection of pump and backfill parameters in conjunction with real-time\npressure monitoring can reduce the labor and time required to complete a\nsuccessful pump and backfill procedure. This paper is intended to be a tool for\nengineers to review their pump and backfill procedures and measured data to\noptimize helium losses, system purity, and labor required.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:39:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["White","M.",""],["Theilacker","J.",""],["Barba","M.",""]]}
{"id":"2308.16301","submitter":"Runbo Li","authors":"Runbo Li","title":"On some problems of primes with the floor function","comments":"8 pages. The second version is a complete improvement on the first\n  version, so we only present the best results","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Let $\\left[x\\right]$ be the largest integer not exceeding $x$. For $0<\\theta\n\\leq 1$, let $\\pi_{\\theta}(x)$ denote the number of integers $n$ with $1 \\leq n\n\\leq x^{\\theta}$ such that $\\left[\\frac{x}{n}\\right]$ is prime and\n$S_{\\mathbb{P}}(x)$ denote the number of primes in the sequence\n$\\left\\{\\left[\\frac{x}{n}\\right]\\right\\}_{n \\geqslant 1}$. In this paper, we\nobtain the asymptotic formula $$ \\pi_{\\theta}(x)=\\frac{x^{\\theta}}{(1-\\theta)\n\\log x}+O\\left(x^{\\theta}(\\log x)^{-2}\\right) $$ provide that\n$\\frac{435}{923}<\\theta<1$, and prove that $$ S_{\\mathbb{P}}(x)=x\\sum_{p}\n\\frac{1}{p(p+1)}+O_{\\varepsilon}\\left(x^{435/923+\\varepsilon}\\right) $$ for $x\n\\rightarrow \\infty$. Thus improve the previous result due to Ma, Wu and the\nauthor.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:25:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Runbo",""]]}
{"id":"2308.16302","submitter":"Alexander Shashkov","authors":"Alexander Shashkov","title":"Low lying zeros of Rankin-Selberg $L$-functions","comments":"32 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the low lying zeros of $GL(2) \\times GL(2)$ Rankin-Selberg\n$L$-functions. Assuming the generalized Riemann hypothesis, we compute the\n$1$-level density of the low-lying zeroes of $L(s, f \\otimes g)$ averaged over\nfamilies of Rankin-Selberg convolutions, where $f, g$ are cuspidal newforms\nwith even weights $k_1, k_2$ and prime levels $N_1, N_2$, respectively. The\nKatz-Sarnak density conjecture predicts that in the limit, the $1$-level\ndensity of suitable families of $L$-functions is the same as the distribution\nof eigenvalues of corresponding families of random matrices. The 1-level\ndensity relies on a smooth test function $\\phi$ whose Fourier transform\n$\\widehat\\phi$ has compact support. In general, we show the Katz-Sarnak density\nconjecture holds for test functions $\\phi$ with $\\operatorname{supp}\n\\widehat\\phi \\subset (-\\frac{1}{2}, \\frac{1}{2})$. When $N_1 = N_2$, we prove\nthe density conjecture for $\\operatorname{supp} \\widehat\\phi \\subset\n(-\\frac{5}{4}, \\frac{5}{4})$ when $k_1 \\ne k_2$, and $\\operatorname{supp}\n\\widehat\\phi \\subset (-\\frac{29}{28}, \\frac{29}{28})$ when $k_1 = k_2$. A lower\norder term emerges when the support of $\\widehat\\phi$ exceeds $(-1, 1)$, which\nmakes these results particularly interesting. The main idea which allows us to\nextend the support of $\\widehat\\phi$ beyond $(-1, 1)$ is an analysis of the\nproducts of Kloosterman sums arising from the Petersson formula. We also\ncarefully treat the contributions from poles in the case where $k_1 = k_2$. Our\nwork provides conditional lower bounds for the proportion of Rankin-Selberg\n$L$-functions which are non-vanishing at the central point and for a related\nconjecture of Keating and Snaith on central $L$-values.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:35:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shashkov","Alexander",""]]}
{"id":"2308.16303","submitter":"Subham De","authors":"Subham De","title":"On the Order Estimates for Specific Functions of $\\zeta(s)$ and its\n  Contribution towards the Analytic Proof of The Prime Number Theorem","comments":"26 Pages ; Survey Report","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, our primary objective is to provide an extensive\nintroduction to the Riemann Zeta Function $\\zeta(s)$, an integral part in the\nstudy different Analytic aspects relevant to the proof of the famous \"Prime\nNumber Theorem\" (PNT). The whole paper comprises of three mutually exclusive\nparts. In the initial sections, we define all the necessary terminologies and\nresults handpicked from the areas related to Analytic Number Theory and\nAnalysis of Complex Numbers, whereas, the second half provides an exposition on\nmeromorphic properties of $\\zeta(s)$, with brief deduction of the Riemann's\nFunctional Equation for the same. The final and most important part of this\nessay is solely dedicated towards appreciating the significance of the proof of\nthe Prime Number Theorem, if at all observed from an Analytic point of view.\nSubstantial amount of references in any of the topics pertinent to the contents\nof this paper have been included in the \\texttt{References} section for the\nreader's convenience, which I do believe shall prove to be resourceful to its\nardent readers and scholars.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:20:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["De","Subham",""]]}
{"id":"2308.16304","submitter":"Chu-Ping Yu","authors":"Chu-Ping Yu, Francisco Vega Iba\\~nez, Armand B\\'ech\\'e, Johan Verbeeck","title":"Quantum Wavefront Shaping with a 48-element Programmable Phase Plate for\n  Electrons","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a 48-element programmable phase plate for coherent electron waves\nconsisting of chip-based microscopic electrostatic elements. This brings the\nhighly successful concept of wavefront shaping from light optics into the realm\nof electron optics and provides an important new degree of freedom to prepare\nthe quantum state of electron waves. The phase plate is produced by a\ncombination of photolithography and focused ion beam post-processing. It\nconsists of an array of 48 electrostatic Einzel lenses distributed along a\npolar grid with 12-fold rotational symmetry. The phase plate chip is controlled\nby a series of 16-bit digital-to-analog converters and is mounted on an\naperture rod placed in the C2 plane of a state-of-the-art transmission electron\nmicroscope operating in the 100-300 keV range. The experimental phase plate\nbehavior is characterized by a Gerchberg-Saxton phase reconstruction algorithm,\nshowing a phase sensitivity of 0.075 rad/mV at 300 keV, with a phase resolution\nof approximately 3$\\cdot$10$^{-3}~\\pi$. The performance of the phase plate is\ndemonstrated by preparing a series of orthogonal quantum states with specific\nintensity profiles. We discuss a range of attractive applications in electron\nmicroscopy and show an experimental proof of concept of a self-tuning electron\nmicroscope setup, demonstrating the potential of adaptive electron optics.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:04:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yu","Chu-Ping",""],["Iba\u00f1ez","Francisco Vega",""],["B\u00e9ch\u00e9","Armand",""],["Verbeeck","Johan",""]]}
{"id":"2308.16305","submitter":"Bj\\\"orn Johannesson","authors":"Bj\\\"orn Johannesson","title":"Sequences related to Lehmer's problem","comments":"34 pages, 1 figure, Master's thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Mahler measure of a monic polynomial $P(x) = a_dx^d + a_{d-1}x^{d-1} +\n\\dots + a_1x + a_0$ is defined as $M(P) := |a_d| \\prod_{P(\\alpha)=0} \\max\\{1,\n|\\alpha|\\}$, where the product runs over all roots of $P$. Lehmer's problem\nasks whether there exists a constant $C>1$ such that $M(P) \\geq C$ for all\nnoncyclotomic polynomials in $\\mathbb{Z}[x]$. In this thesis, we examine the\nproperties of various integer sequences related to this problem, with special\nfocus on how these sequences might help solving Lehmer's problem.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:52:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Johannesson","Bj\u00f6rn",""]]}
{"id":"2308.16306","submitter":"Yiqiang Li","authors":"Yiqiang Li","title":"Quantum groups and edge contractions","comments":"Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the behaviors of quantum groups under an edge contraction. We show\nthat there exists an explicit embedding induced by an edge contraction\noperation. We further conjecture that this explicit embedding is a section of\nan explicit subquotient. This conjecture is proved when restricts to\nnegative/positive half of a quantum group. The compatibility of the Hopf\nalgebra structure of, and many other intrinsic structures associated with, a\nquantum group with the embedding and subquotient is studied along the way. The\nembedding phenomena are further observed in various representation theoretic\nobjects such as Weyl groups and Chevalley groups.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:20:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Yiqiang",""]]}
{"id":"2308.16307","submitter":"Minjae Kim","authors":"Minjae Kim","title":"Implementation Of MNIST Dataset Learning Using Analog Circuit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET cs.AR cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There have been many attempts to implement neural networks in the analog\ncircuit. Most of them had a lot of input terms, and most studies implemented\nneural networks in the analog circuit through a circuit simulation program\ncalled Spice to avoid the need to design chips at a high cost and implement\ncircuits directly to input them. In this study, we will implement neural\nnetworks using a capacitor and diode and use microcontrollers (Arduino Mega\n2560 R3 boards) to drive real-world models and analyze the results.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:06:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kim","Minjae",""]]}
{"id":"2308.16308","submitter":"A. Yu. Petrov","authors":"M. Gomes, J. G. Lima, T. Mariz, J. R. Nascimento, A. Yu. Petrov","title":"Non-Abelian Carroll-Field-Jackiw term term in a Rarita-Schwinger model","comments":"11 pages","journal-ref":"Phys. Lett. B845, 138141 (2023)","doi":"10.1016/j.physletb.2023.138141","report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we demonstrate the possibility of generating a non-Abelian\nCarroll-Field-Jackiw (CFJ) term in the theory of a non-Abelian gauge field\ncoupled to a spin-3/2 field in the presence of the constant axial vector field.\nApplying two regularization schemes, we prove that this term is finite and\nambiguous, particularly vanishing within the 't Hooft-Veltman scheme.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:24:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gomes","M.",""],["Lima","J. G.",""],["Mariz","T.",""],["Nascimento","J. R.",""],["Petrov","A. Yu.",""]]}
{"id":"2308.16309","submitter":"EPTCS","authors":"George A. Elder (Queen Mary University of London) and Conrad Bessant\n  (Queen Mary University of London)","title":"Inferring Compensatory Kinase Networks in Yeast using Prolog","comments":"In Proceedings ICLP 2023, arXiv:2308.14898","journal-ref":"EPTCS 385, 2023, pp. 260-273","doi":"10.4204/EPTCS.385.26","report-no":null,"categories":"q-bio.MN cs.SC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Signalling pathways are conserved across different species, therefore making\nyeast a model organism to study these via disruption of kinase activity. Yeast\nhas 159 genes that encode protein kinases and phosphatases, and 136 of these\nhave counterparts in humans. Therefore any insight in this model organism could\npotentially offer indications of mechanisms of action in the human kinome. The\nstudy utilises a Prolog-based approach, data from a yeast kinase deletions\nstrains study and publicly available kinase-protein associations. Prolog, a\nprogramming language that is well-suited for symbolic reasoning is used to\nreason over the data and infer compensatory kinase networks. This approach is\nbased on the idea that when a kinase is knocked out, other kinases may\ncompensate for this loss of activity. Background knowledge on kinases targeting\nproteins is used to guide the analysis. This knowledge is used to infer the\npotential compensatory interactions between kinases based on the changes in\nphosphorylation observed in the phosphoproteomics data from the yeast study.\nThe results demonstrate the effectiveness of the Prolog-based approach in\nanalysing complex cell signalling mechanisms in yeast. The inferred\ncompensatory kinase networks provide new insights into the regulation of cell\nsignalling in yeast and may aid in the identification of potential therapeutic\ntargets for modulating signalling pathways in yeast and other organisms.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:29:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Elder","George A.","","Queen Mary University of London"],["Bessant","Conrad","","Queen Mary University of London"]]}
{"id":"2308.16310","submitter":"Sam Nariman","authors":"Sam Nariman","title":"On invariants of foliated sphere bundles","comments":"16 pages, with an appendix by Nils Prigge","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Morita showed that for each power of the Euler class, there are examples of\nflat $\\mathbb{S}^1$-bundles for which the power of the Euler class does not\nvanish. Haefliger asked if the same holds for flat odd-dimensional sphere\nbundles. In this paper, for a manifold $M$ with a free torus action, we prove\nthat certain $M$-bundles are cobordant to a flat $M$-bundle and as a\nconsequence, we answer Haefliger's question. We show that the powers of the\nEuler class and Pontryagin classes $p_i$ for $i\\leq n-1$ are all non-trivial in\n$H^*(\\text{BDiff}^{\\delta}_+(\\mathbb{S}^{2n-1});\\mathbb{Q})$. In the appendix,\nNils Prigge corrects a claim by Haefliger about the vanishing of certain\nclasses in the smooth group cohomology of $\\text{Diff}_+(\\mathbb{S}^3)$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:36:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nariman","Sam",""]]}
{"id":"2308.16311","submitter":"Karl A. Kalina","authors":"Karl A. Kalina, Philipp Gebhart, J\\\"org Brummund, Lennart Linden,\n  WaiChing Sun, Markus K\\\"astner","title":"Neural network-based multiscale modeling of finite strain\n  magneto-elasticity with relaxed convexity criteria","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present a framework for the multiscale modeling of finite strain\nmagneto-elasticity based on physics-augmented neural networks (NNs). By using a\nset of problem specific invariants as input, an energy functional as the output\nand by adding several non-trainable expressions to the overall total energy\ndensity functional, the model fulfills multiple physical principles by\nconstruction, e.g., thermodynamic consistency and material symmetry. Three\nNN-based models with varying requirements in terms of an extended polyconvexity\ncondition of the magneto-elastic potential are presented. First, polyconvexity,\nwhich is a global concept, is enforced via input convex neural networks\n(ICNNs). Afterwards, we formulate a relaxed local version of the polyconvexity\nand fulfill it in a weak sense by adding a tailored loss term. As an\nalternative, a loss term to enforce the weaker requirement of strong\nellipticity locally is proposed, which can be favorable to obtain a better\ntrade-off between compatibility with data and physical constraints. Databases\nfor training of the models are generated via computational homogenization for\nboth compressible and quasi-incompressible magneto-active polymers (MAPs).\nThereby, to reduce the computational cost, 2D statistical volume elements and\nan invariant-based sampling technique for the pre-selection of relevant states\nare used. All models are calibrated by using the database, whereby\ninterpolation and extrapolation are considered separately. Furthermore, the\nperformance of the NN models is compared to a conventional model from the\nliterature. The numerical study suggests that the proposed physics-augmented NN\napproach is advantageous over the conventional model for MAPs. Thereby, the two\nmore flexible NN models in combination with the weakly enforced local\npolyconvexity lead to good results, whereas the model based only on ICNNs has\nproven to be too restrictive.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:38:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kalina","Karl A.",""],["Gebhart","Philipp",""],["Brummund","J\u00f6rg",""],["Linden","Lennart",""],["Sun","WaiChing",""],["K\u00e4stner","Markus",""]]}
{"id":"2308.16312","submitter":"Alexander Aycock","authors":"Alexander Aycock","title":"On Euler's Solution of the simple Difference Equation","comments":"11 pages","journal-ref":"Euleriana: 3(2), pp.136-146 (2023)","doi":"10.56031/2693-9908.1058","report-no":null,"categories":"math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note we will discuss Euler's solution of the simple difference\nequation that he gave in his paper{\\it ``De serierum determinatione seu nova\nmethodus inveniendi terminos generales serierum\"} \\cite{E189} (E189:``On the\ndetermination of series or a new method of finding the general terms of\nseries\") and also present a derivation for the values of the Riemann\n$\\zeta$-function at positive integer numbers based on Euler's ideas.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:39:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Aycock","Alexander",""]]}
{"id":"2308.16313","submitter":"Alexander Aycock","authors":"Alexander Aycock","title":"Euler's First Proof of Stirling's Formula","comments":"9 pages","journal-ref":"Euleriana: 3(2), pp.136-146 (2023)","doi":"10.56031/2693-9908.1058","report-no":null,"categories":"math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a proof given by Euler in his paper {\\it ``De serierum\ndeterminatione seu nova methodus inveniendi terminos generales serierum\"}\n\\cite{E189} (E189:``On the determination of series or a new method of finding\nthe general terms of series\") for Stirling's formula. Euler's proof uses his\ntheory of difference equations with constant coefficients. This theory outgrew\nfrom his earlier considerations on inhomogeneous differential equations with\nconstant coefficients of finite order that he tried to extend to the case of\ninfinite order.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:46:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Aycock","Alexander",""]]}
{"id":"2308.16314","submitter":"Gennady Samorodnitsky","authors":"Takashi Owed and Gennady Samorodnitsky","title":"Limit theorems for high-dimensional Betti numbers in the multiparameter\n  random simplicial complexes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the multiparameter random simplicial complex on a vertex set $\\{\n1,\\dots,n \\}$, which is parameterized by multiple connectivity probabilities.\nOur key results concern the topology of this complex of dimensions higher than\nthe critical dimension. We show that the higher-dimensional Betti numbers\nsatisfy strong laws of large numbers and central limit theorems. Moreover,\nlower tail large deviations for these Betti numbers are also discussed. Some of\nour results indicate an occurrence of phase transitions in terms of the scaling\nconstants of the central limit theorem, and the exponentially decaying rate of\nconvergence of lower tail large deviation probabilities.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:46:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Owed","Takashi",""],["Samorodnitsky","Gennady",""]]}
{"id":"2308.16315","submitter":"Aranyo Mitra","authors":"Aranyo Mitra, Ahmal Jawad Zafar, Vadym Apalkov","title":"Ultrafast Field-driven Valley Polarization of Transition Metal\n  Dichalcogenide Quantum Dots","comments":"10 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study theoretically the electron dynamics of transition metal\ndichalcogenide quantum dots in the field of an ultrashort and ultrafast\ncircularly polarized optical pulse. The quantum dots have the shape of a disk\nand their electron systems are described within an effective model with\ninfinite mass boundary conditions. Similar to transition metal dichalcogenide\nmonolayers, a circularly polarized pulse generates ultrafast valley\npolarization of such quantum dots. The dependence of the valley polarization on\nthe size of the dot is sensitive to the dot material and, for different\nmaterials, show both monotonic increase with the dot radius and nonmonotonic\nbehavior with a local maximum at a finite dot radius.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:46:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mitra","Aranyo",""],["Zafar","Ahmal Jawad",""],["Apalkov","Vadym",""]]}
{"id":"2308.16316","submitter":"Tanujit Chakraborty","authors":"Tanujit Chakraborty, Ujjwal Reddy K S, Shraddha M. Naik, Madhurima\n  Panja, Bayapureddy Manvitha","title":"Ten Years of Generative Adversarial Nets (GANs): A survey of the\n  state-of-the-art","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Since their inception in 2014, Generative Adversarial Networks (GANs) have\nrapidly emerged as powerful tools for generating realistic and diverse data\nacross various domains, including computer vision and other applied areas.\nConsisting of a discriminative network and a generative network engaged in a\nMinimax game, GANs have revolutionized the field of generative modeling. In\nFebruary 2018, GAN secured the leading spot on the ``Top Ten Global\nBreakthrough Technologies List'' issued by the Massachusetts Science and\nTechnology Review. Over the years, numerous advancements have been proposed,\nleading to a rich array of GAN variants, such as conditional GAN, Wasserstein\nGAN, CycleGAN, and StyleGAN, among many others. This survey aims to provide a\ngeneral overview of GANs, summarizing the latent architecture, validation\nmetrics, and application areas of the most widely recognized variants. We also\ndelve into recent theoretical developments, exploring the profound connection\nbetween the adversarial principle underlying GAN and Jensen-Shannon divergence,\nwhile discussing the optimality characteristics of the GAN framework. The\nefficiency of GAN variants and their model architectures will be evaluated\nalong with training obstacles as well as training solutions. In addition, a\ndetailed discussion will be provided, examining the integration of GANs with\nnewly developed deep learning frameworks such as Transformers, Physics-Informed\nNeural Networks, Large Language models, and Diffusion models. Finally, we\nreveal several issues as well as future research outlines in this field.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:46:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chakraborty","Tanujit",""],["S","Ujjwal Reddy K",""],["Naik","Shraddha M.",""],["Panja","Madhurima",""],["Manvitha","Bayapureddy",""]]}
{"id":"2308.16317","submitter":"Xiao Liang","authors":"Xiao Liang, Edward Hanna, Derek Simmel, Hang Liu, Yang Wang","title":"High Performance GPU Accelerated MuST Software","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The MuST package is a computational software designed for ab initio\nelectronic structure calculations for solids. The Locally Self-consistent\nMultiple Scattering (LSMS) method implemented in MuST allows to perform the\nelectronic structure calculation for systems with a large number of atoms per\nunit cell. For the LSMS method with muffin-tin potential approximation, the\nmajor computational challenge is the matrix inverse for the scattering matrix\ncalculation, which could take more than 90\\% of the computing time. However,\nthe matrix inverse can be significantly accelerated by modern\ngraphical-processing-units (GPUs). In this paper, we discuss our approach to\nthe code acceleration by offloading the matrix inverse tasks to the GPUs\nthrough a Fortran-C interface from the Fortran code to the CUDA code. We report\nour performance results showing significant speedup ratio achieved to the\ncalculations of NiAu alloy, a candidate for thermoelectric materials.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:51:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liang","Xiao",""],["Hanna","Edward",""],["Simmel","Derek",""],["Liu","Hang",""],["Wang","Yang",""]]}
{"id":"2308.16318","submitter":"Alexander Aycock","authors":"Alexander Aycock","title":"Euler and the Legendre Polynomials","comments":"12 pages","journal-ref":"Euleriana: 3(2), pp.124-135 (2023)","doi":"10.56031/2693-9908.1054","report-no":null,"categories":"math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note we will present how Euler's investigations on various different\nsubjects lead to certain properties of the Legendre polynomials. More\nprecisely, we will show that the generating function and the difference\nequation for the Legendre polynomials was already written down by Euler in at\nleast two different papers. Furthermore, we will demonstrate that some familiar\nexpressions for the Legendre polynomials are corollaries of the\nbefore-mentioned works. Finally, we will show that Euler's ideas on continued\nfractions lead to an integral representation for the Legendre polynomials that\nseems to be less generally known.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:52:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Aycock","Alexander",""]]}
{"id":"2308.16319","submitter":"Jenna Cario","authors":"Jenna Cario (1 and 2), Zhengchang Kou (1), April Dickenson (3),\n  Christine U. Lee (4), Michael L. Oelze (1, 2, and 5) ((1) Beckman Institute\n  for Advanced Science and Technology, University of Illinois at\n  Urbana-Champaign, Urbana IL (2) Department of Electrical and Computer\n  Engineering, University of Illinois at Urbana-Champaign, Urbana IL (3) Breast\n  Imaging Department at Carle Foundation Hospital, Urbana IL (4) Radiology\n  Department at Mayo Clinic, Rochester MN (5) Carle Illinois College of\n  Medicine, University of Illinois at Urbana-Champaign, Urbana IL)","title":"A Radiological Clip Design Using Ultrasound Identification to Improve\n  Localization","comments":"8 pages, 10 figures, for associated .gif files, see\n  https://drive.google.com/drive/folders/1yhRTtPJQ6mDHKmcxeqGnqy1oCQVsSDwC?usp=drive_link,\n  submitted to IEEE Transactions on Biomedical Engineering (TBME)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Objective: We demonstrate the use of ultrasound to receive an acoustic signal\ntransmitted from a radiological clip designed from a custom circuit. This\nsignal encodes an identification number and is localized and identified\nwirelessly by the ultrasound imaging system. Methods: We designed and\nconstructed the test platform with a Teensy 4.0 microcontroller core to detect\nultrasonic imaging pulses received by a transducer embedded in a phantom, which\nacted as the radiological clip. Ultrasound identification (USID) signals were\ngenerated and transmitted as a result. The phantom and clip were imaged using\nan ultrasonic array (Philips L7-4) connected to a Verasonics Vantage 128 system\noperating in pulse inversion (PI) mode. Cross-correlations were performed to\nlocalize and identify the code sequences in the PI images. Results: USID\nsignals were detected and visualized on B-mode images of the phantoms with up\nto sub-millimeter localization accuracy. The average detection rate across\n1,600 frames of ultrasound data was 94.6%. Tested ID values exhibited\ndifferences in detection rates. Conclusion: The USID clip produced\nidentifiable, distinguishable, and localizable signals when imaged.\nSignificance: Radiological clips are used to mark breast cancer being treated\nby neoadjuvant chemotherapy (NAC) via implant in or near treated lesions. As\nNAC progresses, available marking clips can lose visibility in ultrasound, the\nimaging modality of choice for monitoring NAC-treated lesions. By transmitting\nan active signal, more accurate and reliable ultrasound localization of these\nclips could be achieved and multiple clips with different ID values could be\nimaged in the same field of view.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:53:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cario","Jenna","","1 and 2"],["Kou","Zhengchang","","1, 2, and 5"],["Dickenson","April","","1, 2, and 5"],["Lee","Christine U.","","1, 2, and 5"],["Oelze","Michael L.","","1, 2, and 5"]]}
{"id":"2308.16320","submitter":"Ningning Ding","authors":"Ningning Ding, Zhixuan Fang, Jianwei Huang","title":"Information Disclosure under Competition in Sharing Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sharing systems have facilitated the redistribution of underused resources by\nproviding convenient online marketplaces for individual sellers and buyers.\nHowever, sellers in these systems may not fully disclose the information of\ntheir shared commodities, due to strategic behaviors or privacy concerns.\nSellers' strategic information disclosure significantly affects buyers' user\nexperiences and systems' reputation. This paper presents the first analytical\nstudy on information disclosure and pricing of competing sellers in sharing\nsystems. In particular, we propose a two-stage game framework to capture\nsellers' strategic behaviors and buyers' decisions. Although the optimization\nproblem is challenging due to sellers' non-convex and non-monotonic objectives,\nwe completely characterize the complex market equilibria by decomposing it into\nseveral tractable subproblems. We demonstrate that full disclosure by all\nsellers or non-disclosure by all sellers will both lead to intense price\ncompetition. The former all-disclosure case is never an equilibrium even when\nall sellers have good commodity qualities and low privacy costs, while the\nlatter non-disclosure case can be an equilibrium under which all sellers get\nzero profit. We also reveal several critical factors that affect sellers'\ninformation disclosure. Interestingly, sellers' sharing capacity limitation and\nbuyers' estimation biases encourage information disclosure as they mitigate\nsellers' competition.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 20:53:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ding","Ningning",""],["Fang","Zhixuan",""],["Huang","Jianwei",""]]}
{"id":"2308.16321","submitter":"Asmit Nayak","authors":"Asmit Nayak, Rishabh Khandelwal, Kassem Fawaz","title":"Exposing and Addressing Security Vulnerabilities in Browser Text Input\n  Fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, we perform a comprehensive analysis of the security of text\ninput fields in web browsers. We find that browsers' coarse-grained permission\nmodel violates two security design principles: least privilege and complete\nmediation. We further uncover two vulnerabilities in input fields, including\nthe alarming discovery of passwords in plaintext within the HTML source code of\nthe web page. To demonstrate the real-world impact of these vulnerabilities, we\ndesign a proof-of-concept extension, leveraging techniques from static and\ndynamic code injection attacks to bypass the web store review process. Our\nmeasurements and case studies reveal that these vulnerabilities are prevalent\nacross various websites, with sensitive user information, such as passwords,\nexposed in the HTML source code of even high-traffic sites like Google and\nCloudflare. We find that a significant percentage (12.5\\%) of extensions\npossess the necessary permissions to exploit these vulnerabilities and identify\n190 extensions that directly access password fields. Finally, we propose two\ncountermeasures to address these risks: a bolt-on JavaScript package for\nimmediate adoption by website developers allowing them to protect sensitive\ninput fields, and a browser-level solution that alerts users when an extension\naccesses sensitive input fields. Our research highlights the urgent need for\nimproved security measures to protect sensitive user information online.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:02:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nayak","Asmit",""],["Khandelwal","Rishabh",""],["Fawaz","Kassem",""]]}
{"id":"2308.16322","submitter":"Maarten de Hoop","authors":"Maarten V. de Hoop, Masato Kimura, Ching-Lung Lin, Gen Nakamura","title":"Resolvent Estimates for Viscoelastic Systems of Extended Maxwell Type\n  and their Applications","comments":"21 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the theory of viscoelasticity, an important class of models admits a\nrepresentation in terms of springs and dashpots. Widely used members of this\nclass are the Maxwell model and its extended version. This paper concerns\nresolvent estimates for the system of equations for the anisotropic, extended\nMaxwell model, abbreviated as the EMM, and its marginal realization which\nincludes an inertia term; special attention is paid to the introduction of\naugmented variables. This leads to the augmented system that will also be\nreferred to as the \"original\" system. A reduced system is then formed which\nencodes essentially the EMM; it is a closed system with respect to the particle\nvelocity and the difference between the elastic and viscous strains. Based on\nresolvent estimates, it is shown that the original and reduced systems generate\n$C_0$-groups and the reduced system generates a $C_0$-semigroup of contraction.\nNaturally, the EMM can be written in integrodifferential form leading\nexplicitly to relaxation and a viscoelastic integro-differential system.\nHowever, there is a difference between the original and integrodifferential\nsystems, in general, with consequences for whether their solutions generate\nsemigroups or not. Finally, an energy estimate is obtained for the reduced\nsystem, and it is proven that its solutions decay exponentially as time tends\nto infinity. The limiting amplitude principle follows readily from these two\nresults.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:03:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["de Hoop","Maarten V.",""],["Kimura","Masato",""],["Lin","Ching-Lung",""],["Nakamura","Gen",""]]}
{"id":"2308.16323","submitter":"Erick Rodrigues","authors":"Jo\\~ao Henrique Pereira Machado and Gilson Adamczuk Oliveira and\n  \\'Erick Oliveira Rodrigues","title":"Software multiplataforma para a segmenta\\c{c}\\~ao de vasos sangu\\'ineos\n  em imagens da retina","comments":"in Portuguese language. International Conference on Production\n  Research - Americas 2022.\n  https://www.even3.com.br/anais/foreigners_subscription_icpr_americas22/664603-software-multiplataforma-para-a-segmentacao-de-vasos-sanguineos-em-imagens-da-retina/","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, we utilize image segmentation to visually identify blood\nvessels in retinal examination images. This process is typically carried out\nmanually. However, we can employ heuristic methods and machine learning to\nautomate or at least expedite the process. In this context, we propose a\ncross-platform, open-source, and responsive software that allows users to\nmanually segment a retinal image. The purpose is to use the user-segmented\nimage to retrain machine learning algorithms, thereby enhancing future\nautomated segmentation results. Moreover, the software also incorporates and\napplies certain image filters established in the literature to improve vessel\nvisualization. We propose the first solution of this kind in the literature.\nThis is the inaugural integrated software that embodies the aforementioned\nattributes: open-source, responsive, and cross-platform. It offers a\ncomprehensive solution encompassing manual vessel segmentation, as well as the\nautomated execution of classification algorithms to refine predictive models.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:06:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Machado","Jo\u00e3o Henrique Pereira",""],["Oliveira","Gilson Adamczuk",""],["Rodrigues","\u00c9rick Oliveira",""]]}
{"id":"2308.16324","submitter":"Daniel Klain","authors":"Tanya Khovanova and Daniel A. Klain","title":"What's for dessert?","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Two people meet in a coffeehouse and decide to share one dessert from a menu\nof several possible choices. How should they choose which one? A method is\npresented that is intended to be practical, avoiding the need for long\nnegotiations or complete menu rankings, while offering a high likelihood of\nsatisfaction and fairness to both participants. The method is also extended to\nparties of 3 or more people sharing one item from a menu of several choices.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:10:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Khovanova","Tanya",""],["Klain","Daniel A.",""]]}
{"id":"2308.16325","submitter":"Irem Ustek","authors":"\\.Irem \\\"Ustek, Jay Desai, Iv\\'an L\\'opez Torrecillas, Sofiane Abadou,\n  Jinjie Wang, Quentin Fever, Sandhya Rani Kasthuri, Yang Xing, Weisi Guo,\n  Antonios Tsourdos","title":"Two-Stage Violence Detection Using ViTPose and Classification Models at\n  Smart Airports","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 study introduces an innovative violence detection framework tailored to\nthe unique requirements of smart airports, where prompt responses to violent\nsituations are crucial. The proposed framework harnesses the power of ViTPose\nfor human pose estimation. It employs a CNN - BiLSTM network to analyse spatial\nand temporal information within keypoints sequences, enabling the accurate\nclassification of violent behaviour in real time. Seamlessly integrated within\nthe SAFE (Situational Awareness for Enhanced Security framework of SAAB, the\nsolution underwent integrated testing to ensure robust performance in real\nworld scenarios. The AIRTLab dataset, characterized by its high video quality\nand relevance to surveillance scenarios, is utilized in this study to enhance\nthe model's accuracy and mitigate false positives. As airports face increased\nfoot traffic in the post pandemic era, implementing AI driven violence\ndetection systems, such as the one proposed, is paramount for improving\nsecurity, expediting response times, and promoting data informed decision\nmaking. The implementation of this framework not only diminishes the\nprobability of violent events but also assists surveillance teams in\neffectively addressing potential threats, ultimately fostering a more secure\nand protected aviation sector. Codes are available at:\nhttps://github.com/Asami-1/GDP.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:20:15 GMT"}],"update_date":"2023-09-01","authors_parsed":[["\u00dcstek","\u0130rem",""],["Desai","Jay",""],["Torrecillas","Iv\u00e1n L\u00f3pez",""],["Abadou","Sofiane",""],["Wang","Jinjie",""],["Fever","Quentin",""],["Kasthuri","Sandhya Rani",""],["Xing","Yang",""],["Guo","Weisi",""],["Tsourdos","Antonios",""]]}
{"id":"2308.16326","submitter":"Pawel Tecmer Dr hab","authors":"Pawe{\\l} Tecmer and Marta Ga{\\l}y\\'nska and Lena Szczuczko and\n  Katharina Boguslawski","title":"Geminal-based strategies for modeling large building blocks of organic\n  electronic materials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We elaborate on unconventional electronic structure methods based on geminals\nand their potential to advance the rapidly developing field of organic\nphotovoltaics (OPV). Specifically, we focus on the computational advantages of\ngeminal-based methods over standard approaches and identify the critical\naspects of OPV development. Examples are reliable and efficient computations of\norbital energies, electronic spectra, and van-der-Waals interactions.\nGeminal-based models can also be combined with quantum embedding techniques and\na quantum information analysis of orbital interactions to gain a fundamental\nunderstanding of the electronic structures and properties of realistic OPV\nbuilding blocks. Furthermore, other organic components present in, for\ninstance, dye-sensitized solar cells (DSSC) represent another promising scope\nof application. Finally, we provide numerical examples predicting the\nproperties of a small building block of OPV components and two carbazole-based\ndyes proposed as possible DSSC sensitizers.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:21:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tecmer","Pawe\u0142",""],["Ga\u0142y\u0144ska","Marta",""],["Szczuczko","Lena",""],["Boguslawski","Katharina",""]]}
{"id":"2308.16327","submitter":"Jane Morrisobn","authors":"Jane Morrison, Daniel Dicken, Ioannis Argyriou, Michael E. Ressler,\n  Karl D. Gordon, Michael W. Regan, Misty Cracraft, George H. Rieke, Michael\n  Engesser, Stacey Alberts, Javier Alvarez-Marquez, James W. Colbert, Ori D.\n  Fox, Danny Gasman, David R. Law, Macarena Garcia Marin, Andras Gaspar, Pierre\n  Guillard, Sarah Kendrew, Alvaro Labiano, Seppo Laine, Alberto Noriega-Crespo,\n  Irene Shivaei, Greg Sloan","title":"JWST MIRI flight performance: Detector Effects and Data Reduction\n  Algorithms","comments":null,"journal-ref":"Publications of the Astronomical Society of the Pacific, Volume\n  135, Number 1049, 2023","doi":"10.1088/1538-3873/acdea6","report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The detectors in the Mid-Infrared Instrument (MIRI) of the James Webb Space\nTelescope (JWST) are arsenic-21 doped silicon impurity band conduction (Si:As\nIBC) devices and are direct descendants of the Spitzer IRAC22 long wavelength\narrays (channels 3 and 4). With appropriate data processing, they can provide\nexcellent per-23 formance. In this paper we discuss the various non-ideal\nbehaviors of these detectors that need to be addressed24 to realize their\npotential. We have developed a set of algorithms toward this goal, building on\nexperience with25 previous similar detector arrays. The MIRI-specific stage 1\npipeline algorithms, of a three stage JWST cali-26 bration pipeline, were\ndeveloped using pre-flight tests on the flight detectors and flight spares and\nhave been27 refined using flight data. This paper describes these algorithms,\nwhich are included in the first stage of the28 JWST Calibration Pipeline for\nthe MIRI instrument.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:22:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Morrison","Jane",""],["Dicken","Daniel",""],["Argyriou","Ioannis",""],["Ressler","Michael E.",""],["Gordon","Karl D.",""],["Regan","Michael W.",""],["Cracraft","Misty",""],["Rieke","George H.",""],["Engesser","Michael",""],["Alberts","Stacey",""],["Alvarez-Marquez","Javier",""],["Colbert","James W.",""],["Fox","Ori D.",""],["Gasman","Danny",""],["Law","David R.",""],["Marin","Macarena Garcia",""],["Gaspar","Andras",""],["Guillard","Pierre",""],["Kendrew","Sarah",""],["Labiano","Alvaro",""],["Laine","Seppo",""],["Noriega-Crespo","Alberto",""],["Shivaei","Irene",""],["Sloan","Greg",""]]}
{"id":"2308.16328","submitter":"Li He","authors":"Li He, Siyi Hu, Ailun Pei","title":"Debunking Disinformation: Revolutionizing Truth with NLP in Fake News\n  Detection","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The Internet and social media have altered how individuals access news in the\nage of instantaneous information distribution. While this development has\nincreased access to information, it has also created a significant problem: the\nspread of fake news and information. Fake news is rapidly spreading on digital\nplatforms, which has a negative impact on the media ecosystem, public opinion,\ndecision-making, and social cohesion. Natural Language Processing(NLP), which\noffers a variety of approaches to identify content as authentic, has emerged as\na potent weapon in the growing war against disinformation. This paper takes an\nin-depth look at how NLP technology can be used to detect fake news and reveals\nthe challenges and opportunities it presents.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:25:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["He","Li",""],["Hu","Siyi",""],["Pei","Ailun",""]]}
{"id":"2308.16329","submitter":"Hee Oh","authors":"Michael Chow and Hee Oh","title":"Jordan and Cartan spectra in higher rank with applications to\n  correlations","comments":"47 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DS math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a given $d$-tuple $\\rho=(\\rho_1,\\dots,\\rho_d):\\Gamma \\to G$ of faithful\nZariski dense convex cocompact representations of a finitely generated group\n$\\Gamma$, we study the correlations of length spectra\n$\\{\\ell_{\\rho_i(\\gamma)}\\}_{[\\gamma]\\in[\\Gamma]}$ and correlations of\ndisplacement spectra $\\{\\mathsf{d}(\\rho_i(\\gamma)o,o)\\}_{\\gamma\\in\\Gamma}$. We\nprove that for any interior vector $\\mathsf v=(v_1,\\dots,v_d)$ in the spectrum\ncone, there exists $\\delta_\\rho(\\mathsf v) > 0$ such that for any $\\epsilon_1,\n\\dots, \\epsilon_d>0$, there exist $c_1,c_2> 0$ such\nthat\\begin{align*}&\\#\\{[\\gamma]\\in [\\Gamma]: v_iT \\le \\ell_{\\rho_i(\\gamma)} \\le\nv_i T+\\epsilon_i, \\;1 \\le i \\le d\\} \\sim c_1 \\frac{e^{\\delta_\\rho (\\mathsf\nv)T}}{ T^{{(d+1)}/{2}}};\\\\&\\#\\{\\gamma\\in \\Gamma: v_iT \\le\n\\mathsf{d}(\\rho_i(\\gamma)o,o) \\le v_i T+\\epsilon_i, \\;1 \\le i \\le d\\} \\sim c_2\n\\frac{e^{\\delta_\\rho (\\mathsf v)T}}{ T^{{(d-1)}/{2}}}.\\end{align*} The special\ncase where $\\Gamma$ is a surface group, $G=PSL_2(\\mathbb R)$, and $\\mathsf\nv=(1,1)$ was obtained by Schwarz and Sharp in 1993. We deduce this result as a\nspecial case of our main theorem on the distribution of Jordan projections with\nholonomies and Cartan projections in tubes of an Anosov subgroup $\\Gamma$ of a\nsemisimple real algebraic group $G$. We also show that the growth indicator of\n$\\Gamma$ remains the same when we use Jordan projections instead of Cartan\nprojections and tubes instead of cones. We deduce that for any Zariski dense\ndiscrete subgroup, there are exponentially many Jordan and Cartan projections\nin an arbitrarily small tube around any ray in the interior of the limit cone.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:27:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chow","Michael",""],["Oh","Hee",""]]}
{"id":"2308.16330","submitter":"Pedro Silva Correia","authors":"Pedro Silva Correia, Gabriel Dias Carvalho, Thiago R. de Oliveira,\n  Ra\\'ul O. Vallejos and Fernando de Melo","title":"Canonical typicality under general quantum channels","comments":"6+7, 3 figures. V1. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the control of ever more complex quantum systems becoming a reality, new\nscenarios are emerging where generalizations of the most foundational aspects\nof statistical quantum mechanics are imperative. In such experimental scenarios\nthe often natural correspondence between the particles that compose the system\nand the relevant degrees-of-freedom might not be observed. In the present work\nwe employ quantum channels to define generalized subsystems, which should\ncapture the pertinent degrees-of-freedom, and obtain their associated canonical\nstate. Moreover, we show that generalized subsystems also display the phenomena\nof canonical typicality, i.e., the generalized subsystem description generated\nfrom almost any microscopic pure state of the whole system will behave\nsimilarly as the corresponding canonical state. In particular we demonstrate\nthat the property regulating the emergence of the canonical typicality behavior\nis the entropy of the channel used to define the generalized subsystem.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:29:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Correia","Pedro Silva",""],["Carvalho","Gabriel Dias",""],["de Oliveira","Thiago R.",""],["Vallejos","Ra\u00fal O.",""],["de Melo","Fernando",""]]}
{"id":"2308.16331","submitter":"David Martin de Diego","authors":"Miguel Vaquero, Jorge Cort\\'es and David Mart\\'in de Diego","title":"Symmetry Preservation in Hamiltonian Systems: Simulation and Learning","comments":"32 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cs.LG cs.NA math.MP math.NA math.OC math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work presents a general geometric framework for simulating and learning\nthe dynamics of Hamiltonian systems that are invariant under a Lie group of\ntransformations. This means that a group of symmetries is known to act on the\nsystem respecting its dynamics and, as a consequence, Noether's Theorem,\nconserved quantities are observed. We propose to simulate and learn the\nmappings of interest through the construction of $G$-invariant Lagrangian\nsubmanifolds, which are pivotal objects in symplectic geometry. A notable\nproperty of our constructions is that the simulated/learned dynamics also\npreserves the same conserved quantities as the original system, resulting in a\nmore faithful surrogate of the original dynamics than non-symmetry aware\nmethods, and in a more accurate predictor of non-observed trajectories.\nFurthermore, our setting is able to simulate/learn not only Hamiltonian flows,\nbut any Lie group-equivariant symplectic transformation. Our designs leverage\npivotal techniques and concepts in symplectic geometry and geometric mechanics:\nreduction theory, Noether's Theorem, Lagrangian submanifolds, momentum\nmappings, and coisotropic reduction among others. We also present methods to\nlearn Poisson transformations while preserving the underlying geometry and how\nto endow non-geometric integrators with geometric properties. Thus, this work\npresents a novel attempt to harness the power of symplectic and Poisson\ngeometry towards simulating and learning problems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:34:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vaquero","Miguel",""],["Cort\u00e9s","Jorge",""],["de Diego","David Mart\u00edn",""]]}
{"id":"2308.16332","submitter":"Andrew Giuliani","authors":"Marsha Berger, Andrew Giuliani","title":"A new provably stable weighted state redistribution algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a practical finite volume method on cut cells using state\nredistribution. Our algorithm is provably monotone, total variation\ndiminishing, and GKS stable in many situations, and shuts off smoothly as the\ncut cell size approaches a target value. Our analysis reveals why original\nstate redistribution works so well: it results in a monotone scheme for most\nconfigurations, though at times subject to a slightly smaller CFL condition.\nOur analysis also explains why a pre-merging step is beneficial. We show\ncomputational experiments in two and three dimensions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:38:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Berger","Marsha",""],["Giuliani","Andrew",""]]}
{"id":"2308.16333","submitter":"Jiuzhou Wang","authors":"Jiuzhou Wang and Eric F. Lock","title":"Multiple Augmented Reduced Rank Regression for Pan-Cancer Analysis","comments":"38 pages, 7 figures, 10 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME q-bio.QM stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Statistical approaches that successfully combine multiple datasets are more\npowerful, efficient, and scientifically informative than separate analyses. To\naddress variation architectures correctly and comprehensively for\nhigh-dimensional data across multiple sample sets (i.e., cohorts), we propose\nmultiple augmented reduced rank regression (maRRR), a flexible matrix\nregression and factorization method to concurrently learn both covariate-driven\nand auxiliary structured variation. We consider a structured nuclear norm\nobjective that is motivated by random matrix theory, in which the regression or\nfactorization terms may be shared or specific to any number of cohorts. Our\nframework subsumes several existing methods, such as reduced rank regression\nand unsupervised multi-matrix factorization approaches, and includes a\npromising novel approach to regression and factorization of a single dataset\n(aRRR) as a special case. Simulations demonstrate substantial gains in power\nfrom combining multiple datasets, and from parsimoniously accounting for all\nstructured variation. We apply maRRR to gene expression data from multiple\ncancer types (i.e., pan-cancer) from TCGA, with somatic mutations as\ncovariates. The method performs well with respect to prediction and imputation\nof held-out data, and provides new insights into mutation-driven and auxiliary\nvariation that is shared or specific to certain cancer types.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:40:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Jiuzhou",""],["Lock","Eric F.",""]]}
{"id":"2308.16334","submitter":"Shensheng Chen","authors":"Shensheng Chen and Zhen-Gang Wang","title":"Charge Asymmetry Suppresses Coarsening Dynamics in Polyelectrolyte\n  Complex Coacervation","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":"  Mixing solutions of oppositely charged macromolecules can result in\nliquid-liquid phase separation into a polymer-rich coacervate phase and a\npolymer-poor supernatant phase. Here we show that charge asymmetry in the\nconstituent polymers can slow down the coarsening dynamics, with an apparent\ngrowth exponent that deviates from the well-known 1/3 for neutral systems and\ndecreases with increasing degrees of charge asymmetry. Decreasing solvent\nquality accelerates the coarsening dynamics for asymmetric mixtures, but slows\ndown the coarsening dynamics for symmetric mixtures. We rationalize these\nresults by examining the interaction potential between merging droplets.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:55:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Shensheng",""],["Wang","Zhen-Gang",""]]}
{"id":"2308.16335","submitter":"Mark Hagen","authors":"Mark Hagen, Giorgio Mangioni, Alessandro Sisto","title":"A Combinatorial Structure for Many Hierarchically Hyperbolic Spaces","comments":"64 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.GT math.MG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The combinatorial hierarchical hyperbolicity criterion is a very useful way\nof constructing new hierarchically hyperbolic spaces (HHSs). We show that,\nconversely, HHSs satisfying natural assumptions (satisfied, for example, by\nmapping class groups) admit a combinatorial HHS structure. This can be useful\nin constructions of new HHSs, and also our construction clarifies how to apply\nthe combinatorial HHS criterion to suspected examples. We also uncover\nconnections between HHS notions and lattice theory notions.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:55:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hagen","Mark",""],["Mangioni","Giorgio",""],["Sisto","Alessandro",""]]}
{"id":"2308.16336","submitter":"\\\"Omer Veysel \\c{C}a\\u{g}atan","authors":"Omer Veysel Cagatan","title":"ToddlerBERTa: Exploiting BabyBERTa for Grammar Learning and Language\n  Understanding","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":"  We present ToddlerBERTa, a BabyBERTa-like language model, exploring its\ncapabilities through five different models with varied hyperparameters.\nEvaluating on BLiMP, SuperGLUE, MSGS, and a Supplement benchmark from the\nBabyLM challenge, we find that smaller models can excel in specific tasks,\nwhile larger models perform well with substantial data. Despite training on a\nsmaller dataset, ToddlerBERTa demonstrates commendable performance, rivalling\nthe state-of-the-art RoBERTa-base. The model showcases robust language\nunderstanding, even with single-sentence pretraining, and competes with\nbaselines that leverage broader contextual information. Our work provides\ninsights into hyperparameter choices, and data utilization, contributing to the\nadvancement of language models.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:56:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cagatan","Omer Veysel",""]]}
{"id":"2308.16337","submitter":"Daniel Alpay A","authors":"Daniel Alpay and Paula Cerejeiras and Uwe Kaehler and Baruch Schneider","title":"Generalized $q$-Fock spaces and a new type of Stirling numbers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Using $q$-calculus we study a family of reproducing kernel Hilbert spaces\nwhich interpolate between the Hardy space and the Fock space. We give\ncharacterizations of these spaces in terms of classical operators such as\nintegration and backward-shift, and their q-calculus counterparts. We introduce\nan apparently new family of numbers, close to, but different from, the\nq-Stirling numbers of the second kind\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 21:59:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Alpay","Daniel",""],["Cerejeiras","Paula",""],["Kaehler","Uwe",""],["Schneider","Baruch",""]]}
{"id":"2308.16338","submitter":"Yanbo Guo","authors":"Yanbo Guo, Xinzhe Hu, Hasan Siddiquee, Swapnil M. Yadav, Eun Sang\n  Choi, Melanie J. Beazley, Yasuyuki Nakajima, and Yasumasa Takano","title":"Formation of random singlets in the nanocrystalline\n  quasi-one-dimensional spin-1-2 antiferromagnet Sr21Bi8Cu2(CO3)2O41","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Induced by quenched disorder, random-singlet states occur in a variety of\nlow-dimensional spin-1/2 antiferromagnets, some of them candidates for quantum\nspin liquids. Here we report measurements of the specific heat, magnetization,\nand magnetic susceptibility of nanocrystalline Sr21Bi8Cu2(CO3)2O41, a\nquasi-one-dimensional spin-1/2 antiferromagnet with alternating bonds. The\nresults uncover the predominant presence of random-singlet spin pairs in this\nmaterial, with a logarithmic probability distribution, P(J), of the\nrenormalized, emergent exchange interaction, J, in zero magnetic field and P(J)\nproportional to 1/J in magnetic fields. We postulate that these unexpected J\ndependences, in contrast to the usual P(J) \\propto 1/J^{\\gamma} with 0 <\n{\\gamma} < 1, and possibly also the dichotomy, arise from the finite size of\nthe nanocrystals. Scaling functions for the specific heat and magnetization\nreproduce our magnetocaloric-effect data, with no adjustable parameters.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:17:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Guo","Yanbo",""],["Hu","Xinzhe",""],["Siddiquee","Hasan",""],["Yadav","Swapnil M.",""],["Choi","Eun Sang",""],["Beazley","Melanie J.",""],["Nakajima","Yasuyuki",""],["Takano","Yasumasa",""]]}
{"id":"2308.16339","submitter":"William Howard","authors":"R. Michael Buehrer, William W. Howard, Steven Ellingson","title":"Open and Closed-Loop Weight Selection for Pattern Control of\n  Paraboloidal Reflector Antennas with Reconfigurable Rim Scattering","comments":"14 pages, 19 figures. arXiv admin note: substantial text overlap with\n  arXiv:2202.13219","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It has been demonstrated that modifying the rim scattering of a paraboloidal\nreflector antenna through the use of reconfigurable elements along the rim\nfacilitates sidelobe modification including cancelling sidelobes. In this work\nwe investigate techniques for determining unit-modulus weights (i.e., weights\nwhich modify the phase of the scattered electric field) to accomplish sidelobe\ncancellation at arbitrary angles from the reflector axis. Specifically, it is\nshown that despite the large search space and the non-convexity of the cost\nfunction, weights can be found with reasonable complexity which provide\nsignificant cancellation capability. It is demonstrated that this can be done\nusing open-loop (i.e., with pattern knowledge), closed-loop (without pattern\nknowledge), or hybrid (with inexact pattern knowledge) techniques. Initially,\nwe examine the use of unconstrained weights. A primary finding is that\nsufficiently deep nulls are possible with essentially no change in the main\nlobe with practical (binary or quaternary) phase-only weights. The initial\nalgorithms require a knowledge of the antenna pattern (what we term an\n``open-loop'' approach). However, since perfect knowledge of the pattern is not\ntypically available, we also develop closed-loop approaches which require no\nknowledge of the antenna pattern. It is found that these closed-loop approaches\nprovide similar performance. We demonstrate the time-varying performance of\nclosed-loop approaches by simulating an interfering source which moves across\nthe field of view of the antenna. Finally, we leverage the advantages of both\nopen-loop and closed-loop approaches in a hybrid technique that exploits\ninexact knowledge of the pattern by seeding a closed-loop optimization with an\nopen-loop solution as its starting point.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:19:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Buehrer","R. Michael",""],["Howard","William W.",""],["Ellingson","Steven",""]]}
{"id":"2308.16340","submitter":"Alexey Glazyrin","authors":"Arseniy Akopyan and Alexey Glazyrin","title":"On the total perimeter of disjoint convex bodies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this note we introduce a pseudometric on convex planar curves based on\ndistances between normal lines and show its basic properties. Then we use this\npseudometric to give a short proof of the theorem by Pinchasi that the sum of\nperimeters of $k$ convex planar bodies with disjoint interiors contained in a\nconvex body of perimeter $p$ and diameter $d$ is not greater than $p+2(k-1)d$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:20:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Akopyan","Arseniy",""],["Glazyrin","Alexey",""]]}
{"id":"2308.16341","submitter":"Constanza Quijada","authors":"Constanza Quijada, Andr\\'es Anabal\\'on, Robert B. Mann and Julio Oliva","title":"Triple Points of Gravitational AdS Solitons and Black Holes","comments":"5 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a triple point of a new kind for General Relativity, at which two\ngravitational solitons can coexist with a planar black hole in anti de Sitter\nspace. Working in the context of non-linear electrodynamics, we obtain simple,\nsensible spacetimes for which the thermodynamics can be studied in an analytic\nmanner. The spacetimes are charged under the non-linear electrodynamics leading\nto an electric charge for black holes and a magnetic flux for solitons. In the\ngrand-canonical ensemble, we show that the phase space of the theory is very\nrich, containing re-entrant phase transitions, as well as triple points, for\nsmall values of the coupling controlling the non-linearity of the\nelectrodynamics Lagrangian.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:21:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Quijada","Constanza",""],["Anabal\u00f3n","Andr\u00e9s",""],["Mann","Robert B.",""],["Oliva","Julio",""]]}
{"id":"2308.16342","submitter":"Susmita Adhikari","authors":"Neev Shah and Susmita Adhikari","title":"The abundance of core--collapsed subhalos in SIDM: insights from\n  structure formation in $\\Lambda$CDM","comments":"12 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dark matter halos can enter a phase of gravothermal core--collapse in the\npresence of self-interactions. This phase that follows a core--expansion phase\nis thought to be subdominant due to the long time-scales involved. However, it\nhas been shown that the collapse can be accelerated in tidal environments\nparticularly for halos that are centrally concentrated. Cosmological\nsimulations in $\\Lambda$CDM give us the full distribution of satellite orbits\nand halo profiles in the universe. We use properties of the orbits and profiles\nof subhalos from simulations to estimate the fraction of the subhalos in\ndifferent host halo environments, ranging from the Large Magellanic\ncloud(LMC)--like hosts to clusters, that are in the core--collapse phase. We\nuse fluid simulations of self--interacting dark matter (SIDM) to evolve\nsubhalos in their hosts including the effect of tidal truncation at the time of\ntheir pericenter crossing. We find that for parameters that allow the\ninteraction cross-section to be high at dwarf scales, at least $10~\\%$ of all\nsubhalos are expected to have intrinsically collapsed within Hubble time up to\nthe group mass host scales. This fraction increases significantly, becoming at\nleast 20$\\%$ when tidal interactions are considered. To identify these objects\nwe find that we either need to measure their densities at very small radial\nscales, where the subhalos show a bimodal distribution of densities, or\nalternatively we need to measure the slopes of their inner density profiles\nnear the scale radius, which are much steeper than NFW slopes expected in cold\ndark matter halos. Current measurements of central slopes of classical dwarfs\ndo not show a preference for collapsed objects, however this is consistent with\nan SIDM scenario where the classical dwarfs are expected to be in a cored\nphase.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:27:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shah","Neev",""],["Adhikari","Susmita",""]]}
{"id":"2308.16343","submitter":"Hyungju Park","authors":"Hyungju Park","title":"Almost generalized uniform matroids and excluded minors","comments":"Any comment or feedback is appreciated","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish that matroids characterized by the Tutte polynomial\n$\\sum_{i,j\\ge 0}t_{i,j}x^iy^j$ with coefficients $t_{i,j}$ vanishing for\n$(i,j)\\ge (k,l)$ precisely coincide with $(k,l)$-uniform matroids. This\ncharacterization implies that almost $(k,l)$-uniform matroids are exactly\nmatroids with $t_{k,l}\\le 1$ and $t_{i,j}=0$ if $(i,j)>(k,l)$. We also\ncharacterize excluded minors of almost $(k,l)$-uniform matroids in terms of\nTutte polynomial coefficients. Finally, we construct an infinite family of\nexcluded minors of almost $(k,l)$-uniform matroids which extend previously\nknown cases of almost uniform and almost paving matroids.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:29:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Park","Hyungju",""]]}
{"id":"2308.16344","submitter":"Franziska Weickert","authors":"Korbinian Pfn\\\"ur, Joachim L\\\"udke, Rainer Ketzler, Morris Lindner,\n  Timmy Reimann, Benjamin Wenzel, Rocco Holzhey, Lev Dorosinsky, Franziska\n  Weickert","title":"Experimental setup for synchronized surface and magnetic loss studies of\n  grain oriented FeSi steel sheets","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 technical details on an experimental setup that allows to measure\nmagnetic losses in electrical steel sheets and the movement of magnetic domains\non the sample surface simultaneously. The setup is suitable to investigate\ngrain oriented electrical sheets in the polarization range 0.05 T to 2.3 T and\nat excitation frequencies between 50 Hz and 4 kHz. The screened surface area is\n13 mm x 18 mm.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:29:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pfn\u00fcr","Korbinian",""],["L\u00fcdke","Joachim",""],["Ketzler","Rainer",""],["Lindner","Morris",""],["Reimann","Timmy",""],["Wenzel","Benjamin",""],["Holzhey","Rocco",""],["Dorosinsky","Lev",""],["Weickert","Franziska",""]]}
{"id":"2308.16345","submitter":"Taweesak Jitsuk","authors":"T. Jitsuk, A. Di Siena, M.J. Pueschel, P.W. Terry, F. Widmer, E. Poli,\n  and J.S. Sarff","title":"Global Linear and Nonlinear Gyrokinetic Simulations of Tearing Modes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  To better understand the interaction of global tearing modes and\nmicroturbulence in the Madison Symmetric Torus (MST) reversed-field pinch\n(RFP), the global gyrokinetic code GENE is modified to describe tearing mode\ninstability via a shifted Maxwellian distribution consistent with experimental\nequilibria. The implementation of the shifted Maxwellian is tested and\nbenchmarked by comparisons with different codes and models. Good agreement is\nobtained in code-code and code-theory comparisons. Linear stability of tearing\nmodes of a non-reversed MST discharge is studied. A collisionality scan is\nperformed to the lowest order unstable modes ($n=5$, $n=6$) and shown to behave\nalong with theoretical scaling. The nonlinear evolution is simulated, and\nsaturation is found to arise from mode coupling and transfer of energy from the\nmost unstable tearing mode to small-scale stable modes mediated by the $m=2$\ntearing mode. The work described herein lays the foundation for nonlinear\nsimulation and analysis of the interaction of tearing modes and\ngyroradius-scale instabilities in the RFP.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:30:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jitsuk","T.",""],["Di Siena","A.",""],["Pueschel","M. J.",""],["Terry","P. W.",""],["Widmer","F.",""],["Poli","E.",""],["Sarff","J. S.",""]]}
{"id":"2308.16346","submitter":"Sonja Hohloch","authors":"Yannick Gullentops, Sonja Hohloch","title":"Recent examples of hypersemitoric systems and first steps towards a\n  classification: a brief survey","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.SG nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hypersemitoric systems are 2-degree-of-freedom integrable systems on\n4-dimensional manifolds that have an underlying $S^1$-symmetry and no\ndegenerate singularities apart from maybe a finite number of so-called\nparabolic ones. We give a short overview of recent examples displaying various\nbifurcations and sketch a topological-combinatorial classification of the\nconnected components of fibers of hypersemitoric systems.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:39:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gullentops","Yannick",""],["Hohloch","Sonja",""]]}
{"id":"2308.16347","submitter":"Guozhen Lu","authors":"Lu Chen, Guozhen Lu and Maochun Zhu","title":"A sharp trace Adams' inequality in $\\mathbb{R}^{4}$ and Existence of the\n  extremals","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\Omega\\subseteq \\mathbb{R}^{4}$ be a bounded domain with smooth boundary\n$\\partial\\Omega$. In this paper, we establish the following sharp form of the\ntrace Adams' inequality in $W^{2,2}(\\Omega)$ with\n  zero mean value and zero Neumann boundary condition: \\begin{equation*}\nS({\\alpha})=\\underset{\\int_{\\Omega}udx=0,\\frac{\\partial\nu}{\\partial\\nu}|_{\\partial\\Omega}=0,\\Vert\\Delta u\\Vert_{2}\\leq{1}}{\\underset\n{u\\in{W^{2,2}(\\Omega)\\setminus\\{0\\}}}{\\sup}}\\int_{\\partial \\Omega} e^{\\alpha\nu^{2}}d\\sigma<\\infty \\end{equation*} holds if and only if $ \\alpha\\leq12\\pi^2$.\n  Moreover, we prove a classification theorem for the solutions of a class of\nnonlinear boundary value problem of bi-harmonic equations on the half space\n$\\mathbb{R}^4_{+}$. With this classification result, we can show that\n$S({12\\pi^2})$ is attained by using the blow-up analysis and capacitary\nestimate. As an application, we prove a sharp trace Adams-Onofri type\ninequality in general four dimensional bounded domains with smooth boundary.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:40:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Lu",""],["Lu","Guozhen",""],["Zhu","Maochun",""]]}
{"id":"2308.16348","submitter":"Trifce Sandev","authors":"Z. Tomovski, K. Gorska, T. Pietrzak, R. Metzler, T. Sandev","title":"Anomalous and ultraslow diffusion of a particle driven by\n  power-law-correlated and distributed-order noises","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the generalized Langevin equation approach to anomalous diffusion\nfor a harmonic oscillator and a free particle driven by different forms of\ninternal noises, such as power-law-correlated and distributed-order noises that\nfulfil generalized versions of the fluctuation-dissipation theorem. The mean\nsquared displacement and the normalized displacement correlation function are\nderived for the different forms of the friction memory kernel. The\ncorresponding overdamped generalized Langevin equations for these cases are\nalso investigated. It is shown that such models can be used to describe\nanomalous diffusion in complex media, giving rise to subdiffusion,\nsuperdiffusion, ultraslow diffusion, strong anomaly, and other complex\ndiffusive behaviors.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:44:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tomovski","Z.",""],["Gorska","K.",""],["Pietrzak","T.",""],["Metzler","R.",""],["Sandev","T.",""]]}
{"id":"2308.16349","submitter":"Kilichbek Haydarov","authors":"Kilichbek Haydarov, Xiaoqian Shen, Avinash Madasu, Mahmoud Salem, Jia\n  Li, Gamaleldin Elsayed, Mohamed Elhoseiny","title":"Affective Visual Dialog: A Large-Scale Benchmark for Emotional Reasoning\n  Based on Visually Grounded Conversations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce Affective Visual Dialog, an emotion explanation and reasoning\ntask as a testbed for research on understanding the formation of emotions in\nvisually grounded conversations. The task involves three skills: (1)\nDialog-based Question Answering (2) Dialog-based Emotion Prediction and (3)\nAffective emotion explanation generation based on the dialog. Our key\ncontribution is the collection of a large-scale dataset, dubbed AffectVisDial,\nconsisting of 50K 10-turn visually grounded dialogs as well as concluding\nemotion attributions and dialog-informed textual emotion explanations,\nresulting in a total of 27,180 working hours. We explain our design decisions\nin collecting the dataset and introduce the questioner and answerer tasks that\nare associated with the participants in the conversation. We train and\ndemonstrate solid Affective Visual Dialog baselines adapted from\nstate-of-the-art models. Remarkably, the responses generated by our models show\npromising emotional reasoning abilities in response to visually grounded\nconversations. Our project page is available at\nhttps://affective-visual-dialog.github.io.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:50:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Haydarov","Kilichbek",""],["Shen","Xiaoqian",""],["Madasu","Avinash",""],["Salem","Mahmoud",""],["Li","Jia",""],["Elsayed","Gamaleldin",""],["Elhoseiny","Mohamed",""]]}
{"id":"2308.16350","submitter":"Rob van Glabbeek","authors":"Rob van Glabbeek and Peter H\\\"ofner and Weiyou Wang","title":"A Lean-Congruence Format for EP-Bisimilarity","comments":"An extended abstract (all but the appendices) will appear in Proc.\n  EXPRESS/SOS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Enabling preserving bisimilarity is a refinement of strong bisimilarity,\nwhich preserves safety as well as liveness properties. To define it properly,\nlabelled transition systems needed to be upgraded with a successor relation,\ncapturing concurrency between transitions enabled in the same state. We enrich\nthe well-known De Simone format to handle inductive definitions of this\nsuccessor relation. We then establish that ep-bisimilarity is a congruence for\nthe operators, as well as lean congruence for recursion, for all (enriched) De\nSimone languages.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:56:54 GMT"}],"update_date":"2023-09-01","authors_parsed":[["van Glabbeek","Rob",""],["H\u00f6fner","Peter",""],["Wang","Weiyou",""]]}
{"id":"2308.16351","submitter":"Diana Seitova","authors":"V.M. Aynutdinov, V.A. Allakhverdyan, A.D. Avrorin, A.V. Avrorin, Z.\n  Barda\\v{c}ov\\'a, I.A. Belolaptikov, E.A. Bondarev, I.V. Borina, N.M. Budnev,\n  V.A. Chadymov, A.S. Chepurnov, V.Y. Dik, G.V. Domogatsky, A.A. Doroshenko, R.\n  Dvornick\\'y, A.N. Dyachok, Zh.-A.M. Dzhilkibaev, E. Eckerov\\'a, T.V. Elzhov,\n  L. Fajt, V.N. Fomin, A.R. Gafarov, K.V. Golubkov, N.S. Gorshkov, T. I. Gress,\n  K.G. Kebkal, I.V. Kharuk, E.V. Khramov, M.M. Kolbin, S.O. Koligaev, K.V.\n  Konischev, A.V. Korobchenko, A.P. Koshechkin, V.A. Kozhin, M.V. Kruglov, V.F.\n  Kulepov, Y.E. Lemeshev, M.B. Milenin, R.R. Mirgazov, D.V. Naumov, A.S.\n  Nikolaev, D.P. Petukhov, E.N. Pliskovsky, M.I. Rozanov, E.V. Ryabov, G.B.\n  Safronov, D. Seitova, B.A. Shaybonov, M.D. Shelepov, S.D. Shilkin, E.V.\n  Shirokov, F. \\v{S}imkovic, A.E. Sirenko, A.V. Skurikhin, A.G. Solovjev, M.N.\n  Sorokovikov, I. \\v{S}tekl, A.P. Stromakov, O.V. Suvorova, V.A. Tabolenko,\n  B.B. Ulzutuev, Y.V. Yablokova, D.N. Zaborov, S.I. Zavyalov, D.Y. Zvezdov","title":"Time Calibration of the Baikal-GVD Neutrino Telescope with Atmospheric\n  Muons","comments":"38th International Cosmic Ray Conference (ICRC2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM physics.ins-det","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We present a new procedure for time calibration of the Baikal-GVD neutrino\ntelescope. The track reconstruction quality depends on accurate measurements of\narrival times of Cherenkov photons. Therefore, it is crucial to achieve a high\nprecision in time calibration. For that purpose, in addition to other\ncalibration methods, we employ a new procedure using atmospheric muons\nreconstructed in a single-cluster mode. The method is based on iterative\ndetermination of effective time offsets for each optical module. This paper\nfocuses on the results of the iterative reconstruction procedure with time\noffsets from the previous iteration and the verification of the method\ndeveloped. The theoretical muon calibration precision is estimated to be around\n1.5-1.6ns.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:57:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Aynutdinov","V. M.",""],["Allakhverdyan","V. A.",""],["Avrorin","A. D.",""],["Avrorin","A. V.",""],["Barda\u010dov\u00e1","Z.",""],["Belolaptikov","I. A.",""],["Bondarev","E. A.",""],["Borina","I. V.",""],["Budnev","N. M.",""],["Chadymov","V. A.",""],["Chepurnov","A. S.",""],["Dik","V. Y.",""],["Domogatsky","G. V.",""],["Doroshenko","A. A.",""],["Dvornick\u00fd","R.",""],["Dyachok","A. N.",""],["Dzhilkibaev","Zh. -A. M.",""],["Eckerov\u00e1","E.",""],["Elzhov","T. V.",""],["Fajt","L.",""],["Fomin","V. N.",""],["Gafarov","A. R.",""],["Golubkov","K. V.",""],["Gorshkov","N. S.",""],["Gress","T. I.",""],["Kebkal","K. G.",""],["Kharuk","I. V.",""],["Khramov","E. V.",""],["Kolbin","M. M.",""],["Koligaev","S. O.",""],["Konischev","K. V.",""],["Korobchenko","A. V.",""],["Koshechkin","A. P.",""],["Kozhin","V. A.",""],["Kruglov","M. V.",""],["Kulepov","V. F.",""],["Lemeshev","Y. E.",""],["Milenin","M. B.",""],["Mirgazov","R. R.",""],["Naumov","D. V.",""],["Nikolaev","A. S.",""],["Petukhov","D. P.",""],["Pliskovsky","E. N.",""],["Rozanov","M. I.",""],["Ryabov","E. V.",""],["Safronov","G. B.",""],["Seitova","D.",""],["Shaybonov","B. A.",""],["Shelepov","M. D.",""],["Shilkin","S. D.",""],["Shirokov","E. V.",""],["\u0160imkovic","F.",""],["Sirenko","A. E.",""],["Skurikhin","A. V.",""],["Solovjev","A. G.",""],["Sorokovikov","M. N.",""],["\u0160tekl","I.",""],["Stromakov","A. P.",""],["Suvorova","O. V.",""],["Tabolenko","V. A.",""],["Ulzutuev","B. B.",""],["Yablokova","Y. V.",""],["Zaborov","D. N.",""],["Zavyalov","S. I.",""],["Zvezdov","D. Y.",""]]}
{"id":"2308.16352","submitter":"Boqun Zhao","authors":"Boqun Zhao, Chongjun Ouyang, Xingqi Zhang and Yuanwei Liu","title":"Downlink and Uplink NOMA-ISAC with Signal Alignment","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":"  Integrated Sensing and Communications (ISAC) surpasses the conventional\nfrequency-division sensing and communications (FDSAC) in terms of spectrum,\nenergy, and hardware efficiency, with potential for greater enhancement through\nintegration of NOMA and signal alignment techniques. Leveraging these\nadvantages, this paper proposes a multiple-input multiple-output-NOMA-ISAC\nframework with signal alignment and thoroughly analyzes its performance for\nboth downlink and uplink. 1) The downlink ISAC is investigated under three\ndifferent precoding designs: sensing-centric (S-C) design,\ncommunications-centric (C-C) design, and Pareto optimal design. 2) For the\nuplink case, two scenarios are investigated: S-C design and C-C design, based\non the interference cancellation order of the communication signal and the\nsensing signal. In each of these scenarios, key performance metrics including\nsensing rate (SR), communication rate (CR), and outage probability are\ninvestigated. For a deeper understanding, the asymptotic performance of the\nsystem in the high signal-to-noise ratio (SNR) region is also explored, with a\nfocus on the high-SNR slope and diversity order. Finally, the SR-CR rate\nregions achieved by ISAC and FDSAC are studied. Numerical results reveal that\nin both downlink and uplink cases, ISAC outperforms FDSAC in terms of sensing\nand communications performance and is capable of achieving a broader rate\nregion, clearly showcasing its superiority over the conventional FDSAC.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 22:59:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhao","Boqun",""],["Ouyang","Chongjun",""],["Zhang","Xingqi",""],["Liu","Yuanwei",""]]}
{"id":"2308.16353","submitter":"Andrew McNutt","authors":"Nicolas Kruchten, Andrew M. McNutt, Michael J. McGuffin","title":"Metrics-Based Evaluation and Comparison of Visualization Notations","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":"  A visualization notation is a recurring pattern of symbols used to author\nspecifications of visualizations, from data transformation to visual mapping.\nProgrammatic notations use symbols defined by grammars or domain-specific\nlanguages (e.g., ggplot2, dplyr, Vega-Lite) or libraries (e.g., Matplotlib,\nPandas). Designers and prospective users of grammars and libraries often\nevaluate visualization notations by inspecting galleries of examples. While\nsuch collections demonstrate usage and expressiveness, their construction and\nevaluation are usually ad hoc, making comparisons of different notations\ndifficult. More rarely, experts analyze notations via usability heuristics,\nsuch as the Cognitive Dimensions of Notations framework. These analyses, akin\nto structured close readings of text, can reveal design deficiencies, but place\na burden on the expert to simultaneously consider many facets of often complex\nsystems. To alleviate these issues, we introduce a metrics-based approach to\nusability evaluation and comparison of notations in which metrics are computed\nfor a gallery of examples across a suite of notations. While applicable to any\nvisualization domain, we explore the utility of our approach via a case study\nconsidering statistical graphics that explores 40 visualizations across 9\nwidely used notations. We facilitate the computation of appropriate metrics and\nanalysis via a new tool called NotaScope. We gathered feedback via interviews\nwith authors or maintainers of prominent charting libraries (n=6). We find that\nthis approach is a promising way to formalize, externalize, and extend\nevaluations and comparisons of visualization notations.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:00:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kruchten","Nicolas",""],["McNutt","Andrew M.",""],["McGuffin","Michael J.",""]]}
{"id":"2308.16354","submitter":"Wenyi Wu","authors":"Wenyi Wu, Karim Bouyarmane, Ismail Tutar","title":"Catalog Phrase Grounding (CPG): Grounding of Product Textual Attributes\n  in Product Images for e-commerce Vision-Language Applications","comments":"KDD 2022 Workshop on First Content Understanding and Generation for\n  e-Commerce","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present Catalog Phrase Grounding (CPG), a model that can associate product\ntextual data (title, brands) into corresponding regions of product images\n(isolated product region, brand logo region) for e-commerce vision-language\napplications. We use a state-of-the-art modulated multimodal transformer\nencoder-decoder architecture unifying object detection and phrase-grounding. We\ntrain the model in self-supervised fashion with 2.3 million image-text pairs\nsynthesized from an e-commerce site. The self-supervision data is annotated\nwith high-confidence pseudo-labels generated with a combination of teacher\nmodels: a pre-trained general domain phrase grounding model (e.g. MDETR) and a\nspecialized logo detection model. This allows CPG, as a student model, to\nbenefit from transfer knowledge from these base models combining general-domain\nknowledge and specialized knowledge. Beyond immediate catalog phrase grounding\ntasks, we can benefit from CPG representations by incorporating them as ML\nfeatures into downstream catalog applications that require deep semantic\nunderstanding of products. Our experiments on product-brand matching, a\nchallenging e-commerce application, show that incorporating CPG representations\ninto the existing production ensemble system leads to on average 5% recall\nimprovement across all countries globally (with the largest lift of 11% in a\nsingle country) at fixed 95% precision, outperforming other alternatives\nincluding a logo detection teacher model and ResNet50.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:02:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wu","Wenyi",""],["Bouyarmane","Karim",""],["Tutar","Ismail",""]]}
{"id":"2308.16355","submitter":"Yunguan Fu","authors":"Yunguan Fu, Yiwen Li, Shaheer U Saeed, Matthew J Clarkson, Yipeng Hu","title":"A Recycling Training Strategy for Medical Image Segmentation with\n  Diffusion Denoising Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Denoising diffusion models have found applications in image segmentation by\ngenerating segmented masks conditioned on images. Existing studies\npredominantly focus on adjusting model architecture or improving inference such\nas test-time sampling strategies. In this work, we focus on training strategy\nimprovements and propose a novel recycling method. During each training step, a\nsegmentation mask is first predicted given an image and a random noise. This\npredicted mask, replacing the conventional ground truth mask, is used for\ndenoising task during training. This approach can be interpreted as aligning\nthe training strategy with inference by eliminating the dependence on ground\ntruth masks for generating noisy samples. Our proposed method significantly\noutperforms standard diffusion training, self-conditioning, and existing\nrecycling strategies across multiple medical imaging data sets: muscle\nultrasound, abdominal CT, prostate MR, and brain MR. This holds true for two\nwidely adopted sampling strategies: denoising diffusion probabilistic model and\ndenoising diffusion implicit model. Importantly, existing diffusion models\noften display a declining or unstable performance during inference, whereas our\nnovel recycling consistently enhances or maintains performance. Furthermore, we\nshow for the first time that, under a fair comparison with the same network\narchitectures and computing budget, the proposed recycling-based diffusion\nmodels achieved on-par performance with non-diffusion-based supervised\ntraining. This paper summarises these quantitative results and discusses their\nvalues, with a fully reproducible JAX-based implementation, released at\nhttps://github.com/mathpluscode/ImgX-DiffSeg.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:03:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fu","Yunguan",""],["Li","Yiwen",""],["Saeed","Shaheer U",""],["Clarkson","Matthew J",""],["Hu","Yipeng",""]]}
{"id":"2308.16356","submitter":"Nobuyoshi Ohta","authors":"Chiang-Mei Chen, Yi Chen, Akihiro Ishibashi and Nobuyoshi Ohta","title":"Quantum Improved Regular Kerr Black Holes","comments":"15 pages","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 quantum improvement of Kerr black holes with mass-dependent\nscale identifications in asymptotically safe gravity. We find that a physically\nsensible identification can only be a function of $Mr$ and the area\n$A=4\\pi(r^2+a^2)$ where $M$ is the mass of the black hole and $a$ is an angular\nmomentum parameter. We then discuss various properties of the rotating quantum\nblack holes for a simple choice of the identification. We show that the\nresulting regular rotating black holes have the following nice properties: (i)\nadmitting a consistent black hole thermodynamics at the horizon, (ii) resolving\nthe ring singularity, (iii) partially eliminating closed time-like curves\npresent in the classical Kerr black holes.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:06:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Chiang-Mei",""],["Chen","Yi",""],["Ishibashi","Akihiro",""],["Ohta","Nobuyoshi",""]]}
{"id":"2308.16357","submitter":"Quoc Vo","authors":"Quoc Vo, and Tuan Tran","title":"Droplet jumping by modulated electrowetting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate jumping of sessile droplets from a solid surface in ambient\noil using modulated electrowetting actuation. We focus on the case in which the\nelectrowetting effect is activated to cause droplet spreading and then\ndeactivated exactly at the moment the droplet reaches its maximum deformation.\nBy systematically varying the control parameters such as the droplet radius,\nliquid viscosity, and applied voltage, we provide detailed characterisation of\nthe resulting behaviours including a comprehensive phase diagram separating\ndetachment from non-detachment behaviours, as well as how the detach velocity\nand detach time, i.e, duration leading to detachment, depend on the control\nparameters. We then construct a theoretical model predicting the detachment\ncondition using energy conservation principles. We finally validate our\ntheoretical analysis by experimental data obtained in the explored ranges of\nthe control parameters.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:08:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vo","Quoc",""],["Tran","Tuan",""]]}
{"id":"2308.16358","submitter":"Zihan Lin","authors":"Zihan Lin, Carlos Monton, Stefan Bringuier, Gregory Sinclair,\n  Guangming Cheng, Eduardo Marin, Zachary Bergstrom, Dmitry Rudakov, \\v{Z}ana\n  Popovi\\'c, Ulises Losada, Igor Bykov, Evan T. Ostrowski, Shota Abe, Nan Yao,\n  Bruce E. Koel, and Tyler Abrams","title":"Investigation of W-SiC compositionally graded films as a divertor\n  material","comments":"13 pages, 9 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  W-SiC composite material is a promising alternative due to the low neutron\nactivation, low impurity radiation, and ductility of SiC at high temperatures\nwhile leveraging the high erosion resistance of the W armor. Additionally, W\nand SiC have high compatibility given their similar thermal expansion rates.\nThe present study addresses the synthesis and performance of compositionally\ngraded W-SiC films fabricated by pulsed-DC magnetron sputtering. Compositional\ngradients were characterized using transmission electron microscopy (TEM) and\nenergy-dispersive X-ray spectroscopy (EDS), and crystallographic information\nwas obtained using electron diffraction and X-ray diffraction (XRD). Samples\nwere exposed to L-mode deuterium plasma discharges in the DIII-D tokamak using\nthe Divertor Material Evaluation System (DiMES). Post-mortem characterizations\nwere performed using scanning electron microscopy (SEM) and XRD. Electron\ndiffraction and XRD showed that the compositionally graded W-SiC films were\ncomposed of polycrystalline W and amorphous SiC with amorphous W+SiC\ninterlayers. No macroscopic delamination or microstructural changes were\nobserved under mild exposure conditions. This study serves as a preliminary\nexamination of W-SiC compositionally graded composites as a potential candidate\ndivertor material in future tokamak devices.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:08:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lin","Zihan",""],["Monton","Carlos",""],["Bringuier","Stefan",""],["Sinclair","Gregory",""],["Cheng","Guangming",""],["Marin","Eduardo",""],["Bergstrom","Zachary",""],["Rudakov","Dmitry",""],["Popovi\u0107","\u017dana",""],["Losada","Ulises",""],["Bykov","Igor",""],["Ostrowski","Evan T.",""],["Abe","Shota",""],["Yao","Nan",""],["Koel","Bruce E.",""],["Abrams","Tyler",""]]}
{"id":"2308.16359","submitter":"Ari Markowitz","authors":"Ari Markowitz","title":"Recognition and constructive membership for purely hyperbolic groups\n  acting on trees","comments":"19 pages, 12 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an algorithm which takes as input a finite set $X$ of\nautomorphisms of a simplicial tree, and outputs a generating set $X'$ of\n$\\langle X \\rangle$ such that either $\\langle X \\rangle$ is purely hyperbolic\nand $X'$ is a free basis of $\\langle X \\rangle$, or $X'$ contains a non-trivial\nelliptic element. As a special case, the algorithm decides whether a finitely\ngenerated group acting on a locally finite tree is discrete and free. This\nalgorithm, which is based on Nielsen's reduction method, works by repeatedly\napplying Nielsen transformations to $X$ to minimise the generators of $X'$ with\nrespect to a given pre-well-ordering. We use this algorithm to solve the\nconstructive membership problem for finitely generated purely hyperbolic\nautomorphism groups of trees. We provide a Magma implementation of these\nalgorithms, and report its performance.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:19:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Markowitz","Ari",""]]}
{"id":"2308.16360","submitter":"Yuhang Zhou","authors":"Yuhang Zhou, Xuan Lu, Ge Gao, Qiaozhu Mei, Wei Ai","title":"Emoji Promotes Developer Participation and Issue Resolution on GitHub","comments":"12 pages, 5 figures. To be published in the 18th International AAAI\n  Conference on Web and Social Media (ICWSM 2024)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.HC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Although remote working is increasingly adopted during the pandemic, many are\nconcerned by the low-efficiency in the remote working. Missing in text-based\ncommunication are non-verbal cues such as facial expressions and body language,\nwhich hinders the effective communication and negatively impacts the work\noutcomes. Prevalent on social media platforms, emojis, as alternative\nnon-verbal cues, are gaining popularity in the virtual workspaces well. In this\npaper, we study how emoji usage influences developer participation and issue\nresolution in virtual workspaces. To this end, we collect GitHub issues for a\none-year period and apply causal inference techniques to measure the causal\neffect of emojis on the outcome of issues, controlling for confounders such as\nissue content, repository, and author information. We find that emojis can\nsignificantly reduce the resolution time of issues and attract more user\nparticipation. We also compare the heterogeneous effect on different types of\nissues. These findings deepen our understanding of the developer communities,\nand they provide design implications on how to facilitate interactions and\nbroaden developer participation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:26:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhou","Yuhang",""],["Lu","Xuan",""],["Gao","Ge",""],["Mei","Qiaozhu",""],["Ai","Wei",""]]}
{"id":"2308.16361","submitter":"Haochen Zhang","authors":"Haochen Zhang, Yuyang Dong, Chuan Xiao, Masafumi Oyamada","title":"Large Language Models as Data Preprocessors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs), typified by OpenAI's GPT series and Meta's\nLLaMA variants, have marked a significant advancement in artificial\nintelligence. Trained on vast amounts of text data, LLMs are capable of\nunderstanding and generating human-like text across a diverse range of topics.\nThis study expands on the applications of LLMs, exploring their potential in\ndata preprocessing, a critical stage in data mining and analytics applications.\nWe delve into the applicability of state-of-the-art LLMs such as GPT-3.5,\nGPT-4, and Vicuna-13B for error detection, data imputation, schema matching,\nand entity matching tasks. Alongside showcasing the inherent capabilities of\nLLMs, we highlight their limitations, particularly in terms of computational\nexpense and inefficiency. We propose an LLM-based framework for data\npreprocessing, which integrates cutting-edge prompt engineering techniques,\ncoupled with traditional methods like contextualization and feature selection,\nto improve the performance and efficiency of these models. The effectiveness of\nLLMs in data preprocessing is evaluated through an experimental study spanning\n12 datasets. GPT-4 emerged as a standout, achieving 100\\% accuracy or F1 score\non 4 datasets, suggesting LLMs' immense potential in these tasks. Despite\ncertain limitations, our study underscores the promise of LLMs in this domain\nand anticipates future developments to overcome current hurdles.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:28:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Haochen",""],["Dong","Yuyang",""],["Xiao","Chuan",""],["Oyamada","Masafumi",""]]}
{"id":"2308.16362","submitter":"Lei Zhao","authors":"Daoli Zhu and Lei Zhao and Shuzhong Zhang","title":"A Unified Analysis for the Subgradient Methods Minimizing Composite\n  Nonconvex, Nonsmooth and Non-Lipschitz Functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we propose a proximal subgradient method (Prox-SubGrad) for\nsolving nonconvex and nonsmooth optimization problems without assuming\nLipschitz continuity conditions. A number of subgradient upper bounds and their\nrelationships are presented. By means of these upper bounding conditions, we\nestablish some uniform recursive relations for the Moreau envelopes for weakly\nconvex optimization. This uniform scheme simplifies and unifies the proof\nschemes to establish rate of convergence for Prox-SubGrad without assuming\nLipschitz continuity. We present a novel convergence analysis in this context.\nFurthermore, we propose some new stochastic subgradient upper bounding\nconditions and establish convergence and iteration complexity rates for the\nstochastic subgradient method (Sto-SubGrad) to solve non-Lipschitz and\nnonsmooth stochastic optimization problems. In particular, for both\ndeterministic and stochastic subgradient methods on weakly convex optimization\nproblems without Lipschitz continuity, under any of the subgradient upper\nbounding conditions to be introduced in the paper, we show that $O(1/\\sqrt{T})$\nconvergence rate holds in terms of the square of gradient of the Moreau\nenvelope function, which further improves to be $O(1/{T})$ if, in addition, the\nuniform KL condition with exponent $1/2$ holds.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:34:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhu","Daoli",""],["Zhao","Lei",""],["Zhang","Shuzhong",""]]}
{"id":"2308.16363","submitter":"Thomas Gebhart","authors":"Thomas Gebhart and Russell Funk","title":"A Mathematical Framework for Citation Disruption","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.DL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many theories of scientific and technological progress imagine science as an\niterative, developmental process periodically interrupted by innovations which\ndisrupt and restructure the status quo. Due to the immense societal value\ncreated by these disruptive scientific and technological innovations,\naccurately operationalizing this perspective into quantifiable terms represents\na key challenge for researchers seeking to understand the history and\nmechanisms underlying scientific and technological progress. Researchers have\nrecently proposed a number of quantitative measures that seek to quantify the\nextent to which works in science and technology are disruptive with respect to\ntheir scientific context. While these disruption measures show promise in their\nability to quantify potentially disruptive works of science and technology,\ntheir definitions are bespoke to the science of science and lack a broader\ntheoretical framework, obscuring their interrelationships and limiting their\nadoption within broader network science paradigms. We propose a mathematical\nframework for conceptualizing and measuring disruptive scientific contributions\nwithin citation networks through the lens of network centrality, and formally\nrelate the CD Index disruption measure and its variants to betweenness\ncentrality. By reinterpreting disruption through the lens of centrality, we\nunify a number of existing citation-based disruption measures while\nsimultaneously providing natural generalizations which enjoy empirical and\ncomputational efficiencies. We validate these theoretical observations by\ncomputing a variety of disruption measures on real citation data and find that\ncomputing these centrality-based disruption measures over ego networks of\nincreasing radius results in better discernment of award-winning scientific\ninnovations relative to conventional disruption metrics which rely on local\ncitation context alone.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:34:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gebhart","Thomas",""],["Funk","Russell",""]]}
{"id":"2308.16364","submitter":"Matija Franklin","authors":"Matija Franklin, Philip Moreira Tomei, Rebecca Gorman","title":"Strengthening the EU AI Act: Defining Key Terms on AI Manipulation","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The European Union's Artificial Intelligence Act aims to regulate\nmanipulative and harmful uses of AI, but lacks precise definitions for key\nconcepts. This paper provides technical recommendations to improve the Act's\nconceptual clarity and enforceability. We review psychological models to define\n\"personality traits,\" arguing the Act should protect full \"psychometric\nprofiles.\" We urge expanding \"behavior\" to include \"preferences\" since\npreferences causally influence and are influenced by behavior. Clear\ndefinitions are provided for \"subliminal,\" \"manipulative,\" and \"deceptive\"\ntechniques, considering incentives, intent, and covertness. We distinguish\n\"exploiting individuals\" from \"exploiting groups,\" emphasising different policy\nneeds. An \"informed decision\" is defined by four facets: comprehension,\naccurate information, no manipulation, and understanding AI's influence. We\ncaution the Act's therapeutic use exemption given the lack of regulation of\ndigital therapeutics by the EMA. Overall, the recommendations strengthen\ndefinitions of vague concepts in the EU AI Act, enhancing precise applicability\nto regulate harmful AI manipulation.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:42:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Franklin","Matija",""],["Tomei","Philip Moreira",""],["Gorman","Rebecca",""]]}
{"id":"2308.16365","submitter":"Emily Heath","authors":"Enrique Gomez-Leos, Emily Heath, Alex Parker, Coy Schwieder, Shira\n  Zerbib","title":"New bounds on $f(n,5,8)$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $f(n,p,q)$ denote the minimum number of colors needed to color the edges\nof $K_n$ so that every copy of $K_p$ receives at least $q$ distinct colors. In\nthis note, we show $\\frac{6}{7}(n-1) \\leq f(n,5,8) \\leq n + o(n)$. The upper\nbound is proven using the \"conflict-free hypergraph matchings method\" which was\nrecently used by Mubayi and Joos to prove $f(n,4,5) = \\frac{5}{6}n + o(n)$.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:44:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gomez-Leos","Enrique",""],["Heath","Emily",""],["Parker","Alex",""],["Schwieder","Coy",""],["Zerbib","Shira",""]]}
{"id":"2308.16366","submitter":"Alexis Langlois-R\\'emillard","authors":"Marcelo De Martino, Alexis Langlois-R\\'emillard, Roy Oste","title":"The double dihedral Dunkl total angular momentum algebra","comments":"34 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Dunkl deformation of the Dirac operator is part of a realisation of an\northosymplectic Lie superalgebra inside the tensor product of a rational\nCherednik algebra and a Clifford algebra. The Dunkl total angular momentum\nalgebra (TAMA) occurs as the supercentraliser, or dual partner, of this Lie\nsuperalgebra. In this paper, we consider the case when the reflection group\nassociated with the Dunkl operators is a product of two dihedral groups acting\non a four-dimensional Euclidean space. We introduce a subalgebra of the total\nangular momentum algebra that admits a triangular decomposition and, in analogy\nto the celebrated theory of semisimple Lie algebras, we use this triangular\nsubalgebra to give precise necessary conditions that a finite-dimensional\nirreducible representation must obey, in terms of weights. Furthermore, we\nconstruct a basis for representations of the TAMA with explicit actions.\nExamples of these modules occur in the kernel of the Dunkl--Dirac operator in\nthe context of deformations of Howe dual pairs.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:47:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["De Martino","Marcelo",""],["Langlois-R\u00e9millard","Alexis",""],["Oste","Roy",""]]}
{"id":"2308.16367","submitter":"Choonkil Park","authors":"Amin Hosseini, Choonkil Park","title":"Automatic continuity of new generalized derivations","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\mathcal{A}$ and $\\mathcal{B}$ be two algebras and let $n$ be a positive\ninteger. A linear mapping $D:\\mathcal{A} \\rightarrow \\mathcal{B}$ is called a\n\\emph{strongly generalized derivation of order $n$} if there exist families of\nlinear mappings $\\{E_k:\\mathcal{A} \\rightarrow \\mathcal{B}\\}_{k = 1}^{n}$,\n$\\{F_k:\\mathcal{A} \\rightarrow \\mathcal{B}\\}_{k = 1}^{n}$, $\\{G_k:\\mathcal{A}\n\\rightarrow \\mathcal{B}\\}_{k = 1}^{n}$ and $\\{H_k:\\mathcal{A} \\rightarrow\n\\mathcal{B}\\}_{k = 1}^{n}$ which satisfy $D(ab) = \\sum_{k = 1}^{n}\\left[E_k(a)\nF_k(b) + G_k(a)H_k(b)\\right]$ for all $a, b \\in \\mathcal{A}$. The purpose of\nthis article is to study the automatic continuity of such derivations on Banach\nalgebras and $C^{\\ast}$-algebras.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:56:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hosseini","Amin",""],["Park","Choonkil",""]]}
{"id":"2308.16368","submitter":"Daniel E. Ochoa","authors":"Daniel E. Ochoa, Nicolas Espitia, Jorge I. Poveda","title":"Prescribed-Time Control in Switching Systems with Resets: A Hybrid\n  Dynamical Systems Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of achieving prescribed-time stability (PT-S) in a\nclass of hybrid dynamical systems that incorporate switching nonlinear\ndynamics, exogenous inputs, and resets. By \"prescribed-time stability\", we\nrefer to the property of having the states converge to a particular compact set\nof interest before a given time defined a priori by the user. We focus on\ndynamical systems that achieve this property via time-varying gains. For\ncontinuous-time systems, this approach has received significant attention in\nrecent years, with various applications in control, optimization, and\nestimation problems. However, its extensions beyond continuous-time systems\nhave been limited. This gap motivates this paper, which introduces a novel\nclass of switching conditions for switching systems with resets that\nincorporate time-varying gains, ensuring the PT-S property even in the presence\nof unstable modes. The analysis leverages tools from hybrid dynamical system's\ntheory, and a contraction-dilation property that is established for the hybrid\ntime domains of the solutions of the system. We present the model and main\nresults in a general framework and subsequently apply them to three novel\napplications: (a) PT regulation of switching plants with no common Lyapunov\nfunctions; (b) PT control of dynamic plants with uncertainty and intermittent\nfeedback; and (c) PT decision-making in non-cooperative switching games via\nhybrid Nash seeking dynamics.\n","versions":[{"version":"v1","created":"Wed, 30 Aug 2023 23:56:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ochoa","Daniel E.",""],["Espitia","Nicolas",""],["Poveda","Jorge I.",""]]}
{"id":"2308.16369","submitter":"Amey Agrawal","authors":"Amey Agrawal, Ashish Panwar, Jayashree Mohan, Nipun Kwatra, Bhargav S.\n  Gulavani, Ramachandran Ramjee","title":"SARATHI: Efficient LLM Inference by Piggybacking Decodes with Chunked\n  Prefills","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Model (LLM) inference consists of two distinct phases -\nprefill phase which processes the input prompt and decode phase which generates\noutput tokens autoregressively. While the prefill phase effectively saturates\nGPU compute at small batch sizes, the decode phase results in low compute\nutilization as it generates one token at a time per request. The varying\nprefill and decode times also lead to imbalance across micro-batches when using\npipeline parallelism, resulting in further inefficiency due to bubbles.\n  We present SARATHI to address these challenges. SARATHI employs\nchunked-prefills, which splits a prefill request into equal sized chunks, and\ndecode-maximal batching, which constructs a batch using a single prefill chunk\nand populates the remaining slots with decodes. During inference, the prefill\nchunk saturates GPU compute, while the decode requests 'piggyback' and cost up\nto an order of magnitude less compared to a decode-only batch. Chunked-prefills\nallows constructing multiple decode-maximal batches from a single prefill\nrequest, maximizing coverage of decodes that can piggyback. Furthermore, the\nuniform compute design of these batches ameliorates the imbalance between\nmicro-batches, significantly reducing pipeline bubbles.\n  Our techniques yield significant improvements in inference performance across\nmodels and hardware. For the LLaMA-13B model on A6000 GPU, SARATHI improves\ndecode throughput by up to 10x, and accelerates end-to-end throughput by up to\n1.33x. For LLaMa-33B on A100 GPU, we achieve 1.25x higher end-to-end-throughput\nand up to 4.25x higher decode throughput. When used with pipeline parallelism\non GPT-3, SARATHI reduces bubbles by 6.29x, resulting in an end-to-end\nthroughput improvement of 1.91x.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:03:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Agrawal","Amey",""],["Panwar","Ashish",""],["Mohan","Jayashree",""],["Kwatra","Nipun",""],["Gulavani","Bhargav S.",""],["Ramjee","Ramachandran",""]]}
{"id":"2308.16370","submitter":"Qingzhi Ma","authors":"Qingzhi Ma","title":"SieveJoin: Boosting Multi-Way Joins with Reusable Bloom Filters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Improving data systems' performance for join operations has long been an\nissue of great importance. More recently, a lot of focus has been devoted to\nmulti-way join performance and especially on reducing the negative impact of\nproducing intermediate tuples, which in the end do not make it in the final\nresult. We contribute a new multi-way join algorithm, coined SieveJoin, which\nextends the well-known Bloomjoin algorithm to multi-way joins and achieves\nstate-of-the-art performance in terms of join query execution efficiency.\nSieveJoin's salient novel feature is that it allows the propagation of Bloom\nfilters in the join path, enabling the system to `stop early' and eliminate\nuseless intermediate join results. The key design objective of SieveJoin is to\nefficiently `learn' the join results, based on Bloom filters, with negligible\nmemory overheads. We discuss the bottlenecks in delaying multi-way joins, and\nhow Bloom filters are used to remove the generation of unnecessary intermediate\njoin results. We provide a detailed experimental evaluation using various\ndatasets, against a state-of-the-art column-store database and a multi-way\nworst-case optimal join algorithm, showcasing SieveJoin's gains in terms of\nresponse time.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:13:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ma","Qingzhi",""]]}
{"id":"2308.16371","submitter":"Michael Cuffaro","authors":"Michael E. Cuffaro","title":"The Measurement Problem Is a Feature, Not a Bug -- Schematising the\n  Observer as a Postulate and the Quantum-Mechanical Concept of an Open System\n  on an Informational, or (neo-)Bohrian, Approach","comments":"20 pages (including references), 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.hist-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  I flesh out the sense in which the informational approach to interpreting\nquantum mechanics, as defended by Pitowsky and Bub and lately by a number of\nother authors, is (neo-)Bohrian. I argue that on this approach, quantum\nmechanics represents what Bohr called a \"natural generalisation of the ordinary\ncausal description\" in the sense that the idea (which philosophers of science\nlike Stein have argued for on the grounds of practical necessity), that\nunderstanding a theory as a theory of physics requires that we be able to\n\"schematise the observer\" within it, is elevated in quantum mechanics to the\nlevel of a postulate. I argue that the approach's central concern is with the\nmethodological question of how to assign physical properties to what one takes\nto be a system in a given experimental context, rather than the metaphysical\nquestion of what a given state vector represents independently of any context,\nand I show how the quantum generalisation of the concept of an open system may\nbe used to assuage Einstein's complaint that the orthodox approach to quantum\nmechanics runs afoul of the supposedly fundamental methodological requirement\nto the effect that one must always be able, according to Einstein, to treat\nspatially separated systems as isolated from one another.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:19:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cuffaro","Michael E.",""]]}
{"id":"2308.16372","submitter":"Qian Zhang","authors":"Qian Zhang, Chenxi Wu, Adar Kahana, Youngeun Kim, Yuhang Li and George\n  Em Karniadakis, Priyadarshini Panda","title":"Artificial to Spiking Neural Networks Conversion for Scientific Machine\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a method to convert Physics-Informed Neural Networks (PINNs),\ncommonly used in scientific machine learning, to Spiking Neural Networks\n(SNNs), which are expected to have higher energy efficiency compared to\ntraditional Artificial Neural Networks (ANNs). We first extend the calibration\ntechnique of SNNs to arbitrary activation functions beyond ReLU, making it more\nversatile, and we prove a theorem that ensures the effectiveness of the\ncalibration. We successfully convert PINNs to SNNs, enabling computational\nefficiency for diverse regression tasks in solving multiple differential\nequations, including the unsteady Navier-Stokes equations. We demonstrate great\ngains in terms of overall efficiency, including Separable PINNs (SPINNs), which\naccelerate the training process. Overall, this is the first work of this kind\nand the proposed method achieves relatively good accuracy with low spike rates.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:21:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Qian",""],["Wu","Chenxi",""],["Kahana","Adar",""],["Kim","Youngeun",""],["Li","Yuhang",""],["Karniadakis","George Em",""],["Panda","Priyadarshini",""]]}
{"id":"2308.16373","submitter":"Panpan Ren","authors":"Zhongmin Qian, Panpan Ren, Feng-Yu Wang","title":"Entropy Estimate for Degenerate SDEs with Applications to Nonlinear\n  Kinetic Fokker-Planck Equations","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The relative entropy for two different degenerate diffusion processes is\nestimated by using the Wasserstein distance of initial distributions and the\ndifference between coefficients. As applications, the entropy cost inequality\nand exponential ergodicity in entropy are derived for distribution dependent\nstochastic Hamiltonian systems associated with nonlinear kinetic Fokker Planck\nequations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:21:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Qian","Zhongmin",""],["Ren","Panpan",""],["Wang","Feng-Yu",""]]}
{"id":"2308.16374","submitter":"Tim Gorichanaz","authors":"Tim Gorichanaz","title":"Accused: How students respond to allegations of using ChatGPT on\n  assessments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study explores student responses to allegations of cheating using\nChatGPT, a popular software platform that can be used to generate grammatical\nand broadly correct text on virtually any topic. Forty-nine posts and the\nensuing discussions were collected from Reddit, an online discussion forum, in\nwhich students shared their experiences of being accused (the majority falsely)\nand discussed how to navigate their situations. A thematic analysis was\nconducted with this material, and five themes were discerned: a legalistic\nstance, involving argument strategy and evidence gathering; the societal role\nof higher education as a high-stakes gatekeeper; the vicissitudes of trust in\nstudents vs. technology; questions of what constitutes cheating; and the need\nto rethink assessment. The findings from this study will help instructors and\ninstitutions to create more meaningful assessments in the age of AI and develop\nguidelines for student use of ChatGPT and other AI tools.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:23:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gorichanaz","Tim",""]]}
{"id":"2308.16375","submitter":"Xueqi Cheng","authors":"Yi Zhang, Yuying Zhao, Zhaoqing Li, Xueqi Cheng, Yu Wang, Olivera\n  Kotevska, Philip S. Yu, Tyler Derr","title":"A Survey on Privacy in Graph Neural Networks: Attacks, Preservation, and\n  Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Neural Networks (GNNs) have gained significant attention owing to their\nability to handle graph-structured data and the improvement in practical\napplications. However, many of these models prioritize high utility\nperformance, such as accuracy, with a lack of privacy consideration, which is a\nmajor concern in modern society where privacy attacks are rampant. To address\nthis issue, researchers have started to develop privacy-preserving GNNs.\nDespite this progress, there is a lack of a comprehensive overview of the\nattacks and the techniques for preserving privacy in the graph domain. In this\nsurvey, we aim to address this gap by summarizing the attacks on graph data\naccording to the targeted information, categorizing the privacy preservation\ntechniques in GNNs, and reviewing the datasets and applications that could be\nused for analyzing/solving privacy issues in GNNs. We also outline potential\ndirections for future research in order to build better privacy-preserving\nGNNs.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:31:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Yi",""],["Zhao","Yuying",""],["Li","Zhaoqing",""],["Cheng","Xueqi",""],["Wang","Yu",""],["Kotevska","Olivera",""],["Yu","Philip S.",""],["Derr","Tyler",""]]}
{"id":"2308.16376","submitter":"Dongang Wang","authors":"Lei Bai and Dongang Wang and Michael Barnett and Mariano Cabezas and\n  Weidong Cai and Fernando Calamante and Kain Kyle and Dongnan Liu and Linda Ly\n  and Aria Nguyen and Chun-Chien Shieh and Ryan Sullivan and Hengrui Wang and\n  Geng Zhan and Wanli Ouyang and Chenyu Wang","title":"Improving Multiple Sclerosis Lesion Segmentation Across Clinical Sites:\n  A Federated Learning Approach with Noise-Resilient Training","comments":"11 pages, 4 figures, journal submission","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurately measuring the evolution of Multiple Sclerosis (MS) with magnetic\nresonance imaging (MRI) critically informs understanding of disease progression\nand helps to direct therapeutic strategy. Deep learning models have shown\npromise for automatically segmenting MS lesions, but the scarcity of accurately\nannotated data hinders progress in this area. Obtaining sufficient data from a\nsingle clinical site is challenging and does not address the heterogeneous need\nfor model robustness. Conversely, the collection of data from multiple sites\nintroduces data privacy concerns and potential label noise due to varying\nannotation standards. To address this dilemma, we explore the use of the\nfederated learning framework while considering label noise. Our approach\nenables collaboration among multiple clinical sites without compromising data\nprivacy under a federated learning paradigm that incorporates a noise-robust\ntraining strategy based on label correction. Specifically, we introduce a\nDecoupled Hard Label Correction (DHLC) strategy that considers the imbalanced\ndistribution and fuzzy boundaries of MS lesions, enabling the correction of\nfalse annotations based on prediction confidence. We also introduce a Centrally\nEnhanced Label Correction (CELC) strategy, which leverages the aggregated\ncentral model as a correction teacher for all sites, enhancing the reliability\nof the correction process. Extensive experiments conducted on two multi-site\ndatasets demonstrate the effectiveness and robustness of our proposed methods,\nindicating their potential for clinical applications in multi-site\ncollaborations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:36:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bai","Lei",""],["Wang","Dongang",""],["Barnett","Michael",""],["Cabezas","Mariano",""],["Cai","Weidong",""],["Calamante","Fernando",""],["Kyle","Kain",""],["Liu","Dongnan",""],["Ly","Linda",""],["Nguyen","Aria",""],["Shieh","Chun-Chien",""],["Sullivan","Ryan",""],["Wang","Hengrui",""],["Zhan","Geng",""],["Ouyang","Wanli",""],["Wang","Chenyu",""]]}
{"id":"2308.16377","submitter":"Matija Franklin","authors":"Simon Hudson, Matija Franklin","title":"Science Communications for Explainable Artificial Intelligence","comments":"Accepted at the IJCAI-23 Workshop on XAI held at the Thirty-Second\n  International Joint Conference on Artificial Intelligence (IJCAI-23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Artificial Intelligence (AI) has a communication problem. XAI methods have\nbeen used to make AI more understandable and helped resolve some of the\ntransparency issues that inhibit AI's broader usability. However, user\nevaluation studies reveal that the often numerical explanations provided by XAI\nmethods have not always been effective for many types of users of AI systems.\nThis article aims to adapt the major communications models from Science\nCommunications into a framework for practitioners to understand, influence, and\nintegrate the context of audiences both for their communications supporting AI\nliteracy in the public and in designing XAI systems that are more adaptive to\ndifferent users.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:39:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hudson","Simon",""],["Franklin","Matija",""]]}
{"id":"2308.16378","submitter":"Vitor Marques","authors":"Pedro Baptista, Gabriel Coutinho, Vitor Marques","title":"Unexpected Averages of Mixing Matrices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math.CO math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The (standard) average mixing matrix of a continuous-time quantum walk is\ncomputed by taking the expected value of the mixing matrices of the walk under\nthe uniform sampling distribution on the real line. In this paper we consider\nalternative probability distributions, either discrete or continuous, and first\nwe show that several algebraic properties that hold for the average mixing\nmatrix still stand for this more general setting. Then, we provide examples of\ngraphs and choices of distributions where the average mixing matrix behaves in\nan unexpected way: for instance, we show that there are probability\ndistributions for which the average mixing matrices of the paths on three or\nfour vertices have constant entries, opening a significant line of\ninvestigation about how to use classical probability distributions to sample\nquantum walks and obtain desired quantum effects. We present results connecting\nthe trace of the average mixing matrix and quantum walk properties, and we show\nthat the Gram matrix of average states is the average mixing matrix of a\ncertain related distribution. Throughout the text, we employ concepts of\nclassical probability theory not usually seen in texts about quantum walks.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:44:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Baptista","Pedro",""],["Coutinho","Gabriel",""],["Marques","Vitor",""]]}
{"id":"2308.16379","submitter":"Abdelghani Ghanem","authors":"Abdelghani Ghanem, Philippe Ciblat, Mounir Ghogho","title":"Multi-Objective Decision Transformers for Offline Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Offline Reinforcement Learning (RL) is structured to derive policies from\nstatic trajectory data without requiring real-time environment interactions.\nRecent studies have shown the feasibility of framing offline RL as a sequence\nmodeling task, where the sole aim is to predict actions based on prior context\nusing the transformer architecture. However, the limitation of this single task\nlearning approach is its potential to undermine the transformer model's\nattention mechanism, which should ideally allocate varying attention weights\nacross different tokens in the input context for optimal prediction. To address\nthis, we reformulate offline RL as a multi-objective optimization problem,\nwhere the prediction is extended to states and returns. We also highlight a\npotential flaw in the trajectory representation used for sequence modeling,\nwhich could generate inaccuracies when modeling the state and return\ndistributions. This is due to the non-smoothness of the action distribution\nwithin the trajectory dictated by the behavioral policy. To mitigate this\nissue, we introduce action space regions to the trajectory representation. Our\nexperiments on D4RL benchmark locomotion tasks reveal that our propositions\nallow for more effective utilization of the attention mechanism in the\ntransformer model, resulting in performance that either matches or outperforms\ncurrent state-of-the art methods.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:47:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ghanem","Abdelghani",""],["Ciblat","Philippe",""],["Ghogho","Mounir",""]]}
{"id":"2308.16380","submitter":"Xiao Pan","authors":"Elmira Faraji Zonouz, Xiao Pan, Yu-Cheng Hsu, Tony Yang","title":"3D vision-based structural masonry damage detection","comments":"10 pages, accepted in the Canadian Conference - Pacific Conference on\n  Earthquake Engineering 2023, Vancouver, British Columbia","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The detection of masonry damage is essential for preventing potentially\ndisastrous outcomes. Manual inspection can, however, take a long time and be\nhazardous to human inspectors. Automation of the inspection process using novel\ncomputer vision and machine learning algorithms can be a more efficient and\nsafe solution to prevent further deterioration of the masonry structures. Most\nexisting 2D vision-based methods are limited to qualitative damage\nclassification, 2D localization, and in-plane quantification. In this study, we\npresent a 3D vision-based methodology for accurate masonry damage detection,\nwhich offers a more robust solution with a greater field of view, depth of\nvision, and the ability to detect failures in complex environments. First,\nimages of the masonry specimens are collected to generate a 3D point cloud.\nSecond, 3D point clouds processing methods are developed to evaluate the\nmasonry damage. We demonstrate the effectiveness of our approach through\nexperiments on structural masonry components. Our experiments showed the\nproposed system can effectively classify damage states and localize and\nquantify critical damage features. The result showed the proposed method can\nimprove the level of autonomy during the inspection of masonry structures.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:48:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zonouz","Elmira Faraji",""],["Pan","Xiao",""],["Hsu","Yu-Cheng",""],["Yang","Tony",""]]}
{"id":"2308.16381","submitter":"Shaohang Xu","authors":"Shaohang Xu, Haolin Ruan, Wentao Zhang, Yian Wang, Lijun Zhu, Chin\n  Pang Ho","title":"Wasserstein Distributionally Robust Chance Constrained Trajectory\n  Optimization for Mobile Robots within Uncertain Safe Corridor","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Safe corridor-based Trajectory Optimization (TO) presents an appealing\napproach for collision-free path planning of autonomous robots, offering global\noptimality through its convex formulation. The safe corridor is constructed\nbased on the perceived map, however, the non-ideal perception induces\nuncertainty, which is rarely considered in trajectory generation. In this\npaper, we propose Distributionally Robust Safe Corridor Constraints (DRSCCs) to\nconsider the uncertainty of the safe corridor. Then, we integrate DRSCCs into\nthe trajectory optimization framework using Bernstein basis polynomials.\nTheoretically, we rigorously prove that the trajectory optimization problem\nincorporating DRSCCs is equivalent to a computationally efficient, convex\nquadratic program. Compared to the nominal TO, our method enhances navigation\nsafety by significantly reducing the infeasible motions in presence of\nuncertainty. Moreover, the proposed approach is validated through two robotic\napplications, a micro Unmanned Aerial Vehicle (UAV) and a quadruped robot\nUnitree A1.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 00:58:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xu","Shaohang",""],["Ruan","Haolin",""],["Zhang","Wentao",""],["Wang","Yian",""],["Zhu","Lijun",""],["Ho","Chin Pang",""]]}
{"id":"2308.16382","submitter":"Xiao Wang","authors":"Xiao Wang, Fang Dai, Wenyan Guo, Junfeng Wang","title":"A stochastic block model for community detection in attributed networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Community detection is an important content in complex network analysis. The\nexisting community detection methods in attributed networks mostly focus on\nonly using network structure, while the methods of integrating node attributes\nis mainly for the traditional community structures, and cannot detect\nmultipartite structures and mixture structures in network. In addition, the\nmodel-based community detection methods currently proposed for attributed\nnetworks do not fully consider unique topology information of nodes, such as\nbetweenness centrality and clustering coefficient. Therefore, a stochastic\nblock model that integrates betweenness centrality and clustering coefficient\nof nodes for community detection in attributed networks, named BCSBM, is\nproposed in this paper. Different from other generative models for attributed\nnetworks, the generation process of links and attributes in BCSBM model follows\nthe Poisson distribution, and the probability between community is considered\nbased on the stochastic block model. Moreover, the betweenness centrality and\nclustering coefficient of nodes are introduced into the process of links and\nattributes generation. Finally, the expectation maximization algorithm is\nemployed to estimate the parameters of the BCSBM model, and the node-community\nmemberships is obtained through the hard division process, so the community\ndetection is completed. By experimenting on six real-work networks containing\ndifferent network structures, and comparing with the community detection\nresults of five algorithms, the experimental results show that the BCSBM model\nnot only inherits the advantages of the stochastic block model and can detect\nvarious network structures, but also has good data fitting ability due to\nintroducing the betweenness centrality and clustering coefficient of nodes.\nOverall, the performance of this model is superior to other five compared\nalgorithms.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:00:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Xiao",""],["Dai","Fang",""],["Guo","Wenyan",""],["Wang","Junfeng",""]]}
{"id":"2308.16383","submitter":"Chengyang Fang","authors":"Chengyang Fang, Jiangnan Li, Liang Li, Can Ma, Dayong Hu","title":"Separate and Locate: Rethink the Text in Text-based Visual Question\n  Answering","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text-based Visual Question Answering (TextVQA) aims at answering questions\nabout the text in images. Most works in this field focus on designing network\nstructures or pre-training tasks. All these methods list the OCR texts in\nreading order (from left to right and top to bottom) to form a sequence, which\nis treated as a natural language ``sentence''. However, they ignore the fact\nthat most OCR words in the TextVQA task do not have a semantical contextual\nrelationship. In addition, these approaches use 1-D position embedding to\nconstruct the spatial relation between OCR tokens sequentially, which is not\nreasonable. The 1-D position embedding can only represent the left-right\nsequence relationship between words in a sentence, but not the complex spatial\nposition relationship. To tackle these problems, we propose a novel method\nnamed Separate and Locate (SaL) that explores text contextual cues and designs\nspatial position embedding to construct spatial relations between OCR texts.\nSpecifically, we propose a Text Semantic Separate (TSS) module that helps the\nmodel recognize whether words have semantic contextual relations. Then, we\nintroduce a Spatial Circle Position (SCP) module that helps the model better\nconstruct and reason the spatial position relationships between OCR texts. Our\nSaL model outperforms the baseline model by 4.44% and 3.96% accuracy on TextVQA\nand ST-VQA datasets. Compared with the pre-training state-of-the-art method\npre-trained on 64 million pre-training samples, our method, without any\npre-training tasks, still achieves 2.68% and 2.52% accuracy improvement on\nTextVQA and ST-VQA. Our code and models will be released at\nhttps://github.com/fangbufang/SaL.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:00:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fang","Chengyang",""],["Li","Jiangnan",""],["Li","Liang",""],["Ma","Can",""],["Hu","Dayong",""]]}
{"id":"2308.16384","submitter":"Ryota Shii","authors":"Ryota Shii","title":"On non-trivial $\\Lambda$-submodules with finite index of the plus/minus\n  Selmer group over anticyclotomic $\\mathbb{Z}_{p}$-extension at inert primes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $K$ be an imaginary quadratic field where $p$ is inert. Let $E$ be an\nelliptic curve defined over $K$ and suppose that $E$ has good supersingular\nreduction at $p$. In this paper, we prove that the plus/minus Selmer group of\n$E$ over the anticyclotomic $\\mathbb{Z}_{p}$-extension of $K$ has no\nnon-trivial $\\Lambda$-submodules of finite index under mild assumptions for\n$E$. This is an analogous result to R. Greenberg and B. D. Kim for the\nanticyclotomic $\\mathbb{Z}_{p}$-extension essentially. By applying the results\nof A. Agoboola--B. Howard or A. Burungale--K. B\\\"uy\\\"ukboduk--A. Lei, we can\nalso construct examples satisfying the assumptions of our theorem.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:01:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shii","Ryota",""]]}
{"id":"2308.16385","submitter":"Qiang Huang","authors":"Qiang Huang, Jiawei Jiang, Xi Susie Rao, Ce Zhang, Zhichao Han, Zitao\n  Zhang, Xin Wang, Yongjun He, Quanqing Xu, Yang Zhao, Chuang Hu, Shuo Shang,\n  Bo Du","title":"BenchTemp: A General Benchmark for Evaluating Temporal Graph Neural\n  Networks","comments":"28 pages, 23 figures, 27 tables. Submitted to the Conference on\n  Neural Information Processing Systems 2023 Track on Datasets and Benchmarks","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  To handle graphs in which features or connectivities are evolving over time,\na series of temporal graph neural networks (TGNNs) have been proposed. Despite\nthe success of these TGNNs, the previous TGNN evaluations reveal several\nlimitations regarding four critical issues: 1) inconsistent datasets, 2)\ninconsistent evaluation pipelines, 3) lacking workload diversity, and 4)\nlacking efficient comparison. Overall, there lacks an empirical study that puts\nTGNN models onto the same ground and compares them comprehensively. To this\nend, we propose BenchTemp, a general benchmark for evaluating TGNN models on\nvarious workloads. BenchTemp provides a set of benchmark datasets so that\ndifferent TGNN models can be fairly compared. Further, BenchTemp engineers a\nstandard pipeline that unifies the TGNN evaluation. With BenchTemp, we\nextensively compare the representative TGNN models on different tasks (e.g.,\nlink prediction and node classification) and settings (transductive and\ninductive), w.r.t. both effectiveness and efficiency metrics. We have made\nBenchTemp publicly available at https://github.com/qianghuangwhu/benchtemp.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:03:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Huang","Qiang",""],["Jiang","Jiawei",""],["Rao","Xi Susie",""],["Zhang","Ce",""],["Han","Zhichao",""],["Zhang","Zitao",""],["Wang","Xin",""],["He","Yongjun",""],["Xu","Quanqing",""],["Zhao","Yang",""],["Hu","Chuang",""],["Shang","Shuo",""],["Du","Bo",""]]}
{"id":"2308.16386","submitter":"Yang Luo","authors":"Yang Luo, Xiqing Guo, Hui Feng, Lei Ao","title":"RGB-T Tracking via Multi-Modal Mutual Prompt Learning","comments":"9 pages, 5 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Object tracking based on the fusion of visible and thermal im-ages, known as\nRGB-T tracking, has gained increasing atten-tion from researchers in recent\nyears. How to achieve a more comprehensive fusion of information from the two\nmodalities with fewer computational costs has been a problem that re-searchers\nhave been exploring. Recently, with the rise of prompt learning in computer\nvision, we can better transfer knowledge from visual large models to downstream\ntasks. Considering the strong complementarity between visible and thermal\nmodalities, we propose a tracking architecture based on mutual prompt learning\nbetween the two modalities. We also design a lightweight prompter that\nincorporates attention mechanisms in two dimensions to transfer information\nfrom one modality to the other with lower computational costs, embedding it\ninto each layer of the backbone. Extensive ex-periments have demonstrated that\nour proposed tracking ar-chitecture is effective and efficient, achieving\nstate-of-the-art performance while maintaining high running speeds.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:13:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Luo","Yang",""],["Guo","Xiqing",""],["Feng","Hui",""],["Ao","Lei",""]]}
{"id":"2308.16387","submitter":"Zhigang Wu","authors":"Juanzi Cai, Zhiang Wu, Guochun Wu","title":"Stability and instability for compressible Navier-Stokes equations with\n  Yukawa potential","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 first consider global well-posedness and long time behavior\nof compressible Navier-Stokes equations with Yukawa-type potential in\n$L^p$-framework under the stability condition $P'(\\bar\\rho)+\\gamma\\bar\\rho>0$.\nHere $\\bar\\rho>0$ is the background density, P is the pressure and\n$\\gamma\\in\\mathbb{R}$ is Yukawa coefficient. This is a continuity work of\nChikami \\cite{chikami1} concerning on local existence and blow-up criterion. On\nthe other hand, we study the instability of the linear and nonlinear problem of\nthe system when $P'(\\bar\\rho)+\\gamma\\bar\\rho<0$ in the Hadamard sense.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:26:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cai","Juanzi",""],["Wu","Zhiang",""],["Wu","Guochun",""]]}
{"id":"2308.16388","submitter":"Daniel De La Riva Massaad","authors":"Daniel Ahlberg and Daniel de la Riva","title":"Is 'being above the median' a noise sensitive property?","comments":"A YouTube video introducing this article:\n  https://www.youtube.com/watch?v=yAJzVsAwHZs","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Assign independent weights to the edges of the square lattice, from the\nuniform distribution on $\\{a,b\\}$ for some $0<a<b<\\infty$. The weighted graph\ninduces a random metric on $\\mathbb{Z}^2$. Let $T_n$ denote the distance\nbetween $(0,0)$ and $(n,0)$ in this metric. The distribution of $T_n$ has a\nwell-defined median. Itai Benjamini asked in 2011 if the sequence of Boolean\nfunctions encoding whether $T_n$ exceeds its median is noise sensitive? In this\npaper we present the first progress on Benjamini's problem. More precisely, we\nstudy the minimal weight along any path crossing an $n\\times n$-square\nhorizontally and whose vertical fluctuation is smaller than $n^{1/22}$, and\nshow that for this observable, 'being above the median' is a noise sensitive\nproperty.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:42:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ahlberg","Daniel",""],["de la Riva","Daniel",""]]}
{"id":"2308.16389","submitter":"Haven Kim","authors":"Haven Kim, Keunwoo Choi, Mateusz Modrzejewski, Cynthia C. S. Liem","title":"The Biased Journey of MSD_AUDIO.ZIP","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CY eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The equitable distribution of academic data is crucial for ensuring equal\nresearch opportunities, and ultimately further progress. Yet, due to the\ncomplexity of using the API for audio data that corresponds to the Million Song\nDataset along with its misreporting (before 2016) and the discontinuation of\nthis API (after 2016), access to this data has become restricted to those\nwithin certain affiliations that are connected peer-to-peer. In this paper, we\ndelve into this issue, drawing insights from the experiences of 22 individuals\nwho either attempted to access the data or played a role in its creation. With\nthis, we hope to initiate more critical dialogue and more thoughtful\nconsideration with regard to access privilege in the MIR community.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:42:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kim","Haven",""],["Choi","Keunwoo",""],["Modrzejewski","Mateusz",""],["Liem","Cynthia C. S.",""]]}
{"id":"2308.16390","submitter":"Shao-Ping Li","authors":"Shinya Kanemura, Shao-Ping Li","title":"Dark phase transition from WIMP: complementary tests from gravitational\n  waves and colliders","comments":"30 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":"  A dark sector is an interesting place where a strong first-order phase\ntransition, observable gravitational waves and/or a dark matter candidate could\narise. However, the experimental tests for such a dark sector could be\nambiguous due to the dark content, largely unconstrained parameter space and\nthe connection to the visible world. We consider a minimal dark scalar-vector\nboson plasma to realize the three mentioned phenomena, with a unique connection\nto the Standard Model via the Higgs portal coupling. We discuss the important\nfeatures of the Higgs portal in such a minimal dark sector, namely the dark\nthermalization, collider tests, and direct detection of dark matter. We perform\nnumerical analyses of the dark phase transition associated with stochastic\ngravitational waves and dark matter, discussing the complementarity of collider\ndetection, dark matter direct detection and space-based/terrestrial\ninterferometers as a promising avenue to hear and see the minimal dark sector.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:44:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kanemura","Shinya",""],["Li","Shao-Ping",""]]}
{"id":"2308.16391","submitter":"Phuong Duy Huynh Mr.","authors":"Phuong Duy Huynh, Son Hoang Dau, Xiaodong Li, Phuc Luong, Emanuele\n  Viterbo","title":"Improving Robustness and Accuracy of Ponzi Scheme Detection on Ethereum\n  Using Time-Dependent Features","comments":"17 pages, 9 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CE cs.LG q-fin.ST","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rapid development of blockchain has led to more and more funding pouring\ninto the cryptocurrency market, which also attracted cybercriminals' interest\nin recent years. The Ponzi scheme, an old-fashioned fraud, is now popular on\nthe blockchain, causing considerable financial losses to many crypto-investors.\nA few Ponzi detection methods have been proposed in the literature, most of\nwhich detect a Ponzi scheme based on its smart contract source code or opcode.\nThe contract-code-based approach, while achieving very high accuracy, is not\nrobust: first, the source codes of a majority of contracts on Ethereum are not\navailable, and second, a Ponzi developer can fool a contract-code-based\ndetection model by obfuscating the opcode or inventing a new profit\ndistribution logic that cannot be detected (since these models were trained on\nexisting Ponzi logics only). A transaction-based approach could improve the\nrobustness of detection because transactions, unlike smart contracts, are\nharder to be manipulated. However, the current transaction-based detection\nmodels achieve fairly low accuracy. We address this gap in the literature by\ndeveloping new detection models that rely only on the transactions, hence\nguaranteeing the robustness, and moreover, achieve considerably higher\nAccuracy, Precision, Recall, and F1-score than existing transaction-based\nmodels. This is made possible thanks to the introduction of novel\ntime-dependent features that capture Ponzi behaviours characteristics derived\nfrom our comprehensive data analyses on Ponzi and non-Ponzi data from the\nXBlock-ETH repository\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:54:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Huynh","Phuong Duy",""],["Dau","Son Hoang",""],["Li","Xiaodong",""],["Luong","Phuc",""],["Viterbo","Emanuele",""]]}
{"id":"2308.16392","submitter":"Jiawei Peng","authors":"Jiawei Peng, Deping Hu, Hong Liu, Qiang Shi, Peng Bao, and Zhenggang\n  Lan","title":"Studies of Nonadiabatic Dynamics in the Singlet Fission Processes of\n  Pentacene Dimer via Tensor Train Decomposition Method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Singlet fission (SF) is a very significant photophysical phenomenon and\npossesses potential applications. In this work, we try to give the rather\ndetailed theoretical investigation of the SF process in the stacked polyacene\ndimer by combining the high-level quantum chemistry calculations, and the\nquantum dynamics simulations based on the tensor train decomposition method.\nStarting from the construction of the linear vibronic coupling model, we\nexplore the pure electronic dynamics and the vibronic dynamics in the SF\nprocesses. The role of vibrational modes in nonadiabatic dynamics is addressed.\nThe results show that the super-exchange mechanism mediated by the\ncharge-transfer state is found in both pure electronic dynamics and the\nnonadiabatic dynamics. Particularly, the vibrational modes with the frequency\nresonance with the adiabatic energy gap play very import roles in the SF\ndynamics. This work not only provides a deep and detailed understanding of the\nSF process, but also verifies the efficiency of the tensor train decomposition\nmethod that can serve as the reference dynamics method to explore the dynamics\nbehaviors of complex systems.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:56:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Peng","Jiawei",""],["Hu","Deping",""],["Liu","Hong",""],["Shi","Qiang",""],["Bao","Peng",""],["Lan","Zhenggang",""]]}
{"id":"2308.16393","submitter":"Ting Gao","authors":"Hui Li, Ting Gao, Fengli Yan","title":"Parameterized multipartite entanglement measures","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate parameterized multipartite entanglement measures from the\nperspective of $k$-nonseparability in this paper. We present two types of\nentanglement measures in $n$-partite systems, $q$-$k$-ME concurrence\n$(q\\geq2,~2\\leq k\\leq n)$ and $\\alpha$-$k$-ME concurrence\n$(0\\leq\\alpha\\leq\\frac{1}{2},~2\\leq k\\leq n)$, which unambiguously detect all\n$k$-nonseparable states in arbitrary $n$-partite systems. Rigorous proofs show\nthat the proposed $k$-nonseparable measures satisfy all the requirements for\nbeing an entanglement measure including the entanglement monotone, strong\nmonotone, convexity, vanishing on all $k$-separable states, and being strictly\ngreater than zero for all $k$-nonseparable states. In particular, the $q$-2-ME\nconcurrence and $\\alpha$-2-ME concurrence, renamed as $q$-GME concurrence and\n$\\alpha$-GME concurrence, respectively, are two kinds of genuine entanglement\nmeasures corresponding the case where the systems are divided into bipartition\n$(k=2)$. The lower bounds of two classes $k$-nonseparable measures are obtained\nby employing the approach that takes into account the permutationally invariant\npart of a quantum state. And the relations between $q$-$n$-ME concurrence\n($\\alpha$-$n$-ME concurrence) and global negativity are established. In\naddition, we discuss the degree of separability and elaborate on an effective\ndetection method with concrete examples. Moreover, we compare the $q$-GME\nconcurrence defined by us to other genuine entanglement measures.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:58:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Hui",""],["Gao","Ting",""],["Yan","Fengli",""]]}
{"id":"2308.16394","submitter":"Fabian Michel","authors":"Fabian Michel","title":"Linearly Edge-Reinforced Random Walks","comments":"42 pages, 14 figures, Bachelor's Thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This thesis examines linearly edge-reinforced random walks on infinite trees.\nIn particular, recurrence and transience of such random walks on general\n(fixed) trees as well as on Galton-Watson trees (i.e. random trees) is\ncharacterized, and shown to be related to the branching number of these trees\nand a so-called reinforcement parameter. A phase transition from transience to\nrecurrence takes place at a critical parameter value. As a tool, random walks\nin random environment are introduced and known results are repeated, together\nwith detailed proofs. A result on quasi-independent percolation is proved as a\nby-product. Finally, for the edge-reinforced random walk on Z, the existence of\na kind of stationary / limiting distribution with finite moments is shown.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 01:58:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Michel","Fabian",""]]}
{"id":"2308.16395","submitter":"Saibal De","authors":"Saibal De, Zitong Li, Hemanth Kolla, Eric T. Phipps","title":"Efficient Computation of Tucker Decomposition for Streaming Scientific\n  Data Compression","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 Tucker decomposition, an extension of singular value decomposition for\nhigher-order tensors, is a useful tool in analysis and compression of\nlarge-scale scientific data. While it has been studied extensively for static\ndatasets, there are relatively few works addressing the computation of the\nTucker factorization of streaming data tensors. In this paper we propose a new\nstreaming Tucker algorithm tailored for scientific data, specifically for the\ncase of a data tensor whose size increases along a single streaming mode that\ncan grow indefinitely, which is typical of time-stepping scientific\napplications. At any point of this growth, we seek to compute the Tucker\ndecomposition of the data generated thus far, without requiring storing the\npast tensor slices in memory. Our algorithm accomplishes this by starting with\nan initial Tucker decomposition and updating its components--the core tensor\nand factor matrices--with each new tensor slice as it becomes available, while\nsatisfying a user-specified threshold of norm error. We present an\nimplementation within the TuckerMPI software framework, and apply it to\nsynthetic and combustion simulation datasets. By comparing against the standard\n(batch) decomposition algorithm we show that our streaming algorithm provides\nsignificant improvements in memory usage. If the tensor rank stops growing\nalong the streaming mode, the streaming algorithm also incurs less\ncomputational time compared to the batch algorithm.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:01:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["De","Saibal",""],["Li","Zitong",""],["Kolla","Hemanth",""],["Phipps","Eric T.",""]]}
{"id":"2308.16396","submitter":"Keita Nakai","authors":"Keita Nakai","title":"Discrete universality for Matsumoto zeta-functions and the nontrivial\n  zeros of the Riemann zeta-function","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 2017, Garunk\\v{s}tis, Laurin\\v{c}ikas and Macaitien\\.{e} proved the\ndiscrete universality theorem for the Riemann zeta-function sifted by the\nnontrivial zeros of the Riemann zeta-function. This discrete universality has\nbeen extended in various zeta-functions and $L$-functions. In this paper, we\ngeneralize this discrete universality for Matsumoto zeta-functions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:04:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nakai","Keita",""]]}
{"id":"2308.16397","submitter":"Yufei Li","authors":"Yufei Li, Lingling Hou, Pengfei Liu","title":"The Impact of Downgrading Protected Areas (PAD) on Biodiversity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We quantitatively assess the impacts of Downgrading Protected Areas (PAD) on\nbiodiversity in the U.S.. Results show that PAD events significantly reduce\nbiodiversity. The proximity to PAD events decreases the biodiversity by 26.0%\nwithin 50 km compared with records of species further away from the PAD events.\nWe observe an overall 32.3% decrease in abundance after those nearest PAD\nevents are enacted. Abundance declines more in organisms living in contact with\nwater and non-mammals. Species abundance is more sensitive to the negative\nimpacts in areas where PAD events were later reversed, as well as in areas\nclose to protected areas belonging to the International Union for Conservation\nof Nature (IUCN) category. The enacted PAD events between the period 1903 to\n2018 in the U.S. lead to economic losses of approximately $689.95 million due\nto decrease in abundance. Our results contribute to the understanding on the\nimpact of environmental interventions such as PAD events on biodiversity change\nand provide important implications on biodiversity conservation policies.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:05:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Yufei",""],["Hou","Lingling",""],["Liu","Pengfei",""]]}
{"id":"2308.16398","submitter":"Takao Yamaguchi","authors":"Koichi Nagano, Takashi Shioya, Takao Yamaguchi","title":"Two-dimensional metric spaces with curvature bounded above II","comments":"61 pages,23 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a continuation of \\cite{NSY:local}, we mainly discuss the global structure\nof two-dimensional locally compact geodesically complete metric spaces with\ncurvature bounded above. We first obtain the result on the Lipschitz homotopy\napproximations of such spaces by polyhedral spaces. We define the curvature\nmeasures on our spaces making use of the convergence of the curvature measures,\nand establish Gauss-Bonnet Theorem. We also give a characterization of such\nspaces.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:06:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nagano","Koichi",""],["Shioya","Takashi",""],["Yamaguchi","Takao",""]]}
{"id":"2308.16399","submitter":"Matthew Albert","authors":"Matthew Albert, Xiaoyi Bao, Liang Chen","title":"Complex quantum momentum due to correlation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real numbers provide a sufficient description of classical physics and all\nmeasurable phenomena; however, complex numbers are occasionally utilized as a\nconvenient mathematical tool to aid our calculations. On the other hand, the\nformalism of quantum mechanics integrates complex numbers within its\nfundamental principles, and whether this arises out of necessity or not is an\nimportant question that many have attempted to answer. Here, we will consider\ntwo electrons in a one-dimensional quantum well where the interaction potential\nbetween the two electrons is attractive as opposed to the usual repulsive\ncoulomb potential. Pairs of electrons exhibiting such effective attraction\ntowards each other occur in other settings, namely within superconductivity. We\nwill demonstrate that this attractive interaction leads to the necessity of\ncomplex momentum solutions, which further emphasizes the significance of\ncomplex numbers in quantum theory. The complex momentum solutions are solved\nusing a perturbative analysis approach in tandem with Newton's method. The\nprobability densities arising from these complex momentum solutions allow for a\ncomparison with the probability densities of the typical real momentum\nsolutions occurring from the standard repulsive interaction potential.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:09:15 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Albert","Matthew",""],["Bao","Xiaoyi",""],["Chen","Liang",""]]}
{"id":"2308.16400","submitter":"Hao Lei","authors":"Hao Lei, Jiayi Zhang, Huahua Xiao, Xiaodan Zhang, Bo Ai, and Derrick\n  Wing Kwan Ng","title":"Channel Estimation for XL-MIMO Systems with Polar-Domain Multi-Scale\n  Residual Dense Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Extremely large-scale multiple-input multiple-output (XL-MIMO) is a promising\ntechnique to enable versatile applications for future wireless\ncommunications.To realize the huge potential performance gain, accurate channel\nstate information is a fundamental technical prerequisite. In conventional\nmassive MIMO, the channel is often modeled by the far-field planar-wavefront\nwith rich sparsity in the angular domain that facilitates the design of\nlow-complexity channel estimation. However, this sparsity is not conspicuous in\nXL-MIMO systems due to the non-negligible near-field spherical-wavefront. To\naddress the inherent performance loss of the angular-domain channel estimation\nschemes, we first propose the polar-domain multiple residual dense network\n(P-MRDN) for XL-MIMO systems based on the polar-domain sparsity of the\nnear-field channel by improving the existing MRDN scheme. Furthermore, a\npolar-domain multi-scale residual dense network (P-MSRDN) is designed to\nimprove the channel estimation accuracy. Finally, simulation results reveal the\nsuperior performance of the proposed schemes compared with existing benchmark\nschemes and the minimal influence of the channel sparsity on the proposed\nschemes.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:11:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lei","Hao",""],["Zhang","Jiayi",""],["Xiao","Huahua",""],["Zhang","Xiaodan",""],["Ai","Bo",""],["Ng","Derrick Wing Kwan",""]]}
{"id":"2308.16401","submitter":"Shoko Chisaki","authors":"Shoko Chisaki, Ryoh Fuji-Hara and Nobuko Miyamoto","title":"Optimality and Constructions of Spanning Bipartite Block Designs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a statistical problem to estimate variables (effects) that are\nassociated with the edges of a complete bipartite graph $K_{v_1, v_2}=(V_1, V_2\n\\, ; E)$. Each data is obtained as a sum of selected effects, a subset of $E$.\nIn order to estimate efficiently, we propose a design called Spanning Bipartite\nBlock Design (SBBD). For SBBDs such that the effects are estimable, we proved\nthat the estimators have the same variance (variance balanced). If each block\n(a subgraph of $K_{v_1, v_2}$) of SBBD is a semi-regular or a regular bipartite\ngraph, we show that the design is A-optimum. We also show a construction of\nSBBD using an ($r,\\lambda$)-design and an ordered design. A BIBD with prime\npower blocks gives an A-optimum semi-regular or regular SBBD. At last, we\nmention that this SBBD is able to use for deep learning.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:11:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chisaki","Shoko",""],["Fuji-Hara","Ryoh",""],["Miyamoto","Nobuko",""]]}
{"id":"2308.16402","submitter":"Shoko Chisaki","authors":"Shoko Chisaki, Ryoh Fuji-Hara and Nobuko Miyamoto","title":"GDD type Spanning Bipartite Block Designs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is a one-to-one correspondence between the point set of a group\ndivisible design (GDD) with $v_1$ groups of $v_2$ points and the edge set of a\ncomplete bipartite graph $K_{v_1,v_2}$. A block of GDD corresponds to a\nsubgraph of $K_{v_1,v_2}$. A set of subgraphs of $K_{v_1,v_2}$ is constructed\nfrom a block set of GDDs. If the GDD satisfies the $\\lambda_1, \\lambda_2$\nconcurrence condition, then the set of subgraphs also satisfies the spanning\nbipartite block design (SBBD) conditions. We also propose a method to construct\nSBBD directly from an $(r,\\lambda)$-design and a difference matrix over a\ngroup. Suppose the $(r,\\lambda)$-design consists of $v_2$ points and $v_1$\nblocks. When $v_1 >> v_2$, we show a method to construct a SBBD with $v_1$ is\nclose to $v_2$ by partitioning the block set.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:12:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chisaki","Shoko",""],["Fuji-Hara","Ryoh",""],["Miyamoto","Nobuko",""]]}
{"id":"2308.16403","submitter":"Jacob Miller","authors":"Jacob Miller and Vahan Huroyan and Stephen Kobourov","title":"Balancing between the Local and Global Structures (LGS) in Graph\n  Embedding","comments":"Appears in the Proceedings of the 31st International Symposium on\n  Graph Drawing and Network Visualization (GD 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CG cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a method for balancing between the Local and Global Structures\n(LGS) in graph embedding, via a tunable parameter. Some embedding methods aim\nto capture global structures, while others attempt to preserve local\nneighborhoods. Few methods attempt to do both, and it is not always possible to\ncapture well both local and global information in two dimensions, which is\nwhere most graph drawing live. The choice of using a local or a global\nembedding for visualization depends not only on the task but also on the\nstructure of the underlying data, which may not be known in advance. For a\ngiven graph, LGS aims to find a good balance between the local and global\nstructure to preserve. We evaluate the performance of LGS with synthetic and\nreal-world datasets and our results indicate that it is competitive with the\nstate-of-the-art methods, using established quality metrics such as stress and\nneighborhood preservation. We introduce a novel quality metric, cluster\ndistance preservation, to assess intermediate structure capture. All\nsource-code, datasets, experiments and analysis are available online.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:12:46 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Miller","Jacob",""],["Huroyan","Vahan",""],["Kobourov","Stephen",""]]}
{"id":"2308.16404","submitter":"Xixuan Hao","authors":"Xixuan Hao, Aozhong Zhang, Xianze Meng and Bin Fu","title":"Deformation Robust Text Spotting with Geometric Prior","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 text spotting is to perform text detection and recognition in an\nend-to-end manner. Although the diversity of luminosity and orientation in\nscene texts has been widely studied, the font diversity and shape variance of\nthe same character are ignored in recent works, since most characters in\nnatural images are rendered in standard fonts. To solve this problem, we\npresent a Chinese Artistic Dataset, termed as ARText, which contains 33,000\nartistic images with rich shape deformation and font diversity. Based on this\ndatabase, we develop a deformation robust text spotting method (DR TextSpotter)\nto solve the recognition problem of complex deformation of characters in\ndifferent fonts. Specifically, we propose a geometric prior module to highlight\nthe important features based on the unsupervised landmark detection\nsub-network. A graph convolution network is further constructed to fuse the\ncharacter features and landmark features, and then performs semantic reasoning\nto enhance the discrimination for different characters. The experiments are\nconducted on ARText and IC19-ReCTS datasets. Our results demonstrate the\neffectiveness of our proposed method.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:13:15 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hao","Xixuan",""],["Zhang","Aozhong",""],["Meng","Xianze",""],["Fu","Bin",""]]}
{"id":"2308.16405","submitter":"Michael Heisel","authors":"Michael Heisel, Marcelo Chamecki","title":"On the departure from Monin-Obukhov surface similarity and transition to\n  the convective mixed layer","comments":"28 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large-eddy simulations are used to evaluate mean profile similarity in the\nconvective boundary layer (CBL). Particular care is taken regarding the grid\nsensitivity of the profiles and the mitigation of inertial oscillations in the\nsimulation spin-up. The nondimensional gradients $\\phi$ for wind speed and air\ntemperature generally align with Monin-Obukhov similarity across cases but have\na steeper slope than predicted within each profile. The same trend has been\nnoted in several other recent studies. The Businger-Dyer relations are modified\nhere with an exponential cutoff term to account for the decay in $\\phi$ to\nfirst-order approximation, yielding improved similarity from approximately\n0.05$z_i$ to above 0.3$z_i$, where $z_i$ is the CBL depth. The necessity for\nthe exponential correction is attributed to an extended transition from surface\nscaling to zero gradient in the mixed layer, where the departure from\nMonin-Obukhov similarity is negligible at the surface but becomes substantial\nwell below the conventional surface layer height of 0.1$z_i$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:14:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Heisel","Michael",""],["Chamecki","Marcelo",""]]}
{"id":"2308.16406","submitter":"Zehao Dong","authors":"Zehao Dong, Weidong Cao, Muhan Zhang, Dacheng Tao, Yixin Chen, Xuan\n  Zhang","title":"CktGNN: Circuit Graph Neural Network for Electronic Design Automation","comments":"Accepted by ICLR (International Conference on Learning\n  Representations) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The electronic design automation of analog circuits has been a longstanding\nchallenge in the integrated circuit field due to the huge design space and\ncomplex design trade-offs among circuit specifications. In the past decades,\nintensive research efforts have mostly been paid to automate the transistor\nsizing with a given circuit topology. By recognizing the graph nature of\ncircuits, this paper presents a Circuit Graph Neural Network (CktGNN) that\nsimultaneously automates the circuit topology generation and device sizing\nbased on the encoder-dependent optimization subroutines. Particularly, CktGNN\nencodes circuit graphs using a two-level GNN framework (of nested GNN) where\ncircuits are represented as combinations of subgraphs in a known subgraph\nbasis. In this way, it significantly improves design efficiency by reducing the\nnumber of subgraphs to perform message passing. Nonetheless, another critical\nroadblock to advancing learning-assisted circuit design automation is a lack of\npublic benchmarks to perform canonical assessment and reproducible research. To\ntackle the challenge, we introduce Open Circuit Benchmark (OCB), an\nopen-sourced dataset that contains $10$K distinct operational amplifiers with\ncarefully-extracted circuit specifications. OCB is also equipped with\ncommunicative circuit generation and evaluation capabilities such that it can\nhelp to generalize CktGNN to design various analog circuits by producing\ncorresponding datasets. Experiments on OCB show the extraordinary advantages of\nCktGNN through representation-based optimization frameworks over other recent\npowerful GNN baselines and human experts' manual designs. Our work paves the\nway toward a learning-based open-sourced design automation for analog circuits.\nOur source code is available at \\url{https://github.com/zehao-dong/CktGNN}.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:20:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dong","Zehao",""],["Cao","Weidong",""],["Zhang","Muhan",""],["Tao","Dacheng",""],["Chen","Yixin",""],["Zhang","Xuan",""]]}
{"id":"2308.16407","submitter":"Takao Morinari","authors":"Daiki Sasamoto and Takao Morinari","title":"General Formula for the Green's Function Approach to the Spin-1/2\n  Antiferromagnetic Heisenberg Model","comments":"7 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":"  A wide range of analytical and numerical methods are available to study\nquantum spin systems. However, the complexity of spin correlations and\ninteractions limits their applicability to specific temperature ranges. The\nanalytical approach utilizing Green's function has proved advantageous, as it\nallows for formulation without restrictions on the presence of long-range order\nand facilitates estimation of the spin excitation spectrum and thermodynamic\nquantities across the entire temperature range. In this work, we present a\ngeneralized formulation of the Green's function method that can be applied to\ndiverse spin systems. As specific applications, we consider the hypercubic\nlattice and the $J_1$-$J_2$ model. For the cubic lattice case, the Green's\nfunction approach provides a good estimation for the transition temperature.\nRegarding the $J_1$-$J_2$ model, we include nematic correlations in the\nanalysis and find no signature of such correlations, though accurate numerical\ncalculations are required in the presence of strong frustration. Although our\nfocus is on the spin one-half antiferromagnetic Heisenberg model on an\narbitrary lattice, the Green's function approach can be generalized to\nincorporate other interactions and higher spin values.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:23:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sasamoto","Daiki",""],["Morinari","Takao",""]]}
{"id":"2308.16408","submitter":"Mehdi Behroozi","authors":"Mehdi Behroozi and Dinghao Ma","title":"Last Mile Delivery with Drones and Sharing Economy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a combined system of regular delivery trucks and crowdsourced\ndrones, available via a sharing economy platform, to provide a\ntechnology-assisted crowd-based last-mile delivery experience. We develop\nanalytical models and methods for a system in which package delivery is\nperformed by a big truck carrying many packages to a neighborhood or a town in\na metropolitan area and then the packages are assigned to crowdsourced drone\noperators to deliver them to their final destinations. We develop several\noptimization models for various cases of the problem and use a combination of\nheuristic algorithms to solve this NP-hard problem. Finally, we present\ncomputational results for the models and algorithms, and conduct an exhaustive\nsensitivity analysis to check the influence of different parameters and\nassumptions on the final results. We also provide extensive managerial insights\non the benefits of our proposed model if implemented in practice.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:24:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Behroozi","Mehdi",""],["Ma","Dinghao",""]]}
{"id":"2308.16409","submitter":"Ting Gao","authors":"Mengying Hu, Ting Gao, Fengli Yan","title":"Strong quantum nonlocality with genuine entanglement in an $N$-qutrit\n  system","comments":"12 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we construct genuinely multipartite entangled bases in\n$(\\mathbb{C}^{3})^{\\otimes N}$ for $N\\geq3$, where every state is one-uniform\nstate. By modifying this construction, we successfully obtain strongly nonlocal\northogonal genuinely entangled sets and strongly nonlocal orthogonal genuinely\nentangled bases, which provide an answer to the open problem raised by Halder\n$et~al.$\n[\\href{https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.122.040403}\n{Phy. Rev. Lett. \\textbf{122}, 040403 (2019)}]. The strongly nonlocal\northogonal genuine entangled set we constructed in $(\\mathbb{C}^{3})^{\\otimes\nN}$ contains much fewer quantum states than all known ones. When $N>3$, our\nresult answers the open question given by Wang $et~al$.\n[\\href{https://journals.aps.org/pra/abstract/10.1103/PhysRevA.104.012424}\n{Phys. Rev. A \\textbf{104}, 012424 (2021)}].\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:31:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hu","Mengying",""],["Gao","Ting",""],["Yan","Fengli",""]]}
{"id":"2308.16410","submitter":"Th\\'ai Th\\`anh Nguy\\^en","authors":"T\\`ai Huy H\\`a, Arvind Kumar, Hop D. Nguyen, Thai Thanh Nguyen","title":"Resurgence number of graded families of ideals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We define the resurgence and asymptotic resurgence numbers associated to a\npair of graded families of ideals in a Noetherian ring. These notions\ngeneralize the well-studied resurgence and asymptotic resurgence of an ideal in\na polynomial ring. We examine when these invariant are finite and rational. We\ninvestigate situations where these invariant can be computed via Rees\nvaluations or realized as actual limits of well-defined sequences. We study how\nthe asymptotic resurgence changes when a family is replaced by its integral\nclosure. Many examples are given to illustrate that whether or not known\nproperties of resurgence and asymptotic resurgence of an ideal would extend to\nthat of a pair of graded families of ideals generally depends on the Noetherian\nproperty and finite generation of the Rees algebras of these families.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:48:16 GMT"}],"update_date":"2023-09-01","authors_parsed":[["H\u00e0","T\u00e0i Huy",""],["Kumar","Arvind",""],["Nguyen","Hop D.",""],["Nguyen","Thai Thanh",""]]}
{"id":"2308.16411","submitter":"William Bialek","authors":"William Bialek","title":"Keith Brueckner (1924-2014). A biographical memoir","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Keith Brueckner was a theoretical physicist of considerable technical power\nwho came of age as the mysteries of the atomic nucleus were coming into focus.\nHis fundamental contributions to the \"many-body problem\" had a lasting impact\non our understanding of how the macroscopic behavior of matter emerges from the\nunderlying microscopic rules. A passionate and accomplished mountain climber,\nhe listed the American Alpine Club below the National Academy of Sciences on\nhis vitae. During decades of complex interactions between the physics community\nand the United States government, he helped build structures that allowed him\nand many others to provide advice on classified matters, but also actively\nraised funds to support opposition to the war in Vietnam. At the peak of his\ncareer, he left the Ivy League to help found and build a new university in a\nsmall village filled with Marines and retirees - La Jolla, California.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:49:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bialek","William",""]]}
{"id":"2308.16412","submitter":"Yaquan Fang","authors":"Yaquan Fang","title":"Instantaneous Symmetry Breaking to the Non-observed Dark Matter","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A theory explaining the non-observation of the dark matter and the source of\nthe dark energy is presented in this letter. By integrating the asymmetrical\npotential and the Higgs potential, we provide a model with instantaneous\nsymmetrical breaking and stable symmetrical breaking, resulting in the\nnon-observed dark matter and observed matter respectively. Two crucial\nparameters in this model are the frequency and strength of the symmetry\nbreaking from the vacuum: the former helps explain the impact of the effective\nmass from the dark matter; the latter determines the source of the dark energy.\nThe expected strength in a certain period varies, causing the accelerating or\ndeccelerating expansions of the universe. Considering the expected strength\ncorrelated with the vacuum expectation value and basing on the possible\nvariations of the measured masses of the fundamental particles such as Z boson\nover time, one can perhaps derive the exact stage of the current universe.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:49:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fang","Yaquan",""]]}
{"id":"2308.16413","submitter":"Peng Yang","authors":"Yuxin Kong, Peng Yang, Yan Cheng","title":"Edge-Assisted On-Device Model Update for Video Analytics in Adverse\n  Environments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While large deep neural networks excel at general video analytics tasks, the\nsignificant demand on computing capacity makes them infeasible for real-time\ninference on resource-constrained end cam-eras. In this paper, we propose an\nedge-assisted framework that continuously updates the lightweight model\ndeployed on the end cameras to achieve accurate predictions in adverse\nenvironments. This framework consists of three modules, namely, a key frame\nextractor, a trigger controller, and a retraining manager. The low-cost key\nframe extractor obtains frames that can best represent the current environment.\nThose frames are then transmitted and buffered as the retraining data for model\nupdate at the edge server. Once the trigger controller detects a significant\naccuracy drop in the selected frames, the retraining manager outputs the\noptimal retraining configuration balancing the accuracy and time cost. We\nprototype our system on two end devices of different computing capacities with\none edge server. The results demonstrate that our approach significantly\nimproves accuracy across all tested adverse environment scenarios (up to 24%)\nand reduces more than 50% of the retraining time compared to existing\nbenchmarks.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:54:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kong","Yuxin",""],["Yang","Peng",""],["Cheng","Yan",""]]}
{"id":"2308.16414","submitter":"Teruaki Kitano","authors":"Teruaki Kitano, Yoshihiko Mitsumatsu and Shigeyuki Morita","title":"Remarks on flat $S^1$-bundles, $C^\\infty$ vs $C^\\omega$","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe low dimensional homology groups of $\\mathrm{Diff}^\\delta_+S^1$ in\nterms of Haefliger's classifying space $B\\overline{\\Gamma}_1$ by applying a\ntheorem of Thurston. Then we consider the question whether some power of the\nrational Euler class vanishes for real analytic flat $S^1$-bundles. We show\nthat if it occurs, then the homology group of $\\mathrm{Diff}_+^{\\omega,\\delta}\nS^1$ should contain two kinds of many torsion classes which vanish in\n$\\mathrm{Diff}^\\delta_+S^1$. This is an informal note on our discussions about\nthe above question.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:58:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kitano","Teruaki",""],["Mitsumatsu","Yoshihiko",""],["Morita","Shigeyuki",""]]}
{"id":"2308.16415","submitter":"Kyuhong Shim","authors":"Kyuhong Shim, Jinkyu Lee, Simyung Chang, Kyuwoong Hwang","title":"Knowledge Distillation from Non-streaming to Streaming ASR Encoder using\n  Auxiliary Non-streaming Layer","comments":"Accepted to Interspeech 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL eess.AS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Streaming automatic speech recognition (ASR) models are restricted from\naccessing future context, which results in worse performance compared to the\nnon-streaming models. To improve the performance of streaming ASR, knowledge\ndistillation (KD) from the non-streaming to streaming model has been studied,\nmainly focusing on aligning the output token probabilities. In this paper, we\npropose a layer-to-layer KD from the teacher encoder to the student encoder. To\nensure that features are extracted using the same context, we insert auxiliary\nnon-streaming branches to the student and perform KD from the non-streaming\nteacher layer to the non-streaming auxiliary layer. We design a special KD loss\nthat leverages the autoregressive predictive coding (APC) mechanism to\nencourage the streaming model to predict unseen future contexts. Experimental\nresults show that the proposed method can significantly reduce the word error\nrate compared to previous token probability distillation methods.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 02:58:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shim","Kyuhong",""],["Lee","Jinkyu",""],["Chang","Simyung",""],["Hwang","Kyuwoong",""]]}
{"id":"2308.16416","submitter":"Ben Ripley","authors":"B. T. E. Ripley, D. Baillie, and P. B. Blakie","title":"Two-dimensional supersolidity in a planar dipolar Bose gas","comments":"10 pages, 8 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 crystalline stationary states of a dipolar Bose-Einstein\ncondensate in a planar trapping geometry. Our focus is on the ground state\nphase diagram in the thermodynamic limit, where triangular, honeycomb and\nstripe phases occur. We quantify the superfluid fraction by calculating the\nnon-classical translational inertia, which allows us to identify favorable\nparameter regimes for observing supersolid ground states. We develop two\nsimplified theories to approximately describe the ground states, and consider\nthe relationship to roton softening in the uniform ground state. This also\nallows us to extend the phase diagram to the low density regime. While the\ntriangular and honeycomb states have an isotropic superfluid response tensor,\nthe stripe state exhibits anisotropic superfluidity.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:01:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ripley","B. T. E.",""],["Baillie","D.",""],["Blakie","P. B.",""]]}
{"id":"2308.16417","submitter":"Peng Yang","authors":"Yan Cheng, Peng Yang, Ning Zhang, Jiawei Hou","title":"Edge-Assisted Lightweight Region-of-Interest Extraction and Transmission\n  for Vehicle Perception","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To enhance on-road environmental perception for autonomous driving, accurate\nand real-time analytics on high-resolution video frames generated from on-board\ncameras be-comes crucial. In this paper, we design a lightweight object\nlocation method based on class activation mapping (CAM) to rapidly capture the\nregion of interest (RoI) boxes that contain driving safety related objects from\non-board cameras, which can not only improve the inference accuracy of vision\ntasks, but also reduce the amount of transmitted data. Considering the limited\non-board computation resources, the RoI boxes extracted from the raw image are\noffloaded to the edge for further processing. Considering both the dynamics of\nvehicle-to-edge communications and the limited edge resources, we propose an\nadaptive RoI box offloading algorithm to ensure prompt and accurate inference\nby adjusting the down-sampling rate of each box. Extensive experimental results\non four high-resolution video streams demonstrate that our approach can\neffectively improve the overall accuracy by up to 16% and reduce the\ntransmission demand by up to 49%, compared with other benchmarks.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:03:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cheng","Yan",""],["Yang","Peng",""],["Zhang","Ning",""],["Hou","Jiawei",""]]}
{"id":"2308.16418","submitter":"Peng Yang","authors":"Yuanyi He, Peng Yang, Tian Qin, Ning Zhang","title":"End-Edge Coordinated Joint Encoding and Neural Enhancement for Low-Light\n  Video Analytics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate video analytics in low-light environments, and\npropose an end-edge coordinated system with joint video encoding and\nenhancement. It adaptively transmits low-light videos from cameras and performs\nenhancement and inference tasks at the edge. Firstly, according to our\nobservations, both encoding and enhancement for low-light videos have a\nsignificant impact on inference accuracy, which directly influences bandwidth\nand computation overhead. Secondly, due to the limitation of built-in\ncomputation resources, cameras perform encoding and transmitting frames to the\nedge. The edge executes neural enhancement to process low contrast, detail\nloss, and color distortion on low-light videos before inference. Finally, an\nadaptive controller is designed at the edge to select quantization parameters\nand scales of neural enhancement networks, aiming to improve the inference\naccuracy and meet the latency requirements. Extensive real-world experiments\ndemon-strate that, the proposed system can achieve a better trade-off between\ncommunication and computation resources and optimize the inference accuracy.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:09:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["He","Yuanyi",""],["Yang","Peng",""],["Qin","Tian",""],["Zhang","Ning",""]]}
{"id":"2308.16419","submitter":"Peng Yang","authors":"Qingxuan Feng, Peng Yang, Zhixuan Huang, Jiayin Chen, Ning Zhang","title":"Deadline Aware Two-Timescale Resource Allocation for VR Video Streaming","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate resource allocation problem in the context of\nmultiple virtual reality (VR) video flows sharing a certain link, considering\nspecific deadline of each video frame and the impact of different frames on\nvideo quality. Firstly, we establish a queuing delay bound estimation model,\nenabling link node to proactively discard frames that will exceed the deadline.\nSecondly, we model the importance of different frames based on viewport feature\nof VR video and encoding method. Accordingly, the frames of each flow are\nsorted. Then we formulate a problem of minimizing long-term quality loss caused\nby frame dropping subject to per-flow quality guarantee and bandwidth\nconstraints. Since the frequency of frame dropping and network fluctuation are\nnot on the same time scale, we propose a two-timescale resource allocation\nscheme. On the long timescale, a queuing theory based resource allocation\nmethod is proposed to satisfy quality requirement, utilizing frame queuing\ndelay bound to obtain minimum resource demand for each flow. On the short\ntimescale, in order to quickly fine-tune allocation results to cope with the\nunstable network state, we propose a low-complexity heuristic algorithm,\nscheduling available resources based on the importance of frames in each flow.\nExtensive experimental results demonstrate that the proposed scheme can\nefficiently improve quality and fairness of VR video flows under various\nnetwork conditions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:12:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Feng","Qingxuan",""],["Yang","Peng",""],["Huang","Zhixuan",""],["Chen","Jiayin",""],["Zhang","Ning",""]]}
{"id":"2308.16420","submitter":"Junzhang Ma Prof.","authors":"Xin Liang, Zihan Lin, Jun Zhang, Jianfa Zhao, Shiyu Feng, Wenlong Lu,\n  Guodong Wang, Luchuan Shi, Ningning Wang, Pengfei Shan, Muntaser Naamneh,\n  Runzhe Liu, Bastien Michon, Jinguang Cheng, Changqing Jin, Yang Ren, Junzhang\n  Ma","title":"Observation of Flat band and Van Hove Singularity in Nitrogen Doped\n  Lutetium Hydride","comments":"26 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hydrogen-rich materials offer a compelling avenue towards room temperature\nsuperconductivity, albeit under ultra-high pressure. However, the high-pressure\nenvironment imposes formidable constraints to investigate the electronic band\nstructure. Even under ambient pressure, the research remains elusive, due to\nthe inherent instability of most of the hydrogen-rich materials upon pressure\nrelease. Very recently, high temperature superconductivity has been reported in\npressurized lutetium hydrides (~71 K) and nitrogen doped lutetium hydride (~294\nK), with the later under debate. Upon decompression, nitrogen doped lutetium\nhydride manifests a stable metallic phase with dark blue color. This\ntransformation engenders an unprecedented opportunity, allowing for the\nexperimental investigation of the electronic band structure intrinsic to\nhydrogen-rich material. In this work, using angle resolved photoemission\nspectroscopy to investigate the nitrogen doped lutetium hydride, we observed\nsignificant flat band and a Van Hove singularity marginally below the Fermi\nlevel. These salient features, identified as critical elements, proffer\npotential amplifiers for the realization of heightened superconductivity,\npotentially extending to room temperature, as evidenced by prior research. Our\nresults not only unveil a confluence of potent strong correlation effects and\nanisotropy within the Lu-H-N compound, but also provide a prospect for\nengineering high temperature superconductivity through the strategic\nmanipulation of flat band and the VHS, effectively tailoring their alignment\nwith the Fermi energy.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:15:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liang","Xin",""],["Lin","Zihan",""],["Zhang","Jun",""],["Zhao","Jianfa",""],["Feng","Shiyu",""],["Lu","Wenlong",""],["Wang","Guodong",""],["Shi","Luchuan",""],["Wang","Ningning",""],["Shan","Pengfei",""],["Naamneh","Muntaser",""],["Liu","Runzhe",""],["Michon","Bastien",""],["Cheng","Jinguang",""],["Jin","Changqing",""],["Ren","Yang",""],["Ma","Junzhang",""]]}
{"id":"2308.16421","submitter":"Vishwaas Narasinh","authors":"Vishwaas Narasinh, Senthil Raja G","title":"Sequential Pitch Distributions for Raga Detection","comments":"16 pages, 6 figures, AI Music Creativity","journal-ref":"AIMC 2023. Retrieved from https://aimc2023.pubpub.org/pub/j9v30p0j","doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Raga is a fundamental melodic concept in Indian Art Music (IAM). It is\ncharacterized by complex patterns. All performances and compositions are based\non the raga framework. Raga and tonic detection have been a long-standing\nresearch problem in the field of Music Information Retrieval. In this paper, we\nattempt to detect the raga using a novel feature to extract sequential or\ntemporal information from an audio sample. We call these Sequential Pitch\nDistributions (SPD), which are distributions taken over pitch values between\ntwo given pitch values over time. We also achieve state-of-the-art results on\nboth Hindustani and Carnatic music raga data sets with an accuracy of 99% and\n88.13%, respectively. SPD gives a great boost in accuracy over a standard pitch\ndistribution. The main goal of this paper, however, is to present an\nalternative approach to modeling the temporal aspects of the melody and thereby\ndeducing the raga.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:15:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Narasinh","Vishwaas",""],["G","Senthil Raja",""]]}
{"id":"2308.16422","submitter":"Zhixiang Ren","authors":"Tianyu Zhao, Yue Zhou, Ruijun Shi, Zhoujian Cao, Zhixiang Ren","title":"DECODE: DilatEd COnvolutional neural network for Detecting\n  Extreme-mass-ratio inspirals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM cs.LG gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The detection of Extreme Mass Ratio Inspirals (EMRIs) is intricate due to\ntheir complex waveforms, extended duration, and low signal-to-noise ratio\n(SNR), making them more challenging to be identified compared to compact binary\ncoalescences. While matched filtering-based techniques are known for their\ncomputational demands, existing deep learning-based methods primarily handle\ntime-domain data and are often constrained by data duration and SNR. In\naddition, most existing work ignores time-delay interferometry (TDI) and\napplies the long-wavelength approximation in detector response calculations,\nthus limiting their ability to handle laser frequency noise. In this study, we\nintroduce DECODE, an end-to-end model focusing on EMRI signal detection by\nsequence modeling in the frequency domain. Centered around a dilated causal\nconvolutional neural network, trained on synthetic data considering TDI-1.5\ndetector response, DECODE can efficiently process a year's worth of\nmultichannel TDI data with an SNR of around 50. We evaluate our model on 1-year\ndata with accumulated SNR ranging from 50 to 120 and achieve a true positive\nrate of 96.3% at a false positive rate of 1%, keeping an inference time of less\nthan 0.01 seconds. With the visualization of three showcased EMRI signals for\ninterpretability and generalization, DECODE exhibits strong potential for\nfuture space-based gravitational wave data analyses.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:16:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhao","Tianyu",""],["Zhou","Yue",""],["Shi","Ruijun",""],["Cao","Zhoujian",""],["Ren","Zhixiang",""]]}
{"id":"2308.16423","submitter":"Tomasz Polak T.P.","authors":"A. Krzywicka T. P. Polak","title":"Reentrant phase behavior in systems with density-induced tunneling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.other cond-mat.stat-mech cond-mat.supr-con quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Open many body quantum systems play a paramount role in various branches of\nphysics, such as quantum information, nonlinear optics or condensed matter. The\ndissipative character of open systems has gained a lot of interest especially\nwithin the fields of quantum optics, due to unprecedented stabilization of\nquantum coherence, and quantum information, with its desire to control\nenvironmental degrees of freedom. We look beyond the typical mechanism of\ndissipation associated with an external source and show that strongly\ninteracting many particle systems can create quantum decoherence within\nthemselves. We study a quantum bosonic two-dimensional many body system with\nextended interactions between particles. Analytical calculations show that the\nsystem can be driven out of its coherent state, which is prevalent among\ncommonly used setups. However, we also observe a revival of the superfluid\nphase within the same framework for sufficiently large interaction strength.\nThe breakdown of quantum coherence is inevitable, but can be misinterpreted if\none assumes improper coupling between the constituents of the many particle\nsystem. We show an adequate path to retrieve physically relevant results and\nconsider its limitations. The system displays a natural cutoff that enforces\nthe breakdown of superfluidity.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:24:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Polak","A. Krzywicka T. P.",""]]}
{"id":"2308.16424","submitter":"Hiroyuki Masaki","authors":"Hiroyuki Masaki, Hideyuki Hotta, Yukio Katukawa, Ryohtaroh T. Ishikawa","title":"Solar horizontal flow evaluation using neural network and numerical\n  simulation with snapshot data","comments":"13 pages, 20 figures, accepted for publication in pasj","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We suggest a method that evaluates the horizontal velocity in the solar\nphotosphere with easily observable values using a combination of neural network\nand radiative magnetohydrodynamics simulations. All three-component velocities\nof thermal convection on the solar surface have important roles in generating\nwaves in the upper atmosphere. However, the velocity perpendicular to the line\nof sight (LoS) is difficult to observe. To deal with this problem, the local\ncorrelation tracking (LCT) method, which employs the difference between two\nimages, has been widely used, but LCT has several disadvantages. We develop a\nmethod that evaluates the horizontal velocity from a snapshot of the intensity\nand the LoS velocity with a neural network. We use data from numerical\nsimulations for training the neural network. While two consecutive intensity\nimages are required for LCT, our network needs just one intensity image at only\na specific moment for input. From these input array, our network outputs a\nsame-size array of two-component velocity field. With only the intensity data,\nthe network achieves a high correlation coefficient between the simulated and\nevaluated velocities of 0.83. In addition, the network performance can be\nimproved when we add LoS velocity for input, enabling achieving a correlation\ncoefficient of 0.90. Our method is also applied to observed data.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:28:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Masaki","Hiroyuki",""],["Hotta","Hideyuki",""],["Katukawa","Yukio",""],["Ishikawa","Ryohtaroh T.",""]]}
{"id":"2308.16425","submitter":"Zenan Ling","authors":"Zenan Ling, Zhenyu Liao, Robert C. Qiu","title":"On the Equivalence between Implicit and Explicit Neural Networks: A\n  High-dimensional Viewpoint","comments":"Accepted by Workshop on High-dimensional Learning Dynamics, ICML\n  2023, Honolulu, Hawaii","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Implicit neural networks have demonstrated remarkable success in various\ntasks. However, there is a lack of theoretical analysis of the connections and\ndifferences between implicit and explicit networks. In this paper, we study\nhigh-dimensional implicit neural networks and provide the high dimensional\nequivalents for the corresponding conjugate kernels and neural tangent kernels.\nBuilt upon this, we establish the equivalence between implicit and explicit\nnetworks in high dimensions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:28:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ling","Zenan",""],["Liao","Zhenyu",""],["Qiu","Robert C.",""]]}
{"id":"2308.16426","submitter":"Yasuaki Kobayashi","authors":"Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono","title":"Enumerating minimal vertex covers and dominating sets with capacity\n  and/or connectivity constraints","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider the problems of enumerating minimal vertex covers\nand minimal dominating sets with capacity and/or connectivity constraints. We\ndevelop polynomial-delay enumeration algorithms for these problems on\nbounded-degree graphs. For the case of minimal connected vertex cover, our\nalgorithm runs in polynomial delay even on the class of $d$-claw free graphs,\nwhich extends the result on bounded-degree graphs. To complement these\nalgorithmic results, we show that the problems of enumerating minimal connected\nvertex covers and minimal capacitated vertex covers in bipartite graphs are at\nleast as hard as enumerating minimal transversals in hypergraphs.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:30:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kobayashi","Yasuaki",""],["Kurita","Kazuhiro",""],["Matsui","Yasuko",""],["Ono","Hirotaka",""]]}
{"id":"2308.16427","submitter":"Seoung Dal Jung","authors":"Xueshan Fu, Seoung Dal Jung","title":"Generalized Chen's conjecture for biharmonic maps on foliations","comments":"14 pages. arXiv admin note: text overlap with arXiv:2212.05639","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 prove the generalized Chen's conjecture for\n(F,F')-biharmonic map, which is a critical point of the transversal bienergy\nfunctional\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:31:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fu","Xueshan",""],["Jung","Seoung Dal",""]]}
{"id":"2308.16428","submitter":"Maico Felipe Silva Ribeiro","authors":"R. Ara\\'ujo dos Santos, A. Menegon, M. Ribeiro, J. Seade and I. D.\n  Santamaria Guar\\'in","title":"On the topology of the Milnor Boundary for real analytic singularities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the topology of the boundaries of the Milnor fibers of real\nanalytics map-germs $f: (\\mathbb{R}^M,0) \\to (\\mathbb{R}^K,0)$ and\n$f_{I}:=\\Pi_{I}\\circ f : (\\mathbb{R}^M,0) \\to (\\mathbb{R}^I,0)$ that admit\nMilnor's tube fibrations, where $\\Pi_{I}:(\\mathbb{R}^K,0)\\to\n(\\mathbb{R}^{I},0)$ is the canonical projection for $1\\leq I<K.$ For each $I$\nwe prove that the Milnor boundary $\\partial F_{I}$ is given by the double of\nthe Milnor tube fiber $F_{I+1}.$ We prove that if $K-I\\geq 2$, then the pair\n$(\\partial F_{I},\\partial F_{f})$ is a generalized $(K-I-1)$-open-book\ndecomposition with binding $\\partial F_{f}$ and page $F_{f} \\setminus \\partial\nF_{f}$ - the interior of the Milnor fibre $F_{f}$ (see the definition below).\nThis allows us to prove several new Euler characteristic formulae connecting\nthe Milnor boundaries $\\partial F_{f},$ $\\partial F_{I},$ with the respectives\nlinks $\\mathcal{L}_{f}, \\mathcal{L}_{I},$ for each $1\\leq I<K,$ and a\nL\\^e-Greuel type formula for the Milnor boundary.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:31:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Santos","R. Ara\u00fajo dos",""],["Menegon","A.",""],["Ribeiro","M.",""],["Seade","J.",""],["Guar\u00edn","I. D. Santamaria",""]]}
{"id":"2308.16429","submitter":"Zhi Zhou","authors":"Tianhao Hu, Bangti Jin, Zhi Zhou","title":"Solving Poisson Problems in Polygonal Domains with Singularity Enriched\n  Physics Informed Neural Networks","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Physics informed neural networks (PINNs) represent a very powerful class of\nnumerical solvers for partial differential equations using deep neural\nnetworks, and have been successfully applied to many diverse problems. However,\nwhen applying the method to problems involving singularity, e.g., point sources\nor geometric singularities, the obtained approximations often have low\naccuracy, due to limited regularity of the exact solution. In this work, we\ninvestigate PINNs for solving Poisson equations in polygonal domains with\ngeometric singularities and mixed boundary conditions. We propose a novel\nsingularity enriched PINN (SEPINN), by explicitly incorporating the singularity\nbehavior of the analytic solution, e.g., corner singularity, mixed boundary\ncondition and edge singularities, into the ansatz space, and present a\nconvergence analysis of the scheme. We present extensive numerical simulations\nin two and three-dimensions to illustrate the efficiency of the method, and\nalso a comparative study with existing neural network based approaches.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:35:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hu","Tianhao",""],["Jin","Bangti",""],["Zhou","Zhi",""]]}
{"id":"2308.16430","submitter":"Pramit Rej","authors":"Pramit Rej and Piyali Bhar","title":"Relativistic isotropic stellar model in $f(R,\\,T)$ gravity with\n  Durgapal- IV Metric","comments":"17 pages, 9 figures, 2 tables. arXiv admin note: text overlap with\n  arXiv:2212.07810","journal-ref":"New Astronomy New Astronomy, Volume 105, January 2024, 102113","doi":"10.1016/j.newast.2023.102113","report-no":null,"categories":"gr-qc astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, a new static, non-singular, spherically symmetric fluid model\nhas been obtained in the background of $f(R,\\,T)$ gravity. Here we consider the\nisotropic metric potentials of Durgapal-IV [M.C. Durgapal, J. Phys. A {\\bf 15}\n2637 (1982)] solution as input to handle the Einstein field equations in\n$f(R,\\,T)$ environment. For different coupling parameter values of $\\chi$,\ngraphical representations of the physical parameters have been demonstrated to\ndescribe the analytical results more clearly. It should be highlighted that the\nresults of General Relativity (GR) are given by $\\chi=0$. With the use of both\nanalytical discussion and graphical illustrations, a thorough comparison of our\nresults with the GR outcomes is also covered. The numerical values of the\nvarious physical attributes have been given for various coupling parameter\n$\\chi$ values in order to discuss the impact of this parameter. Here we apply\nour solution by considering the compact star candidate LMC X-4 [M.L. Rawls et\nal., Astrophys. J. {\\bf 730} 25 (2011)] with mass$=(1.04 \\pm 0.09)M_{\\odot}$\nand radius $= 8.301_{-0.2}^{+0.2}$ km. respectively, to analyze both\nanalytically and graphically. To confirm the physical acceptance of our model,\nwe discuss certain physical properties of our obtained solution such as energy\nconditions, causality, hydrostatic equilibrium through a modified\nTolman-Oppenheimer-Volkoff (TOV) conservation equation, pressure-density ratio,\netc. Also, our solution is well-behaved and free from any singularity at the\ncenter. From our present study, it is observed that all of our obtained results\nfall within the physically admissible regime, indicating the viability of our\nmodel.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:37:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Rej","Pramit",""],["Bhar","Piyali",""]]}
{"id":"2308.16431","submitter":"Pamela Burrage","authors":"Pamela M. Burrage, Hasitha N. Weerasinghe, Kevin Burrage","title":"Using a library of chemical reactions to fit systems of ordinary\n  differential equations to agent-based models: a machine learning approach","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper we introduce a new method based on a library of chemical\nreactions for constructing a system of ordinary differential equations from\nstochastic simulations arising from an agent-based model. The advantage of this\napproach is that this library respects any coupling between systems components,\nwhereas the SINDy algorithm (introduced by Brunton, Proctor and Kutz) treats\nthe individual components as decoupled from one another. Another advantage of\nour approach is that we can use a non-negative least squares algorithm to find\nthe non-negative rate constants in a very robust, stable and simple manner. We\nillustrate our ideas on an agent-based model of tumour growth on a 2D lattice.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:42:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Burrage","Pamela M.",""],["Weerasinghe","Hasitha N.",""],["Burrage","Kevin",""]]}
{"id":"2308.16432","submitter":"Vorapong Suppakitpaisarn","authors":"Pengchang Ren and Reiji Suda and Vorapong Suppakitpaisarn","title":"Efficient Additions and Montgomery Reductions of Large Integers for SIMD","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper presents efficient algorithms, designed to leverage SIMD for\nperforming Montgomery reductions and additions on integers larger than 512\nbits. The existing algorithms encounter inefficiencies when parallelized using\nSIMD due to extensive dependencies in both operations, particularly noticeable\nin costly operations like ARM's SVE. To mitigate this problem, a novel addition\nalgorithm is introduced that simulates the addition of large integers using a\nsmaller addition, quickly producing the same set of carries. These carries are\nthen utilized to perform parallel additions on large integers. For Montgomery\nreductions, serial multiplications are replaced with precomputations that can\nbe effectively calculated using SIMD extensions. Experimental evidence\ndemonstrates that these proposed algorithms substantially enhance the\nperformance of state-of-the-art implementations of several post-quantum\ncryptography algorithms. Notably, they deliver a 30% speed-up from the latest\nCTIDH implementation, an 11% speed-up from the latest CSIDH implementation in\nAVX-512 processors, and a 7% speed-up from Microsoft's standard PQCrypto-SIDH\nfor SIKEp503 on A64FX.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:44:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ren","Pengchang",""],["Suda","Reiji",""],["Suppakitpaisarn","Vorapong",""]]}
{"id":"2308.16433","submitter":"Shoichiro Kawase","authors":"Shoichiro Kawase, Takuya Murota, Hiroya Fukuda, Masaya Oishi, Teppei\n  Kawata, Kentaro Kitafuji, Seiya Manabe, Yukinobu Watanabe, Hiroki Nishibata,\n  Shintaro Go, Tamito Kai, Yuto Nagata, Taiga Muto, Yuichi Ishibashi, Megumi\n  Niikura, Daisuke Suzuki, Teiichiro Matsuzaki, Katsuhiko Ishida, Rurie Mizuno,\n  Noritaka Kitamura","title":"Effect of large-angle incidence on particle identification performance\n  for light-charged ($Z \\le 2$) particles by pulse shape analysis with a\n  pad-type nTD silicon detector","comments":"8 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, particle discrimination methods based on digital waveform\nanalysis techniques for neutron-transmutation-doped silicon (nTD-Si) detectors\nhave become widely used for the identification of low-energy charged particles.\nAlthough the particle discrimination capability of this method has been well\ndemonstrated for small incident angles, the particle discrimination performance\nmay be affected by changes in the detector response when the detector is moved\ncloser to the charged particle source and the incident position distribution\nand incident angle distribution to the detector become wide. In this study, we\nperformed a beam test for particle discrimination in light-charged ($Z \\le 2$)\nparticles using the digital waveform analysis method with a pad-type nTD-Si\ndetector and investigated the dependence of the performance of the particle\ndiscrimination on the incident position and incident angle. As the incident\nangle increased, a decrease in the maximum current was observed, which was\nsufficient to affect the performance of the particle discrimination. This\ndecrease can be expressed as a function of the penetration depth of the charged\nparticles into the detector, which varies for each nuclide.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:48:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kawase","Shoichiro",""],["Murota","Takuya",""],["Fukuda","Hiroya",""],["Oishi","Masaya",""],["Kawata","Teppei",""],["Kitafuji","Kentaro",""],["Manabe","Seiya",""],["Watanabe","Yukinobu",""],["Nishibata","Hiroki",""],["Go","Shintaro",""],["Kai","Tamito",""],["Nagata","Yuto",""],["Muto","Taiga",""],["Ishibashi","Yuichi",""],["Niikura","Megumi",""],["Suzuki","Daisuke",""],["Matsuzaki","Teiichiro",""],["Ishida","Katsuhiko",""],["Mizuno","Rurie",""],["Kitamura","Noritaka",""]]}
{"id":"2308.16434","submitter":"Indranil Chowdhury","authors":"Indranil Chowdhury and Espen R. Jakobsen","title":"Precise Error Bounds for Numerical Approximations of Fractional HJB\n  EInquations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove precise rates of convergence for monotone approximation schemes of\nfractional and nonlocal Hamilton-Jacobi-Bellman (HJB) equations. We consider\ndiffusion corrected difference-quadrature schemes from the literature and new\napproximations based on powers of discrete Laplacians, approximations which are\n(formally) fractional order and 2nd order methods. It is well-known in\nnumerical analysis that convergence rates depend on the regularity of\nsolutions, and here we consider cases with varying solution regularity: (i)\nStrongly degenerate problems with Lipschitz solutions, and (ii) weakly\nnon-degenerate problems where we show that solutions have bounded fractional\nderivatives of order between 1 and 2. Our main results are optimal error\nestimates with convergence rates that capture precisely both the fractional\norder of the schemes and the fractional regularity of the solutions. For\nstrongly degenerate equations, these rates improve earlier results. For weakly\nnon-degenerate problems of order greater than one, the results are new. Here we\nshow improved rates compared to the strongly degenerate case, rates that are\nalways better than 1/2.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:48:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chowdhury","Indranil",""],["Jakobsen","Espen R.",""]]}
{"id":"2308.16435","submitter":"Cara Appel","authors":"Jonathan S. Koning, Ashwin Subramanian, Mazen Alotaibi, Cara L. Appel,\n  Christopher M. Sullivan, Thon Chao, Lisa Truong, Robyn L. Tanguay, Pankaj\n  Jaiswal, Taal Levi, Damon B. Lesmeister","title":"Njobvu-AI: An open-source tool for collaborative image labeling and\n  implementation of computer vision models","comments":"13 pages, 6 figures. For code and documentation, see\n  https://github.com/sullichrosu/Njobvu-AI/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Practitioners interested in using computer vision models lack user-friendly\nand open-source software that combines features to label training data, allow\nmultiple users, train new algorithms, review output, and implement new models.\nLabeling training data, such as images, is a key step to developing accurate\nobject detection algorithms using computer vision. This step is often not\ncompatible with many cloud-based services for marking or labeling image and\nvideo data due to limited internet bandwidth in many regions of the world.\nDesktop tools are useful for groups working in remote locations, but users\noften do not have the capability to combine projects developed locally by\nmultiple collaborators. Furthermore, many tools offer features for labeling\ndata or using pre-trained models for classification, but few allow researchers\nto combine these steps to create and apply custom models. Free, open-source,\nand user-friendly software that offers a full suite of features (e.g., ability\nto work locally and online, and train custom models) is desirable to field\nresearchers and conservationists that may have limited coding skills. We\ndeveloped Njobvu-AI, a free, open-source tool that can be run on both desktop\nand server hardware using Node.js, allowing users to label data, combine\nprojects for collaboration and review, train custom algorithms, and implement\nnew computer vision models. The name Njobvu-AI (pronounced N-joh-voo AI),\nincorporating the Chichewa word for elephant, is inspired by a wildlife\nmonitoring program in Malawi that was a primary impetus for the development of\nthis tool and references similarities between the powerful memory of elephants\nand properties of computer vision models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:49:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Koning","Jonathan S.",""],["Subramanian","Ashwin",""],["Alotaibi","Mazen",""],["Appel","Cara L.",""],["Sullivan","Christopher M.",""],["Chao","Thon",""],["Truong","Lisa",""],["Tanguay","Robyn L.",""],["Jaiswal","Pankaj",""],["Levi","Taal",""],["Lesmeister","Damon B.",""]]}
{"id":"2308.16436","submitter":"Bo-Yan Cui","authors":"Bo-Yan Cui, Yue-Long Shen, Chao Wang and Yan-Bing Wei","title":"QCD factorization for the $B\\to \\gamma\\ell\\nu_{\\ell}$ decay beyond\n  leading power","comments":"29 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The radiative leptonic $B\\to \\gamma\\ell\\nu_{\\ell}$ decay serves as an ideal\nplatform to determine the $B$-meson inverse moment which is a fundamental\nnonperturbative parameter for the $B$ meson. In this paper, we explore precise\nQCD contributions to this decay with an energetic photon. We reproduce the\nnext-to-next-to-leading-logarithmic resummation formula for the decay amplitude\nat leading power in $\\Lambda_{\\rm QCD}/m_b$. Employing operator identities, we\ncalculate subleading-power contributions from the expansion of the\nhard-collinear propagator of the internal up quark and the heavy-quark\nexpansion of the bottom quark. We update the contributions from the hadronic\nstructure of the photon to the $\\decay$ process with the dispersion technique.\nTogether with other yet known power corrections, phenomenological applications\nincluding the partial branching fraction and ratio of the branching fractions\nof the radiative $B$ decay are investigated.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:52:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cui","Bo-Yan",""],["Shen","Yue-Long",""],["Wang","Chao",""],["Wei","Yan-Bing",""]]}
{"id":"2308.16437","submitter":"Xiaolu Zhang","authors":"Zhaoxin Huan, Ke Ding, Ang Li, Xiaolu Zhang, Xu Min, Yong He, Liang\n  Zhang, Jun Zhou, Linjian Mo, Jinjie Gu, Zhongyi Liu, Wenliang Zhong, Guannan\n  Zhang","title":"AntM$^{2}$C: A Large Scale Dataset For Multi-Scenario Multi-Modal CTR\n  Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Click-through rate (CTR) prediction is a crucial issue in recommendation\nsystems. There has been an emergence of various public CTR datasets. However,\nexisting datasets primarily suffer from the following limitations. Firstly,\nusers generally click different types of items from multiple scenarios, and\nmodeling from multiple scenarios can provide a more comprehensive understanding\nof users. Existing datasets only include data for the same type of items from a\nsingle scenario. Secondly, multi-modal features are essential in multi-scenario\nprediction as they address the issue of inconsistent ID encoding between\ndifferent scenarios. The existing datasets are based on ID features and lack\nmulti-modal features. Third, a large-scale dataset can provide a more reliable\nevaluation of models, fully reflecting the performance differences between\nmodels. The scale of existing datasets is around 100 million, which is\nrelatively small compared to the real-world CTR prediction. To address these\nlimitations, we propose AntM$^{2}$C, a Multi-Scenario Multi-Modal CTR dataset\nbased on industrial data from Alipay. Specifically, AntM$^{2}$C provides the\nfollowing advantages: 1) It covers CTR data of 5 different types of items,\nproviding insights into the preferences of users for different items, including\nadvertisements, vouchers, mini-programs, contents, and videos. 2) Apart from\nID-based features, AntM$^{2}$C also provides 2 multi-modal features, raw text\nand image features, which can effectively establish connections between items\nwith different IDs. 3) AntM$^{2}$C provides 1 billion CTR data with 200\nfeatures, including 200 million users and 6 million items. It is currently the\nlargest-scale CTR dataset available. Based on AntM$^{2}$C, we construct several\ntypical CTR tasks and provide comparisons with baseline methods. The dataset\nhomepage is available at https://www.atecup.cn/home.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:52:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Huan","Zhaoxin",""],["Ding","Ke",""],["Li","Ang",""],["Zhang","Xiaolu",""],["Min","Xu",""],["He","Yong",""],["Zhang","Liang",""],["Zhou","Jun",""],["Mo","Linjian",""],["Gu","Jinjie",""],["Liu","Zhongyi",""],["Zhong","Wenliang",""],["Zhang","Guannan",""]]}
{"id":"2308.16438","submitter":"Itai Dattner","authors":"Itai Dattner, Shota Gugushvili, Oleksandr Laskorunskyi","title":"Model Selection for Ordinary Differential Equations: a Statistical\n  Testing Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ordinary differential equations (ODEs) are foundational in modeling intricate\ndynamics across a gamut of scientific disciplines. Yet, a possibility to\nrepresent a single phenomenon through multiple ODE models, driven by different\nunderstandings of nuances in internal mechanisms or abstraction levels,\npresents a model selection challenge. This study introduces a testing-based\napproach for ODE model selection amidst statistical noise. Rooted in the model\nmisspecification framework, we adapt foundational insights from classical\nstatistical paradigms (Vuong and Hotelling) to the ODE context, allowing for\nthe comparison and ranking of diverse causal explanations without the\nconstraints of nested models. Our simulation studies validate the theoretical\nrobustness of our proposed test, revealing its consistent size and power.\nReal-world data examples further underscore the algorithm's applicability in\npractice. To foster accessibility and encourage real-world applications, we\nprovide a user-friendly Python implementation of our model selection algorithm,\nbridging theoretical advancements with hands-on tools for the scientific\ncommunity.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:57:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dattner","Itai",""],["Gugushvili","Shota",""],["Laskorunskyi","Oleksandr",""]]}
{"id":"2308.16439","submitter":"Jihua Zhang","authors":"Jihua Zhang, Jinyong Ma, Dragomir N. Neshev, Andrey A. Sukhorukov","title":"Photon pair generation from lithium niobate metasurface with tunable\n  spatial entanglement","comments":null,"journal-ref":null,"doi":"10.3788/COL202321.010005","report-no":null,"categories":"physics.optics quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Two-photon state with spatial entanglement is an essential resource for\ntesting fundamental laws of quantum mechanics and various quantum applications.\nIts creation typically relies on spontaneous parametric down-conversion in\nbulky nonlinear crystals where the tunability of spatial entanglement is\nlimited. Here, we predict that ultrathin nonlinear lithium niobate metasurfaces\ncan generate and diversely tune spatially entangled photon pairs. The spatial\nproperties of photons including the emission pattern, rate, and degree of\nspatial entanglement are analysed theoretically with the coupled mode theory\nand Schmidt decomposition method. We show that by leveraging the strong angular\ndispersion of the metasurface, the degree of spatial entanglement quantified by\nthe Schmidt number can be decreased or increased by changing the pump laser\nwavelength and a Gaussian beam size. This flexibility can facilitate diverse\nquantum applications of entangled photon states generated from nonlinear\nmetasurfaces.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 03:58:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Jihua",""],["Ma","Jinyong",""],["Neshev","Dragomir N.",""],["Sukhorukov","Andrey A.",""]]}
{"id":"2308.16440","submitter":"Alireza Parhizkar","authors":"Alireza Parhizkar, Victor Galitski","title":"Localizing Transitions via Interaction-Induced Flat Bands","comments":"4.5 pages + supplemental material","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall hep-th math-ph math.MP quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a theory of interaction-induced band-flattening in\nstrongly correlated electron systems. We begin by illustrating an inherent\nconnection between flat bands and index theorems, and presenting a generic\nprescription for constructing flat bands by periodically repeating local\nHamiltonians with topological zero modes. Specifically, we demonstrate that a\nDirac particle in an external, spatially periodic magnetic field can be cast in\nthis form. We derive a condition on the field to produce perfectly flat bands\nand provide an exact analytical solution for the flat band wave functions.\nFurthermore, we explore an interacting model of Dirac fermions in a spatially\ninhomogeneous field. We show that certain Hubbard-Stratonovich configurations\nexist that ``rectify'' the field configuration, inducing band flattening. We\npresent an explicit model where this localization scenario is energetically\nfavorable -- specifically in Dirac systems with nearly flat bands, where the\nenergy cost of rectifying textures is quadratic in the order parameter, whereas\nthe energy gain from flattening is linear. In conclusion, we discuss\nalternative symmetry-breaking channels, especially superconductivity, and\npropose that these interaction-induced band-flattening scenarios represent a\ngeneric non-perturbative mechanism for spontaneous symmetry breaking, pertinent\nto many strongly-correlated electron systems.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:04:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Parhizkar","Alireza",""],["Galitski","Victor",""]]}
{"id":"2308.16441","submitter":"Chen Zhao","authors":"Dong Li, Wenjun Wang, Minglai Shao, Chen Zhao","title":"Contrastive Representation Learning Based on Multiple Node-centered\n  Subgraphs","comments":"CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the basic element of graph-structured data, node has been recognized as\nthe main object of study in graph representation learning. A single node\nintuitively has multiple node-centered subgraphs from the whole graph (e.g.,\none person in a social network has multiple social circles based on his\ndifferent relationships). We study this intuition under the framework of graph\ncontrastive learning, and propose a multiple node-centered subgraphs\ncontrastive representation learning method to learn node representation on\ngraphs in a self-supervised way. Specifically, we carefully design a series of\nnode-centered regional subgraphs of the central node. Then, the mutual\ninformation between different subgraphs of the same node is maximized by\ncontrastive loss. Experiments on various real-world datasets and different\ndownstream tasks demonstrate that our model has achieved state-of-the-art\nresults.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:04:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Dong",""],["Wang","Wenjun",""],["Shao","Minglai",""],["Zhao","Chen",""]]}
{"id":"2308.16442","submitter":"Jonathan Axtell","authors":"Jonathan D. Axtell","title":"Generalized polynomial functors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We define Schur categories, $\\Gamma^d \\mathcal C$, associated to a\n$\\Bbbk$-linear category $\\mathcal C$, over a commutative ring $\\Bbbk$. The\ncorresponding representation categories, $\\mathbf{rep}\\, \\Gamma^d\\mathcal C$,\ngeneralize categories of strict polynomial functors. Given a\n$\\Bbbk$-superalgebra $A$, we show that for certain categories $\\mathcal{V} =\n\\boldsymbol{\\mathcal V}_A$, $\\boldsymbol{\\mathcal E}_A$ of $A$-supermodules,\nthere is a Morita equivalence between $\\mathbf{rep}\\, \\Gamma^d\\mathcal{V}$ and\nthe category of supermodules over a generalized Schur superalgebra of the form\n$S^A(m|n,d)$ and $S^A(n,d)$, respectively. We also describe a formulation of\ngeneralized Schur-Weyl duality from the viewpoint of the category\n$\\mathbf{rep}\\, \\Gamma^d \\boldsymbol{\\mathcal E}_A$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:04:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Axtell","Jonathan D.",""]]}
{"id":"2308.16443","submitter":"Jianghui Ji","authors":"Shoucun Hu, Bin Li, Haoxuan Jiang, Gang Bao, Jianghui Ji","title":"Peculiar orbital characteristics of Earth quasi-satellite 469219\n  Kamo`oalewa: implications for the Yarkovsky detection and orbital uncertainty\n  propagation","comments":"15 pages, 11 figures, accepted for publication in AJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.space-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  469219 Kamo`oalewa is selected as one of the primary targets of Tianwen-2\nmission, which is currently believed to be the most stable quasi-satellite of\nEarth. Here we derive a weak detection of the Yarkovsky effect for Kamo`oalewa,\ngiving $A_2 = -1.075\\pm0.447\\times 10^{-13} \\rm{au/d}^2$, with the available\nground-based optical observations from Minor Planet Center and a relatively\nconservative weighting scheme. Due to the quasi-satellite resonance with Earth,\nwe show that the detection of Yarkovsky effect by orbital fitting with\nastrometric observations becomes difficult as its orbital drift shows a slow\noscillatory growth resulting from the Yarkovsky effect. In addition, we\nextensively explore the characteristics of orbital uncertainty propagation and\nfind that the positional uncertainty mainly arises from the geocentric radial\ndirection in 2010-2020, and then concentrates in the heliocentric transverse\ndirection in 2020-2030. Furthermore, the heliocentric transverse uncertainty is\nclearly monthly dependent, which can arrive at a minimum around January and a\nmaximum around July as the orbit moves towards the leading and trailing edges,\nrespectively, in 2025-2027. Finally, we investigate a long-term uncertainty\npropagation in the quasi-satellite regime, implying that the quasi-satellite\nresonance with Earth may play a crucial role in constraining the increase of\nuncertainty over time. Such interesting feature further implies that the\norbital precision of Kamo`oalewa is relatively stable at its quasi-satellite\nphase, which may also be true for other quasi-satellites of Earth.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:06:15 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hu","Shoucun",""],["Li","Bin",""],["Jiang","Haoxuan",""],["Bao","Gang",""],["Ji","Jianghui",""]]}
{"id":"2308.16444","submitter":"Reinier D\\'iaz Mill\\'an","authors":"R. D\\'iaz Mill\\'an, O. P. Ferreira and J. Ugon","title":"Frank-Wolfe algorithm for DC optimization problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the present paper, we formulate two versions of Frank--Wolfe algorithm or\nconditional gradient method to solve the DC optimization problem with an\nadaptive step size. The DC objective function consists of two components; the\nfirst is thought to be differentiable with a continuous Lipschitz gradient,\nwhile the second is only thought to be convex. The second version is based on\nthe first and employs finite differences to approximate the gradient of the\nfirst component of the objective function. In contrast to past formulations\nthat used the curvature/Lipschitz-type constant of the objective function, the\nstep size computed does not require any constant associated with the\ncomponents. For the first version, we established that the algorithm is\nwell-defined of the algorithm and that every limit point of the generated\nsequence is a stationary point of the problem. We also introduce the class of\nweak-star-convex functions and show that, despite the fact that these functions\nare non-convex in general, the rate of convergence of the first version of the\nalgorithm to minimize these functions is ${\\cal O}(1/k)$. The finite difference\nused to approximate the gradient in the second version of the Frank-Wolfe\nalgorithm is computed with the step-size adaptively updated using two previous\niterations. Unlike previous applications of finite difference in the\nFrank-Wolfe algorithm, which provided approximate gradients with absolute\nerror, the one used here provides us with a relative error, simplifying the\nalgorithm analysis. In this case, we show that all limit points of the\ngenerated sequence for the second version of the Frank-Wolfe algorithm are\nstationary points for the problem under consideration, and we establish that\nthe rate of convergence for the duality gap is ${\\cal O}(1/\\sqrt{k})$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:07:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mill\u00e1n","R. D\u00edaz",""],["Ferreira","O. P.",""],["Ugon","J.",""]]}
{"id":"2308.16445","submitter":"Zengqi Peng","authors":"Zengqi Peng, Xiao Zhou, Yubin Wang, Lei Zheng, Ming Liu, Jun Ma","title":"Curriculum Proximal Policy Optimization with Stage-Decaying Clipping for\n  Self-Driving at Unsignalized Intersections","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unsignalized intersections are typically considered as one of the most\nrepresentative and challenging scenarios for self-driving vehicles. To tackle\nautonomous driving problems in such scenarios, this paper proposes a curriculum\nproximal policy optimization (CPPO) framework with stage-decaying clipping. By\nadjusting the clipping parameter during different stages of training through\nproximal policy optimization (PPO), the vehicle can first rapidly search for an\napproximate optimal policy or its neighborhood with a large parameter, and then\nconverges to the optimal policy with a small one. Particularly, the stage-based\ncurriculum learning technology is incorporated into the proposed framework to\nimprove the generalization performance and further accelerate the training\nprocess. Moreover, the reward function is specially designed in view of\ndifferent curriculum settings. A series of comparative experiments are\nconducted in intersection-crossing scenarios with bi-lane carriageways to\nverify the effectiveness of the proposed CPPO method. The results show that the\nproposed approach demonstrates better adaptiveness to different dynamic and\ncomplex environments, as well as faster training speed over baseline methods.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:12:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Peng","Zengqi",""],["Zhou","Xiao",""],["Wang","Yubin",""],["Zheng","Lei",""],["Liu","Ming",""],["Ma","Jun",""]]}
{"id":"2308.16446","submitter":"Nariman Torkzaban","authors":"Nariman Torkzaban, Anousheh Gholami, John S. Baras, Bruce Golden","title":"PASA: A Priori Adaptive Splitting Algorithm for the Split Delivery\n  Vehicle Routing Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The split delivery vehicle routing problem (SDVRP) is a relaxed variant of\nthe capacitated vehicle routing problem (CVRP) where the restriction that each\ncustomer is visited precisely once is removed. Compared with CVRP, the SDVRP\nallows a reduction in the cost of the routes traveled by vehicles. The exact\nmethods to solve the SDVRP are computationally expensive. Moreover, the\ncomplexity and difficult implementation of the state-of-the-art heuristic\napproaches hinder their application in real-life scenarios of the SDVRP. In\nthis paper, we propose an easily understandable and effective approach to solve\nthe SDVPR based on an a priori adaptive splitting algorithm (PASA). The idea of\na priori split strategy was first introduced in Chen et al. (2017). In this\napproach, the demand of the customers is split into smaller values using a\nfixed splitting rule in advance. Consequently, the original SDVRP instance is\nconverted to a CVRP instance which is solved using an existing CVRP solver.\nWhile the proposed a priori splitting rule in Chen et al. (2017) is fixed for\nall customers regardless of their demand and location, we suggest an adaptive\nsplitting rule that takes into account the distance of the customers to the\ndepot and their demand values. Our experiments show that PASA can generate\nsolutions comparable to the state-of-the-art but much faster. Furthermore, our\nalgorithm outperforms the fixed a priori splitting rule proposed by Chen et al.\n(2017).\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:13:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Torkzaban","Nariman",""],["Gholami","Anousheh",""],["Baras","John S.",""],["Golden","Bruce",""]]}
{"id":"2308.16447","submitter":"Yunhui Wu","authors":"Yuxin He, Yang Shen, Yunhui Wu, and Yuhao Xue","title":"Non-simple systoles on random hyperbolic surfaces for large genus","comments":"47 pages, 11 figures. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.CV math.DG math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigate the asymptotic behavior of the non-simple\nsystole, which is the length of a shortest non-simple closed geodesic, on a\nrandom closed hyperbolic surface on the moduli space $\\mathcal{M}_g$ of Riemann\nsurfaces of genus $g$ endowed with the Weil-Petersson measure. We show that as\nthe genus $g$ goes to infinity, the non-simple systole of a generic hyperbolic\nsurface in $\\mathcal{M}_g$ behaves exactly like $\\log g$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:26:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["He","Yuxin",""],["Shen","Yang",""],["Wu","Yunhui",""],["Xue","Yuhao",""]]}
{"id":"2308.16448","submitter":"Gaoqing Cao","authors":"Gaoqing Cao","title":"Topological transition in a parallel electromagnetic field","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th cond-mat.mtrl-sci hep-th","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this work, we attack the problem of \"chiral phase instability\" ($\\chi$PI)\nin a quantum chromodynamics (QCD) system under a parallel and constant\nelectromagnetic field. The $\\chi$PI refers to that: When $I_2\\equiv{\\bf E\\cdot\nB}$ is larger than the threshold $I_2^c$, no homogeneous solution can be found\nfor $\\sigma$ or $\\pi^0$ condensate, and the chiral phase (or angle) $\\theta$\nbecomes unstable. Within the two-flavor chiral perturbation theory, we obtain\nan effective Lagrangian density for $\\theta(x)$ where the chiral anomalous\nWess-Zumino-Witten term is found to play a role of \"source\" to the \"potential\nfield\" $\\theta(x)$. The Euler-Lagrangian equation is applied to derive the\nequation of motion for $\\theta(x)$, and physical solutions are worked out for\nseveral shapes of system. In the case $I_2>I_2^c$, it is found that the\n$\\chi$PI actually implies an inhomogeneous QCD phase with $\\theta(x)$ spatially\ndependent. By its very nature, the homogeneous-inhomogeneous phase transition\nis of pure topological and second order at $I_2^c$. Finally, the work is\nextended to the three-flavor case, where an inhomogeneous $\\eta$ condensation\nis also found to be developed for $I_2>I_2^c$. Correspondingly, there is a\nsecond critical point, $I_2^{c'}=24.3I_2^c$, across which the transition is\nalso of topological and second order by its very nature.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:32:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cao","Gaoqing",""]]}
{"id":"2308.16449","submitter":"Vivek Baruah Thapa","authors":"Trisha Sarkar, Vivek Baruah Thapa, Monika Sinha","title":"Fast neutron star cooling in light of the PREX-2 experiment","comments":"8 pages, 5 figures. Accepted for publication in Phys. Rev. C","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The nuclear symmetry energy and its behaviour with density has been recently\nevaluated with enhanced value by PREX-2 experiment. This new values enables\ndirect Urca neutrino emission process to be functioning in the dense matter\ninside neutron stars. With this new outlook we study the cooling rate of\ncanonical mass neutron stars and compare with available observational cooling\ndata. We find most of the isolated neutron star thermal profile is compatible\nwith the cooling of canonical mass star including superfluidity suppression.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:36:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sarkar","Trisha",""],["Thapa","Vivek Baruah",""],["Sinha","Monika",""]]}
{"id":"2308.16450","submitter":"Vsevolod Gubarev","authors":"Vsevolod Gubarev, Farukh Mashurov, Alexander Panasenko","title":"Generalized sharped cubic form and split spin factor algebra","comments":"29 p","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There is a well-known construction of a Jordan algebra via a sharped cubic\nform. We introduce a generalized sharped cubic form and prove that the split\nspin factor algebra is induced by this construction and satisfies the identity\n$((a,b,c),d,b) + ((c,b,d),a,b) + ((d,b,a),c,b) = 0$. The split spin factor\nalgebras have recently appeared in the classification of 2-generated axial\nalgebras of Monster type fulfilled by T. Yabe; their properties were studied by\nJ. McInroy and S. Shpectorov.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:37:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gubarev","Vsevolod",""],["Mashurov","Farukh",""],["Panasenko","Alexander",""]]}
{"id":"2308.16451","submitter":"Jingwei Song","authors":"Keke Yang, Zheng Zhang, Meng Li, Tuoyu Cao, Maani Ghaffari, and\n  Jingwei Song","title":"Optical flow-based vascular respiratory motion compensation","comments":"This manuscript has been accepted by IEEE Robotics and Automation\n  Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper develops a new vascular respiratory motion compensation algorithm,\nMotion-Related Compensation (MRC), to conduct vascular respiratory motion\ncompensation by extrapolating the correlation between invisible vascular and\nvisible non-vascular. Robot-assisted vascular intervention can significantly\nreduce the radiation exposure of surgeons. In robot-assisted image-guided\nintervention, blood vessels are constantly moving/deforming due to respiration,\nand they are invisible in the X-ray images unless contrast agents are injected.\nThe vascular respiratory motion compensation technique predicts 2D vascular\nroadmaps in live X-ray images. When blood vessels are visible after contrast\nagents injection, vascular respiratory motion compensation is conducted based\non the sparse Lucas-Kanade feature tracker. An MRC model is trained to learn\nthe correlation between vascular and non-vascular motions. During the\nintervention, the invisible blood vessels are predicted with visible tissues\nand the trained MRC model. Moreover, a Gaussian-based outlier filter is adopted\nfor refinement. Experiments on in-vivo data sets show that the proposed method\ncan yield vascular respiratory motion compensation in 0.032 sec, with an\naverage error 1.086 mm. Our real-time and accurate vascular respiratory motion\ncompensation approach contributes to modern vascular intervention and surgical\nrobots.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:38:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yang","Keke",""],["Zhang","Zheng",""],["Li","Meng",""],["Cao","Tuoyu",""],["Ghaffari","Maani",""],["Song","Jingwei",""]]}
{"id":"2308.16452","submitter":"Viktor T. Toth","authors":"Viktor T. Toth","title":"Imaging with a gravitational lens: the geometric view","comments":"5 pages, 6 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":"  We investigate imaging point sources with a monopole gravitational lens, such\nas the Solar Gravitational Lens in the geometric optics limit. We compute the\nlight amplification of the lens used in conjunction with a telescope featuring\na circular aperture that is placed in the focal region of the lens, compared to\nthe amount of light collected by the same telescope unaided by a gravitational\nlens. We recover an averaged point-spread function that is in robust agreement\nwith a wave-theoretical description of the lens, and can be used in practical\ncalculations or simulations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:40:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Toth","Viktor T.",""]]}
{"id":"2308.16453","submitter":"Xiang Li","authors":"Xiang Li, Juncheng Guo, Qige Song, Jiang Xie, Yafei Sang, Shuyuan\n  Zhao, and Yongzheng Zhang","title":"Listen to Minority: Encrypted Traffic Classification for Class Imbalance\n  with Contrastive Pre-Training","comments":"Accepted by 2023 IEEE SECON, 9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mobile Internet has profoundly reshaped modern lifestyles in various aspects.\nEncrypted Traffic Classification (ETC) naturally plays a crucial role in\nmanaging mobile Internet, especially with the explosive growth of mobile apps\nusing encrypted communication. Despite some existing learning-based ETC methods\nshowing promising results, three-fold limitations still remain in real-world\nnetwork environments, 1) label bias caused by traffic class imbalance, 2)\ntraffic homogeneity caused by component sharing, and 3) training with reliance\non sufficient labeled traffic. None of the existing ETC methods can address all\nthese limitations. In this paper, we propose a novel Pre-trAining\nSemi-Supervised ETC framework, dubbed PASS. Our key insight is to resample the\noriginal train dataset and perform contrastive pre-training without using\nindividual app labels directly to avoid label bias issues caused by class\nimbalance, while obtaining a robust feature representation to differentiate\noverlapping homogeneous traffic by pulling positive traffic pairs closer and\npushing negative pairs away. Meanwhile, PASS designs a semi-supervised\noptimization strategy based on pseudo-label iteration and dynamic loss\nweighting algorithms in order to effectively utilize massive unlabeled traffic\ndata and alleviate manual train dataset annotation workload. PASS outperforms\nstate-of-the-art ETC methods and generic sampling approaches on four public\ndatasets with significant class imbalance and traffic homogeneity, remarkably\npushing the F1 of Cross-Platform215 with 1.31%, ISCX-17 with 9.12%.\nFurthermore, we validate the generality of the contrastive pre-training and\npseudo-label iteration components of PASS, which can adaptively benefit ETC\nmethods with diverse feature extractors.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:45:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Xiang",""],["Guo","Juncheng",""],["Song","Qige",""],["Xie","Jiang",""],["Sang","Yafei",""],["Zhao","Shuyuan",""],["Zhang","Yongzheng",""]]}
{"id":"2308.16454","submitter":"Satoshi Suzuki Dr.","authors":"Satoshi Suzuki, Shin'ya Yamaguchi, Shoichiro Takeda, Sekitoshi Kanai,\n  Naoki Makishima, Atsushi Ando, Ryo Masumura","title":"Adversarial Finetuning with Latent Representation Constraint to Mitigate\n  Accuracy-Robustness Tradeoff","comments":"Accepted by International Conference on Computer Vision (ICCV) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper addresses the tradeoff between standard accuracy on clean examples\nand robustness against adversarial examples in deep neural networks (DNNs).\nAlthough adversarial training (AT) improves robustness, it degrades the\nstandard accuracy, thus yielding the tradeoff. To mitigate this tradeoff, we\npropose a novel AT method called ARREST, which comprises three components: (i)\nadversarial finetuning (AFT), (ii) representation-guided knowledge distillation\n(RGKD), and (iii) noisy replay (NR). AFT trains a DNN on adversarial examples\nby initializing its parameters with a DNN that is standardly pretrained on\nclean examples. RGKD and NR respectively entail a regularization term and an\nalgorithm to preserve latent representations of clean examples during AFT. RGKD\npenalizes the distance between the representations of the standardly pretrained\nand AFT DNNs. NR switches input adversarial examples to nonadversarial ones\nwhen the representation changes significantly during AFT. By combining these\ncomponents, ARREST achieves both high standard accuracy and robustness.\nExperimental results demonstrate that ARREST mitigates the tradeoff more\neffectively than previous AT-based methods do.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:46:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Suzuki","Satoshi",""],["Yamaguchi","Shin'ya",""],["Takeda","Shoichiro",""],["Kanai","Sekitoshi",""],["Makishima","Naoki",""],["Ando","Atsushi",""],["Masumura","Ryo",""]]}
{"id":"2308.16455","submitter":"Vsevolod Gubarev","authors":"Vsevolod Gubarev","title":"Nonunital decompositions of the matrix algebra of order three","comments":"7 p","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  All decompositions of $M_3(\\mathbb{C})$ into a direct vector-space sum of two\nsubalgebras such that none of the subalgebras contains the identity matrix are\nclassified. Thus, the classification of all decompositions of $M_3(\\mathbb{C})$\ninto a direct vector-space sum of two subalgebras as well as description of\nRota-Baxter operators of nonzero weight on $M_3(\\mathbb{C})$ is finished.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:48:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gubarev","Vsevolod",""]]}
{"id":"2308.16456","submitter":"Shuai Wang","authors":"Shuai Wang, Zhen Wang and Yuan-Hai Shao","title":"Least Squares Maximum and Weighted Generalization-Memorization Machines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose a new way of remembering by introducing a memory\ninfluence mechanism for the least squares support vector machine (LSSVM).\nWithout changing the equation constraints of the original LSSVM, this\nmechanism, allows an accurate partitioning of the training set without\noverfitting. The maximum memory impact model (MIMM) and the weighted impact\nmemory model (WIMM) are then proposed. It is demonstrated that these models can\nbe degraded to the LSSVM. Furthermore, we propose some different memory impact\nfunctions for the MIMM and WIMM. The experimental results show that that our\nMIMM and WIMM have better generalization performance compared to the LSSVM and\nsignificant advantage in time cost compared to other memory models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:48:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Shuai",""],["Wang","Zhen",""],["Shao","Yuan-Hai",""]]}
{"id":"2308.16457","submitter":"Andr\\'es R. Vindas-Mel\\'endez","authors":"Eon Lee and Carson Mitchell and Andr\\'es R. Vindas-Mel\\'endez","title":"Stack-sorting simplices: geometry and lattice-point enumeration","comments":"25 pages, 5 figures, 1 table, comments welcomed!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the polytopes that arise from the convex hulls of stack-sorting on\nparticular permutations. We show that they are simplices and proceed to study\ntheir geometry and lattice-point enumeration. First, we prove some enumerative\nresults on $Ln1$ permutations, i.e., permutations of length $n$ whose\npenultimate and last entries are $n$ and $1$, respectively. Additionally, we\nthen focus on a specific permutation, which we call $L'n1$, and show that the\nconvex hull of all its iterations through the stack-sorting algorithm share the\nsame lattice-point enumerator as that of the $(n-1)$-dimensional unit cube and\nlecture-hall simplex. Lastly, we detail some results on the real lattice-point\nenumerator for variations of the simplices arising from stack-sorting $L'n1$\npermutations. This then allows us to show that $L'n1$ simplices are Gorenstein\nof index $2$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:52:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lee","Eon",""],["Mitchell","Carson",""],["Vindas-Mel\u00e9ndez","Andr\u00e9s R.",""]]}
{"id":"2308.16458","submitter":"Xiangru Tang","authors":"Xiangru Tang, Bill Qian, Rick Gao, Jiakang Chen, Xinyun Chen, Mark\n  Gerstein","title":"BioCoder: A Benchmark for Bioinformatics Code Generation with Contextual\n  Pragmatic Knowledge","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":"  Pre-trained language models like ChatGPT have significantly improved code\ngeneration. As these models scale up, there is an increasing need for the\noutput to handle more intricate tasks. Moreover, in bioinformatics, generating\nfunctional programs poses additional notable challenges due to the amount of\ndomain knowledge, the need for complicated data operations, and intricate\nfunctional dependencies between the operations. Here, we present BioCoder, a\nbenchmark developed to evaluate existing pre-trained models in generating\nbioinformatics code. In relation to function-code generation, BioCoder covers\npotential package dependencies, class declarations, and global variables. It\nincorporates 1026 functions and 1243 methods in Python and Java from GitHub and\n253 examples from the Rosalind Project. BioCoder incorporates a fuzz-testing\nframework for evaluation, and we have applied it to evaluate many models\nincluding InCoder, CodeGen, CodeGen2, SantaCoder, StarCoder, StarCoder+,\nInstructCodeT5+, and ChatGPT. Our detailed analysis of these models emphasizes\nthe importance of domain knowledge, pragmatic code generation, and contextual\nunderstanding. Our dataset, benchmark, Docker images, and scripts required for\ntesting are all available at https://github.com/gersteinlab/biocoder.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:52:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tang","Xiangru",""],["Qian","Bill",""],["Gao","Rick",""],["Chen","Jiakang",""],["Chen","Xinyun",""],["Gerstein","Mark",""]]}
{"id":"2308.16459","submitter":"Viktor T. Toth","authors":"Viktor T. Toth","title":"Gravitational anomaly detection using a satellite constellation:\n  Analysis and simulation","comments":"24 pages, 5 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":"  We investigate the utility of a constellation of four satellites in\nheliocentric orbit, equipped with accurate means to measure intersatellite\nranges, round-trip times and phases of signals coherently retransmitted between\nmembers of the constellation. Our goal is to reconstruct the measured trace of\nthe gravitational gradient tensor as accurately as possible. Intersatellite\nranges alone are not sufficient for its determination, as they do not account\nfor any rotation of the satellite constellation, which introduces fictitious\nforces and accelerations. However, measuring signal round-trip time differences\namong the satellites supplies the necessary observables to estimate, and\nsubtract, the effects of rotation. Utilizing, in addition, the approximate\ndistance and direction from the Sun, it is possible to approach an accuracy of\n$10^{-24}~{\\rm s}^{-2}$ for a constellation with typical intersatellite\ndistances of 1,000 km in an orbit with a 1 astronomical unit semi-major axis.\nThis is deemed sufficient to detect the presence of a galileonic modification\nof the solar gravitational field.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:53:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Toth","Viktor T.",""]]}
{"id":"2308.16460","submitter":"Yuyan Zhou","authors":"Yuyan Zhou, Dong Liang, Songcan Chen, Sheng-Jun Huang, Shuo Yang,\n  Chongyi Li","title":"Improving Lens Flare Removal with General Purpose Pipeline and Multiple\n  Light Sources Recovery","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":"  When taking images against strong light sources, the resulting images often\ncontain heterogeneous flare artifacts. These artifacts can importantly affect\nimage visual quality and downstream computer vision tasks. While collecting\nreal data pairs of flare-corrupted/flare-free images for training flare removal\nmodels is challenging, current methods utilize the direct-add approach to\nsynthesize data. However, these methods do not consider automatic exposure and\ntone mapping in image signal processing pipeline (ISP), leading to the limited\ngeneralization capability of deep models training using such data. Besides,\nexisting methods struggle to handle multiple light sources due to the different\nsizes, shapes and illuminance of various light sources. In this paper, we\npropose a solution to improve the performance of lens flare removal by\nrevisiting the ISP and remodeling the principle of automatic exposure in the\nsynthesis pipeline and design a more reliable light sources recovery strategy.\nThe new pipeline approaches realistic imaging by discriminating the local and\nglobal illumination through convex combination, avoiding global illumination\nshifting and local over-saturation. Our strategy for recovering multiple light\nsources convexly averages the input and output of the neural network based on\nilluminance levels, thereby avoiding the need for a hard threshold in\nidentifying light sources. We also contribute a new flare removal testing\ndataset containing the flare-corrupted images captured by ten types of consumer\nelectronics. The dataset facilitates the verification of the generalization\ncapability of flare removal methods. Extensive experiments show that our\nsolution can effectively improve the performance of lens flare removal and push\nthe frontier toward more general situations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 04:58:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhou","Yuyan",""],["Liang","Dong",""],["Chen","Songcan",""],["Huang","Sheng-Jun",""],["Yang","Shuo",""],["Li","Chongyi",""]]}
{"id":"2308.16461","submitter":"Qi Chen","authors":"Qi Chen, Wei Huang, Yueyi Zhang, Zhiwei Xiong","title":"Domain Adaptive Synapse Detection with Weak Point Annotations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The development of learning-based methods has greatly improved the detection\nof synapses from electron microscopy (EM) images. However, training a model for\neach dataset is time-consuming and requires extensive annotations.\nAdditionally, it is difficult to apply a learned model to data from different\nbrain regions due to variations in data distributions. In this paper, we\npresent AdaSyn, a two-stage segmentation-based framework for domain adaptive\nsynapse detection with weak point annotations. In the first stage, we address\nthe detection problem by utilizing a segmentation-based pipeline to obtain\nsynaptic instance masks. In the second stage, we improve model generalizability\non target data by regenerating square masks to get high-quality pseudo labels.\nBenefiting from our high-accuracy detection results, we introduce the distance\nnearest principle to match paired pre-synapses and post-synapses. In the\nWASPSYN challenge at ISBI 2023, our method ranks the 1st place.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:05:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Qi",""],["Huang","Wei",""],["Zhang","Yueyi",""],["Xiong","Zhiwei",""]]}
{"id":"2308.16462","submitter":"Aaron Tran","authors":"Aaron Tran, Lorenzo Sironi","title":"Electron Heating in 2D PIC Simulations of Quasi-Perpendicular Low-Beta\n  Shocks","comments":"32 pages, 25 figures; submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.space-ph astro-ph.HE astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We measure the thermal electron energization in 1D and 2D particle-in-cell\n(PIC) simulations of quasi-perpendicular, low-beta ($\\beta_p=0.25$)\ncollisionless ion-electron shocks with mass ratio $m_i/m_e=200$, fast Mach\nnumber $\\mathcal{M}_{ms}=1$-$4$, and upstream magnetic field angle $\\theta_{Bn}\n= 55$-$85^\\circ$ from shock normal $\\hat{\\boldsymbol{n}}$. It is known that\nshock electron heating is described by an ambipolar, $\\boldsymbol{B}$-parallel\nelectric potential jump, $\\Delta\\phi_\\parallel$, that scales roughly linearly\nwith the electron temperature jump. Our simulations have\n$\\Delta\\phi_\\parallel/(0.5 m_i {u_\\mathrm{sh}}^2) \\sim 0.1$-$0.2$ in units of\nthe pre-shock ions' bulk kinetic energy, in agreement with prior measurements\nand simulations. Different ways to measure $\\phi_\\parallel$, including the use\nof de Hoffmann-Teller frame fields, agree to tens-of-percent accuracy.\nNeglecting off-diagonal electron pressure tensor terms can lead to a systematic\nunderestimate of $\\phi_\\parallel$ in our low-$\\beta_p$ shocks. We further focus\non two $\\theta_{Bn}=65^\\circ$ shocks: a $\\mathcal{M}_s=4$ ($\\mathcal{M}_A=1.8$)\ncase with a long, $30 d_i$ precursor of whistler waves along\n$\\hat{\\boldsymbol{n}}$, and a $\\mathcal{M}_s=7$ ($\\mathcal{M}_A=3.2$) case with\na shorter, $5d_i$ precursor of whistlers oblique to both $\\hat{\\boldsymbol{n}}$\nand $\\boldsymbol{B}$; $d_i$ is the ion skin depth. Within the precursors,\n$\\phi_\\parallel$ has a secular rise towards the shock along multiple whistler\nwavelengths and also has localized spikes within magnetic troughs. In a 1D\nsimulation of the $\\mathcal{M}_s=4$, $\\theta_{Bn}=65^\\circ$ case,\n$\\phi_\\parallel$ shows a weak dependence on the electron plasma-to-cyclotron\nfrequency ratio $\\omega_{pe}/\\Omega_{ce}$, and $\\phi_\\parallel$ decreases by a\nfactor of 2 as $m_i/m_e$ is raised to the true proton-electron value of 1836.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:06:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tran","Aaron",""],["Sironi","Lorenzo",""]]}
{"id":"2308.16463","submitter":"Yupan Huang","authors":"Yupan Huang and Zaiqiao Meng and Fangyu Liu and Yixuan Su and Nigel\n  Collier and Yutong Lu","title":"Sparkles: Unlocking Chats Across Multiple Images for Multimodal\n  Instruction-Following Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models exhibit enhanced zero-shot performance on various tasks\nwhen fine-tuned with instruction-following data. Multimodal\ninstruction-following models extend these capabilities by integrating both text\nand images. However, existing models such as MiniGPT-4 face challenges in\nmaintaining dialogue coherence in scenarios involving multiple images. A\nprimary reason is the lack of a specialized dataset for this critical\napplication. To bridge these gaps, we present SparklesChat, a multimodal\ninstruction-following model for open-ended dialogues across multiple images. To\nsupport the training, we introduce SparklesDialogue, the first\nmachine-generated dialogue dataset tailored for word-level interleaved\nmulti-image and text interactions. Furthermore, we construct SparklesEval, a\nGPT-assisted benchmark for quantitatively assessing a model's conversational\ncompetence across multiple images and dialogue turns. Our experiments validate\nthe effectiveness of SparklesChat in understanding and reasoning across\nmultiple images and dialogue turns. Specifically, SparklesChat outperformed\nMiniGPT-4 on established vision-and-language benchmarks, including the BISON\nbinary image selection task and the NLVR2 visual reasoning task. Moreover,\nSparklesChat scored 8.56 out of 10 on SparklesEval, substantially exceeding\nMiniGPT-4's score of 3.91 and nearing GPT-4's score of 9.26. Qualitative\nevaluations further demonstrate SparklesChat's generality in handling\nreal-world applications. All resources will be available at\nhttps://github.com/HYPJUDY/Sparkles.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:15:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Huang","Yupan",""],["Meng","Zaiqiao",""],["Liu","Fangyu",""],["Su","Yixuan",""],["Collier","Nigel",""],["Lu","Yutong",""]]}
{"id":"2308.16464","submitter":"Anas Nadeem","authors":"Anas Nadeem, Muhammad Usman Sarwar, Muhammad Zubair Malik","title":"MaintainoMATE: A GitHub App for Intelligent Automation of Maintenance\n  Activities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Software development projects rely on issue tracking systems at the core of\ntracking maintenance tasks such as bug reports, and enhancement requests.\nIncoming issue-reports on these issue tracking systems must be managed in an\neffective manner. First, they must be labelled and then assigned to a\nparticular developer with relevant expertise. This handling of issue-reports is\ncritical and requires thorough scanning of the text entered in an issue-report\nmaking it a labor-intensive task. In this paper, we present a unified framework\ncalled MaintainoMATE, which is capable of automatically categorizing the\nissue-reports in their respective category and further assigning the\nissue-reports to a developer with relevant expertise. We use the Bidirectional\nEncoder Representations from Transformers (BERT), as an underlying model for\nMaintainoMATE to learn the contextual information for automatic issue-report\nlabeling and assignment tasks. We deploy the framework used in this work as a\nGitHub application. We empirically evaluate our approach on GitHub\nissue-reports to show its capability of assigning labels to the issue-reports.\nWe were able to achieve an F1-score close to 80\\%, which is comparable to\nexisting state-of-the-art results. Similarly, our initial evaluations show that\nwe can assign relevant developers to the issue-reports with an F1 score of\n54\\%, which is a significant improvement over existing approaches. Our initial\nfindings suggest that MaintainoMATE has the potential of improving software\nquality and reducing maintenance costs by accurately automating activities\ninvolved in the maintenance processes. Our future work would be directed\ntowards improving the issue-assignment module.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:15:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nadeem","Anas",""],["Sarwar","Muhammad Usman",""],["Malik","Muhammad Zubair",""]]}
{"id":"2308.16465","submitter":"Yong See Foo Mr","authors":"Yong See Foo, Jennifer A. Flegg","title":"Haplotype frequency inference from pooled genetic data with a latent\n  multinomial model","comments":"35 pages, 16 figures, 3 algorithms, submitted to Biometrics journal","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In genetic studies, haplotype data provide more refined information than data\nabout separate genetic markers. However, large-scale studies that genotype\nhundreds to thousands of individuals may only provide results of pooled data,\nwhere only the total allele counts of each marker in each pool are reported.\nMethods for inferring haplotype frequencies from pooled genetic data that scale\nwell with pool size rely on a normal approximation, which we observe to produce\nunreliable inference when applied to real data. We illustrate cases where the\napproximation breaks down, due to the normal covariance matrix being\nnear-singular. As an alternative to approximate methods, in this paper we\npropose exact methods to infer haplotype frequencies from pooled genetic data\nbased on a latent multinomial model, where the observed allele counts are\nconsidered integer combinations of latent, unobserved haplotype counts. One of\nour methods, latent count sampling via Markov bases, achieves approximately\nlinear runtime with respect to pool size. Our exact methods produce more\naccurate inference over existing approximate methods for synthetic data and for\ndata based on haplotype information from the 1000 Genomes Project. We also\ndemonstrate how our methods can be applied to time-series of pooled genetic\ndata, as a proof of concept of how our methods are relevant to more complex\nhierarchical settings, such as spatiotemporal models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:17:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Foo","Yong See",""],["Flegg","Jennifer A.",""]]}
{"id":"2308.16466","submitter":"Yiming Zhang","authors":"Yiming Zhang, Tianang Leng, Kun Han, Xiaohui Xie","title":"Self-Sampling Meta SAM: Enhancing Few-shot Medical Image Segmentation\n  with Meta-Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While the Segment Anything Model (SAM) excels in semantic segmentation for\ngeneral-purpose images, its performance significantly deteriorates when applied\nto medical images, primarily attributable to insufficient representation of\nmedical images in its training dataset. Nonetheless, gathering comprehensive\ndatasets and training models that are universally applicable is particularly\nchallenging due to the long-tail problem common in medical images. To address\nthis gap, here we present a Self-Sampling Meta SAM (SSM-SAM) framework for\nfew-shot medical image segmentation. Our innovation lies in the design of three\nkey modules: 1) An online fast gradient descent optimizer, further optimized by\na meta-learner, which ensures swift and robust adaptation to new tasks. 2) A\nSelf-Sampling module designed to provide well-aligned visual prompts for\nimproved attention allocation; and 3) A robust attention-based decoder\nspecifically designed for medical few-shot learning to capture relationship\nbetween different slices. Extensive experiments on a popular abdominal CT\ndataset and an MRI dataset demonstrate that the proposed method achieves\nsignificant improvements over state-of-the-art methods in few-shot\nsegmentation, with an average improvements of 10.21% and 1.80% in terms of DSC,\nrespectively. In conclusion, we present a novel approach for rapid online\nadaptation in interactive image segmentation, adapting to a new organ in just\n0.83 minutes. Code is publicly available on GitHub upon acceptance.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:20:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Yiming",""],["Leng","Tianang",""],["Han","Kun",""],["Xie","Xiaohui",""]]}
{"id":"2308.16467","submitter":"Yangshuai Wang","authors":"Yangshuai Wang","title":"A Posteriori Analysis and Adaptive Algorithms for Blended Type\n  Atomistic-to-Continuum Coupling with Higher-Order Finite Elements","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The efficient and accurate simulation of material systems with defects using\natomistic- to-continuum (a/c) coupling methods is a topic of considerable\ninterest in the field of computational materials science. To achieve the\ndesired balance between accuracy and computational efficiency, the use of a\nposteriori analysis and adaptive algorithms is critical. In this work, we\npresent a rigorous a posteriori error analysis for three typical blended a/c\ncoupling methods: the blended energy-based quasi-continuum (BQCE) method, the\nblended force-based quasi-continuum (BQCF) method, and the atomistic/continuum\nblending with ghost force correction (BGFC) method. We employ first and\nsecond-order finite element methods (and potentially higher-order methods) to\ndiscretize the Cauchy-Born model in the continuum region. The resulting error\nestimator provides both an upper bound on the true approximation error and a\nlower bound up to a theory-based truncation indicator, ensuring its reliability\nand efficiency. Moreover, we propose an a posteriori analysis for the energy\nerror. We have designed and implemented a corresponding adaptive mesh\nrefinement algorithm for two typical examples of crystalline defects. In both\nnumerical experiments, we observe optimal convergence rates with respect to\ndegrees of freedom when compared to a priori error estimates.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:21:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Yangshuai",""]]}
{"id":"2308.16468","submitter":"Yahya Saleh","authors":"Yahya Saleh, \\'Alvaro Fern\\'andez Corral, Armin Iske, Jochen K\\\"upper,\n  and Andrey Yachmenev","title":"Computing excited states of molecules using normalizing flows","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a new nonlinear variational framework for simultaneously computing\nground and excited states of quantum systems. Our approach is based on\napproximating wavefunctions in the linear span of basis functions that are\naugmented and optimized \\emph{via} composition with normalizing flows. The\naccuracy and efficiency of our approach are demonstrated in the calculations of\na large number of vibrational states of the triatomic H$_2$S molecule as well\nas ground and several excited electronic states of prototypical one-electron\nsystems including the hydrogen atom, the molecular hydrogen ion, and a carbon\natom in a single-active-electron approximation. The results demonstrate\nsignificant improvements in the accuracy of energy predictions and accelerated\nbasis-set convergence even when using normalizing flows with a small number of\nparameters. The present approach can be also seen as the optimization of a set\nof intrinsic coordinates that best capture the underlying physics within the\ngiven basis set.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:22:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Saleh","Yahya",""],["Corral","\u00c1lvaro Fern\u00e1ndez",""],["Iske","Armin",""],["K\u00fcpper","Jochen",""],["Yachmenev","Andrey",""]]}
{"id":"2308.16469","submitter":"Quoc-Nam Nguyen","authors":"Chau-Thang Phan, Quoc-Nam Nguyen, Kiet Van Nguyen","title":"Link Prediction for Wikipedia Articles as a Natural Language Inference\n  Task","comments":"Accepted at the 10th IEEE International Conference On Data Science\n  And Advanced Analytics (DSAA 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Link prediction task is vital to automatically understanding the structure of\nlarge knowledge bases. In this paper, we present our system to solve this task\nat the Data Science and Advanced Analytics 2023 Competition \"Efficient and\nEffective Link Prediction\" (DSAA-2023 Competition) with a corpus containing\n948,233 training and 238,265 for public testing. This paper introduces an\napproach to link prediction in Wikipedia articles by formulating it as a\nnatural language inference (NLI) task. Drawing inspiration from recent\nadvancements in natural language processing and understanding, we cast link\nprediction as an NLI task, wherein the presence of a link between two articles\nis treated as a premise, and the task is to determine whether this premise\nholds based on the information presented in the articles. We implemented our\nsystem based on the Sentence Pair Classification for Link Prediction for the\nWikipedia Articles task. Our system achieved 0.99996 Macro F1-score and 1.00000\nMacro F1-score for the public and private test sets, respectively. Our team\nUIT-NLP ranked 3rd in performance on the private test set, equal to the scores\nof the first and second places. Our code is publicly for research purposes.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:25:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Phan","Chau-Thang",""],["Nguyen","Quoc-Nam",""],["Van Nguyen","Kiet",""]]}
{"id":"2308.16470","submitter":"Xi Zhou","authors":"Xiao Shen, Shirui Pan, Kup-Sze Choi, Xi Zhou","title":"Domain-adaptive Message Passing Graph Neural Network","comments":null,"journal-ref":"Neural Networks 164 (2023): 439-454","doi":"10.1016/j.neunet.2023.04.038","report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Cross-network node classification (CNNC), which aims to classify nodes in a\nlabel-deficient target network by transferring the knowledge from a source\nnetwork with abundant labels, draws increasing attention recently. To address\nCNNC, we propose a domain-adaptive message passing graph neural network\n(DM-GNN), which integrates graph neural network (GNN) with conditional\nadversarial domain adaptation. DM-GNN is capable of learning informative\nrepresentations for node classification that are also transferrable across\nnetworks. Firstly, a GNN encoder is constructed by dual feature extractors to\nseparate ego-embedding learning from neighbor-embedding learning so as to\njointly capture commonality and discrimination between connected nodes.\nSecondly, a label propagation node classifier is proposed to refine each node's\nlabel prediction by combining its own prediction and its neighbors' prediction.\nIn addition, a label-aware propagation scheme is devised for the labeled source\nnetwork to promote intra-class propagation while avoiding inter-class\npropagation, thus yielding label-discriminative source embeddings. Thirdly,\nconditional adversarial domain adaptation is performed to take the\nneighborhood-refined class-label information into account during adversarial\ndomain adaptation, so that the class-conditional distributions across networks\ncan be better matched. Comparisons with eleven state-of-the-art methods\ndemonstrate the effectiveness of the proposed DM-GNN.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:26:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shen","Xiao",""],["Pan","Shirui",""],["Choi","Kup-Sze",""],["Zhou","Xi",""]]}
{"id":"2308.16471","submitter":"Jun Morimoto","authors":"Satoshi Yamamori, Jun Morimoto","title":"A Policy Adaptation Method for Implicit Multitask Reinforcement Learning\n  Problems","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In dynamic motion generation tasks, including contact and collisions, small\nchanges in policy parameters can lead to extremely different returns. For\nexample, in soccer, the ball can fly in completely different directions with a\nsimilar heading motion by slightly changing the hitting position or the force\napplied to the ball or when the friction of the ball varies. However, it is\ndifficult to imagine that completely different skills are needed for heading a\nball in different directions. In this study, we proposed a multitask\nreinforcement learning algorithm for adapting a policy to implicit changes in\ngoals or environments in a single motion category with different reward\nfunctions or physical parameters of the environment. We evaluated the proposed\nmethod on the ball heading task using a monopod robot model. The results showed\nthat the proposed method can adapt to implicit changes in the goal positions or\nthe coefficients of restitution of the ball, whereas the standard domain\nrandomization approach cannot cope with different task settings.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:26:14 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yamamori","Satoshi",""],["Morimoto","Jun",""]]}
{"id":"2308.16472","submitter":"Ming Ng","authors":"Ming Ng","title":"Logical Berkovich Geometry: A Point-free Perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Extending our insights from \\cite{NVOstrowski}, we apply point-free\ntechniques to sharpen a foundational result in Berkovich geometry. In our\nlanguage, given the ring $\\mathcal{A}:=K\\{R^{-1}T\\}$ of convergent power series\nover a suitable non-Archimedean field $K$, the points of its Berkovich Spectrum\n$\\mathcal{M}(\\mathcal{A})$ correspond to $R$-good filters. The surprise is\nthat, unlike the original result by Berkovich, we do not require the field $K$\nto be non-trivially valued. Our investigations into non-Archimedean geometry\ncan be understood as being framed by the question: what is the relationship\nbetween topology and logic?\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:27:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ng","Ming",""]]}
{"id":"2308.16473","submitter":"Haibo Wang","authors":"HaiBo Wang, Zonglin Yao, Fuyang Zhou, Yong Wu, Jianguo Wang, and\n  Xiangjun Chen","title":"Suppressing electron disorder-induced heating of ultracold neutral\n  plasma via optical lattice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Disorder-induced heating (DIH) prevents ultracold neutral plasma into\nelectron strong coupling regime. Here we propose a scheme to suppress\nelectronic DIH via optical lattice. We simulate the evolution dynamics of\nultracold neutral plasma constrained by three-dimensional optical lattice using\nclassical molecular dynamics method. The results show that for experimentally\nachievable condition, electronic DIH is suppressed by a factor of 1.3, and the\nCoulomb coupling strength can reach to 0.8 which is approaching the strong\ncoupling regime. Suppressing electronic DIH via optical lattice may pave a way\nfor the research of electronic strongly coupled plasma.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:30:22 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","HaiBo",""],["Yao","Zonglin",""],["Zhou","Fuyang",""],["Wu","Yong",""],["Wang","Jianguo",""],["Chen","Xiangjun",""]]}
{"id":"2308.16474","submitter":"Yongqiang Zhao","authors":"Yongqiang Zhao, Zhenyu Li, Feng Zhang, Xinhai Xu, Donghong Liu","title":"Enhancing Subtask Performance of Multi-modal Large Language Model","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":"  Multi-modal Large Language Model (MLLM) refers to a model expanded from a\nLarge Language Model (LLM) that possesses the capability to handle and infer\nmulti-modal data. Current MLLMs typically begin by using LLMs to decompose\ntasks into multiple subtasks, then employing individual pre-trained models to\ncomplete specific subtasks, and ultimately utilizing LLMs to integrate the\nresults of each subtasks to obtain the results of the task. In real-world\nscenarios, when dealing with large projects, it is common practice to break\ndown the project into smaller sub-projects, with different teams providing\ncorresponding solutions or results. The project owner then decides which\nsolution or result to use, ensuring the best possible outcome for each subtask\nand, consequently, for the entire project. Inspired by this, this study\nconsiders selecting multiple pre-trained models to complete the same subtask.\nBy combining the results from multiple pre-trained models, the optimal subtask\nresult is obtained, enhancing the performance of the MLLM. Specifically, this\nstudy first selects multiple pre-trained models focused on the same subtask\nbased on distinct evaluation approaches, and then invokes these models in\nparallel to process input data and generate corresponding subtask results.\nFinally, the results from multiple pre-trained models for the same subtask are\ncompared using the LLM, and the best result is chosen as the outcome for that\nsubtask. Extensive experiments are conducted in this study using GPT-4\nannotated datasets and human-annotated datasets. The results of various\nevaluation metrics adequately demonstrate the effectiveness of the proposed\napproach in this paper.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:37:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhao","Yongqiang",""],["Li","Zhenyu",""],["Zhang","Feng",""],["Xu","Xinhai",""],["Liu","Donghong",""]]}
{"id":"2308.16475","submitter":"Yuxuan Hu","authors":"Yuxuan Hu, Jing Zhang, Chen Zhao, Cuiping Li, Hong Chen","title":"Transformer Compression via Subspace Projection","comments":"21 pages, 1 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose TCSP, a novel method for compressing a transformer model by\nfocusing on reducing the hidden size of the model. By projecting the whole\ntransform model into a subspace, we enable matrix operations between the weight\nmatrices in the model and features in a reduced-dimensional space, leading to\nsignificant reductions in model parameters and computing resources. To\nestablish this subspace, we decompose the feature matrix, derived from\ndifferent layers of sampled data instances, into a projection matrix. For\nevaluation, TCSP is applied to compress T5 and BERT models on the GLUE and\nSQuAD benchmarks. Experimental results demonstrate that TCSP achieves a\ncompression ratio of 44\\% with at most 1.6\\% degradation in accuracy,\nsurpassing or matching prior compression methods. Furthermore, TCSP exhibits\ncompatibility with other methods targeting filter and attention head size\ncompression.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:40:14 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hu","Yuxuan",""],["Zhang","Jing",""],["Zhao","Chen",""],["Li","Cuiping",""],["Chen","Hong",""]]}
{"id":"2308.16476","submitter":"Zhipeng Yu","authors":"Zhipeng Yu, Jin Lin, Feng Liu, Jiarong Li, Yingtian Chi, Yonghua Song,\n  Zhengwei Ren","title":"Multi-Stage Expansion Planning for Decarbonizing Thermal Generation\n  Supported Renewable Power Systems Using Hydrogen and Ammonia Storage","comments":"10 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale centralized development of wind and solar energy and peer-to-grid\ntransmission of renewable energy source (RES) via high voltage direct current\n(HVDC) has been regarded as one of the most promising ways to achieve goals of\npeak carbon and carbon neutrality in China. Traditionally, large-scale thermal\ngeneration is needed to economically support the load demand of HVDC with a\ngiven profile, which in turn raises concerns about carbon emissions. To address\nthe issues above, hydrogen energy storage system (HESS) and ammonia energy\nstorage system (AESS) are introduced to gradually replace thermal generation,\nwhich is represented as a multi-stage expansion planning (MSEP) problem.\nSpecifically, first, HESS and AESS are established in the MSEP model with\ncarbon emission reduction constraints, and yearly data with hourly time\nresolution are utilized for each stage to well describe the intermittence of\nRES. Then, a combined Dantzig-Wolfe decomposition (DWD) and column generation\n(CG) solution approach is proposed to efficiently solve the large-scale MSEP\nmodel. Finally, a real-life system in China is studied. The results indicate\nthat HESS and AESS have the potential to handle the intermittence of RES, as\nwell as the monthly imbalance between RES and load demand. Especially under the\ngoal of carbon neutrality, the contribution of HESS and AESS in reducing\nlevelized cost of energy (LCOE) reaches 12.28% and 14.59%, respectively, which\nfinally leads to a LCOE of 0.4324 RMB/kWh.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:43:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yu","Zhipeng",""],["Lin","Jin",""],["Liu","Feng",""],["Li","Jiarong",""],["Chi","Yingtian",""],["Song","Yonghua",""],["Ren","Zhengwei",""]]}
{"id":"2308.16477","submitter":"Wenjie Ding","authors":"Wenjie Ding, Limeng Qiao, Xi Qiu, Chi Zhang","title":"PivotNet: Vectorized Pivot Learning for End-to-end HD Map Construction","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":"  Vectorized high-definition map online construction has garnered considerable\nattention in the field of autonomous driving research. Most existing approaches\nmodel changeable map elements using a fixed number of points, or predict local\nmaps in a two-stage autoregressive manner, which may miss essential details and\nlead to error accumulation. Towards precise map element learning, we propose a\nsimple yet effective architecture named PivotNet, which adopts unified\npivot-based map representations and is formulated as a direct set prediction\nparadigm. Concretely, we first propose a novel Point-to-Line Mask module to\nencode both the subordinate and geometrical point-line priors in the network.\nThen, a well-designed Pivot Dynamic Matching module is proposed to model the\ntopology in dynamic point sequences by introducing the concept of sequence\nmatching. Furthermore, to supervise the position and topology of the vectorized\npoint predictions, we propose a Dynamic Vectorized Sequence loss. Extensive\nexperiments and ablations show that PivotNet is remarkably superior to other\nSOTAs by 5.9 mAP at least. The code will be available soon.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 05:43:46 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ding","Wenjie",""],["Qiao","Limeng",""],["Qiu","Xi",""],["Zhang","Chi",""]]}
{"id":"2308.16478","submitter":"Luis Iv\\'an Hern\\'andez Ru\\'iz","authors":"Luis Iv\\'an Hern\\'andez Ru\\'iz","title":"Law of large numbers and central limit theorem for renewal Hawkes\n  processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A uniform law of large numbers and a central limit theorem are established\nvia a martingale approach for a univariate Hawkes process with immigration\ngiven by a renewal process. The results are obtained for renewal processes with\nabsolutely continuous interarrival distribution.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:10:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ru\u00edz","Luis Iv\u00e1n Hern\u00e1ndez",""]]}
{"id":"2308.16479","submitter":"Songbai Chen","authors":"Songbai Chen, Jiliang Jing","title":"Kerr black hole shadow casted by the extraordinary light rays with Weyl\n  corrections","comments":"14 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have investigated the equation of motion for photons with Weyl corrections\nin a Kerr black hole spacetime in the small coupling case. Our results show\nthat Weyl corrections yield phenomena of birefringence. The light rays\npropagating in the spacetime are separated into the ordinary rays and the\nextraordinary rays, and the propagation of the latter depends on the\ncorrections. We probe the effects of Weyl corrections on the Kerr black hole\nshadows casted by the extraordinary rays and find that such corrections result\nin a weak stretching or squeezing in the vertical direction for the black hole\nshadows. Finally, we also study the change of the length of the Near-Horizon\nExtremal Kerr line (NHEK line) with Weyl corrections. These features could help\nus to understand the electrodynamics with Weyl corrections from black hole\nshadows.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:19:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Songbai",""],["Jing","Jiliang",""]]}
{"id":"2308.16480","submitter":"Won Kyung Do","authors":"Won Kyung Do, Bianca Aumann, Camille Chungyoun, and Monroe Kennedy III","title":"Inter-finger Small Object Manipulation with DenseTact Optical Tactile\n  Sensor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The ability to grasp and manipulate small objects in cluttered environments\nremains a significant challenge. This paper introduces a novel approach that\nutilizes a tactile sensor-equipped gripper with eight degrees of freedom to\novercome these limitations. We employ DenseTact 2.0 for the gripper, enabling\nprecise control and improved grasp success rates, particularly for small\nobjects ranging from 5mm to 25mm. Our integrated strategy incorporates the\nrobot arm, gripper, and sensor to manipulate and orient small objects for\nsubsequent classification effectively. We contribute a specialized dataset\ndesigned for classifying these objects based on tactile sensor output and a new\ncontrol algorithm for in-hand orientation tasks. Our system demonstrates 88% of\nsuccessful grasp and successfully classified small objects in cluttered\nscenarios.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:26:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Do","Won Kyung",""],["Aumann","Bianca",""],["Chungyoun","Camille",""],["Kennedy","Monroe","III"]]}
{"id":"2308.16481","submitter":"Ahmed Hatem","authors":"Ahmed Hatem, Yiming Qian, Yang Wang","title":"Point-TTA: Test-Time Adaptation for Point Cloud Registration Using\n  Multitask Meta-Auxiliary Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present Point-TTA, a novel test-time adaptation framework for point cloud\nregistration (PCR) that improves the generalization and the performance of\nregistration models. While learning-based approaches have achieved impressive\nprogress, generalization to unknown testing environments remains a major\nchallenge due to the variations in 3D scans. Existing methods typically train a\ngeneric model and the same trained model is applied on each instance during\ntesting. This could be sub-optimal since it is difficult for the same model to\nhandle all the variations during testing. In this paper, we propose a test-time\nadaptation approach for PCR. Our model can adapt to unseen distributions at\ntest-time without requiring any prior knowledge of the test data. Concretely,\nwe design three self-supervised auxiliary tasks that are optimized jointly with\nthe primary PCR task. Given a test instance, we adapt our model using these\nauxiliary tasks and the updated model is used to perform the inference. During\ntraining, our model is trained using a meta-auxiliary learning approach, such\nthat the adapted model via auxiliary tasks improves the accuracy of the primary\ntask. Experimental results demonstrate the effectiveness of our approach in\nimproving generalization of point cloud registration and outperforming other\nstate-of-the-art approaches.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:32:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hatem","Ahmed",""],["Qian","Yiming",""],["Wang","Yang",""]]}
{"id":"2308.16482","submitter":"Farhad Keramat dashliborun","authors":"Salma Salimi, Farhad Keramat, Tomi Westerlund, Jorge Pe\\~na Queralta","title":"A Customizable Conflict Resolution and Attribute-Based Access Control\n  Framework for Multi-Robot Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As multi-robot systems continue to advance and become integral to various\napplications, managing conflicts and ensuring secure access control are\ncritical challenges that need to be addressed. Access control is essential in\nmulti-robot systems to ensure secure and authorized interactions among robots,\nprotect sensitive data, and prevent unauthorized access to resources. This\npaper presents a novel framework for customizable conflict resolution and\nattribute-based access control in multi-robot systems for ROS 2 leveraging the\nHyperledger Fabric blockchain. We introduce an attribute-based access control\n(ABAC) Fabric-ROS 2 bridge to enable secure communication and control between\nusers and robots. By defining conflict resolution policies based on task\npriorities, robot capabilities, and user-defined constraints, our framework\noffers a flexible way to resolve conflicts. Additionally, it incorporates\nattribute-based access control, granting access rights based on user and robot\nattributes. ABAC offers a modular approach to control access compared to\nexisting access control approaches in ROS 2, such as SROS2. Through this\nframework, multi-robot systems can be managed efficiently, securely, and\nadaptably, ensuring controlled access to resources and managing conflicts. Our\nexperimental evaluation shows that our framework marginally improves latency\nand throughput over exiting Fabric and ROS 2 integration solutions. At higher\nnetwork load, it is the only solution to operate reliably without a diverging\ntransaction commitment latency. We also demonstrate how conflicts arising from\nsimultaneous control or a robot by two users are resolved in real-time and\nmotion distortion is effectively eliminated.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:37:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Salimi","Salma",""],["Keramat","Farhad",""],["Westerlund","Tomi",""],["Queralta","Jorge Pe\u00f1a",""]]}
{"id":"2308.16483","submitter":"Jaeik Jeon","authors":"Jaeik Jeon, Seongmin Ha, Yeonyee E. Yoon, Jiyeon Kim, Hyunseok Jeong,\n  Dawun Jeong, Yeonggul Jang, Youngtaek Hong and Hyuk-Jae Chang","title":"Echocardiographic View Classification with Integrated\n  Out-of-Distribution Detection for Enhanced Automatic Echocardiographic\n  Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.HC cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the rapidly evolving field of automatic echocardiographic analysis and\ninterpretation, automatic view classification is a critical yet challenging\ntask, owing to the inherent complexity and variability of echocardiographic\ndata. This study presents ECHOcardiography VIew Classification with\nOut-of-Distribution dEtection (ECHO-VICODE), a novel deep learning-based\nframework that effectively addresses this challenge by training to classify 31\nclasses, surpassing previous studies and demonstrating its capacity to handle a\nwide range of echocardiographic views. Furthermore, ECHO-VICODE incorporates an\nintegrated out-of-distribution (OOD) detection function, leveraging the\nrelative Mahalanobis distance to effectively identify 'near-OOD' instances\ncommonly encountered in echocardiographic data. Through extensive\nexperimentation, we demonstrated the outstanding performance of ECHO-VICODE in\nterms of view classification and OOD detection, significantly reducing the\npotential for errors in echocardiographic analyses. This pioneering study\nsignificantly advances the domain of automated echocardiography analysis and\nexhibits promising prospects for substantial applications in extensive clinical\nresearch and practice.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:44:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jeon","Jaeik",""],["Ha","Seongmin",""],["Yoon","Yeonyee E.",""],["Kim","Jiyeon",""],["Jeong","Hyunseok",""],["Jeong","Dawun",""],["Jang","Yeonggul",""],["Hong","Youngtaek",""],["Chang","Hyuk-Jae",""]]}
{"id":"2308.16484","submitter":"Ahmed Hatem","authors":"Ahmed Hatem, Yiming Qian, Yang Wang","title":"Test-Time Adaptation for Point Cloud Upsampling Using Meta-Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Affordable 3D scanners often produce sparse and non-uniform point clouds that\nnegatively impact downstream applications in robotic systems. While existing\npoint cloud upsampling architectures have demonstrated promising results on\nstandard benchmarks, they tend to experience significant performance drops when\nthe test data have different distributions from the training data. To address\nthis issue, this paper proposes a test-time adaption approach to enhance model\ngenerality of point cloud upsampling. The proposed approach leverages\nmeta-learning to explicitly learn network parameters for test-time adaption.\nOur method does not require any prior information about the test data. During\nmeta-training, the model parameters are learned from a collection of\ninstance-level tasks, each of which consists of a sparse-dense pair of point\nclouds from the training data. During meta-testing, the trained model is\nfine-tuned with a few gradient updates to produce a unique set of network\nparameters for each test instance. The updated model is then used for the final\nprediction. Our framework is generic and can be applied in a plug-and-play\nmanner with existing backbone networks in point cloud upsampling. Extensive\nexperiments demonstrate that our approach improves the performance of\nstate-of-the-art models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:44:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hatem","Ahmed",""],["Qian","Yiming",""],["Wang","Yang",""]]}
{"id":"2308.16485","submitter":"Xuechen Wang","authors":"Xuechen Wang, Shiwan Zhao, Yong Qin","title":"Supervised Contrastive Learning with Nearest Neighbor Search for Speech\n  Emotion Recognition","comments":"Accepted by lnterspeech 2023, poster","journal-ref":"INTERSPEECH 2023, 1913-1917","doi":"10.21437/Interspeech.2023-842","report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Speech Emotion Recognition (SER) is a challenging task due to limited data\nand blurred boundaries of certain emotions. In this paper, we present a\ncomprehensive approach to improve the SER performance throughout the model\nlifecycle, including pre-training, fine-tuning, and inference stages. To\naddress the data scarcity issue, we utilize a pre-trained model, wav2vec2.0.\nDuring fine-tuning, we propose a novel loss function that combines\ncross-entropy loss with supervised contrastive learning loss to improve the\nmodel's discriminative ability. This approach increases the inter-class\ndistances and decreases the intra-class distances, mitigating the issue of\nblurred boundaries. Finally, to leverage the improved distances, we propose an\ninterpolation method at the inference stage that combines the model prediction\nwith the output from a k-nearest neighbors model. Our experiments on IEMOCAP\ndemonstrate that our proposed methods outperform current state-of-the-art\nresults.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:45:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Xuechen",""],["Zhao","Shiwan",""],["Qin","Yong",""]]}
{"id":"2308.16486","submitter":"Chenglong Li","authors":"Andong Lu, Zhang Zhang, Yan Huang, Yifan Zhang, Chenglong Li, Jin\n  Tang, and Liang Wang","title":"Illumination Distillation Framework for Nighttime Person\n  Re-Identification and A New Benchmark","comments":"Accepted by TMM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Nighttime person Re-ID (person re-identification in the nighttime) is a very\nimportant and challenging task for visual surveillance but it has not been\nthoroughly investigated. Under the low illumination condition, the performance\nof person Re-ID methods usually sharply deteriorates. To address the low\nillumination challenge in nighttime person Re-ID, this paper proposes an\nIllumination Distillation Framework (IDF), which utilizes illumination\nenhancement and illumination distillation schemes to promote the learning of\nRe-ID models. Specifically, IDF consists of a master branch, an illumination\nenhancement branch, and an illumination distillation module. The master branch\nis used to extract the features from a nighttime image. The illumination\nenhancement branch first estimates an enhanced image from the nighttime image\nusing a nonlinear curve mapping method and then extracts the enhanced features.\nHowever, nighttime and enhanced features usually contain data noise due to\nunstable lighting conditions and enhancement failures. To fully exploit the\ncomplementary benefits of nighttime and enhanced features while suppressing\ndata noise, we propose an illumination distillation module. In particular, the\nillumination distillation module fuses the features from two branches through a\nbottleneck fusion model and then uses the fused features to guide the learning\nof both branches in a distillation manner. In addition, we build a real-world\nnighttime person Re-ID dataset, named Night600, which contains 600 identities\ncaptured from different viewpoints and nighttime illumination conditions under\ncomplex outdoor environments. Experimental results demonstrate that our IDF can\nachieve state-of-the-art performance on two nighttime person Re-ID datasets\n(i.e., Night600 and Knight ). We will release our code and dataset at\nhttps://github.com/Alexadlu/IDF.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:45:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lu","Andong",""],["Zhang","Zhang",""],["Huang","Yan",""],["Zhang","Yifan",""],["Li","Chenglong",""],["Tang","Jin",""],["Wang","Liang",""]]}
{"id":"2308.16487","submitter":"Wenkai Ouyang","authors":"Wenkai Ouyang, Alexander C. Lygo, Yubi Chen, Huiyuan Zheng, Dung Vu,\n  Brandi L. Wooten, Xichen Liang, Wang Yao, Joseph P. Heremans, Susanne\n  Stemmer, and Bolin Liao","title":"Extraordinary Thermoelectric Properties of Topological Surface States in\n  Quantum-Confined Cd3As2 Thin Films","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Topological insulators and semimetals have been shown to possess intriguing\nthermoelectric properties promising for energy harvesting and cooling\napplications. However, thermoelectric transport associated with the Fermi arc\ntopological surface states on topological Dirac semimetals remains less\nexplored. In this work, we systematically examine thermoelectric transport in a\nseries of topological Dirac semimetal Cd3As2 thin films grown by molecular beam\nepitaxy. Surprisingly, we find significantly enhanced Seebeck effect and\nanomalous Nernst effect at cryogenic temperatures when the Cd3As2 layer is\nthin. Combining angle-dependent quantum oscillation analysis,\nmagnetothermoelectric measurement, transport modelling and first-principles\nsimulation, we isolate the contributions from bulk and surface conducting\nchannels and attribute the unusual thermoeletric properties to the topological\nsurface states. Our analysis showcases the rich thermoelectric transport\nphysics in quantum-confined topological Dirac semimetal thin films and suggests\nnew routes to achieving high thermoelectric performance at cryogenic\ntemperatures.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:46:54 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ouyang","Wenkai",""],["Lygo","Alexander C.",""],["Chen","Yubi",""],["Zheng","Huiyuan",""],["Vu","Dung",""],["Wooten","Brandi L.",""],["Liang","Xichen",""],["Yao","Wang",""],["Heremans","Joseph P.",""],["Stemmer","Susanne",""],["Liao","Bolin",""]]}
{"id":"2308.16488","submitter":"Hui Wang","authors":"Hui Wang, Shiwan Zhao, Xiguang Zheng, Yong Qin","title":"RAMP: Retrieval-Augmented MOS Prediction via Confidence-based Dynamic\n  Weighting","comments":"Accepted by Interspeech 2023, oral","journal-ref":"INTERSPEECH 2023, 1095-1099","doi":"10.21437/Interspeech.2023-851","report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automatic Mean Opinion Score (MOS) prediction is crucial to evaluate the\nperceptual quality of the synthetic speech. While recent approaches using\npre-trained self-supervised learning (SSL) models have shown promising results,\nthey only partly address the data scarcity issue for the feature extractor.\nThis leaves the data scarcity issue for the decoder unresolved and leading to\nsuboptimal performance. To address this challenge, we propose a\nretrieval-augmented MOS prediction method, dubbed {\\bf RAMP}, to enhance the\ndecoder's ability against the data scarcity issue. A fusing network is also\nproposed to dynamically adjust the retrieval scope for each instance and the\nfusion weights based on the predictive confidence. Experimental results show\nthat our proposed method outperforms the existing methods in multiple\nscenarios.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:48:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Hui",""],["Zhao","Shiwan",""],["Zheng","Xiguang",""],["Qin","Yong",""]]}
{"id":"2308.16489","submitter":"Sandeep Kumar Mondal","authors":"Sandeep Kumar Mondal, Saikat Das, Nayantara Gupta","title":"Unraveling the Emission Mechanism of the HBL Source Mrk 180 with\n  Multi-Wavelength Data","comments":"8 pages, 4 figures, 1 table. arXiv admin note: substantial text\n  overlap with arXiv:2212.07331","journal-ref":"PoS ICRC2023 (2023) 942","doi":"10.22323/1.444.0942","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Markarian (Mrk) 180 is a High frequency-peaked BL Lacertae object or HBL\nobject, located at a redshift of 0.045 and a potential candidate for\nhigh-energy cosmic ray acceleration. In this work, we have done a temporal and\nspectral study using Fermi Large Area Telescope (Fermi-LAT) $\\gamma$-ray data,\ncollected over 12.8 years. In the case of the temporal study, the 12.8 years\nlong, 30-day binned, Fermi-LAT $\\gamma$-ray light curve does not show any\nsignificant enhancement of the flux. To understand the underlying physical\nmechanism, we focused our study on multi-wavelength spectral analysis. We\nconstructed multi-wavelength spectral energy distribution (MWSED) using Swift\nX-ray, ultraviolet & optical, and X-ray Multi-Mirror Mission (XMM-Newton) data,\nwhich have been analysed thoroughly. The SED has been modelled with three\ndifferent models: (i) pure leptonic scenario and lepto-hadronic scenario where\nwe considered two types of lepto-hadronic interactions (ii) line-of-sight\ninteractions of ultrahigh-energy cosmic rays (UHECR; $E\\gtrsim 10^{17}$ eV)\nwith the cosmic background radiation and (iii) interaction between relativistic\nprotons with the cold proton within the blazar jet. In this literature, we have\ndone a detailed comparative study between all these three models. In an earlier\nstudy, Mrk 180 was associated with the Telescope Array (TA) hotspot of UHECRs\nat $E>57$ EeV which motivates us to check whether Mrk 180 can be a source of\nUHECRs, contributing to the TA hotspot. From our study, we find, for\nconservative strengths of the extragalactic magnetic field, Mrk 180 is unlikely\nto be a source of UHECR events.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:52:20 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mondal","Sandeep Kumar",""],["Das","Saikat",""],["Gupta","Nayantara",""]]}
{"id":"2308.16490","submitter":"Shih-Chieh Su","authors":"Shih-Chieh Su","title":"Latent Painter","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Latent diffusers revolutionized the generative AI and inspired creative art.\nWhen denoising the latent, the predicted original image at each step\ncollectively animates the formation. However, the animation is limited by the\ndenoising nature of the diffuser, and only renders a sharpening process. This\nwork presents Latent Painter, which uses the latent as the canvas, and the\ndiffuser predictions as the plan, to generate painting animation. Latent\nPainter also transits one generated image to another, which can happen between\nimages from two different sets of checkpoints.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:52:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Su","Shih-Chieh",""]]}
{"id":"2308.16491","submitter":"Kristina Gligoric","authors":"Kristina Gligoric and Tiziano Piccardi and Jake Hofman and Robert West","title":"In-class Data Analysis Replications: Teaching Students while Testing\n  Science","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.LG cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Science is facing a reproducibility crisis. Previous work has proposed\nincorporating data analysis replications into classrooms as a potential\nsolution. However, despite the potential benefits, it is unclear whether this\napproach is feasible, and if so, what the involved stakeholders-students,\neducators, and scientists-should expect from it. Can students perform a data\nanalysis replication over the course of a class? What are the costs and\nbenefits for educators? And how can this solution help benchmark and improve\nthe state of science?\n  In the present study, we incorporated data analysis replications in the\nproject component of the Applied Data Analysis course (CS-401) taught at EPFL\n(N=354 students). Here we report pre-registered findings based on surveys\nadministered throughout the course. First, we demonstrate that students can\nreplicate previously published scientific papers, most of them qualitatively\nand some exactly. We find discrepancies between what students expect of data\nanalysis replications and what they experience by doing them along with changes\nin expectations about reproducibility, which together serve as evidence of\nattitude shifts to foster students' critical thinking. Second, we provide\ninformation for educators about how much overhead is needed to incorporate\nreplications into the classroom and identify concerns that replications bring\nas compared to more traditional assignments. Third, we identify tangible\nbenefits of the in-class data analysis replications for scientific communities,\nsuch as a collection of replication reports and insights about replication\nbarriers in scientific work that should be avoided going forward.\n  Overall, we demonstrate that incorporating replication tasks into a large\ndata science class can increase the reproducibility of scientific work as a\nby-product of data science instruction, thus benefiting both science and\nstudents.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:53:22 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gligoric","Kristina",""],["Piccardi","Tiziano",""],["Hofman","Jake",""],["West","Robert",""]]}
{"id":"2308.16492","submitter":"Haonan Ling","authors":"Haonan Ling, Milad Nourbakhsh, Vincent R. Whiteside, Joseph G.\n  Tischler, Artur R. Davoyan","title":"Near-unity light-matter interaction in mid-infrared van der Waals\n  nanocavities","comments":"14 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Accessing mid-infrared radiation is of great importance for a range of\napplications, including thermal imaging, sensing, and radiative cooling. Here,\nwe study light interaction with hexagonal boron nitride nanocavities and reveal\nstrong and tunable resonances across its hyperbolic transition. In addition to\nconventional phonon-polariton excitations, we demonstrate that the high\nrefractive index of hexagonal boron nitride outside the Reststrahlen band\nallows enhanced light-matter interactions in deep subwavelength (<{\\lambda}/15)\nnanostructures across a broad 7-8 {\\mu}m range. Near-unity absorption and high\nquality (Q>80) resonance interaction in the vicinity of the transverse optical\nphonon is observed. Our study provides new avenues to design highly efficient\nand ultracompact structures for controlling mid-infrared radiation and\naccessing strong light-matter interaction.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:53:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ling","Haonan",""],["Nourbakhsh","Milad",""],["Whiteside","Vincent R.",""],["Tischler","Joseph G.",""],["Davoyan","Artur R.",""]]}
{"id":"2308.16493","submitter":"Reza Akhavian","authors":"Riley Tavassoli, Mani Amani, Reza Akhavian","title":"Expanding Frozen Vision-Language Models without Retraining: Towards\n  Improved Robot Perception","comments":"Preprint submitted to Information Fusion","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Vision-language models (VLMs) have shown powerful capabilities in visual\nquestion answering and reasoning tasks by combining visual representations with\nthe abstract skill set large language models (LLMs) learn during pretraining.\nVision, while the most popular modality to augment LLMs with, is only one\nrepresentation of a scene. In human-robot interaction scenarios, robot\nperception requires accurate scene understanding by the robot. In this paper,\nwe define and demonstrate a method of aligning the embedding spaces of\ndifferent modalities (in this case, inertial measurement unit (IMU) data) to\nthe vision embedding space through a combination of supervised and contrastive\ntraining, enabling the VLM to understand and reason about these additional\nmodalities without retraining. We opt to give the model IMU embeddings directly\nover using a separate human activity recognition model that feeds directly into\nthe prompt to allow for any nonlinear interactions between the query, image,\nand IMU signal that would be lost by mapping the IMU data to a discrete\nactivity label. Further, we demonstrate our methodology's efficacy through\nexperiments involving human activity recognition using IMU data and visual\ninputs. Our results show that using multiple modalities as input improves the\nVLM's scene understanding and enhances its overall performance in various\ntasks, thus paving the way for more versatile and capable language models in\nmulti-modal contexts.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:53:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tavassoli","Riley",""],["Amani","Mani",""],["Akhavian","Reza",""]]}
{"id":"2308.16494","submitter":"EPTCS","authors":"Howard Barnum, Matthew A. Graydon (Institute for Quantum Computing,\n  University of Waterloo), Alex Wilce (Susquehanna University)","title":"Locally Tomographic Shadows (Extended Abstract)","comments":"In Proceedings QPL 2023, arXiv:2308.15489","journal-ref":"EPTCS 384, 2023, pp. 47-57","doi":"10.4204/EPTCS.384.3","report-no":null,"categories":"quant-ph math.CT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a monoidal probabilistic theory -- a symmetric monoidal category\n$\\mathcal{C}$ of systems and processes, together with a functor $\\mathbf{V}$\nassigning concrete probabilistic models to objects of $\\mathcal{C}$ -- we\nconstruct a locally tomographic probabilistic theory\nLT$(\\mathcal{C},\\mathbf{V})$ -- the locally tomographic shadow of\n$(\\mathcal{C},\\mathbf{V})$ -- describing phenomena observable by local agents\ncontrolling systems in $\\mathcal{C}$, and able to pool information about joint\nmeasurements made on those systems. Some globally distinct states become\nlocally indistinguishable in LT$(\\mathcal{C},\\mathbf{V})$, and we restrict the\nset of processes to those that respect this indistinguishability. This\nconstruction is investigated in some detail for real quantum theory.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:57:20 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Barnum","Howard","","Institute for Quantum Computing,\n  University of Waterloo"],["Graydon","Matthew A.","","Institute for Quantum Computing,\n  University of Waterloo"],["Wilce","Alex","","Susquehanna University"]]}
{"id":"2308.16495","submitter":"EPTCS","authors":"Gejza Jen\\v{c}a (Slovak University of Technology, Bratislava), Bert\n  Lindenhovius (Slovak Academy of Sciences, Bratislava)","title":"Quantum Suplattices","comments":"In Proceedings QPL 2023, arXiv:2308.15489","journal-ref":"EPTCS 384, 2023, pp. 58-74","doi":"10.4204/EPTCS.384.4","report-no":null,"categories":"cs.DM cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Building on the theory of quantum posets, we introduce a non-commutative\nversion of suplattices, i.e., complete lattices whose morphisms are\nsupremum-preserving maps, which form a step towards a new notion of quantum\ntopological spaces. We show that the theory of these quantum suplattices\nresembles the classical theory: the opposite quantum poset of a quantum\nsuplattice is again a quantum suplattice, and quantum suplattices arise as\nalgebras of a non-commutative version of the monad of downward-closed subsets\nof a poset. The existence of this monad is proved by introducing a\nnon-commutative generalization of monotone relations between quantum posets,\nwhich form a compact closed category. Moreover, we introduce a non-commutative\ngeneralization of Galois connections and we prove that an upper Galois adjoint\nof a monotone map between quantum suplattices exists if and only if the map is\na morphism of quantum suplattices. Finally, we prove a quantum version of the\nKnaster-Tarski fixpoint theorem: the quantum set of fixpoints of a monotone\nendomap on a quantum suplattice form a quantum suplattice.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:57:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jen\u010da","Gejza","","Slovak University of Technology, Bratislava"],["Lindenhovius","Bert","","Slovak Academy of Sciences, Bratislava"]]}
{"id":"2308.16496","submitter":"EPTCS","authors":"Ewan Murphy (University of Oxford), Aleks Kissinger (University of\n  Oxford)","title":"Global Synthesis of CNOT Circuits with Holes","comments":"In Proceedings QPL 2023, arXiv:2308.15489","journal-ref":"EPTCS 384, 2023, pp. 75-88","doi":"10.4204/EPTCS.384.5","report-no":null,"categories":"quant-ph cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A common approach to quantum circuit transformation is to use the properties\nof a specific gate set to create an efficient representation of a given\ncircuit's unitary, such as a parity matrix or stabiliser tableau, and then\nresynthesise an improved circuit, e.g. with fewer gates or respecting\nconnectivity constraints. Since these methods rely on a restricted gate set,\ngeneralisation to arbitrary circuits usually involves slicing the circuit into\npieces that can be resynthesised and working with these separately. The choices\nmade about what gates should go into each slice can have a major effect on the\nperformance of the resynthesis. In this paper we propose an alternative\napproach to generalising these resynthesis algorithms to general quantum\ncircuits. Instead of cutting the circuit into slices, we \"cut out\" the gates we\ncan't resynthesise leaving holes in our quantum circuit. The result is a\nsecond-order process called a quantum comb, which can be resynthesised\ndirectly. We apply this idea to the RowCol algorithm, which resynthesises CNOT\ncircuits for topologically constrained hardware, explaining how we were able to\nextend it to work for quantum combs. We then compare the generalisation of\nRowCol using our method to the naive \"slice and build\" method empirically on a\nvariety of circuit sizes and hardware topologies. Finally, we outline how\nquantum combs could be used to help generalise other resynthesis algorithms.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 06:58:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Murphy","Ewan","","University of Oxford"],["Kissinger","Aleks","","University of\n  Oxford"]]}
{"id":"2308.16497","submitter":"EPTCS","authors":"Robin Cockett (University of Calgary), Jean-Simon Pacaud Lemay\n  (Macquarie University)","title":"Moore-Penrose Dagger Categories","comments":"In Proceedings QPL 2023, arXiv:2308.15489","journal-ref":"EPTCS 384, 2023, pp. 171-186","doi":"10.4204/EPTCS.384.10","report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The notion of a Moore-Penrose inverse (M-P inverse) was introduced by Moore\nin 1920 and rediscovered by Penrose in 1955. The M-P inverse of a complex\nmatrix is a special type of inverse which is unique, always exists, and can be\ncomputed using singular value decomposition. In a series of papers in the\n1980s, Puystjens and Robinson studied M-P inverses more abstractly in the\ncontext of dagger categories. Despite the fact that dagger categories are now a\nfundamental notion in categorical quantum mechanics, the notion of a M-P\ninverse has not (to our knowledge) been revisited since their work. One purpose\nof this paper is, thus, to renew the study of M-P inverses in dagger\ncategories.\n  Here we introduce the notion of a Moore-Penrose dagger category and provide\nmany examples including complex matrices, finite Hilbert spaces, dagger\ngroupoids, and inverse categories. We also introduce generalized versions of\nsingular value decomposition, compact singular value decomposition, and polar\ndecomposition for maps in a dagger category, and show how, having such a\ndecomposition is equivalent to having M-P inverses. This allows us to provide\nprecise characterizations of which maps have M-P inverses in a dagger\nidempotent complete category, a dagger kernel category with dagger biproducts\n(and negatives), and a dagger category with unique square roots.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:00:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cockett","Robin","","University of Calgary"],["Lemay","Jean-Simon Pacaud","","Macquarie University"]]}
{"id":"2308.16498","submitter":"EPTCS","authors":"Kin Ian Lo (University College London, London, UK), Mehrnoosh\n  Sadrzadeh (University College London, London, UK), Shane Mansfield (Quandela,\n  Paris, France)","title":"Generalised Winograd Schema and its Contextuality","comments":"In Proceedings QPL 2023, arXiv:2308.15489","journal-ref":"EPTCS 384, 2023, pp. 187-202","doi":"10.4204/EPTCS.384.11","report-no":null,"categories":"cs.CL cs.AI quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ambiguities in natural language give rise to probability distributions over\ninterpretations. The distributions are often over multiple ambiguous words at a\ntime; a multiplicity which makes them a suitable topic for sheaf-theoretic\nmodels of quantum contextuality. Previous research showed that different\nquantitative measures of contextuality correlate well with Psycholinguistic\nresearch on lexical ambiguities. In this work, we focus on coreference\nambiguities and investigate the Winograd Schema Challenge (WSC), a test\nproposed by Levesque in 2011 to evaluate the intelligence of machines. The WSC\nconsists of a collection of multiple-choice questions that require\ndisambiguating pronouns in sentences structured according to the Winograd\nschema, in a way that makes it difficult for machines to determine the correct\nreferents but remains intuitive for human comprehension. In this study, we\npropose an approach that analogously models the Winograd schema as an\nexperiment in quantum physics. However, we argue that the original Winograd\nSchema is inherently too simplistic to facilitate contextuality. We introduce a\nnovel mechanism for generalising the schema, rendering it analogous to a\nBell-CHSH measurement scenario. We report an instance of this generalised\nschema, complemented by the human judgements we gathered via a crowdsourcing\nplatform. The resulting model violates the Bell-CHSH inequality by 0.192, thus\nexhibiting contextuality in a coreference resolution setting.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:00:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lo","Kin Ian","","University College London, London, UK"],["Sadrzadeh","Mehrnoosh","","University College London, London, UK"],["Mansfield","Shane","","Quandela,\n  Paris, France"]]}
{"id":"2308.16499","submitter":"Markus Reiher","authors":"Miguel Steiner and Markus Reiher","title":"Navigating chemical reaction space with a steering wheel","comments":"40 pages, 10 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":"  Autonomous reaction network exploration algorithms offer a systematic\napproach to explore mechanisms of complex chemical processes. However, the\nresulting reaction networks are so vast that an exploration of all potentially\naccessible intermediates is computationally too demanding. This renders\nbrute-force explorations unfeasible, while explorations with completely\npre-defined intermediates or hard-wired chemical constraints, such as\nelement-specific coordination numbers, are not flexible enough for complex\nchemical systems. Here, we introduce a Steering Wheel to guide an otherwise\nunbiased automated exploration. The Steering Wheel algorithm is intuitive,\ngenerally applicable, and enables one to focus on specific regions of an\nemerging network. It also allows for guiding automated data generation in the\ncontext of mechanism exploration, catalyst design, and other chemical\noptimization challenges. The algorithm is demonstrated for reaction mechanism\nelucidation of transition metal catalysts. We highlight how to explore\ncatalytic cycles in a systematic and reproducible way. The exploration\nobjectives are fully adjustable, allowing one to harness the Steering Wheel for\nboth structure-specific (accurate) calculations as well as for broad\nhigh-throughput screening of possible reaction intermediates.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:05:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Steiner","Miguel",""],["Reiher","Markus",""]]}
{"id":"2308.16500","submitter":"Peter Danchev","authors":"Peter Vassilev Danchev, Truong Huu Dung and Tran Nam Son","title":"Images of Multilinear Polynomials on Generalized Quaternion Algebras","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The main goal of this paper is to extend [J. Algebra Appl. 20 (2021),\n2150074] to generalized quaternion algebras, even when these algebras are not\nnecessarily division rings. More precisely, in such cases, the image of a\nmultilinear polynomial evaluated on a quaternion algebra is a vector space and\nwe additionally provide a classification of possible images.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:12:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Danchev","Peter Vassilev",""],["Dung","Truong Huu",""],["Son","Tran Nam",""]]}
{"id":"2308.16501","submitter":"Mingzheng Paul Tang","authors":"Paul Mingzheng Tang, Ba Phong Tran, Hoong Chuin Lau","title":"Individually Rational Collaborative Vehicle Routing through\n  Give-And-Take Exchanges","comments":"7 pages 4 figures This paper was presented in the IJCAI 2023 First\n  International Workshop on Search and Planning with Complex Objectives\n  (WoSePCO) http://idm-lab.org/wiki/complex-objective","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we are concerned with the automated exchange of orders between\nlogistics companies in a marketplace platform to optimize total revenues. We\nintroduce a novel multi-agent approach to this problem, focusing on the\nCollaborative Vehicle Routing Problem (CVRP) through the lens of individual\nrationality. Our proposed algorithm applies the principles of Vehicle Routing\nProblem (VRP) to pairs of vehicles from different logistics companies,\noptimizing the overall routes while considering standard VRP constraints plus\nindividual rationality constraints. By facilitating cooperation among competing\nlogistics agents through a Give-and-Take approach, we show that it is possible\nto reduce travel distance and increase operational efficiency system-wide. More\nimportantly, our approach ensures individual rationality and faster\nconvergence, which are important properties of ensuring the long-term\nsustainability of the marketplace platform. We demonstrate the efficacy of our\napproach through extensive experiments using real-world test data from major\nlogistics companies. The results reveal our algorithm's ability to rapidly\nidentify numerous optimal solutions, underscoring its practical applicability\nand potential to transform the logistics industry.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:18:37 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tang","Paul Mingzheng",""],["Tran","Ba Phong",""],["Lau","Hoong Chuin",""]]}
{"id":"2308.16502","submitter":"Yang Li","authors":"Yang Li and Xiao Li","title":"Apply Non-Hermitian Physics to Realize Ultra-High-Quality Factors of\n  Optically Trapped Particles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical trapping and binding systems are non-Hermitian. On one hand, the\noptical force is non-Hermitian and may pump energy into the trapped particle\nwhen the non-Hermiticity is sufficiently large. On the other hand, the ambient\ndamping constitutes a loss to the particle. Here, we show that in a\nlow-friction environment, the interplay between the energy pumped-in by light\nand the ambient dissipation can give rise to either instability or a periodic\nvibration characterized by a finite quality factor (Q-factor). Through a\ncomprehensive exploration, we analyze the influence of various parameters on\nthe non-Hermitian force field. Our investigation reveals several strategies for\nenhancing the non-Hermitian force field, such as augmenting particle radius and\nrefractive index, utilizing triangular lattice optical clusters, and reducing\nlattice constants.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:19:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Yang",""],["Li","Xiao",""]]}
{"id":"2308.16503","submitter":"Yongyao Li","authors":"Xiaoxi Xu, Feiyan Zhao, Jiayao Huang, Hehe Xiang, Li Zhang, Zhaopin\n  Chen, Zhongquan Nie, Boris A Malomed, and Yongyao Li","title":"Semidiscrete optical vortex droplets in quasi-phase-matched photonic\n  crystals","comments":"9 pages, 7 figures, and 82 references","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A new scheme for producing semidiscrete self-trapped vortices\n(\\textquotedblleft swirling photon droplets\\textquotedblright ) in photonic\ncrystals with competing quadratic ($\\chi ^{(2)}$) and self-defocusing cubic\n($\\chi ^{(3)}$) nonlinearities is proposed. The photonic crystal is designed\nwith a striped structure, in the form of spatially periodic modulation of the\n$\\chi ^{(2)}$ susceptibility, which is imposed by the quasi-phase-matching\ntechnique. Unlike previous realizations of semidiscrete optical modes in\ncomposite media, built as combinations of continuous and arrayed discrete\nwaveguides, the semidiscrete vortex droplets are produced here in the fully\ncontinuous medium. This work reveals that the system supports two types of\nsemidiscrete vortex droplets, \\textit{viz}., onsite- and intersite-centered\nones, which feature, respectively, odd and even numbers of stripes,\n$\\mathcal{N}$. Stability areas for the states with different values of\n$\\mathcal{N}$ are identified in the system's parameter space. Some stability\nareas overlap with each others, giving rise to multistability of states with\ndifferent $\\mathcal{N}$. The coexisting states are mutually degenerate,\nfeaturing equal values of the Hamiltonian and propagation constant. An\nexperimental scheme to realize the droplets is outlined, suggesting new\npossibilities for the long-distance transmission of structured light carrying\norbital angular momentum in nonlinear media.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:27:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xu","Xiaoxi",""],["Zhao","Feiyan",""],["Huang","Jiayao",""],["Xiang","Hehe",""],["Zhang","Li",""],["Chen","Zhaopin",""],["Nie","Zhongquan",""],["Malomed","Boris A",""],["Li","Yongyao",""]]}
{"id":"2308.16504","submitter":"Magnus Perninge Dr.","authors":"Magnus Perninge","title":"Optimal Stopping of BSDEs with Constrained Jumps and Related Zero-Sum\n  Games","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 introduce a non-linear Snell envelope which at each time\nrepresents the maximal value that can be achieved by stopping a BSDE with\nconstrained jumps. We establish the existence of the Snell envelope by\nemploying a penalization technique and the primary challenge we encounter is\ndemonstrating the regularity of the limit for the scheme. Additionally, we\nrelate the Snell envelope to a finite horizon, zero-sum stochastic differential\ngame, where one player controls a path-dependent stochastic system by invoking\nimpulses, while the opponent is given the opportunity to stop the game\nprematurely. Importantly, by developing new techniques within the realm of\ncontrol randomization, we demonstrate that the value of the game exists and is\nprecisely characterized by our non-linear Snell envelope.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:32:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Perninge","Magnus",""]]}
{"id":"2308.16505","submitter":"Xu Huang","authors":"Xu Huang, Jianxun Lian, Yuxuan Lei, Jing Yao, Defu Lian, Xing Xie","title":"Recommender AI Agent: Integrating Large Language Models for Interactive\n  Recommendations","comments":"16 pages, 15 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommender models excel at providing domain-specific item recommendations by\nleveraging extensive user behavior data. Despite their ability to act as\nlightweight domain experts, they struggle to perform versatile tasks such as\nproviding explanations and engaging in conversations. On the other hand, large\nlanguage models (LLMs) represent a significant step towards artificial general\nintelligence, showcasing remarkable capabilities in instruction comprehension,\ncommonsense reasoning, and human interaction. However, LLMs lack the knowledge\nof domain-specific item catalogs and behavioral patterns, particularly in areas\nthat diverge from general world knowledge, such as online e-commerce.\nFinetuning LLMs for each domain is neither economic nor efficient.\n  In this paper, we bridge the gap between recommender models and LLMs,\ncombining their respective strengths to create a versatile and interactive\nrecommender system. We introduce an efficient framework called RecAgent, which\nemploys LLMs as the brain and recommender models as tools. We first outline a\nminimal set of essential tools required to transform LLMs into RecAgent. We\nthen propose an efficient workflow within RecAgent for task execution,\nincorporating key components such as a memory bus, dynamic\ndemonstration-augmented task planning, and reflection. RecAgent enables\ntraditional recommender systems, such as those ID-based matrix factorization\nmodels, to become interactive systems with a natural language interface through\nthe integration of LLMs. Experimental results on several public datasets show\nthat RecAgent achieves satisfying performance as a conversational recommender\nsystem, outperforming general-purpose LLMs.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:36:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Huang","Xu",""],["Lian","Jianxun",""],["Lei","Yuxuan",""],["Yao","Jing",""],["Lian","Defu",""],["Xie","Xing",""]]}
{"id":"2308.16506","submitter":"Siran Li","authors":"Siran Li and Jianing Yang","title":"Characterisations for the depletion of reactant in a one-dimensional\n  dynamic combustion model","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, a novel observation is made on a one-dimensional compressible\nNavier--Stokes model for the dynamic combustion of a reacting mixture of\n$\\gamma$-law gases ($\\gamma>1$) with discontinuous Arrhenius reaction rate\nfunction, on both bounded and unbounded domains. We show that the mass fraction\nof the reactant (denoted as $Z$) satisfies a weighted gradient estimate $Z_y/\n\\sqrt{Z} \\in L^\\infty_t L^2_y$, provided that at time zero the density is\nLipschitz continuous and bounded strictly away from zero and infinity.\nConsequently, the graph of $Z$ cannot form cusps or corners near the points\nwhere the reactant in the combustion process is completely depleted at any\ninstant, and the entropy of $Z$ is bounded from above. The key ingredient of\nthe proof is a new estimate based on the Fisher information, first exploited by\n[2, 7] with applications to PDEs in chemorepulsion and thermoelasticity. Along\nthe way, we also establish a Lipschitz estimate for the density.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:37:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Siran",""],["Yang","Jianing",""]]}
{"id":"2308.16507","submitter":"Alexander Rudenko","authors":"Alexander N. Rudenko, Danis I. Badrtdinov, Igor A. Abrikosov, and\n  Mikhail I. Katsnelson","title":"Strong electron-phonon coupling and phonon-induced superconductivity in\n  tetragonal C$_3$N$_4$ with hole doping","comments":"10 pages incl. Supplemental Material, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  C$_3$N$_4$ is a recently discovered phase of carbon-nitrides with the\ntetragonal crystal structure (arXiv:2209.01968) that is stable at ambient\nconditions. C$_3$N$_4$ is a semiconductor exhibiting flat-band anomalies in the\nvalence band, suggesting the emergence of many-body instabilities upon hole\ndoping. Here, using state-of-the-art first-principles calculations we show that\nhole-doped C$_3$N$_4$ reveals strong electron-phonon coupling, leading to the\nformation of a gapped superconducting state. The phase transition temperatures\nturns out to be strongly dependent on the hole concentration. We propose that\nholes could be injected into C$_3$N$_4$ via boron doping which induces,\naccording to our results, a rigid shift of the Fermi energy without significant\nmodification of the electronic structure. Based on the electron-phonon coupling\nand Coulomb pseudopotential calculated from first principles, we conclude that\nthe boron concentration of 6 atoms per nm$^3$ would be required to reach the\ncritical temperature of $\\sim$55 K at ambient pressure.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:43:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Rudenko","Alexander N.",""],["Badrtdinov","Danis I.",""],["Abrikosov","Igor A.",""],["Katsnelson","Mikhail I.",""]]}
{"id":"2308.16508","submitter":"Jorge Fari\\~na-Asategui","authors":"Jorge Fari\\~na-Asategui","title":"Restricted Hausdorff spectra of $q$-adic automorphisms","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We solve two well-known open problems on the Hausdorff dimension of branch\ngroups. Firstly, we completely determine the self-similar Hausdorff spectrum of\nthe group of $q$-adic automorphisms where $q$ is a prime power, answering a\nquestion of Grigorchuk. Indeed, we take a further step and completely determine\nits Hausdorff spectra restricted to the most important subclasses of\nself-similar groups, providing examples differing drastically from the\npreviously known ones in the literature. Our proof relies on a new explicit\nformula for the computation of the Hausdorff dimension of closed self-similar\ngroups and a generalization of iterated permutational wreath products.\n  Secondly, we provide the first examples of just infinite branch pro-$p$\ngroups with trivial Hausdorff dimension, disproving a well-known conjecture of\nBoston which has been open for over two decades.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:44:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fari\u00f1a-Asategui","Jorge",""]]}
{"id":"2308.16509","submitter":"S{\\o}ren Ulstrup","authors":"S{\\o}ren Ulstrup, Yann in 't Veld, Jill A. Miwa, Alfred J. H. Jones,\n  Kathleen M. McCreary, Jeremy T. Robinson, Berend T. Jonker, Simranjeet Singh,\n  Roland J. Koch, Eli Rotenberg, Aaron Bostwick, Chris Jozwiak, Malte R\\\"osner\n  and Jyoti Katoch","title":"Discovery of interlayer plasmon polaron in graphene/WS$_2$\n  heterostructures","comments":"25 pages, 9 figures including Supporting Information","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":"  Harnessing electronic excitations involving coherent coupling to bosonic\nmodes is essential for the design and control of emergent phenomena in quantum\nmaterials [1]. In situations where charge carriers induce a lattice distortion\ndue to the electron-phonon interaction, the conducting states get \"dressed\".\nThis leads to the formation of polaronic quasiparticles that dramatically\nimpact charge transport, surface reactivity, thermoelectric and optical\nproperties, as observed in a variety of crystals and interfaces composed of\npolar materials [2-6]. Similarly, when oscillations of the charge density\ncouple to conduction electrons the more elusive plasmon polaron emerges [7],\nwhich has been detected in electron-doped semiconductors [8-10]. However, the\nexploration of polaronic effects on low energy excitations is still in its\ninfancy in two-dimensional (2D) materials. Here, we present the discovery of an\ninterlayer plasmon polaron in heterostructures composed of graphene on top of\nSL WS$_2$. By using micro-focused angle-resolved photoemission spectroscopy\n(microARPES) during in situ doping of the top graphene layer, we observe a\nstrong quasiparticle peak accompanied by several carrier density-dependent\nshake-off replicas around the SL WS$_2$ conduction band minimum (CBM). Our\nresults are explained by an effective many-body model in terms of a coupling\nbetween SL WS$_2$ conduction electrons and graphene plasmon modes. It is\nimportant to take into account the presence of such interlayer collective\nmodes, as they have profound consequences for the electronic and optical\nproperties of heterostructures that are routinely explored in many device\narchitectures involving 2D transition metal dichalcogenides (TMDs) [11-15].\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:46:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ulstrup","S\u00f8ren",""],["Veld","Yann in 't",""],["Miwa","Jill A.",""],["Jones","Alfred J. H.",""],["McCreary","Kathleen M.",""],["Robinson","Jeremy T.",""],["Jonker","Berend T.",""],["Singh","Simranjeet",""],["Koch","Roland J.",""],["Rotenberg","Eli",""],["Bostwick","Aaron",""],["Jozwiak","Chris",""],["R\u00f6sner","Malte",""],["Katoch","Jyoti",""]]}
{"id":"2308.16510","submitter":"Egor Sevriugov","authors":"Egor Sevriugov, Ivan Oseledets","title":"Robust GAN inversion","comments":"22 pages, 28 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advancements in real image editing have been attributed to the\nexploration of Generative Adversarial Networks (GANs) latent space. However,\nthe main challenge of this procedure is GAN inversion, which aims to map the\nimage to the latent space accurately. Existing methods that work on extended\nlatent space $W+$ are unable to achieve low distortion and high editability\nsimultaneously. To address this issue, we propose an approach which works in\nnative latent space $W$ and tunes the generator network to restore missing\nimage details. We introduce a novel regularization strategy with learnable\ncoefficients obtained by training randomized StyleGAN 2 model - WRanGAN. This\nmethod outperforms traditional approaches in terms of reconstruction quality\nand computational efficiency, achieving the lowest distortion with 4 times\nfewer parameters. Furthermore, we observe a slight improvement in the quality\nof constructing hyperplanes corresponding to binary image attributes. We\ndemonstrate the effectiveness of our approach on two complex datasets:\nFlickr-Faces-HQ and LSUN Church.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:47:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sevriugov","Egor",""],["Oseledets","Ivan",""]]}
{"id":"2308.16511","submitter":"YongHyeok Lee","authors":"Yong-Hyeok Lee, Namhyun Cho","title":"PhonMatchNet: Phoneme-Guided Zero-Shot Keyword Spotting for User-Defined\n  Keywords","comments":null,"journal-ref":"Proc. INTERSPEECH 2023, 3964-3968","doi":"10.21437/Interspeech.2023-597","report-no":null,"categories":"eess.AS cs.SD eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study presents a novel zero-shot user-defined keyword spotting model\nthat utilizes the audio-phoneme relationship of the keyword to improve\nperformance. Unlike the previous approach that estimates at utterance level, we\nuse both utterance and phoneme level information. Our proposed method comprises\na two-stream speech encoder architecture, self-attention-based pattern\nextractor, and phoneme-level detection loss for high performance in various\npronunciation environments. Based on experimental results, our proposed model\noutperforms the baseline model and achieves competitive performance compared\nwith full-shot keyword spotting models. Our proposed model significantly\nimproves the EER and AUC across all datasets, including familiar words, proper\nnouns, and indistinguishable pronunciations, with an average relative\nimprovement of 67% and 80%, respectively. The implementation code of our\nproposed model is available at https://github.com/ncsoft/PhonMatchNet.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:48:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lee","Yong-Hyeok",""],["Cho","Namhyun",""]]}
{"id":"2308.16512","submitter":"Yichun Shi","authors":"Yichun Shi, Peng Wang, Jianglong Ye, Mai Long, Kejie Li, Xiao Yang","title":"MVDream: Multi-view Diffusion for 3D Generation","comments":"Our project page is https://MV-Dream.github.io","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose MVDream, a multi-view diffusion model that is able to generate\ngeometrically consistent multi-view images from a given text prompt. By\nleveraging image diffusion models pre-trained on large-scale web datasets and a\nmulti-view dataset rendered from 3D assets, the resulting multi-view diffusion\nmodel can achieve both the generalizability of 2D diffusion and the consistency\nof 3D data. Such a model can thus be applied as a multi-view prior for 3D\ngeneration via Score Distillation Sampling, where it greatly improves the\nstability of existing 2D-lifting methods by solving the 3D consistency problem.\nFinally, we show that the multi-view diffusion model can also be fine-tuned\nunder a few shot setting for personalized 3D generation, i.e. DreamBooth3D\napplication, where the consistency can be maintained after learning the subject\nidentity.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:49:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shi","Yichun",""],["Wang","Peng",""],["Ye","Jianglong",""],["Long","Mai",""],["Li","Kejie",""],["Yang","Xiao",""]]}
{"id":"2308.16513","submitter":"Ana Cristina Ferreira","authors":"Ahmed Elshafei, Ana Cristina Ferreira, Miguel S\\'anchez and Abdelghani\n  Zeghib","title":"Lie groups with all left-invariant semi-Riemannian metrics complete","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For each left-invariant semi-Riemannian metric $g$ on a Lie group $G$, we\nintroduce the class of bi-Lipschitz Riemannian Clairaut metrics, whose\ncompleteness implies the completeness of $g$. When the adjoint representation\nof $G$ satisfies an at most linear growth bound, then all the Clairaut metrics\nare complete for any $g$. We prove that this bound is satisfied by compact and\n2-step nilpotent groups, as well as by semidirect products $K \\ltimes_\\rho\n\\mathbb{R}^n$ , where $K$ is the direct product of a compact and an abelian Lie\ngroup and $\\rho(K)$ is pre-compact; they include all the known examples of Lie\ngroups with all left-invariant metrics complete.\n  The affine group of the real line is considered to illustrate how our\ntechniques work even in the the absence of linear growth and suggest new\nquestions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:52:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Elshafei","Ahmed",""],["Ferreira","Ana Cristina",""],["S\u00e1nchez","Miguel",""],["Zeghib","Abdelghani",""]]}
{"id":"2308.16514","submitter":"Piotr Pokora","authors":"Marek Janasz, Piotr Pokora, Marcin Zieli\\'nski","title":"On arrangements of smooth plane quartics and their bitangents","comments":"19 pages, comments are very welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the present paper we revisit the geometry of smooth plane quartics and\ntheir bitangents from various viewpoints. First of all, we study in detail the\nweak combinatorics of arrangements of bitangents associated with highly\nsymmetric quartic curves. We look at these quartic curves automorphism-wise and\nwe establish a lower bound on the number of quadruple intersection points for\narrangements of bitangents associated to smooth plane quartics being smooth and\nreduced members of Ciani's pencil. Then we construct new examples of $3$-syzygy\nreduced plane curves using smooth plane quartics and their bitangents.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:57:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Janasz","Marek",""],["Pokora","Piotr",""],["Zieli\u0144ski","Marcin",""]]}
{"id":"2308.16515","submitter":"Zimo Sheng","authors":"Zimo Sheng and Mingyu Xiao","title":"A Discharging Method: Improved Kernels for Edge Triangle Packing and\n  Covering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  \\textsc{Edge Triangle Packing} and \\textsc{Edge Triangle Covering} are dual\nproblems extensively studied in the field of parameterized complexity.\n  Given a graph $G$ and an integer $k$, \\textsc{Edge Triangle Packing} seeks to\ndetermine whether there exists a set of at least $k$ edge-disjoint triangles in\n$G$,\n  while \\textsc{Edge Triangle Covering} aims to find out whether there exists a\nset of at most $k$ edges that intersects all triangles in $G$.\n  Previous research has shown that \\textsc{Edge Triangle Packing} has a kernel\nof $(3+\\epsilon)k$ vertices, while \\textsc{Edge Triangle Covering} has a kernel\nof $6k$ vertices.\n  In this paper, we show that the two problems allow kernels of $3k$ vertices,\nimproving all previous results. A significant contribution of our work is the\nutilization of a novel discharging method for analyzing kernel size, which\nexhibits potential for analyzing other kernel algorithms.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 07:57:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sheng","Zimo",""],["Xiao","Mingyu",""]]}
{"id":"2308.16516","submitter":"Andreas Roth","authors":"Cedric Sanders, Andreas Roth, Thomas Liebig","title":"Curvature-based Pooling within Graph Neural Networks","comments":"ECMLPKDD 2023 - Workshop on Mining and Learning with Graphs","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over-squashing and over-smoothing are two critical issues, that limit the\ncapabilities of graph neural networks (GNNs). While over-smoothing eliminates\nthe differences between nodes making them indistinguishable, over-squashing\nrefers to the inability of GNNs to propagate information over long distances,\nas exponentially many node states are squashed into fixed-size representations.\nBoth phenomena share similar causes, as both are largely induced by the graph\ntopology. To mitigate these problems in graph classification tasks, we propose\nCurvPool, a novel pooling method. CurvPool exploits the notion of curvature of\na graph to adaptively identify structures responsible for both over-smoothing\nand over-squashing. By clustering nodes based on the Balanced Forman curvature,\nCurvPool constructs a graph with a more suitable structure, allowing deeper\nmodels and the combination of distant information. We compare it to other\nstate-of-the-art pooling approaches and establish its competitiveness in terms\nof classification accuracy, computational complexity, and flexibility. CurvPool\noutperforms several comparable methods across all considered tasks. The most\nconsistent results are achieved by pooling densely connected clusters using the\nsum aggregation, as this allows additional information about the size of each\npool.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:00:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sanders","Cedric",""],["Roth","Andreas",""],["Liebig","Thomas",""]]}
{"id":"2308.16517","submitter":"Xu Chen","authors":"Ke Luo and Tao Ouyang and Zhi Zhou and Xu Chen","title":"BeeFlow: Behavior Tree-based Serverless Workflow Modeling and Scheduling\n  for Resource-Constrained Edge Clusters","comments":"Accepted by Journal of Systems Architecture","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.NI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Serverless computing has gained popularity in edge computing due to its\nflexible features, including the pay-per-use pricing model, auto-scaling\ncapabilities, and multi-tenancy support. Complex Serverless-based applications\ntypically rely on Serverless workflows (also known as Serverless function\norchestration) to express task execution logic, and numerous application- and\nsystem-level optimization techniques have been developed for Serverless\nworkflow scheduling. However, there has been limited exploration of optimizing\nServerless workflow scheduling in edge computing systems, particularly in\nhigh-density, resource-constrained environments such as system-on-chip clusters\nand single-board-computer clusters. In this work, we discover that existing\nServerless workflow scheduling techniques typically assume models with limited\nexpressiveness and cause significant resource contention. To address these\nissues, we propose modeling Serverless workflows using behavior trees, a novel\nand fundamentally different approach from existing directed-acyclic-graph- and\nstate machine-based models. Behavior tree-based modeling allows for easy\nanalysis without compromising workflow expressiveness. We further present\nobservations derived from the inherent tree structure of behavior trees for\ncontention-free function collections and awareness of exact and empirical\nconcurrent function invocations. Based on these observations, we introduce\nBeeFlow, a behavior tree-based Serverless workflow system tailored for\nresource-constrained edge clusters. Experimental results demonstrate that\nBeeFlow achieves up to 3.2X speedup in a high-density, resource-constrained\nedge testbed and 2.5X speedup in a high-profile cloud testbed, compared with\nthe state-of-the-art.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:01:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Luo","Ke",""],["Ouyang","Tao",""],["Zhou","Zhi",""],["Chen","Xu",""]]}
{"id":"2308.16518","submitter":"Yongxin Shao","authors":"Yongxin Shao, Aihong Tan, Tianhong Yan, Zhetao Sun","title":"MS23D: A 3D Object Detection Method Using Multi-Scale Semantic Feature\n  Points to Construct 3D Feature Layers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lidar point clouds, as a type of data with accurate distance perception, can\neffectively represent the motion and posture of objects in three-dimensional\nspace. However, the sparsity and disorderliness of point clouds make it\nchallenging to extract features directly from them. Many studies have addressed\nthis issue by transforming point clouds into regular voxel representations.\nHowever, these methods often lead to the loss of fine-grained local feature\ninformation due to downsampling. Moreover, the sparsity of point clouds poses\ndifficulties in efficiently aggregating features in 3D feature layers using\nvoxel-based two-stage methods. To address these issues, this paper proposes a\ntwo-stage 3D detection framework called MS$^{2}$3D. In MS$^{2}$3D, we utilize\nsmall-sized voxels to extract fine-grained local features and large-sized\nvoxels to capture long-range local features. Additionally, we propose a method\nfor constructing 3D feature layers using multi-scale semantic feature points,\nenabling the transformation of sparse 3D feature layers into more compact\nrepresentations. Furthermore, we compute the offset between feature points in\nthe 3D feature layers and the centroid of objects, aiming to bring them as\nclose as possible to the object's center. It significantly enhances the\nefficiency of feature aggregation. To validate the effectiveness of our method,\nwe evaluated our method on the KITTI dataset and ONCE dataset together.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:03:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shao","Yongxin",""],["Tan","Aihong",""],["Yan","Tianhong",""],["Sun","Zhetao",""]]}
{"id":"2308.16519","submitter":"Yini Yang","authors":"Jian Li and Yini Yang","title":"Characterizations of distality via weak equicontinuity","comments":"20 pages. To appear in Discrete and Continuous Dynamical Systems.\n  arXiv admin note: text overlap with arXiv:2108.01271","journal-ref":null,"doi":"10.3934/dcds.2023096","report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For an infinite discrete group $G$ acting on a compact metric space $X$, we\nintroduce several weak versions of equicontinuity along subsets of $G$ and show\nthat if a minimal system $(X,G)$ admits an invariant measure then $(X,G)$ is\ndistal if and only if it is pairwise IP$^*$-equicontinuous; if the product\nsystem $(X\\times X,G)$ of a minimal system $(X,G)$ has a dense set of minimal\npoints, then $(X,G)$ is distal if and only if it is pairwise\nIP$^*$-equicontinuous if and only if it is pairwise central$^*$-equicontinuous;\nif $(X,G)$ is a minimal system with $G$ being abelian, then $(X,G)$ is a system\nof order $\\infty$ if and only if it is pairwise FIP$^*$-equicontinuous.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:03:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Jian",""],["Yang","Yini",""]]}
{"id":"2308.16520","submitter":"Xianjing Dong","authors":"Xianjing Dong","title":"Nevanlinna's five-value theorem on non-positively curved complete\n  K\\\"ahler manifolds","comments":"arXiv admin note: substantial text overlap with arXiv:2301.01295","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nevanlinna's five-value theorem is well-known as a famous theorem in value\ndistribution theory, which asserts that two non-constant meromorphic functions\non $\\mathbb C$ are identical if they share five distinct values ignoring\nmultiplicities in $\\overline{\\mathbb C}.$ The central goal of this paper is to\ngeneralize Nevanlinna's five-value theorem to non-compact complete K\\\"ahler\nmanifolds with non-positive sectional curvature by means of the theory of\nalgebraic dependence. With a certain growth condition imposed, we show that two\nnonconstant meromorphic functions on such class of manifolds are identical if\nthey share five distinct values ignoring multiplicities in $\\overline{\\mathbb\nC}.$\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:04:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dong","Xianjing",""]]}
{"id":"2308.16521","submitter":"Jing Wang","authors":"J. Wang, W. K. Zheng, T. G. Brink, D. W. Xu, A. V. Filippenko, C. Gao,\n  C. H. Xie and J. Y. Wei","title":"Are \"Changing-Look'' Active Galactic Nuclei Special in the Coevolution\n  of Supermassive Black Holes and their Hosts? I","comments":"20 pages, 9 figures and 3 tables, to be published in ApJ. arXiv admin\n  note: substantial text overlap with arXiv:2210.03928","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The nature of the so-called ``changing-look'' (CL) active galactic nucleus\n(AGN), which is characterized by spectral-type transitions within $\\sim10$~yr,\nremains an open question. As the first in our series of studies, we here\nattempt to understand the CL phenomenon from a view of the coevolution of AGNs\nand their host galaxies (i.e., if CL-AGNs are at a specific evolutionary stage)\nby focusing on the SDSS local ``partially obscured'' AGNs in which the stellar\npopulation of the host galaxy can be easily measured in the integrated spectra.\nA spectroscopic follow-up program using the Xinglong 2.16~m, Lick/Shane 3~m,\nand Keck 10~m telescopes enables us to identify in total 9 CL-AGNs from a\nsample of 59 candidates selected by their mid-infrared variability. Detailed\nanalysis of these spectra shows that the host galaxies of the CL-AGNs are\nbiased against young stellar populations and tend to be dominated by\nintermediate-age stellar populations. This motivates us to propose that CL-AGNs\nare probably particular AGNs at a specific evolutionary stage, such as a\ntransition stage from ``feast'' to ``famine'' fueling of the supermassive black\nhole. In addition, we reinforce the previous claim that CL-AGNs tend to be\nbiased against both a high Eddington ratio and a high bolometric luminosity,\nsuggesting that the disk-wind broad-line-region model is a plausible\nexplanation of the CL phenomenon.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:09:20 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","J.",""],["Zheng","W. K.",""],["Brink","T. G.",""],["Xu","D. W.",""],["Filippenko","A. V.",""],["Gao","C.",""],["Xie","C. H.",""],["Wei","J. Y.",""]]}
{"id":"2308.16522","submitter":"Ruofei Bai","authors":"Ruofei Bai, Hongliang Guo, Wei-Yun Yau, Lihua Xie","title":"Graph-based SLAM-Aware Exploration with Prior Topo-Metric Information","comments":"8 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous exploration requires the robot to explore an unknown environment\nwhile constructing an accurate map with the SLAM (Simultaneous Localization and\nMapping) techniques. Without prior information, the exploratory performance is\nusually conservative due to the limited planning horizon. This paper exploits a\nprior topo-metric graph of the environment to benefit both the exploration\nefficiency and the pose graph accuracy in SLAM. Based on recent advancements in\nrelating pose graph reliability with graph topology, we are able to formulate\nboth objectives into a SLAM-aware path planning problem over the prior graph,\nwhich finds a fast exploration path with informative loop closures that\nglobally stabilize the pose graph. Furthermore, we derive theoretical\nthresholds to speed up the greedy algorithm to the problem, which significantly\nprune non-optimal loop closures in iterations. The proposed planner is\nincorporated into a hierarchical exploration framework, with flexible features\nincluding path replanning and online prior map update that adds additional\ninformation to the prior graph. Extensive experiments indicate that our method\nhas comparable exploration efficiency to others while consistently maintaining\nhigher mapping accuracy in various environments. Our implementations will be\nopen-source on GitHub.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:11:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bai","Ruofei",""],["Guo","Hongliang",""],["Yau","Wei-Yun",""],["Xie","Lihua",""]]}
{"id":"2308.16523","submitter":"Paolo Amore","authors":"Paolo Amore, Damian de la Cruz, Valeria Hernandez, Ian Rincon and\n  Ulises Zarate","title":"Circle packing in arbitrary domains","comments":"26 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe an algorithm that allows one to find dense packing configurations\nof a number of congruent disks in arbitrary domains in two or more dimensions.\nWe have applied it to a large class of two dimensional domains such as\nrectangles, ellipses, crosses, multiply connected domains and even to the\ncardioid. For many of the cases that we have studied no previous result was\navailable. The fundamental idea in our approach is the introduction of \"image\"\ndisks, which allows one to work with a fixed container, thus lifting the\nlimitations of the packing algorithms of \\cite{Nurmela97,Amore21,Amore23}. We\nbelieve that the extension of our algorithm to three (or higher) dimensional\ncontainers (not considered here) can be done straightforwardly.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:15:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Amore","Paolo",""],["de la Cruz","Damian",""],["Hernandez","Valeria",""],["Rincon","Ian",""],["Zarate","Ulises",""]]}
{"id":"2308.16524","submitter":"Michael Leconte","authors":"M. Leconte and T. Kobayashi","title":"Zonal profile corrugations and staircase formation: transport crossphase\n  modulations","comments":"22 pages, 11 figures. arXiv admin note: substantial text overlap with\n  arXiv:2111.06022","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recently, quasi-stationary structures called $E \\times B$ staircases were\nobserved in gyrokinetic simulations, in all transport channels [Dif-Pradalier\net al. Phys. Rev. Lett. 114, 085004 (2015)]. We present a novel analytical\ntheory - supported by plasma fluid simulations - for the generation of density\nprofile corrugations (staircase): Turbulent fluctuations self-organize to\ngenerate quasi-stationary radial modulations $\\Delta \\theta_k(r,t)$ of the\ntransport crossphase $\\theta_k$ between density and electric potential\nfluctuations. The radial modulations of the associated particle flux drive\nzonal corrugations of the density profile, via a modulational instability. In\nturn, zonal density corrugations regulate the turbulence via nonlinear damping\nof the fluctuations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:16:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Leconte","M.",""],["Kobayashi","T.",""]]}
{"id":"2308.16525","submitter":"Dariusz Gora","authors":"Kevin Almeida Cheminant, Dariusz Gora, Nataliia Borodai, Ralph Engel,\n  Tanguy Pierog, Jan Pekala, Markus Roth, Jaros{\\l}aw Stasielak, Michael Unger,\n  Darko Veberic, Henryk Wilczynski","title":"Method for calculation of the beta exponent from the Heitler-Matthews\n  model of hadronic air showers","comments":"Proccedings of 38th International Cosmic Ray Conference (ICRC2023)","journal-ref":null,"doi":"10.22323/1.444.0243","report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The number of muons in an air shower is a strong indicator of the mass of the\nprimary particle and increases with a small power of the cosmic ray mass by the\n$\\beta$-exponent, $N_{\\mu} \\sim A^{(1-\\beta)}$. This behaviour can be explained\nin terms of the Heitler-Matthews model of hadronic air showers. In this paper,\nwe present a method for calculating $\\beta$ from the Heitler-Matthews model.\nThe method has been successfully verified with a series of simulated events\nobserved by the Pierre Auger Observatory at $10^{19}$ eV. To follow real\nmeasurements of the mass composition at this energy, the generated sample\nconsists of a certain fraction of events produced with p, He, N and Fe primary\nenergies. Since hadronic interactions at the highest energies can differ from\nthose observed at energies reached by terrestrial accelerators, we generate a\nmock data set with $\\beta =0.92$ (the canonical value) and $\\beta =0.96$ (a\nmore exotic scenario). The method can be applied to measured events to\ndetermine the muon signal for each primary particle as well as the muon scaling\nfactor and the $\\beta$-exponent. Determining the $\\beta$-exponent can\neffectively constrain the parameters that govern hadronic interactions and help\nsolve the so-called muon problem, where hadronic interaction models predict too\nfew muons relative to observed events. In this paper, we lay the foundation for\nthe future analysis of measured data from the Pierre Auger Observatory with a\nsimulation study.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:16:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cheminant","Kevin Almeida",""],["Gora","Dariusz",""],["Borodai","Nataliia",""],["Engel","Ralph",""],["Pierog","Tanguy",""],["Pekala","Jan",""],["Roth","Markus",""],["Stasielak","Jaros\u0142aw",""],["Unger","Michael",""],["Veberic","Darko",""],["Wilczynski","Henryk",""]]}
{"id":"2308.16526","submitter":"Zhang Chi","authors":"Chi Zhang and Fu-Wen Shu","title":"Gravity-induced entanglement between two massive microscopic particles\n  in curved spacetime: I.The Schwarzschild background","comments":"14 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-th quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The experiment involving the entanglement of two massive particles through\ngravitational fields has been devised to discern the quantum attributes of\ngravity. In this paper, we present a scheme to extend this experiment's\napplicability to more generalized curved spacetimes, with the objective of\nvalidating universal quantum gravity within broader contexts. Specifically, we\ndirect our attention towards the quantum gravity induced entanglement of mass\n(QGEM) in astrophysical phenomena, such as particles traversing the\ninterstellar medium. Notably, we ascertain that the gravitational field within\ncurved spacetime can induce observable entanglement between particle pairs in\nboth scenarios, even when dealing with particles significantly smaller than\nmesoscopic masses. Furthermore, we obtain the characteristic spectra of QGEM\nacross diverse scenarios, shedding light on potential future experimental\nexaminations. This approach not only establishes a more pronounced and\nextensive manifestation of the quantum influences of gravity compared to the\noriginal scheme but also opens avenues for prospective astronomical\nexperiments. These experiments, aligned with our postulates, hold immense\nadvantages and implications for the detection of quantum gravity and can be\nenvisioned for future design.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:16:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Chi",""],["Shu","Fu-Wen",""]]}
{"id":"2308.16527","submitter":"Ruohuan Fang","authors":"Ruohuan Fang, Guansong Pang, Lei Zhou, Xiao Bai, Jin Zheng","title":"Unsupervised Recognition of Unknown Objects for Open-World Object\n  Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Open-World Object Detection (OWOD) extends object detection problem to a\nrealistic and dynamic scenario, where a detection model is required to be\ncapable of detecting both known and unknown objects and incrementally learning\nnewly introduced knowledge. Current OWOD models, such as ORE and OW-DETR, focus\non pseudo-labeling regions with high objectness scores as unknowns, whose\nperformance relies heavily on the supervision of known objects. While they can\ndetect the unknowns that exhibit similar features to the known objects, they\nsuffer from a severe label bias problem that they tend to detect all regions\n(including unknown object regions) that are dissimilar to the known objects as\npart of the background. To eliminate the label bias, this paper proposes a\nnovel approach that learns an unsupervised discriminative model to recognize\ntrue unknown objects from raw pseudo labels generated by unsupervised region\nproposal methods. The resulting model can be further refined by a\nclassification-free self-training method which iteratively extends pseudo\nunknown objects to the unlabeled regions. Experimental results show that our\nmethod 1) significantly outperforms the prior SOTA in detecting unknown objects\nwhile maintaining competitive performance of detecting known object classes on\nthe MS COCO dataset, and 2) achieves better generalization ability on the LVIS\nand Objects365 datasets.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:17:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fang","Ruohuan",""],["Pang","Guansong",""],["Zhou","Lei",""],["Bai","Xiao",""],["Zheng","Jin",""]]}
{"id":"2308.16528","submitter":"Ning Gao","authors":"Ning Gao, Ngo Anh Vien, Hanna Ziesche, Gerhard Neumann","title":"SA6D: Self-Adaptive Few-Shot 6D Pose Estimator for Novel and Occluded\n  Objects","comments":null,"journal-ref":"Conference on Robot Learning (CoRL), 2023","doi":null,"report-no":null,"categories":"cs.CV cs.LG cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  To enable meaningful robotic manipulation of objects in the real-world, 6D\npose estimation is one of the critical aspects. Most existing approaches have\ndifficulties to extend predictions to scenarios where novel object instances\nare continuously introduced, especially with heavy occlusions. In this work, we\npropose a few-shot pose estimation (FSPE) approach called SA6D, which uses a\nself-adaptive segmentation module to identify the novel target object and\nconstruct a point cloud model of the target object using only a small number of\ncluttered reference images. Unlike existing methods, SA6D does not require\nobject-centric reference images or any additional object information, making it\na more generalizable and scalable solution across categories. We evaluate SA6D\non real-world tabletop object datasets and demonstrate that SA6D outperforms\nexisting FSPE methods, particularly in cluttered scenes with occlusions, while\nrequiring fewer reference images.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:19:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gao","Ning",""],["Vien","Ngo Anh",""],["Ziesche","Hanna",""],["Neumann","Gerhard",""]]}
{"id":"2308.16529","submitter":"Yoon Kyung Lee","authors":"Yoon Kyung Lee, Yoonwon Jung, Gyuyi Kang, Sowon Hahn","title":"Developing Social Robots with Empathetic Non-Verbal Cues Using Large\n  Language Models","comments":null,"journal-ref":"In Proceedings of 2023 IEEE International Conference on Robot &\n  Human Interactive Communication (RO-MAN)","doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.HC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We propose augmenting the empathetic capacities of social robots by\nintegrating non-verbal cues. Our primary contribution is the design and\nlabeling of four types of empathetic non-verbal cues, abbreviated as SAFE:\nSpeech, Action (gesture), Facial expression, and Emotion, in a social robot.\nThese cues are generated using a Large Language Model (LLM). We developed an\nLLM-based conversational system for the robot and assessed its alignment with\nsocial cues as defined by human counselors. Preliminary results show distinct\npatterns in the robot's responses, such as a preference for calm and positive\nsocial emotions like 'joy' and 'lively', and frequent nodding gestures. Despite\nthese tendencies, our approach has led to the development of a social robot\ncapable of context-aware and more authentic interactions. Our work lays the\ngroundwork for future studies on human-robot interactions, emphasizing the\nessential role of both verbal and non-verbal cues in creating social and\nempathetic robots.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:20:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lee","Yoon Kyung",""],["Jung","Yoonwon",""],["Kang","Gyuyi",""],["Hahn","Sowon",""]]}
{"id":"2308.16530","submitter":"Andreea Bianca Popescu","authors":"Andreea Bianca Popescu, Cosmin Ioan Nita, Ioana Antonia Taca, Anamaria\n  Vizitiu, Lucian Mihai Itu","title":"Privacy-Preserving Medical Image Classification through Deep Learning\n  and Matrix Decomposition","comments":"6 pages, 9 figures, Published in: 2023 31st Mediterranean Conference\n  on Control and Automation (MED)","journal-ref":"2023 31st Mediterranean Conference on Control and Automation\n  (MED), Limassol, Cyprus, 2023, pp. 305-310","doi":"10.1109/MED59994.2023.10185748","report-no":null,"categories":"cs.CR cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning (DL)-based solutions have been extensively researched in the\nmedical domain in recent years, enhancing the efficacy of diagnosis, planning,\nand treatment. Since the usage of health-related data is strictly regulated,\nprocessing medical records outside the hospital environment for developing and\nusing DL models demands robust data protection measures. At the same time, it\ncan be challenging to guarantee that a DL solution delivers a minimum level of\nperformance when being trained on secured data, without being specifically\ndesigned for the given task. Our approach uses singular value decomposition\n(SVD) and principal component analysis (PCA) to obfuscate the medical images\nbefore employing them in the DL analysis. The capability of DL algorithms to\nextract relevant information from secured data is assessed on a task of\nangiographic view classification based on obfuscated frames. The security level\nis probed by simulated artificial intelligence (AI)-based reconstruction\nattacks, considering two threat actors with different prior knowledge of the\ntargeted data. The degree of privacy is quantitatively measured using\nsimilarity indices. Although a trade-off between privacy and accuracy should be\nconsidered, the proposed technique allows for training the angiographic view\nclassifier exclusively on secured data with satisfactory performance and with\nno computational overhead, model adaptation, or hyperparameter tuning. While\nthe obfuscated medical image content is well protected against human\nperception, the hypothetical reconstruction attack proved that it is also\ndifficult to recover the complete information of the original frames.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:21:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Popescu","Andreea Bianca",""],["Nita","Cosmin Ioan",""],["Taca","Ioana Antonia",""],["Vizitiu","Anamaria",""],["Itu","Lucian Mihai",""]]}
{"id":"2308.16531","submitter":"Weiyu Ding","authors":"Weiyu Ding, Hu Zou, Xu Kong, Yulong Gao, Fujia Li, Hongxin Zhang,\n  Jiali Wang, Jie Song, Jipeng Sui, Jundan Nie, Suijian Xue, Weijian Guo, Yao\n  Yao, and Zhimin Zhou","title":"Strong [O III] {\\lambda}5007 Compact Galaxies Identified from SDSS DR16\n  and Their Scaling Relations","comments":"12 pages, 8 figures, 1 table. Published in AJ","journal-ref":null,"doi":"10.3847/1538-3881/ace893","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Green pea galaxies are a special class of star-forming compact galaxies with\nstrong [O III]{\\lambda}5007 and considered as analogs of high-redshift\nLy{\\alpha}-emitting galaxies and potential sources for cosmic reionization. In\nthis paper, we identify 76 strong [O III]{\\lambda}5007 compact galaxies at z <\n0.35 from DR1613 of the Sloan Digital Sky Survey. These galaxies present\nrelatively low stellar mass, high star formation rate, and low metallicity.\nBoth star-forming main sequence relation (SFMS) and mass-metallicity relation\n(MZR) are investigated and compared with green pea and blueberry galaxies\ncollected from literature. It is found that our strong [O III] {\\lambda}5007\ncompact galaxies share common properties with those compact galaxies with\nextreme star formation and show distinct scaling relations in respect to those\nof normal star-forming galaxies at the same redshift. The slope of SFMS is\nhigher, indicates that strong [O III]{\\lambda}5007 compact galaxies might grow\nfaster in stellar mass. The lower MZR implies that they may be less chemically\nevolved and hence on the early stage of star formation. A further environmental\ninvestigation confirms that they inhabit relatively low-density regions. Future\nlargescale spectroscopic surveys will provide more details on their physical\norigin and evolution.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:21:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ding","Weiyu",""],["Zou","Hu",""],["Kong","Xu",""],["Gao","Yulong",""],["Li","Fujia",""],["Zhang","Hongxin",""],["Wang","Jiali",""],["Song","Jie",""],["Sui","Jipeng",""],["Nie","Jundan",""],["Xue","Suijian",""],["Guo","Weijian",""],["Yao","Yao",""],["Zhou","Zhimin",""]]}
{"id":"2308.16532","submitter":"Binjie Chen","authors":"Binjie Chen, Yunzhou Xia, Yu Zang, Cheng Wang, Jonathan Li","title":"Decoupled Local Aggregation for Point Cloud Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The unstructured nature of point clouds demands that local aggregation be\nadaptive to different local structures. Previous methods meet this by\nexplicitly embedding spatial relations into each aggregation process. Although\nthis coupled approach has been shown effective in generating clear semantics,\naggregation can be greatly slowed down due to repeated relation learning and\nredundant computation to mix directional and point features. In this work, we\npropose to decouple the explicit modelling of spatial relations from local\naggregation. We theoretically prove that basic neighbor pooling operations can\ntoo function without loss of clarity in feature fusion, so long as essential\nspatial information has been encoded in point features. As an instantiation of\ndecoupled local aggregation, we present DeLA, a lightweight point network,\nwhere in each learning stage relative spatial encodings are first formed, and\nonly pointwise convolutions plus edge max-pooling are used for local\naggregation then. Further, a regularization term is employed to reduce\npotential ambiguity through the prediction of relative coordinates.\nConceptually simple though, experimental results on five classic benchmarks\ndemonstrate that DeLA achieves state-of-the-art performance with reduced or\ncomparable latency. Specifically, DeLA achieves over 90\\% overall accuracy on\nScanObjectNN and 74\\% mIoU on S3DIS Area 5. Our code is available at\nhttps://github.com/Matrix-ASC/DeLA .\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:21:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Binjie",""],["Xia","Yunzhou",""],["Zang","Yu",""],["Wang","Cheng",""],["Li","Jonathan",""]]}
{"id":"2308.16533","submitter":"Ante Ravlic","authors":"Ante Ravli\\'c, Esra Y\\\"uksel, Tamara Nik\\v{s}i\\'c and Nils Paar","title":"Influence of the symmetry energy on the nuclear binding energies and the\n  neutron drip line position","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A clear connection can be established between properties of nuclear matter\nand finite-nuclei observables, such as the correlation between the slope of the\nsymmetry energy and dipole polarizability, or between compressibility and the\nisoscalar monopole giant resonance excitation energy. Establishing a connection\nbetween realistic atomic nuclei and an idealized infinite nuclear matter leads\nto a better understanding of underlying physical mechanisms that govern nuclear\ndynamics. In this work, we aim to study the dependence of the binding energies\nand related quantities (e.g. location of drip lines, the total number of bound\neven-even nuclei) on the symmetry energy $S_2(\\rho)$. The properties of finite\nnuclei are calculated by employing the relativistic Hartree-Bogoliubov (RHB)\nmodel, assuming even-even axial and reflection symmetric nuclei. Calculations\nare performed by employing two families of relativistic energy density\nfunctionals (EDFs), based on different effective Lagrangians, constrained to a\nspecific symmetry energy at saturation density $J$ within the interval of\n$30$--$36$ MeV. Nuclear binding energies and related quantities of bound nuclei\nare calculated between $8 \\leq Z \\leq 104$ from the two-proton to the\ntwo-neutron drip line. As the neutron drip line is approached, the interactions\nwith stiffer $J$ tend to predict more bound nuclei, resulting in a systematic\nshift of the two-neutron drip line towards more neutron-rich nuclei.\nConsequentially, a correlation between the number of bound nuclei $N_{nucl}$\nand $S_2(\\rho)$ is established for a set of functionals constrained using the\nsimilar optimization procedures. The direction of the relationship between the\nnumber of bound nuclei and symmetry energy highly depends on the density under\nconsideration.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:24:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ravli\u0107","Ante",""],["Y\u00fcksel","Esra",""],["Nik\u0161i\u0107","Tamara",""],["Paar","Nils",""]]}
{"id":"2308.16534","submitter":"Davide Scassola","authors":"Davide Scassola, Sebastiano Saccani, Ginevra Carbone, Luca Bortolussi","title":"Conditioning Score-Based Generative Models by Neuro-Symbolic Constraints","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":"  Score-based and diffusion models have emerged as effective approaches for\nboth conditional and unconditional generation. Still conditional generation is\nbased on either a specific training of a conditional model or classifier\nguidance, which requires training a noise-dependent classifier, even when the\nclassifier for uncorrupted data is given. We propose an approach to sample from\nunconditional score-based generative models enforcing arbitrary logical\nconstraints, without any additional training. Firstly, we show how to\nmanipulate the learned score in order to sample from an un-normalized\ndistribution conditional on a user-defined constraint. Then, we define a\nflexible and numerically stable neuro-symbolic framework for encoding soft\nlogical constraints. Combining these two ingredients we obtain a general, but\napproximate, conditional sampling algorithm. We further developed effective\nheuristics aimed at improving the approximation. Finally, we show the\neffectiveness of our approach for various types of constraints and data:\ntabular data, images and time series.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:25:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Scassola","Davide",""],["Saccani","Sebastiano",""],["Carbone","Ginevra",""],["Bortolussi","Luca",""]]}
{"id":"2308.16535","submitter":"Seenimuthu Stalin","authors":"M. Kirane, S. Stalin, R. Arun, M. Lakshmanan","title":"Soliton molecules in Fermi-Pasta-Ulam-Tsingou lattice: Gardner equation\n  approach","comments":"Submitted For Publication (2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We revisit the Fermi-Pasta-Ulam-Tsingou lattice (FPUT) with quadratic and\ncubic nonlinear interactions in the continuous limit by deducing the Gardner\nequation. Through the Hirota bilinear method, multi-soliton solutions are\nobtained for the Gardner equation. Based on these solutions, we show the\nexcitation of an interesting class of table-top soliton molecules in the FPUT\nlattice through the velocity resonance mechanism. Depending on the condition on\nthe free parameters, we classify them as dissociated and synthetic type\nmolecules. The main feature of the table-top soliton molecules is that they do\nnot exhibit oscillations in the coalescence region. This property ensures that\nthey are distinct from the soliton molecules, having retrieval force, of the\nnonlinear Schr\\\"odinger family of systems. Further, to study the stability of\nthe soliton molecule we allow it to interact with a single (or multi)\nsoliton(s). The asymptotic analysis shows that their structures remain\nconstant, though the bond length varies, throughout the collision process. In\naddition, we consider the FPUT lattice with quadratic nonlinear interaction and\nFPUT lattice with cubic nonlinearity as sub-cases and point out the nature of\nthe soliton molecules for these cases also systematically. We achieve this\nbased on the interconnections between the solutions of the Gardner, modified\nK-dV and K-dV equations. Finally, we simulate the FPUT chain corresponding to\nthe Gardner equation numerically and verify the existence of all the soliton\nstructures associated with it. We believe that the present study can be\nextended to other integrable and non-integrable systems with applications in\nfluid dynamics, Bose-Einstein condensates, nonlinear optics, and plasma\nphysics.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:26:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kirane","M.",""],["Stalin","S.",""],["Arun","R.",""],["Lakshmanan","M.",""]]}
{"id":"2308.16536","submitter":"Marius Le Joubioux","authors":"M. Le Joubioux, H. Savajols, W. Mittig, X. Fl\\'echard, Yu. E.\n  Penionzhkevich, D. Ackermann, C. Borcea, L. Caceres, P. Delahaye, F.\n  Didierjean, S. Franchoo, A. Grillet, B. Jacquot, M. Lebois, X. Ledoux, N.\n  Lecesne, E. Li\\'enard, S. Lukyanov, O. Naviliat-Cuncic, J. Piot, A. Singha,\n  V. Smirnov, C. Stodel, D. Testov, J.C. Thomas, D. Verney","title":"Is there a dark decay of neutrons in $^6$He ?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by the four standard deviations discrepancy between the mean values\nfor the neutron lifetime obtained from beam and bottle experiments, we have\nsearched for a hypothetical neutron dark decay in $^6$He nuclei through the\nchannel $^6{\\rm He} \\rightarrow ^4{\\rm He}+n+\\chi$. The experiment used a\n25~keV high intensity $^6$He$^+$ beam with a high efficiency neutron detector.\nThe search for a signal correlated with the $^6$He activity in the neutron\ndetection rate resulted in a branching ratio ${\\rm Br}_\\chi \\leq\n4.0\\times10^{-10}$ with a 95\\% C.L. over the mass window $937.993 < m_\\chi <\nm_n-0.975$ MeV. This result is five orders of magnitude smaller than required\nto solve the neutron lifetime discrepancy.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:27:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Joubioux","M. Le",""],["Savajols","H.",""],["Mittig","W.",""],["Fl\u00e9chard","X.",""],["Penionzhkevich","Yu. E.",""],["Ackermann","D.",""],["Borcea","C.",""],["Caceres","L.",""],["Delahaye","P.",""],["Didierjean","F.",""],["Franchoo","S.",""],["Grillet","A.",""],["Jacquot","B.",""],["Lebois","M.",""],["Ledoux","X.",""],["Lecesne","N.",""],["Li\u00e9nard","E.",""],["Lukyanov","S.",""],["Naviliat-Cuncic","O.",""],["Piot","J.",""],["Singha","A.",""],["Smirnov","V.",""],["Stodel","C.",""],["Testov","D.",""],["Thomas","J. C.",""],["Verney","D.",""]]}
{"id":"2308.16537","submitter":"Sophie Quennelle","authors":"Sophie Quennelle (HeKA, UPCit\\'e, CRC), Maxime Douillet (Imagine),\n  Lisa Friedlander (UPCit\\'e), Olivia Boyer (UPCit\\'e), Anita Burgun (HeKA,\n  UPCit\\'e, CRC), Antoine Neuraz (HeKA, UPCit\\'e, CRC), Nicolas Garcelon (HeKA,\n  UPCit\\'e, Imagine)","title":"The Smart Data Extractor, a Clinician Friendly Solution to Accelerate\n  and Improve the Data Collection During Clinical Trials","comments":"IOS Press, 2023, Studies in Health Technology and Informatics","journal-ref":null,"doi":"10.3233/SHTI230112","report-no":null,"categories":"q-bio.QM cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In medical research, the traditional way to collect data, i.e. browsing\npatient files, has been proven to induce bias, errors, human labor and costs.\nWe propose a semi-automated system able to extract every type of data,\nincluding notes. The Smart Data Extractor pre-populates clinic research forms\nby following rules. We performed a cross-testing experiment to compare\nsemi-automated to manual data collection. 20 target items had to be collected\nfor 79 patients. The average time to complete one form was 6'81'' for manual\ndata collection and 3'22'' with the Smart Data Extractor. There were also more\nmistakes during manual data collection (163 for the whole cohort) than with the\nSmart Data Extractor (46 for the whole cohort). We present an easy to use,\nunderstandable and agile solution to fill out clinical research forms. It\nreduces human effort and provides higher quality data, avoiding data re-entry\nand fatigue induced errors.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:28:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Quennelle","Sophie","","HeKA, UPCit\u00e9, CRC"],["Douillet","Maxime","","Imagine"],["Friedlander","Lisa","","UPCit\u00e9"],["Boyer","Olivia","","UPCit\u00e9"],["Burgun","Anita","","HeKA,\n  UPCit\u00e9, CRC"],["Neuraz","Antoine","","HeKA, UPCit\u00e9, CRC"],["Garcelon","Nicolas","","HeKA,\n  UPCit\u00e9, Imagine"]]}
{"id":"2308.16538","submitter":"Carsten Maple","authors":"Carsten Maple, Lukasz Szpruch, Gregory Epiphaniou, Kalina Staykova,\n  Simran Singh, William Penwarden, Yisi Wen, Zijian Wang, Jagdish Hariharan,\n  Pavle Avramovic","title":"The AI Revolution: Opportunities and Challenges for the Finance Sector","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This report examines Artificial Intelligence (AI) in the financial sector,\noutlining its potential to revolutionise the industry and identify its\nchallenges. It underscores the criticality of a well-rounded understanding of\nAI, its capabilities, and its implications to effectively leverage its\npotential while mitigating associated risks. The potential of AI potential\nextends from augmenting existing operations to paving the way for novel\napplications in the finance sector. The application of AI in the financial\nsector is transforming the industry. Its use spans areas from customer service\nenhancements, fraud detection, and risk management to credit assessments and\nhigh-frequency trading. However, along with these benefits, AI also presents\nseveral challenges. These include issues related to transparency,\ninterpretability, fairness, accountability, and trustworthiness. The use of AI\nin the financial sector further raises critical questions about data privacy\nand security. A further issue identified in this report is the systemic risk\nthat AI can introduce to the financial sector. Being prone to errors, AI can\nexacerbate existing systemic risks, potentially leading to financial crises.\nRegulation is crucial to harnessing the benefits of AI while mitigating its\npotential risks. Despite the global recognition of this need, there remains a\nlack of clear guidelines or legislation for AI use in finance. This report\ndiscusses key principles that could guide the formation of effective AI\nregulation in the financial sector, including the need for a risk-based\napproach, the inclusion of ethical considerations, and the importance of\nmaintaining a balance between innovation and consumer protection. The report\nprovides recommendations for academia, the finance industry, and regulators.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:30:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Maple","Carsten",""],["Szpruch","Lukasz",""],["Epiphaniou","Gregory",""],["Staykova","Kalina",""],["Singh","Simran",""],["Penwarden","William",""],["Wen","Yisi",""],["Wang","Zijian",""],["Hariharan","Jagdish",""],["Avramovic","Pavle",""]]}
{"id":"2308.16539","submitter":"Christopher Diehl","authors":"Christopher Diehl and Tobias Klosek and Martin Kr\\\"uger and Nils\n  Murzyn and Torsten Bertram","title":"On a Connection between Differential Games, Optimal Control, and\n  Energy-based Models for Multi-Agent Interactions","comments":"International Conference on Machine Learning, Workshop on New\n  Frontiers in Learning, Control, and Dynamical Systems (ICML 2023\n  Frontiers4LCD)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.GT cs.LG cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Game theory offers an interpretable mathematical framework for modeling\nmulti-agent interactions. However, its applicability in real-world robotics\napplications is hindered by several challenges, such as unknown agents'\npreferences and goals. To address these challenges, we show a connection\nbetween differential games, optimal control, and energy-based models and\ndemonstrate how existing approaches can be unified under our proposed\nEnergy-based Potential Game formulation. Building upon this formulation, this\nwork introduces a new end-to-end learning application that combines neural\nnetworks for game-parameter inference with a differentiable game-theoretic\noptimization layer, acting as an inductive bias. The experiments using\nsimulated mobile robot pedestrian interactions and real-world automated driving\ndata provide empirical evidence that the game-theoretic layer improves the\npredictive performance of various neural network backbones.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:30:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Diehl","Christopher",""],["Klosek","Tobias",""],["Kr\u00fcger","Martin",""],["Murzyn","Nils",""],["Bertram","Torsten",""]]}
{"id":"2308.16540","submitter":"Sudarsana Kadiri","authors":"Dhananjaya Gowda, Sudarsana Reddy Kadiri, Brad Story, Paavo Alku","title":"Time-Varying Quasi-Closed-Phase Analysis for Accurate Formant Tracking\n  in Speech Signals","comments":null,"journal-ref":"IEEE/ACM Transactions on Audio, Speech, and Language Processing,\n  Vol. 28, pp. 1901-1914, 2020","doi":"10.1109/TASLP.2020.3000037","report-no":null,"categories":"eess.AS cs.CL cs.SD eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose a new method for the accurate estimation and\ntracking of formants in speech signals using time-varying quasi-closed-phase\n(TVQCP) analysis. Conventional formant tracking methods typically adopt a\ntwo-stage estimate-and-track strategy wherein an initial set of formant\ncandidates are estimated using short-time analysis (e.g., 10--50 ms), followed\nby a tracking stage based on dynamic programming or a linear state-space model.\nOne of the main disadvantages of these approaches is that the tracking stage,\nhowever good it may be, cannot improve upon the formant estimation accuracy of\nthe first stage. The proposed TVQCP method provides a single-stage formant\ntracking that combines the estimation and tracking stages into one. TVQCP\nanalysis combines three approaches to improve formant estimation and tracking:\n(1) it uses temporally weighted quasi-closed-phase analysis to derive\nclosed-phase estimates of the vocal tract with reduced interference from the\nexcitation source, (2) it increases the residual sparsity by using the $L_1$\noptimization and (3) it uses time-varying linear prediction analysis over long\ntime windows (e.g., 100--200 ms) to impose a continuity constraint on the vocal\ntract model and hence on the formant trajectories. Formant tracking experiments\nwith a wide variety of synthetic and natural speech signals show that the\nproposed TVQCP method performs better than conventional and popular formant\ntracking tools, such as Wavesurfer and Praat (based on dynamic programming),\nthe KARMA algorithm (based on Kalman filtering), and DeepFormants (based on\ndeep neural networks trained in a supervised manner). Matlab scripts for the\nproposed method can be found at: https://github.com/njaygowda/ftrack\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:30:20 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gowda","Dhananjaya",""],["Kadiri","Sudarsana Reddy",""],["Story","Brad",""],["Alku","Paavo",""]]}
{"id":"2308.16541","submitter":"Yi Wen","authors":"Yi Wen, Siwei Wang, Ke Liang, Weixuan Liang, Xinhang Wan, Xinwang Liu,\n  Suyuan Liu, Jiyuan Liu, En Zhu","title":"Scalable Incomplete Multi-View Clustering with Structure Alignment","comments":null,"journal-ref":null,"doi":"10.1145/3581783.3611981","report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The success of existing multi-view clustering (MVC) relies on the assumption\nthat all views are complete. However, samples are usually partially available\ndue to data corruption or sensor malfunction, which raises the research of\nincomplete multi-view clustering (IMVC). Although several anchor-based IMVC\nmethods have been proposed to process the large-scale incomplete data, they\nstill suffer from the following drawbacks: i) Most existing approaches neglect\nthe inter-view discrepancy and enforce cross-view representation to be\nconsistent, which would corrupt the representation capability of the model; ii)\nDue to the samples disparity between different views, the learned anchor might\nbe misaligned, which we referred as the Anchor-Unaligned Problem for Incomplete\ndata (AUP-ID). Such the AUP-ID would cause inaccurate graph fusion and degrades\nclustering performance. To tackle these issues, we propose a novel incomplete\nanchor graph learning framework termed Scalable Incomplete Multi-View\nClustering with Structure Alignment (SIMVC-SA). Specially, we construct the\nview-specific anchor graph to capture the complementary information from\ndifferent views. In order to solve the AUP-ID, we propose a novel structure\nalignment module to refine the cross-view anchor correspondence. Meanwhile, the\nanchor graph construction and alignment are jointly optimized in our unified\nframework to enhance clustering quality. Through anchor graph construction\ninstead of full graphs, the time and space complexity of the proposed SIMVC-SA\nis proven to be linearly correlated with the number of samples. Extensive\nexperiments on seven incomplete benchmark datasets demonstrate the\neffectiveness and efficiency of our proposed method. Our code is publicly\navailable at https://github.com/wy1019/SIMVC-SA.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:30:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wen","Yi",""],["Wang","Siwei",""],["Liang","Ke",""],["Liang","Weixuan",""],["Wan","Xinhang",""],["Liu","Xinwang",""],["Liu","Suyuan",""],["Liu","Jiyuan",""],["Zhu","En",""]]}
{"id":"2308.16542","submitter":"Ugo Dal Lago","authors":"Ugo Dal Lago, Alexis Ghyselen","title":"On Model-Checking Higher-Order Effectful Programs (Long Version)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Model-checking is one of the most powerful techniques for verifying systems\nand programs, which since the pioneering results by Knapik et al., Ong, and\nKobayashi, is known to be applicable to functional programs with higher-order\ntypes against properties expressed by formulas of monadic second-order logic.\nWhat happens when the program in question, in addition to higher-order\nfunctions, also exhibits algebraic effects such as probabilistic choice or\nglobal store? The results in the literature range from those, mostly positive,\nabout nondeterministic effects, to those about probabilistic effects, in the\npresence of which even mere reachability becomes undecidable. This work takes a\nfresh and general look at the problem, first of all showing that there is an\nelegant and natural way of viewing higher-order programs producing algebraic\neffects as ordinary higher-order recursion schemes. We then move on to consider\neffect handlers, showing that in their presence the model checking problem is\nbound to be undecidable in the general case, while it stays decidable when\nhandlers have a simple syntactic form, still sufficient to capture so-called\ngeneric effects. Along the way we hint at how a general specification language\ncould look like, this way justifying some of the results in the literature, and\nderiving new ones.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:33:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lago","Ugo Dal",""],["Ghyselen","Alexis",""]]}
{"id":"2308.16543","submitter":"Panu Lahti","authors":"Panu Lahti and Quoc-Hung Nguyen","title":"BMO-type functionals, total variation, and $\\Gamma$-convergence","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 study the BMO-type functional $\\kappa_{\\varepsilon}(f,\\mathbb R^n)$, which\ncan be used to characterize BV functions $f\\in BV(\\mathbb R^n)$. The\n$\\Gamma$-limit of this functional, taken with respect to\n$L^1_{\\mathrm{loc}}$-convergence, is known to be $\\tfrac 14 |Df|(\\mathbb R^n)$.\nWe show that the $\\Gamma$-limit with respect to\n$L^{\\infty}_{\\mathrm{loc}}$-convergence is \\[ \\tfrac 14 |D^a f|(\\mathbb\nR^n)+\\tfrac 14 |D^c f|(\\mathbb R^n)+\\tfrac 12 |D^j f|(\\mathbb R^n), \\]\n  which agrees with the ``pointwise'' limit in the case of SBV functions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:34:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lahti","Panu",""],["Nguyen","Quoc-Hung",""]]}
{"id":"2308.16544","submitter":"Jalmari Tuominen","authors":"Jalmari Tuominen, Eetu Pulkkinen, Jaakko Peltonen, Juho Kanniainen,\n  Niku Oksala, Ari Palom\\\"aki, Antti Roine","title":"Forecasting Emergency Department Crowding with Advanced Machine Learning\n  Models and Multivariable Input","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Emergency department (ED) crowding is a significant threat to patient safety\nand it has been repeatedly associated with increased mortality. Forecasting\nfuture service demand has the potential patient outcomes. Despite active\nresearch on the subject, several gaps remain: 1) proposed forecasting models\nhave become outdated due to quick influx of advanced machine learning models\n(ML), 2) amount of multivariable input data has been limited and 3) discrete\nperformance metrics have been rarely reported. In this study, we document the\nperformance of a set of advanced ML models in forecasting ED occupancy 24 hours\nahead. We use electronic health record data from a large, combined ED with an\nextensive set of explanatory variables, including the availability of beds in\ncatchment area hospitals, traffic data from local observation stations, weather\nvariables, etc. We show that N-BEATS and LightGBM outpeform benchmarks with 11\n% and 9 % respective improvements and that DeepAR predicts next day crowding\nwith an AUC of 0.76 (95 % CI 0.69-0.84). To the best of our knowledge, this is\nthe first study to document the superiority of LightGBM and N-BEATS over\nstatistical benchmarks in the context of ED forecasting.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:34:20 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tuominen","Jalmari",""],["Pulkkinen","Eetu",""],["Peltonen","Jaakko",""],["Kanniainen","Juho",""],["Oksala","Niku",""],["Palom\u00e4ki","Ari",""],["Roine","Antti",""]]}
{"id":"2308.16545","submitter":"Yunfeng Hou","authors":"Yunfeng Hou and Qingdu Li","title":"Distributed Nonblocking Supervisory Control of Timed Discrete-Event\n  Systems with Communication Delays and Losses","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate the distributed networked supervisory control\nproblem of timed discrete-event systems (DESs). The supervisors communicate\nwith each other over a shared network subject to nondeterministic communication\ndelays and losses. Given the communication delays are counted by time,\ntechniques are developed to model the dynamics of the communication channels\nand the interaction process between the supervisors. Based on these techniques,\nwe define the observation mappings of the system by taking delays and losses\ninto consideration. Then, we derive the necessary and sufficient condition for\nthe existence of a set of supervisors. This condition is expressed as network\ncontrollability and network joint observability. Finally, a practical example\nof intelligent manufacturing is provided to show the application of the\nproposed framework.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:36:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hou","Yunfeng",""],["Li","Qingdu",""]]}
{"id":"2308.16546","submitter":"Alec Kirkley","authors":"Alec Kirkley","title":"Constructing hypergraphs from temporal data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A wide range of systems across the social and natural sciences produce\ntemporal data consisting of interaction events among nodes in disjoint sets.\nOnline shopping, for example, generates purchasing events of the form (user,\nproduct, time of purchase), and mutualistic interactions in plant-pollinator\nsystems generate pollination events of the form (insect, plant, time of\npollination). These data sets can be meaningfully modeled as temporal\nhypergraph snapshots in which multiple nodes within one set (i.e. online\nshoppers) share a hyperedge if they interacted with a common node in the\nopposite set (i.e. purchased the same product) within a given time window,\nallowing for the application of a range of hypergraph analysis techniques.\nHowever, it is often unclear how to choose the number and duration of these\ntemporal snapshots, which have a strong influence on the final hypergraph\nrepresentations. Here we propose a principled, efficient, nonparametric\nsolution to this longstanding problem by extracting temporal hypergraph\nsnapshots that optimally capture structural regularities in temporal event data\naccording to the minimum description length principle. We demonstrate our\nmethods on real and synthetic datasets, finding that they can recover planted\nartificial hypergraph structure in the presence of considerable noise and\nreveal meaningful activity fluctuations in human mobility data.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:37:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kirkley","Alec",""]]}
{"id":"2308.16547","submitter":"Cecilia Pagliantini","authors":"Cecilia Pagliantini, Federico Vismara","title":"Fully adaptive structure-preserving hyper-reduction of parametric\n  Hamiltonian systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Model order reduction provides low-complexity high-fidelity surrogate models\nthat allow rapid and accurate solutions of parametric differential equations.\nThe development of reduced order models for parametric nonlinear Hamiltonian\nsystems is still challenged by several factors: (i) the geometric structure\nencoding the physical properties of the dynamics; (ii) the slowly decaying\nKolmogorov $n$-width of conservative dynamics; (iii) the gradient structure of\nthe nonlinear flow velocity; (iv) high variations in the numerical rank of the\nstate as a function of time and parameters. We propose to address these aspects\nvia a structure-preserving adaptive approach that combines symplectic dynamical\nlow-rank approximation with adaptive gradient-preserving hyper-reduction and\nparameters sampling. Additionally, we propose to vary in time the dimensions of\nboth the reduced basis space and the hyper-reduction space by monitoring the\nquality of the reduced solution via an error indicator related to the\nprojection error of the Hamiltonian vector field. The resulting adaptive\nhyper-reduced models preserve the geometric structure of the Hamiltonian flow,\ndo not rely on prior information on the dynamics, and can be solved at a cost\nthat is linear in the dimension of the full order model and linear in the\nnumber of test parameters. Numerical experiments demonstrate the improved\nperformances of the resulting fully adaptive models compared to the original\nand reduced order models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:38:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pagliantini","Cecilia",""],["Vismara","Federico",""]]}
{"id":"2308.16548","submitter":"Filippo Contino","authors":"Carlo Branchina, Vincenzo Branchina, Filippo Contino, Arcangelo\n  Pernace","title":"Does the Cosmological Constant really indicate the existence of a Dark\n  Dimension?","comments":"9 pages, 1 Appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc hep-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  It has been recently proposed that we might live in a universe with a single\ncompact extra dimension, whose mesoscopic size is dictated by the measured\nvalue of the cosmological constant. Central to this proposal is the result that\nin a $4+n$ dimensional theory with $n$ compact dimensions a tower of\nKaluza-Klein (KK) states contributes an amount $m_{_{\\rm KK}}^4$ to the vacuum\nenergy $\\rho_4$, where $m_{_{\\rm KK}}$ is the KK scale of the tower. We show\nthat the result $\\rho_4 \\sim m_{_{\\rm KK}}^4$ comes from a mistreatment of the\nasymptotics of the loop momenta in the $4+n$ original theory. When the latter\nare correctly treated, new UV-sensitive terms appear in $\\rho_4$ that\ninvalidate the prediction of the dark dimension. We also show that, despite\nrecent claims to the contrary, it is always possible to perform consistent\neffective field theory calculations that include only a finite number of tower\nstates.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:40:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Branchina","Carlo",""],["Branchina","Vincenzo",""],["Contino","Filippo",""],["Pernace","Arcangelo",""]]}
{"id":"2308.16549","submitter":"Fatma Elsafoury","authors":"Fatma Elsafoury","title":"Thesis Distillation: Investigating The Impact of Bias in NLP Models on\n  Hate Speech Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is a summary of the work in my PhD thesis. In which, I investigate\nthe impact of bias in NLP models on the task of hate speech detection from\nthree perspectives: explainability, offensive stereotyping bias, and fairness.\nI discuss the main takeaways from my thesis and how they can benefit the\nbroader NLP community. Finally, I discuss important future research directions.\nThe findings of my thesis suggest that bias in NLP models impacts the task of\nhate speech detection from all three perspectives. And that unless we start\nincorporating social sciences in studying bias in NLP models, we will not\neffectively overcome the current limitations of measuring and mitigating bias\nin NLP models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:40:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Elsafoury","Fatma",""]]}
{"id":"2308.16550","submitter":"Trygve Magnus R{\\ae}der","authors":"Trygve Magnus R{\\ae}der, Urko Petralanda, Thomas Olsen, and Hugh\n  Simons","title":"Imaging the Electric Field with X-Ray Diffraction Microscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The properties of semiconductors and functional dielectrics are defined by\ntheir response in electric fields, which may be perturbed by defects and the\nstrain they generate. In this work, we demonstrate how diffraction-based X-ray\nmicroscopy techniques may be utilized to image the electric field in insulating\ncrystalline materials. By analysing a prototypical ferro- and piezoelectric\nmaterial, BaTiO$_{3}$, we identify trends that can guide experimental design\ntowards imaging the electric field using any diffraction-based X-ray microscopy\ntechnique. We explain these trends in the context of dark-field X-ray\nmicroscopy, but the framework is also valid for Bragg scanning probe X-ray\nmicroscopy, Bragg coherent diffraction imaging and Bragg X-ray ptychography.\nThe ability to quantify electric field distributions alongside the defects and\nstrain already accessible via these techniques offers a more comprehensive\npicture of the often complex structure-property relationships that exist in\nmany insulating and semiconducting materials.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:43:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["R\u00e6der","Trygve Magnus",""],["Petralanda","Urko",""],["Olsen","Thomas",""],["Simons","Hugh",""]]}
{"id":"2308.16551","submitter":"Chenyao Jiang","authors":"Chenyao Jiang, Shiyao Zhai, Hengrui Song, Yuqing Ma, Yachen Fan,\n  Yancheng Fang, Dongmei Yu, Canyang Zhang, Sanyang Han, Runming Wang, Yong\n  Liu, Jianbo Li, Peiwu Qin","title":"Object Detection for Caries or Pit and Fissure Sealing Requirement in\n  Children's First Permanent Molars","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":"  Dental caries is one of the most common oral diseases that, if left\nuntreated, can lead to a variety of oral problems. It mainly occurs inside the\npits and fissures on the occlusal/buccal/palatal surfaces of molars and\nchildren are a high-risk group for pit and fissure caries in permanent molars.\nPit and fissure sealing is one of the most effective methods that is widely\nused in prevention of pit and fissure caries. However, current detection of\npits and fissures or caries depends primarily on the experienced dentists,\nwhich ordinary parents do not have, and children may miss the remedial\ntreatment without timely detection. To address this issue, we present a method\nto autodetect caries and pit and fissure sealing requirements using oral photos\ntaken by smartphones. We use the YOLOv5 and YOLOX models and adopt a tiling\nstrategy to reduce information loss during image pre-processing. The best\nresult for YOLOXs model with tiling strategy is 72.3 mAP.5, while the best\nresult without tiling strategy is 71.2. YOLOv5s6 model with/without tiling\nattains 70.9/67.9 mAP.5, respectively. We deploy the pre-trained network to\nmobile devices as a WeChat applet, allowing in-home detection by parents or\nchildren guardian.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:43:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jiang","Chenyao",""],["Zhai","Shiyao",""],["Song","Hengrui",""],["Ma","Yuqing",""],["Fan","Yachen",""],["Fang","Yancheng",""],["Yu","Dongmei",""],["Zhang","Canyang",""],["Han","Sanyang",""],["Wang","Runming",""],["Liu","Yong",""],["Li","Jianbo",""],["Qin","Peiwu",""]]}
{"id":"2308.16552","submitter":"Yang Liu","authors":"Yang Liu, Xiaoyun Zhong, Shiyao Zhai, Zhicheng Du, Zhenyuan Gao,\n  Qiming Huang, Canyang Zhang, Bin Jiang, Vijay Kumar Pandey, Sanyang Han,\n  Runming Wang, Yuxing Han and Peiwu Qin","title":"Prompt-enhanced Hierarchical Transformer Elevating Cardiopulmonary\n  Resuscitation Instruction via Temporal Action Segmentation","comments":"Transformer for Cardiopulmonary Resuscitation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The vast majority of people who suffer unexpected cardiac arrest are\nperformed cardiopulmonary resuscitation (CPR) by passersby in a desperate\nattempt to restore life, but endeavors turn out to be fruitless on account of\ndisqualification. Fortunately, many pieces of research manifest that\ndisciplined training will help to elevate the success rate of resuscitation,\nwhich constantly desires a seamless combination of novel techniques to yield\nfurther advancement. To this end, we collect a custom CPR video dataset in\nwhich trainees make efforts to behave resuscitation on mannequins independently\nin adherence to approved guidelines, thereby devising an auxiliary toolbox to\nassist supervision and rectification of intermediate potential issues via\nmodern deep learning methodologies. Our research empirically views this problem\nas a temporal action segmentation (TAS) task in computer vision, which aims to\nsegment an untrimmed video at a frame-wise level. Here, we propose a\nPrompt-enhanced hierarchical Transformer (PhiTrans) that integrates three\nindispensable modules, including a textual prompt-based Video Features\nExtractor (VFE), a transformer-based Action Segmentation Executor (ASE), and a\nregression-based Prediction Refinement Calibrator (PRC). The backbone of the\nmodel preferentially derives from applications in three approved public\ndatasets (GTEA, 50Salads, and Breakfast) collected for TAS tasks, which\naccounts for the excavation of the segmentation pipeline on the CPR dataset. In\ngeneral, we unprecedentedly probe into a feasible pipeline that genuinely\nelevates the CPR instruction qualification via action segmentation in\nconjunction with cutting-edge deep learning techniques. Associated experiments\nadvocate our implementation with multiple metrics surpassing 91.0%.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:43:52 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Yang",""],["Zhong","Xiaoyun",""],["Zhai","Shiyao",""],["Du","Zhicheng",""],["Gao","Zhenyuan",""],["Huang","Qiming",""],["Zhang","Canyang",""],["Jiang","Bin",""],["Pandey","Vijay Kumar",""],["Han","Sanyang",""],["Wang","Runming",""],["Han","Yuxing",""],["Qin","Peiwu",""]]}
{"id":"2308.16553","submitter":"Anita Pasotti","authors":"M. Meszka, A. Pasotti, M.A. Pellegrini","title":"The seating couple problem in even case","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we consider the seating couple problem with an even number of\nseats, which, using graph theory terminology, can be stated as follows. Given a\npositive even integer $v=2n$ and a list $L$ containing $n$ positive integers\nnot exceeding $n$, is it always possible to find a perfect matching of $K_v$\nwhose list of edge-lengths is $L$? Up to now a (non-constructive) solution is\nknown only when all the edge-lengths are coprime with $v$. In this paper we\nfirstly present some necessary conditions for the existence of a solution.\nThen, we give a complete constructive solution when the list consists of one or\ntwo distinct elements, and when the list consists of consecutive integers\n$1,2,\\ldots,x$, each one appearing with the same multiplicity. Finally, we\npropose a conjecture and some open problems.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:44:22 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Meszka","M.",""],["Pasotti","A.",""],["Pellegrini","M. A.",""]]}
{"id":"2308.16554","submitter":"Paul Malisani","authors":"Paul Malisani (IFPEN)","title":"Interior point methods in optimal control problems of affine systems:\n  Convergence results and solving algorithms","comments":"submitted to SIAM SICON","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents an interior point method for pure-state and\nmixed-constrained optimal control problems for dynamics, mixed constraints, and\ncost function all affine in the control variable. This method relies on\nresolving a sequence of two-point boundary value problems of differential and\nalgebraic equations. This paper establishes a convergence result for primal and\ndual variables of the optimal control problem. A primal and a primal-dual\nsolving algorithm are presented, and a challenging numerical example is treated\nfor illustration. Accepted for publication at SIAM SICON 2023\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:45:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Malisani","Paul","","IFPEN"]]}
{"id":"2308.16555","submitter":"Rui Fan","authors":"Chenbo Zhou, Shuai Su, Qijun Chen, Rui Fan","title":"E3CM: Epipolar-Constrained Cascade Correspondence Matching","comments":"accepted to Neurocomputing","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate and robust correspondence matching is of utmost importance for\nvarious 3D computer vision tasks. However, traditional explicit\nprogramming-based methods often struggle to handle challenging scenarios, and\ndeep learning-based methods require large well-labeled datasets for network\ntraining. In this article, we introduce Epipolar-Constrained Cascade\nCorrespondence (E3CM), a novel approach that addresses these limitations.\nUnlike traditional methods, E3CM leverages pre-trained convolutional neural\nnetworks to match correspondence, without requiring annotated data for any\nnetwork training or fine-tuning. Our method utilizes epipolar constraints to\nguide the matching process and incorporates a cascade structure for progressive\nrefinement of matches. We extensively evaluate the performance of E3CM through\ncomprehensive experiments and demonstrate its superiority over existing\nmethods. To promote further research and facilitate reproducibility, we make\nour source code publicly available at https://mias.group/E3CM.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:46:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhou","Chenbo",""],["Su","Shuai",""],["Chen","Qijun",""],["Fan","Rui",""]]}
{"id":"2308.16556","submitter":"Dongdong Hu","authors":"K.Wang, J.Zhou, X.Wang, X.Li, D.Hu, Y.Sun","title":"Batch test of MRPC3b for CBM-TOF/STAR-eTOF","comments":"18 pages,12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The Compressed Baryonic Matter (CBM) experiment is one of the major\nscientific spectrometers of the future Facility for Antiproton and Ion Research\n(FAIR) in Darmstadt. As one of the core sub-systems in CBM experiment for\ncharged hadron identification, the Time-of-Flight (TOF) system is required to\nhave a time resolution better than 80 ps. According to the final state particle\nflux distribution, the CBM-TOF will be constructed with several types of\nMultigap Resistive Plate Chambers (MRPC). In the outer region of the TOF wall\nwhere the particle fluxes are around 1 kHz/cm2, MRPCs with ultra-thin float\nglass electrodes are considered as a cost effective solution. MRPC3b prototypes\nhave been developed and tested with excellent performance which could meet all\nthe requirements. Before the construction of CBM-TOF, approximately 80 MRPC3bs\nare assembled for the STAR endcap TOF (STAR-eTOF) upgrade at RHIC as part of\nthe FAIR Phase-0 programs for CBM-TOF which provides a valuable opportunity for\ndetector stability test under high flux environments. This paper will introduce\nthe batch test of the MRPC3bs for STAR-eTOF upgrade. Time resolution of better\nthan 70 ps and efficiency of around 95% are achieved. Notably, during the batch\ntest, it has been observed that the noise rates of the two edge strips in each\ncounter are significantly higher than those of the middle strips. Simulations\nwith Computer Simulation Technology (CST)Studio Suite are carried out and\nseveral kinds of MRPC prototypes are designed and tested accordingly. Based on\nthe simulation and test results, the design of the MRPC3b has been further\noptimized, resulting in a significant suppression of noise rates in the edge\nstrips.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:46:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","K.",""],["Zhou","J.",""],["Wang","X.",""],["Li","X.",""],["Hu","D.",""],["Sun","Y.",""]]}
{"id":"2308.16557","submitter":"Arghavan Moradi Dakhel","authors":"Arghavan Moradi Dakhel, Amin Nikanjam, Vahid Majdinasab, Foutse Khomh,\n  Michel C. Desmarais","title":"Effective Test Generation Using Pre-trained Large Language Models and\n  Mutation Testing","comments":"16 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One of the critical phases in software development is software testing.\nTesting helps with identifying potential bugs and reducing maintenance costs.\nThe goal of automated test generation tools is to ease the development of tests\nby suggesting efficient bug-revealing tests. Recently, researchers have\nleveraged Large Language Models (LLMs) of code to generate unit tests. While\nthe code coverage of generated tests was usually assessed, the literature has\nacknowledged that the coverage is weakly correlated with the efficiency of\ntests in bug detection. To improve over this limitation, in this paper, we\nintroduce MuTAP for improving the effectiveness of test cases generated by LLMs\nin terms of revealing bugs by leveraging mutation testing. Our goal is achieved\nby augmenting prompts with surviving mutants, as those mutants highlight the\nlimitations of test cases in detecting bugs. MuTAP is capable of generating\neffective test cases in the absence of natural language descriptions of the\nProgram Under Test (PUTs). We employ different LLMs within MuTAP and evaluate\ntheir performance on different benchmarks. Our results show that our proposed\nmethod is able to detect up to 28% more faulty human-written code snippets.\nAmong these, 17% remained undetected by both the current state-of-the-art fully\nautomated test generation tool (i.e., Pynguin) and zero-shot/few-shot learning\napproaches on LLMs. Furthermore, MuTAP achieves a Mutation Score (MS) of 93.57%\non synthetic buggy code, outperforming all other approaches in our evaluation.\nOur findings suggest that although LLMs can serve as a useful tool to generate\ntest cases, they require specific post-processing steps to enhance the\neffectiveness of the generated test cases which may suffer from syntactic or\nfunctional errors and may be ineffective in detecting certain types of bugs and\ntesting corner cases PUTs.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:48:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dakhel","Arghavan Moradi",""],["Nikanjam","Amin",""],["Majdinasab","Vahid",""],["Khomh","Foutse",""],["Desmarais","Michel C.",""]]}
{"id":"2308.16558","submitter":"Frederic Chassot","authors":"Fr\\'ed\\'eric Chassot (1), Aki Pulkkinen (1,2), Geoffroy Kremer (1,3),\n  Tetiana Zakusylo (4), Gauthier Krizman (4), Mahdi Hajlaoui (4), J. Hugo Dil\n  (5,6), Juraj Krempask\\'y (6), J\\'an Min\\'ar (2), Gunther Springholz (4) and\n  Claude Monney (1) ((1) Department of Physics and Fribourg Center for\n  Nanomaterials, Universit\\'e de Fribourg, Fribourg, Switzerland, (2) New\n  Technologies-Research Center, University of West Bohemia, Plzen, Czech\n  Republic, (3) Institut Jean Lamour, UMR 7198, CNRS-Universit\\'e de Lorraine,\n  Campus ARTEM, 2 all\\'ee Andr\\'e Guinier, BP 50840, 54011 Nancy, France, (4)\n  Institut f\\\"ur Halbleiter-und Festk\\\"orperphysik, Johannes Kepler\n  Universit\\\"at, Linz, Austria, (5) Institute of Physics, Ecole Polytechnique\n  F\\'ed\\'erale de Lausanne, Lausanne, Switzerland, (6) Photon Science Division,\n  Paul Scherrer Institut, Villigen, Switzerland)","title":"Persistence of structural distortion and bulk band Rashba splitting in\n  SnTe above its ferroelectric critical temperature","comments":"26 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ferroelectric semiconductor $\\alpha$-SnTe has been regarded as a\ntopological crystalline insulator and the dispersion of its surface states has\nbeen intensively measured with angle-resolved photoemission spectroscopy\n(ARPES) over the last decade. However, much less attention has been given to\nthe impact of the ferroelectric transition on its electronic structure, and in\nparticular on its bulk states. Here, we investigate the low-energy electronic\nstructure of $\\alpha$-SnTe with ARPES and follow the evolution of the\nbulk-state Rashba splitting as a function of temperature, across its\nferroelectric critical temperature of about $T_c\\sim 110$ K. Unexpectedly, we\nobserve a persistent band splitting up to room temperature, which is consistent\nwith an order-disorder contribution to the phase transition that requires the\npresence of fluctuating local dipoles above $T_c$. We conclude that no\ntopological surface state can occur at the (111) surface of SnTe, at odds with\nrecent literature.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:48:46 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chassot","Fr\u00e9d\u00e9ric",""],["Pulkkinen","Aki",""],["Kremer","Geoffroy",""],["Zakusylo","Tetiana",""],["Krizman","Gauthier",""],["Hajlaoui","Mahdi",""],["Dil","J. Hugo",""],["Krempask\u00fd","Juraj",""],["Min\u00e1r","J\u00e1n",""],["Springholz","Gunther",""],["Monney","Claude",""]]}
{"id":"2308.16559","submitter":"Christina Stoiber","authors":"Christina Stoiber, Daniela Moitzi, Holger Stitz, Florian Grassinger,\n  Anto Silviya Geo Prakash, Dominic Girardi, Marc Streit and Wolfgang Aigner","title":"VisAhoi: Towards a Library to Generate and Integrate Visualization\n  Onboarding Using High-level Visualization Grammars","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Visualization onboarding supports users in reading, interpreting, and\nextracting information from visual data representations. General-purpose\nonboarding tools and libraries are applicable for explaining a wide range of\ngraphical user interfaces but cannot handle specific visualization\nrequirements. This paper describes a first step towards developing an\nonboarding library called VisAhoi, which is easy to integrate, extend,\nsemi-automate, reuse, and customize. VisAhoi supports the creation of\nonboarding elements for different visualization types and datasets. We\ndemonstrate how to extract and describe onboarding instructions using three\nwell-known high-level descriptive visualization grammars - Vega-Lite,\nPlotly.js, and ECharts. We show the applicability of our library by performing\ntwo usage scenarios that describe the integration of VisAhoi into a VA tool for\nthe analysis of high-throughput screening (HTS) data and, second, into a\nFlourish template to provide an authoring tool for data journalists for a\ntreemap visualization. We provide a supplementary website that demonstrates the\napplicability of VisAhoi to various visualizations, including a bar chart, a\nhorizon graph, a change matrix or heatmap, a scatterplot, and a treemap\nvisualization.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:49:15 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Stoiber","Christina",""],["Moitzi","Daniela",""],["Stitz","Holger",""],["Grassinger","Florian",""],["Prakash","Anto Silviya Geo",""],["Girardi","Dominic",""],["Streit","Marc",""],["Aigner","Wolfgang",""]]}
{"id":"2308.16560","submitter":"Naoya Kuse","authors":"Omnia Nawwar, Kaoru Minoshima, Naoya Kuse","title":"Stepped-Frequency THz-wave Signal Generation From a Kerr Microresonator\n  Soliton Comb","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Optically generated terahertz (THz) oscillators have garnered considerable\nattention in recent years due to their potential for wide tunability and low\nphase noise. Here, for the first time, a dissipative Kerr microresonator\nsoliton comb (DKS), which is inherently in a low noise state, is utilized to\nproduce a stepped-frequency THz signal ($\\approx$ 280 GHz). The frequency of\none comb mode from a DKS is scanned through an optical-recirculating\nfrequency-shifting loop (ORFSL) which induces a predetermined frequency step\nonto the carrier frequency. The scanned signal is subsequently heterodyned with\nan adjacent comb mode, generating a THz signal in a frequency range that is\ndetermined by the repetition frequency of the DKS. The proposed method is\nproved by proof-of-concept experiments with MHz level electronics, showing a\nbandwidth of 4.15 GHz with a frequency step of 83 MHz and a period of 16\n$\\mu$s.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:49:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nawwar","Omnia",""],["Minoshima","Kaoru",""],["Kuse","Naoya",""]]}
{"id":"2308.16561","submitter":"Trinh Vuong Thi Le","authors":"Trinh Thi Le Vuong and Jin Tae Kwak","title":"MoMA: Momentum Contrastive Learning with Multi-head Attention-based\n  Knowledge Distillation for Histopathology Image Analysis","comments":"Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  There is no doubt that advanced artificial intelligence models and high\nquality data are the keys to success in developing computational pathology\ntools. Although the overall volume of pathology data keeps increasing, a lack\nof quality data is a common issue when it comes to a specific task due to\nseveral reasons including privacy and ethical issues with patient data. In this\nwork, we propose to exploit knowledge distillation, i.e., utilize the existing\nmodel to learn a new, target model, to overcome such issues in computational\npathology. Specifically, we employ a student-teacher framework to learn a\ntarget model from a pre-trained, teacher model without direct access to source\ndata and distill relevant knowledge via momentum contrastive learning with\nmulti-head attention mechanism, which provides consistent and context-aware\nfeature representations. This enables the target model to assimilate\ninformative representations of the teacher model while seamlessly adapting to\nthe unique nuances of the target data. The proposed method is rigorously\nevaluated across different scenarios where the teacher model was trained on the\nsame, relevant, and irrelevant classification tasks with the target model.\nExperimental results demonstrate the accuracy and robustness of our approach in\ntransferring knowledge to different domains and tasks, outperforming other\nrelated methods. Moreover, the results provide a guideline on the learning\nstrategy for different types of tasks and scenarios in computational pathology.\nCode is available at: \\url{https://github.com/trinhvg/MoMA}.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:54:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vuong","Trinh Thi Le",""],["Kwak","Jin Tae",""]]}
{"id":"2308.16562","submitter":"Maria Rigaki","authors":"Maria Rigaki, Sebastian Garcia","title":"The Power of MEME: Adversarial Malware Creation with Model-Based\n  Reinforcement Learning","comments":"12 pages, 3 figures, 3 tables. Accepted at ESORICS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Due to the proliferation of malware, defenders are increasingly turning to\nautomation and machine learning as part of the malware detection tool-chain.\nHowever, machine learning models are susceptible to adversarial attacks,\nrequiring the testing of model and product robustness. Meanwhile, attackers\nalso seek to automate malware generation and evasion of antivirus systems, and\ndefenders try to gain insight into their methods. This work proposes a new\nalgorithm that combines Malware Evasion and Model Extraction (MEME) attacks.\nMEME uses model-based reinforcement learning to adversarially modify Windows\nexecutable binary samples while simultaneously training a surrogate model with\na high agreement with the target model to evade. To evaluate this method, we\ncompare it with two state-of-the-art attacks in adversarial malware creation,\nusing three well-known published models and one antivirus product as targets.\nResults show that MEME outperforms the state-of-the-art methods in terms of\nevasion capabilities in almost all cases, producing evasive malware with an\nevasion rate in the range of 32-73%. It also produces surrogate models with a\nprediction label agreement with the respective target models between 97-99%.\nThe surrogate could be used to fine-tune and improve the evasion rate in the\nfuture.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:55:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Rigaki","Maria",""],["Garcia","Sebastian",""]]}
{"id":"2308.16563","submitter":"Liu Ke","authors":"Ke Liu and Fa Wang","title":"Schwinger boson symmetric spin liquids of Shastry-Sutherland model","comments":"25 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":"  Motivated by recent experimental and numerical evidences of deconfined\nquantum critical point and quantum spin-liquid states in spin-$1/2$ Heisenberg\nmodel on Shastry-Sutherland lattice, we studied possible symmetric spin liquid\nstates and their proximate ordered states under Schwinger boson formalism. We\nfound a symmetric gapped $Z_2$ spin-liquid state for intermediate model\nparameter $0.66 < J_1/J_2 < 0.71$ under mean-field approximation. The Schwinger\nboson mean-field picture is partially supported by exact-diagonalization and\nself-consistent spin wave theory results.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:57:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Ke",""],["Wang","Fa",""]]}
{"id":"2308.16564","submitter":"Zhihui Luo","authors":"Zhihui Luo, Biao Lv, Meng Wang, W\\'ei W\\'u, Dao-xin Yao","title":"High-T$_C$ superconductivity in $\\mathrm{La_3Ni_2O_7}$ based on the\n  bilayer two-orbital t-J model","comments":"8 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The recently discovered high-T$_C$ superconductor La$_3$Ni$_2$O$_7$ has\nsparked renewed interest in the unconventional superconductivity. Here we study\nthe unconventional superconductivity in pressurized La$_3$Ni$_2$O$_7$ based on\na bilayer two-orbital $t-J$ model, using the renormalized mean-field theory.\nOur results reveal a robust $s^\\pm-$wave pairing driven by the inter-layer\n$d_{z^2}$ magnetic coupling, which exhibits a transition temperature within the\nsame order of magnitude as the experimentally observed $T_c \\sim 80$ K. We\nobtain a comprehensive superconducting phase diagram in the doping plane.\nNotably, the La$_3$Ni$_2$O$_7$ under pressure is found situated roughly in the\noptimal doping regime of the phase diagram. When the $d_{x^2-y^2}$ orbital\nbecomes close to half-filling, $d-$wave and $d+is$ pairing can emerge from the\nsystem. We discuss the interplay between the Fermi surface topology and\ndifferent pairing symmetries. The stability of the $s^\\pm-$wave pairing against\nHund's coupling and other magnetic exchange couplings is examined.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:57:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Luo","Zhihui",""],["Lv","Biao",""],["Wang","Meng",""],["W\u00fa","W\u00e9i",""],["Yao","Dao-xin",""]]}
{"id":"2308.16565","submitter":"Marcel Risch","authors":"Marcel Risch","title":"Reporting activities for the oxygen evolution reaction: Do we compare\n  apples to apples?","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":"  The oxygen evolution reaction (OER) is a key enabler of sustainable chemical\nenergy storage. Here, the author assesses the current status of protocols for\nbenchmarking the OER in materials- and device-centered investigations and makes\nsuggestions for more comparable data.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 08:59:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Risch","Marcel",""]]}
{"id":"2308.16566","submitter":"David Koz\\'ak","authors":"David Koz\\'ak, Vojin Jovanovic, Codru\\c{t} Stancu, Tom\\'a\\v{s} Vojnar,\n  Christian Wimmer","title":"Comparing Rapid Type Analysis with Points-To Analysis in GraalVM Native\n  Image","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Whole-program analysis is an essential technique that enables advanced\ncompiler optimizations. An important example of such a method is points-to\nanalysis used by ahead-of-time (AOT) compilers to discover program elements\n(classes, methods, fields) used on at least one program path. GraalVM Native\nImage uses a points-to analysis to optimize Java applications, which is a\ntime-consuming step of the build. We explore how much the analysis time can be\nimproved by replacing the points-to analysis with a rapid type analysis (RTA),\nwhich computes reachable elements faster by allowing more imprecision. We\npropose several extensions of previous approaches to RTA: making it parallel,\nincremental, and supporting heap snapshotting. We present an extensive\nexperimental evaluation of the effects of using RTA instead of points-to\nanalysis, in which RTA allowed us to reduce the analysis time for Spring\nPetclinic, a popular demo application of the Spring framework, by 64% and the\noverall build time by 35% at the cost of increasing the image size due to the\nimprecision by 15%.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:01:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Koz\u00e1k","David",""],["Jovanovic","Vojin",""],["Stancu","Codru\u0163",""],["Vojnar","Tom\u00e1\u0161",""],["Wimmer","Christian",""]]}
{"id":"2308.16567","submitter":"Fei Yang","authors":"Fei Yang, Kai Wang, Joost van de Weijer","title":"ScrollNet: Dynamic Weight Importance for Continual Learning","comments":"Accepted at Visual Continual Learning workshop (ICCV2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The principle underlying most existing continual learning (CL) methods is to\nprioritize stability by penalizing changes in parameters crucial to old tasks,\nwhile allowing for plasticity in other parameters. The importance of weights\nfor each task can be determined either explicitly through learning a\ntask-specific mask during training (e.g., parameter isolation-based approaches)\nor implicitly by introducing a regularization term (e.g., regularization-based\napproaches). However, all these methods assume that the importance of weights\nfor each task is unknown prior to data exposure. In this paper, we propose\nScrollNet as a scrolling neural network for continual learning. ScrollNet can\nbe seen as a dynamic network that assigns the ranking of weight importance for\neach task before data exposure, thus achieving a more favorable\nstability-plasticity tradeoff during sequential task learning by reassigning\nthis ranking for different tasks. Additionally, we demonstrate that ScrollNet\ncan be combined with various CL methods, including regularization-based and\nreplay-based approaches. Experimental results on CIFAR100 and TinyImagenet\ndatasets show the effectiveness of our proposed method. We release our code at\nhttps://github.com/FireFYF/ScrollNet.git.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:01:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yang","Fei",""],["Wang","Kai",""],["van de Weijer","Joost",""]]}
{"id":"2308.16568","submitter":"Jan Verh\\\"ulsdonk","authors":"Jan Verh\\\"ulsdonk, Thomas Grandits, Francisco Sahli Costabal, Rolf\n  Krause, Angelo Auricchio, Gundolf Haase, Simone Pezzuto, Alexander Effland","title":"Shape of my heart: Cardiac models through learned signed distance\n  functions","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 efficient construction of an anatomical model is one of the major\nchallenges of patient-specific in-silico models of the human heart. Current\nmethods frequently rely on linear statistical models, allowing no advanced\ntopological changes, or requiring medical image segmentation followed by a\nmeshing pipeline, which strongly depends on image resolution, quality, and\nmodality. These approaches are therefore limited in their transferability to\nother imaging domains. In this work, the cardiac shape is reconstructed by\nmeans of three-dimensional deep signed distance functions with Lipschitz\nregularity. For this purpose, the shapes of cardiac MRI reconstructions are\nlearned from public databases to model the spatial relation of multiple\nchambers in Cartesian space. We demonstrate that this approach is also capable\nof reconstructing anatomical models from partial data, such as point clouds\nfrom a single ventricle, or modalities different from the trained MRI, such as\nelectroanatomical mapping, and in addition, allows us to generate new\nanatomical shapes by randomly sampling latent vectors.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:02:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Verh\u00fclsdonk","Jan",""],["Grandits","Thomas",""],["Costabal","Francisco Sahli",""],["Krause","Rolf",""],["Auricchio","Angelo",""],["Haase","Gundolf",""],["Pezzuto","Simone",""],["Effland","Alexander",""]]}
{"id":"2308.16569","submitter":"Jie Chen","authors":"Jie Chen, Xingchen Song, Zhendong Peng, Binbin Zhang, Fuping Pan,\n  Zhiyong Wu","title":"LightGrad: Lightweight Diffusion Probabilistic Model for Text-to-Speech","comments":"Accepted by ICASSP 2023","journal-ref":null,"doi":"10.1109/ICASSP49357.2023.10096710","report-no":null,"categories":"cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recent advances in neural text-to-speech (TTS) models bring thousands of TTS\napplications into daily life, where models are deployed in cloud to provide\nservices for customs. Among these models are diffusion probabilistic models\n(DPMs), which can be stably trained and are more parameter-efficient compared\nwith other generative models. As transmitting data between customs and the\ncloud introduces high latency and the risk of exposing private data, deploying\nTTS models on edge devices is preferred. When implementing DPMs onto edge\ndevices, there are two practical problems. First, current DPMs are not\nlightweight enough for resource-constrained devices. Second, DPMs require many\ndenoising steps in inference, which increases latency. In this work, we present\nLightGrad, a lightweight DPM for TTS. LightGrad is equipped with a lightweight\nU-Net diffusion decoder and a training-free fast sampling technique, reducing\nboth model parameters and inference latency. Streaming inference is also\nimplemented in LightGrad to reduce latency further. Compared with Grad-TTS,\nLightGrad achieves 62.2% reduction in paramters, 65.7% reduction in latency,\nwhile preserving comparable speech quality on both Chinese Mandarin and English\nin 4 denoising steps.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:05:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Jie",""],["Song","Xingchen",""],["Peng","Zhendong",""],["Zhang","Binbin",""],["Pan","Fuping",""],["Wu","Zhiyong",""]]}
{"id":"2308.16570","submitter":"Bruno Sousa Miguel","authors":"Duarte Dias, Bruno Sousa, Nuno Antunes","title":"MONDEO: Multistage Botnet 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":"  Mobile devices have widespread to become the most used piece of technology.\nDue to their characteristics, they have become major targets for botnet-related\nmalware. FluBot is one example of botnet malware that infects mobile devices.\nIn particular, FluBot is a DNS-based botnet that uses Domain Generation\nAlgorithms (DGA) to establish communication with the Command and Control Server\n(C2). MONDEO is a multistage mechanism with a flexible design to detect\nDNS-based botnet malware. MONDEO is lightweight and can be deployed without\nrequiring the deployment of software, agents, or configuration in mobile\ndevices, allowing easy integration in core networks. MONDEO comprises four\ndetection stages: Blacklisting/Whitelisting, Query rate analysis, DGA analysis,\nand Machine learning evaluation. It was created with the goal of processing\nstreams of packets to identify attacks with high efficiency, in the distinct\nphases. MONDEO was tested against several datasets to measure its efficiency\nand performance, being able to achieve high performance with RandomForest\nclassifiers. The implementation is available at github.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:12:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dias","Duarte",""],["Sousa","Bruno",""],["Antunes","Nuno",""]]}
{"id":"2308.16571","submitter":"Asif Azad","authors":"Ashrafur Rahman Khan, Asif Azad","title":"Document Layout Analysis on BaDLAD Dataset: A Comprehensive MViTv2 Based\n  Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the rapidly evolving digital era, the analysis of document layouts plays a\npivotal role in automated information extraction and interpretation. In our\nwork, we have trained MViTv2 transformer model architecture with cascaded mask\nR-CNN on BaDLAD dataset to extract text box, paragraphs, images and tables from\na document. After training on 20365 document images for 36 epochs in a 3 phase\ncycle, we achieved a training loss of 0.2125 and a mask loss of 0.19. Our work\nextends beyond training, delving into the exploration of potential enhancement\navenues. We investigate the impact of rotation and flip augmentation, the\neffectiveness of slicing input images pre-inference, the implications of\nvarying the resolution of the transformer backbone, and the potential of\nemploying a dual-pass inference to uncover missed text-boxes. Through these\nexplorations, we observe a spectrum of outcomes, where some modifications\nresult in tangible performance improvements, while others offer unique insights\nfor future endeavors.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:12:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Khan","Ashrafur Rahman",""],["Azad","Asif",""]]}
{"id":"2308.16572","submitter":"Radu Tudor Ionescu","authors":"Neelu Madan, Nicolae-Catalin Ristea, Kamal Nasrollahi, Thomas B.\n  Moeslund, Radu Tudor Ionescu","title":"CL-MAE: Curriculum-Learned Masked Autoencoders","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":"  Masked image modeling has been demonstrated as a powerful pretext task for\ngenerating robust representations that can be effectively generalized across\nmultiple downstream tasks. Typically, this approach involves randomly masking\npatches (tokens) in input images, with the masking strategy remaining unchanged\nduring training. In this paper, we propose a curriculum learning approach that\nupdates the masking strategy to continually increase the complexity of the\nself-supervised reconstruction task. We conjecture that, by gradually\nincreasing the task complexity, the model can learn more sophisticated and\ntransferable representations. To facilitate this, we introduce a novel\nlearnable masking module that possesses the capability to generate masks of\ndifferent complexities, and integrate the proposed module into masked\nautoencoders (MAE). Our module is jointly trained with the MAE, while adjusting\nits behavior during training, transitioning from a partner to the MAE\n(optimizing the same reconstruction loss) to an adversary (optimizing the\nopposite loss), while passing through a neutral state. The transition between\nthese behaviors is smooth, being regulated by a factor that is multiplied with\nthe reconstruction loss of the masking module. The resulting training procedure\ngenerates an easy-to-hard curriculum. We train our Curriculum-Learned Masked\nAutoencoder (CL-MAE) on ImageNet and show that it exhibits superior\nrepresentation learning capabilities compared to MAE. The empirical results on\nfive downstream tasks confirm our conjecture, demonstrating that curriculum\nlearning can be successfully used to self-supervise masked autoencoders.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:13:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Madan","Neelu",""],["Ristea","Nicolae-Catalin",""],["Nasrollahi","Kamal",""],["Moeslund","Thomas B.",""],["Ionescu","Radu Tudor",""]]}
{"id":"2308.16573","submitter":"Yuanbin Chen","authors":"Yuanbin Chen, Tao Wang, Hui Tang, Longxuan Zhao, Ruige Zong, Tao Tan,\n  Xinlin Zhang, Tong Tong","title":"Dual-Decoder Consistency via Pseudo-Labels Guided Data Augmentation for\n  Semi-Supervised Medical Image Segmentation","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":"  Medical image segmentation methods often rely on fully supervised approaches\nto achieve excellent performance, which is contingent upon having an extensive\nset of labeled images for training. However, annotating medical images is both\nexpensive and time-consuming. Semi-supervised learning offers a solution by\nleveraging numerous unlabeled images alongside a limited set of annotated ones.\nIn this paper, we introduce a semi-supervised medical image segmentation method\nbased on the mean-teacher model, referred to as Dual-Decoder Consistency via\nPseudo-Labels Guided Data Augmentation (DCPA). This method combines consistency\nregularization, pseudo-labels, and data augmentation to enhance the efficacy of\nsemi-supervised segmentation. Firstly, the proposed model comprises both\nstudent and teacher models with a shared encoder and two distinct decoders\nemploying different up-sampling strategies. Minimizing the output discrepancy\nbetween decoders enforces the generation of consistent representations, serving\nas regularization during student model training. Secondly, we introduce mixup\noperations to blend unlabeled data with labeled data, creating mixed data and\nthereby achieving data augmentation. Lastly, pseudo-labels are generated by the\nteacher model and utilized as labels for mixed data to compute unsupervised\nloss. We compare the segmentation results of the DCPA model with six\nstate-of-the-art semi-supervised methods on three publicly available medical\ndatasets. Beyond classical 10\\% and 20\\% semi-supervised settings, we\ninvestigate performance with less supervision (5\\% labeled data). Experimental\noutcomes demonstrate that our approach consistently outperforms existing\nsemi-supervised medical image segmentation methods across the three\nsemi-supervised settings.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:13:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Yuanbin",""],["Wang","Tao",""],["Tang","Hui",""],["Zhao","Longxuan",""],["Zong","Ruige",""],["Tan","Tao",""],["Zhang","Xinlin",""],["Tong","Tong",""]]}
{"id":"2308.16574","submitter":"Kiyoaki Doi","authors":"Kiyoaki Doi, Akimasa Kataoka","title":"Constraints on the dust size distributions in the HD 163296 disk from\n  the difference of the apparent dust ring widths between two ALMA Bands","comments":"29 pages, 16 figures. Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The dust size in protoplanetary disks is a crucial parameter for\nunderstanding planet formation, while the observational constraints on dust\nsize distribution have large uncertainties. In this study, we present a new\nmethod to constrain the dust size distribution from the dust spatial\ndistribution, utilizing the fact that larger dust grains are more spatially\nlocalized. We analyze the ALMA Band 6 (1.25 mm) and Band 4 (2.14 mm)\nhigh-resolution images and constrain the dust size distribution in the two\nrings of the HD 163296 disk. We find that the outer ring at 100 au appears\nnarrower at the longer wavelengths, while the inner ring at 67 au appears to\nhave similar widths across the two wavelengths. We model dust rings trapped at\ngas pressure maxima, where the dust grains follow a power-law size\ndistribution, and the dust grains of a specific size follow a Gaussian spatial\ndistribution with the width depending on the grain size. By comparing the\nobservations with the models, we constrain the maximum dust size\n$a_{\\mathrm{max}}$ and the exponent of the dust size distribution $p$. We\nconstrain that $0.9 \\ \\mathrm{mm} < a_{\\mathrm{max}} < 5 \\ \\mathrm{mm}$ and $p\n< 3.3$ in the inner ring, and $a_{\\mathrm{max}} > 3 \\times 10^1 \\ \\mathrm{mm}$\nand $3.4 < p < 3.7$ in the outer ring. The larger maximum dust size in the\nouter ring implies a spatial dependency in dust growth, potentially influencing\nthe formation location of the planetesimals. We further discuss the turbulence\nstrength $\\alpha$ derived from the constrained dust spatial distribution,\nassuming equilibrium between turbulent diffusion and accumulation of dust\ngrains.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:16:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Doi","Kiyoaki",""],["Kataoka","Akimasa",""]]}
{"id":"2308.16575","submitter":"Francesco Galvagno","authors":"M. Billo', M. Frau, F. Galvagno, A. Lerda","title":"Integrated correlators with a Wilson line in $\\mathcal{N}=4$ SYM","comments":"34 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the context of integrated correlators in $\\mathcal{N}=4$ SYM, we study the\n2-point functions of local operators with a superconformal line defect.\nStarting from the mass-deformed $\\mathcal{N}=2^*$ theory in presence of a\n$\\frac{1}{2}$-BPS Wilson line, we exploit the residual superconformal symmetry\nafter the defect insertion, and show that the massive deformation corresponds\nto integrated insertions of the superconformal primaries belonging to the\nstress tensor multiplet with a specific integration measure which is explicitly\nderived after enforcing the superconformal Ward identities. Finally, we show\nhow the Wilson line integrated correlator can be computed by the\n$\\mathcal{N}=2^*$ Wilson loop vacuum expectation value on a 4-sphere in terms\nof a matrix model using supersymmetric localization. In particular, we\nreformulate previous matrix model computations by making use of recursion\nrelations and Bessel kernels, providing a direct link with more general\nlocalization computations in $\\mathcal{N}=2$ theories.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:18:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Billo'","M.",""],["Frau","M.",""],["Galvagno","F.",""],["Lerda","A.",""]]}
{"id":"2308.16576","submitter":"Chen Li","authors":"Chen Li, Jihao Lin, Gim Hee Lee","title":"GHuNeRF: Generalizable Human NeRF from a Monocular Video","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we tackle the challenging task of learning a generalizable\nhuman NeRF model from a monocular video. Although existing generalizable human\nNeRFs have achieved impressive results, they require muti-view images or videos\nwhich might not be always available. On the other hand, some works on\nfree-viewpoint rendering of human from monocular videos cannot be generalized\nto unseen identities. In view of these limitations, we propose GHuNeRF to learn\na generalizable human NeRF model from a monocular video of the human performer.\nWe first introduce a visibility-aware aggregation scheme to compute vertex-wise\nfeatures, which is used to construct a 3D feature volume. The feature volume\ncan only represent the overall geometry of the human performer with\ninsufficient accuracy due to the limited resolution. To solve this, we further\nenhance the volume feature with temporally aligned point-wise features using an\nattention mechanism. Finally, the enhanced feature is used for predicting\ndensity and color for each sampled point. A surface-guided sampling strategy is\nalso introduced to improve the efficiency for both training and inference. We\nvalidate our approach on the widely-used ZJU-MoCap dataset, where we achieve\ncomparable performance with existing multi-view video based approaches. We also\ntest on the monocular People-Snapshot dataset and achieve better performance\nthan existing works when only monocular video is used.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:19:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Chen",""],["Lin","Jihao",""],["Lee","Gim Hee",""]]}
{"id":"2308.16577","submitter":"Jie Chen","authors":"Jie Chen, Changhe Song, Deyi Tuo, Xixin Wu, Shiyin Kang, Zhiyong Wu,\n  Helen Meng","title":"Improving Mandarin Prosodic Structure Prediction with Multi-level\n  Contextual Information","comments":"Accepted by Interspeech2022","journal-ref":null,"doi":"10.21437/Interspeech.2022-131","report-no":null,"categories":"cs.SD cs.CL eess.AS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For text-to-speech (TTS) synthesis, prosodic structure prediction (PSP) plays\nan important role in producing natural and intelligible speech. Although\ninter-utterance linguistic information can influence the speech interpretation\nof the target utterance, previous works on PSP mainly focus on utilizing\nintrautterance linguistic information of the current utterance only. This work\nproposes to use inter-utterance linguistic information to improve the\nperformance of PSP. Multi-level contextual information, which includes both\ninter-utterance and intrautterance linguistic information, is extracted by a\nhierarchical encoder from character level, utterance level and discourse level\nof the input text. Then a multi-task learning (MTL) decoder predicts prosodic\nboundaries from multi-level contextual information. Objective evaluation\nresults on two datasets show that our method achieves better F1 scores in\npredicting prosodic word (PW), prosodic phrase (PPH) and intonational phrase\n(IPH). It demonstrates the effectiveness of using multi-level contextual\ninformation for PSP. Subjective preference tests also indicate the naturalness\nof synthesized speeches are improved.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:19:15 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Jie",""],["Song","Changhe",""],["Tuo","Deyi",""],["Wu","Xixin",""],["Kang","Shiyin",""],["Wu","Zhiyong",""],["Meng","Helen",""]]}
{"id":"2308.16578","submitter":"Irving G\\'omez","authors":"Irving G\\'omez-M\\'endez and Chainarong Amornbunchornvej","title":"Income, education, and other poverty-related variables: a journey\n  through Bayesian hierarchical models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.AP stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One-shirt-size policy cannot handle poverty issues well since each area has\nits unique challenges, while having a custom-made policy for each area\nseparately is unrealistic due to limitation of resources as well as having\nissues of ignoring dependencies of characteristics between different areas. In\nthis work, we propose to use Bayesian hierarchical models which can potentially\nexplain the data regarding income and other poverty-related variables in the\nmulti-resolution governing structural data of Thailand. We discuss the journey\nof how we design each model from simple to more complex ones, estimate their\nperformance in terms of variable explanation and complexity, discuss models'\ndrawbacks, as well as propose the solutions to fix issues in the lens of\nBayesian hierarchical models in order to get insight from data.\n  We found that Bayesian hierarchical models performed better than both\ncomplete pooling (single policy) and no pooling models (custom-made policy).\nAdditionally, by adding the year-of-education variable, the hierarchical model\nenriches its performance of variable explanation. We found that having a higher\neducation level increases significantly the households' income for all the\nregions in Thailand. The impact of the region in the households' income is\nalmost vanished when education level or years of education are considered.\nTherefore, education might have a mediation role between regions and the\nincome. Our work can serve as a guideline for other countries that require the\nBayesian hierarchical approach to model their variables and get insight from\ndata.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:22:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["G\u00f3mez-M\u00e9ndez","Irving",""],["Amornbunchornvej","Chainarong",""]]}
{"id":"2308.16579","submitter":"Joel Dahne","authors":"Joel Dahne","title":"Highest Cusped Waves for the Fractional KdV Equations","comments":"86 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we prove the existence of highest, cusped, traveling wave\nsolutions for the fractional KdV equations $f_t + f f_x = |D|^{\\alpha} f_x$ for\nall $\\alpha \\in (-1,0)$ and give their exact leading asymptotic behavior at\nzero. The proof combines careful asymptotic analysis and a computer-assisted\napproach.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:23:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dahne","Joel",""]]}
{"id":"2308.16580","submitter":"Christoph Bandt","authors":"Christoph Bandt","title":"Elementary fractal geometry. 3. Complex Pisot factors imply finite type","comments":"28 pages, 9 figures, figures decreased to comply with size\n  restriction for submissions","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-similar sets require a separation condition to admit a nice mathematical\nstructure. The classical open set condition (OSC) is difficult to verify.\nZerner proved that there is a positive and finite Hausdorff measure for a\nweaker separation property which is always fulfilled for crystallographic data.\nNgai and Wang gave more specific results for a finite type property (FT), and\nfor algebraic data with a real Pisot expansion factor. We show how the\nalgorithmic FT concept of Bandt and Mesing relates to the property of Ngai and\nWang. Merits and limitations of the FT algorithm are discussed. Our main result\nsays that FT is always true in the complex plane if the similarity mappings are\ngiven by a complex Pisot expansion factor $\\lambda$ and algebraic integers in\nthe number field generated by $\\lambda .$ This extends the previous results and\nopens the door to huge classes of separated self-similar sets, with large\ncomplexity and an appearance of natural textures. Numerous examples are\nprovided.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:24:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bandt","Christoph",""]]}
{"id":"2308.16581","submitter":"Vladimir Bobkov","authors":"Vladimir Bobkov, Mieko Tanaka","title":"Abstract multiplicity results for $(p,q)$-Laplace equations with two\n  parameters","comments":"29 pages, 3 figures","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 and multiplicity of abstract weak solutions of\nthe equation $-\\Delta_p u -\\Delta_q u=\\alpha |u|^{p-2}u + \\beta |u|^{q-2}u$ in\na bounded domain under zero Dirichlet boundary conditions, assuming $1<q<p$ and\n$\\alpha,\\beta \\in \\mathbb{R}$. We determine three generally different ranges of\nparameters $\\alpha$ and $\\beta$ for which the problem possesses a given number\nof distinct pairs of solutions with a prescribed sign of energy. As auxiliary\nresults, which are also of independent interest, we provide alternative\ncharacterizations of variational eigenvalues of the $q$-Laplacian using\nnarrower and larger constraint sets than in the standard minimax definition.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:24:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bobkov","Vladimir",""],["Tanaka","Mieko",""]]}
{"id":"2308.16582","submitter":"Yuanfan Guo","authors":"Qingping Zheng, Yuanfan Guo, Jiankang Deng, Jianhua Han, Ying Li,\n  Songcen Xu, Hang Xu","title":"Any-Size-Diffusion: Toward Efficient Text-Driven Synthesis for Any-Size\n  HD Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stable diffusion, a generative model used in text-to-image synthesis,\nfrequently encounters resolution-induced composition problems when generating\nimages of varying sizes. This issue primarily stems from the model being\ntrained on pairs of single-scale images and their corresponding text\ndescriptions. Moreover, direct training on images of unlimited sizes is\nunfeasible, as it would require an immense number of text-image pairs and\nentail substantial computational expenses. To overcome these challenges, we\npropose a two-stage pipeline named Any-Size-Diffusion (ASD), designed to\nefficiently generate well-composed images of any size, while minimizing the\nneed for high-memory GPU resources. Specifically, the initial stage, dubbed Any\nRatio Adaptability Diffusion (ARAD), leverages a selected set of images with a\nrestricted range of ratios to optimize the text-conditional diffusion model,\nthereby improving its ability to adjust composition to accommodate diverse\nimage sizes. To support the creation of images at any desired size, we further\nintroduce a technique called Fast Seamless Tiled Diffusion (FSTD) at the\nsubsequent stage. This method allows for the rapid enlargement of the ASD\noutput to any high-resolution size, avoiding seaming artifacts or memory\noverloads. Experimental results on the LAION-COCO and MM-CelebA-HQ benchmarks\ndemonstrate that ASD can produce well-structured images of arbitrary sizes,\ncutting down the inference time by 2x compared to the traditional tiled\nalgorithm.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:27:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zheng","Qingping",""],["Guo","Yuanfan",""],["Deng","Jiankang",""],["Han","Jianhua",""],["Li","Ying",""],["Xu","Songcen",""],["Xu","Hang",""]]}
{"id":"2308.16583","submitter":"Jean-Emile Bourgine","authors":"Jean-Emile Bourgine, Alexandr Garbali","title":"A $(q,t)$deformation of the 2d Toda integrable hierarchy","comments":"52 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph hep-th math.MP math.QA nlin.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A $(q,t)$-deformation of the 2d Toda integrable hierarchy is introduced by\nenhancing the underlying symmetry algebra $\\mathfrak{gl}(\\infty)\\simeq\n\\text{q-W}_{1+\\infty}$ to the quantum toroidal $\\mathfrak{gl}(1)$ algebra. The\ndifference-differential equations of the hierarchy are obtained from the\nexpansion of $(q,t)$-bilinear identities, and two equations refining the 2d\nToda equation are found in this way. The derivation of the bilinear identities\nfollows from the isomorphism between the Fock representation of level $(2,0)$\nof the quantum toroidal $\\mathfrak{gl}(1)$ algebra and the tensor product of\nthe q-deformed Virasoro algebra with a $u(1)$ Heisenberg algebra. It leads to\nidentify the $(q,t)$-deformed Casimir with the screening charges of the\ndeformed Virasoro algebra. Due to the non-trivial coproduct, equations of the\nhierarchy no longer involve a single tau-function, but instead relate a set of\ndifferent tau functions. We then define the universal refined tau function\nusing the $L$-matrix of the quantum toroidal $\\mathfrak{gl}(1)$ algebra and\ninterpret it as the generating function of the deformed tau functions. The\nequations of the hierarchy, written in terms of the universal refined tau\nfunction, combine into two-term quadratic equations similar to the $RLL$\nequations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:28:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bourgine","Jean-Emile",""],["Garbali","Alexandr",""]]}
{"id":"2308.16584","submitter":"Zhongtao Jiang","authors":"Zhongtao Jiang, Yuanzhe Zhang, Yiming Ju, and Kang Liu","title":"Unsupervised Text Style Transfer with Deep Generative Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a general framework for unsupervised text style transfer with deep\ngenerative models. The framework models each sentence-label pair in the\nnon-parallel corpus as partially observed from a complete quadruplet which\nadditionally contains two latent codes representing the content and style,\nrespectively. These codes are learned by exploiting dependencies inside the\nobserved data. Then a sentence is transferred by manipulating them. Our\nframework is able to unify previous embedding and prototype methods as two\nspecial forms. It also provides a principled perspective to explain previously\nproposed techniques in the field such as aligned encoder and adversarial\ntraining. We further conduct experiments on three benchmarks. Both automatic\nand human evaluation results show that our methods achieve better or\ncompetitive results compared to several strong baselines.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:29:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jiang","Zhongtao",""],["Zhang","Yuanzhe",""],["Ju","Yiming",""],["Liu","Kang",""]]}
{"id":"2308.16585","submitter":"Saux Patrick","authors":"Patrick Saux (Scool, CRIStAL), Pierre Bauvin, Violeta Raverdy, Julien\n  Teigny (Scool), H\\'el\\`ene Verkindt, Tomy Soumphonphakdy (Scool), Maxence\n  Debert (Scool), Anne Jacobs, Daan Jacobs, Valerie Monpellier, Phong Ching\n  Lee, Chin Hong Lim, Johanna C Andersson-Assarsson, Lena Carlsson, Per-Arne\n  Svensson, Florence Galtier, Guelareh Dezfoulian, Mihaela Moldovanu, Severine\n  Andrieux, Julien Couster, Marie Lepage, Erminia Lembo, Ornella Verrastro,\n  Maud Robert, Paulina Salminen, Geltrude Mingrone, Ralph Peterli, Ricardo V\n  Cohen, Carlos Zerrweck, David Nocca, Carel W Le Roux, Robert Caiazzo,\n  Philippe Preux (Scool, CRIStAL), Fran\\c{c}ois Pattou","title":"Development and validation of an interpretable machine learning-based\n  calculator for predicting 5-year weight trajectories after bariatric surgery:\n  a multinational retrospective cohort SOPHIA study","comments":"The Lancet Digital Health, 2023","journal-ref":null,"doi":"10.1016/S2589-7500(23)00135-8","report-no":null,"categories":"cs.LG stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Background Weight loss trajectories after bariatric surgery vary widely\nbetween individuals, and predicting weight loss before the operation remains\nchallenging. We aimed to develop a model using machine learning to provide\nindividual preoperative prediction of 5-year weight loss trajectories after\nsurgery. Methods In this multinational retrospective observational study we\nenrolled adult participants (aged $\\ge$18 years) from ten prospective cohorts\n(including ABOS [NCT01129297], BAREVAL [NCT02310178], the Swedish Obese\nSubjects study, and a large cohort from the Dutch Obesity Clinic [Nederlandse\nObesitas Kliniek]) and two randomised trials (SleevePass [NCT00793143] and\nSM-BOSS [NCT00356213]) in Europe, the Americas, and Asia, with a 5 year\nfollowup after Roux-en-Y gastric bypass, sleeve gastrectomy, or gastric band.\nPatients with a previous history of bariatric surgery or large delays between\nscheduled and actual visits were excluded. The training cohort comprised\npatients from two centres in France (ABOS and BAREVAL). The primary outcome was\nBMI at 5 years. A model was developed using least absolute shrinkage and\nselection operator to select variables and the classification and regression\ntrees algorithm to build interpretable regression trees. The performances of\nthe model were assessed through the median absolute deviation (MAD) and root\nmean squared error (RMSE) of BMI. Findings10 231 patients from 12 centres in\nten countries were included in the analysis, corresponding to 30 602\npatient-years. Among participants in all 12 cohorts, 7701 (75$\\bullet$3%) were\nfemale, 2530 (24$\\bullet$7%) were male. Among 434 baseline attributes available\nin the training cohort, seven variables were selected: height, weight,\nintervention type, age, diabetes status, diabetes duration, and smoking status.\nAt 5 years, across external testing cohorts the overall mean MAD BMI was\n2$\\bullet$8 kg/m${}^2$ (95% CI 2$\\bullet$6-3$\\bullet$0) and mean RMSE BMI was\n4$\\bullet$7 kg/m${}^2$ (4$\\bullet$4-5$\\bullet$0), and the mean difference\nbetween predicted and observed BMI was-0$\\bullet$3 kg/m${}^2$ (SD 4$\\bullet$7).\nThis model is incorporated in an easy to use and interpretable web-based\nprediction tool to help inform clinical decision before surgery.\nInterpretationWe developed a machine learning-based model, which is\ninternationally validated, for predicting individual 5-year weight loss\ntrajectories after three common bariatric interventions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:30:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Saux","Patrick","","Scool, CRIStAL"],["Bauvin","Pierre","","Scool"],["Raverdy","Violeta","","Scool"],["Teigny","Julien","","Scool"],["Verkindt","H\u00e9l\u00e8ne","","Scool"],["Soumphonphakdy","Tomy","","Scool"],["Debert","Maxence","","Scool"],["Jacobs","Anne","","Scool, CRIStAL"],["Jacobs","Daan","","Scool, CRIStAL"],["Monpellier","Valerie","","Scool, CRIStAL"],["Lee","Phong Ching","","Scool, CRIStAL"],["Lim","Chin Hong","","Scool, CRIStAL"],["Andersson-Assarsson","Johanna C","","Scool, CRIStAL"],["Carlsson","Lena","","Scool, CRIStAL"],["Svensson","Per-Arne","","Scool, CRIStAL"],["Galtier","Florence","","Scool, CRIStAL"],["Dezfoulian","Guelareh","","Scool, CRIStAL"],["Moldovanu","Mihaela","","Scool, CRIStAL"],["Andrieux","Severine","","Scool, CRIStAL"],["Couster","Julien","","Scool, CRIStAL"],["Lepage","Marie","","Scool, CRIStAL"],["Lembo","Erminia","","Scool, CRIStAL"],["Verrastro","Ornella","","Scool, CRIStAL"],["Robert","Maud","","Scool, CRIStAL"],["Salminen","Paulina","","Scool, CRIStAL"],["Mingrone","Geltrude","","Scool, CRIStAL"],["Peterli","Ralph","","Scool, CRIStAL"],["Cohen","Ricardo V","","Scool, CRIStAL"],["Zerrweck","Carlos","","Scool, CRIStAL"],["Nocca","David","","Scool, CRIStAL"],["Roux","Carel W Le","","Scool, CRIStAL"],["Caiazzo","Robert","","Scool, CRIStAL"],["Preux","Philippe","","Scool, CRIStAL"],["Pattou","Fran\u00e7ois",""]]}
{"id":"2308.16586","submitter":"Xunzhu Tang","authors":"Xunzhu Tang and Haoye Tian and Zhenghan Chen and Weiguo Pian and Saad\n  Ezzini and Abdoul Kader Kabore and Andrew Habib and Jacques Klein and\n  Tegawende F. Bissyande","title":"Learning to Represent Patches","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Patch representation is crucial in automating various software engineering\ntasks, like determining patch accuracy or summarizing code changes. While\nrecent research has employed deep learning for patch representation, focusing\non token sequences or Abstract Syntax Trees (ASTs), they often miss the\nchange's semantic intent and the context of modified lines. To bridge this gap,\nwe introduce a novel method, Patcherizer. It delves into the intentions of\ncontext and structure, merging the surrounding code context with two innovative\nrepresentations. These capture the intention in code changes and the intention\nin AST structural modifications pre and post-patch. This holistic\nrepresentation aptly captures a patch's underlying intentions. Patcherizer\nemploys graph convolutional neural networks for structural intention graph\nrepresentation and transformers for intention sequence representation. We\nevaluated Patcherizer's embeddings' versatility in three areas: (1) Patch\ndescription generation, (2) Patch accuracy prediction, and (3) Patch intention\nidentification. Our experiments demonstrate the representation's efficacy\nacross all tasks, outperforming state-of-the-art methods. For example, in patch\ndescription generation, Patcherizer excels, showing an average boost of 19.39%\nin BLEU, 8.71% in ROUGE-L, and 34.03% in METEOR scores.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:34:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tang","Xunzhu",""],["Tian","Haoye",""],["Chen","Zhenghan",""],["Pian","Weiguo",""],["Ezzini","Saad",""],["Kabore","Abdoul Kader",""],["Habib","Andrew",""],["Klein","Jacques",""],["Bissyande","Tegawende F.",""]]}
{"id":"2308.16587","submitter":"Rasmus Larsen","authors":"Alexei Bazavov, Daniel Hoying, Olaf Kaczmarek, Rasmus N. Larsen,\n  Swagato Mukherjee, Peter Petreczky, Alexander Rothkopf, Johannes Heinrich\n  Weber","title":"Un-screened forces in Quark-Gluon Plasma?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the correlator of temporal Wilson lines at non-zero temperature in\n2+1 flavor lattice QCD with the aim to define the heavy quark-antiquark\npotential at non-zero temperature. For temperatures $153~{\\rm MeV} \\leq T \\leq\n352~{\\rm MeV}$ the spectral representation of this correlator is consistent\nwith a broadened peak in the spectral function, position or width of which then\ndefines the real or imaginary parts of the heavy quark-antiquark potential at\nnon-zero temperature, respectively. We find that the real part of the potential\nis not screened contrary to the widely-held expectations. We comment on how\nthis fact may modify the picture of quarkonium melting in the quark-gluon\nplasma.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:35:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bazavov","Alexei",""],["Hoying","Daniel",""],["Kaczmarek","Olaf",""],["Larsen","Rasmus N.",""],["Mukherjee","Swagato",""],["Petreczky","Peter",""],["Rothkopf","Alexander",""],["Weber","Johannes Heinrich",""]]}
{"id":"2308.16588","submitter":"Zhongtao Jiang","authors":"Zhongtao Jiang, Yuanzhe Zhang, Cao Liu, Jiansong Chen, Jun Zhao, Kang\n  Liu","title":"Interpreting Sentiment Composition with Latent Semantic Tree","comments":"Findings of ACL2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the key to sentiment analysis, sentiment composition considers the\nclassification of a constituent via classifications of its contained\nsub-constituents and rules operated on them. Such compositionality has been\nwidely studied previously in the form of hierarchical trees including untagged\nand sentiment ones, which are intrinsically suboptimal in our view. To address\nthis, we propose semantic tree, a new tree form capable of interpreting the\nsentiment composition in a principled way. Semantic tree is a derivation of a\ncontext-free grammar (CFG) describing the specific composition rules on\ndifference semantic roles, which is designed carefully following previous\nlinguistic conclusions. However, semantic tree is a latent variable since there\nis no its annotation in regular datasets. Thus, in our method, it is\nmarginalized out via inside algorithm and learned to optimize the\nclassification performance. Quantitative and qualitative results demonstrate\nthat our method not only achieves better or competitive results compared to\nbaselines in the setting of regular and domain adaptation classification, and\nalso generates plausible tree explanations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:35:52 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jiang","Zhongtao",""],["Zhang","Yuanzhe",""],["Liu","Cao",""],["Chen","Jiansong",""],["Zhao","Jun",""],["Liu","Kang",""]]}
{"id":"2308.16589","submitter":"Sean Collins","authors":"Sang T. Pham, Natalia Koniuch, Emily Wynne, Andy Brown, Sean M.\n  Collins","title":"Microscopic crystallographic analysis of dislocations in molecular\n  crystals","comments":"Manuscript (14 pages, 4 figures) and Supplementary Material (32\n  pages, 19 figures) in a single PDF file","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":"  Organic molecular crystals encompass a vast range of materials from\npharmaceuticals to organic optoelectronics and proteins to waxes in biological\nand industrial settings. Crystal defects from grain boundaries to dislocations\nare known to play key roles in mechanisms of growth and also in the functional\nproperties of molecular crystals. In contrast to the precise analysis of\nindividual defects in metals, ceramics, and inorganic semiconductors enabled by\nelectron microscopy, significantly greater ambiguity remains in the\nexperimental determination of individual dislocation character and slip systems\nin molecular materials. In large part, nanoscale dislocation analysis in\nmolecular crystals has been hindered by the severely constrained electron\nexposures required to avoid irreversibly degrading these crystals. Here, we\npresent a low-dose, single-exposure approach enabling nanometre-resolved\nanalysis of individual extended dislocations in molecular crystals. We\ndemonstrate the approach for a range of crystal types to reveal dislocation\ncharacter and operative slip systems unambiguously.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:36:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pham","Sang T.",""],["Koniuch","Natalia",""],["Wynne","Emily",""],["Brown","Andy",""],["Collins","Sean M.",""]]}
{"id":"2308.16590","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Measurements of long-range two-particle correlation over a wide\n  pseudorapidity range in p$-$Pb collisions at $\\sqrt{s_{\\rm NN}}=5.0$ TeV","comments":"27 pages, 11 captioned figures, 2 tables, authors from page 21,\n  submitted to JHEP, figures at http://alice-publications.web.cern.ch/node/9604","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-196","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Correlations in azimuthal angle extending over a long range in pseudorapidity\nbetween particles, usually called the \"ridge\" phenomenon, were discovered in\nheavy-ion collisions, and later found in pp and p$-$Pb collisions. In large\nsystems, they are thought to arise from the expansion (collective flow) of the\nproduced particles. Extending these measurements over a wider range in\npseudorapidity and final-state particle multiplicity is important to understand\nbetter the origin of these long-range correlations in small-collision systems.\nIn this Letter, measurements of the long-range correlations in p$-$Pb\ncollisions at $\\sqrt{s_{\\rm NN}} = 5.02$ TeV are extended to a pseudorapidity\ngap of $\\Delta\\eta \\sim 8$ between particles using the ALICE, forward\nmultiplicity detectors. After suppressing non-flow correlations, e.g., from jet\nand resonance decays, the ridge structure is observed to persist up to a very\nlarge gap of $\\Delta\\eta \\sim 8$ for the first time in p$-$Pb collisions. This\nshows that the collective flow-like correlations extend over an extensive\npseudorapidity range also in small-collision systems such as p$-$Pb collisions.\nThe pseudorapidity dependence of the second-order anisotropic flow coefficient,\nv2({\\eta}), is extracted from the long-range correlations. The $v_{2}(\\eta)$\nresults are presented for a wide pseudorapidity range of $-3.1 < \\eta < 4.8$ in\nvarious centrality classes in p$-$Pb collisions. To gain a comprehensive\nunderstanding of the source of anisotropic flow in small-collision systems, the\n$v_{2}(\\eta)$ measurements are compared to hydrodynamic and transport model\ncalculations. The comparison suggests that the final-state interactions play a\ndominant role in developing the anisotropic flow in small-collision systems.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:39:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16591","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Multiplicity and event-scale dependent flow and jet fragmentation in pp\n  collisions at $\\sqrt{s}$ = 13 TeV and in p$-$Pb collisions at\n  $\\sqrt{s_\\mathrm{NN}}$ = 5.02 TeV","comments":"31 pages, 7 captioned figures, 2 tables, authors from page 25,\n  submitted to JHEP, figures at http://alice-publications.web.cern.ch/node/9602","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-195","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Long- and short-range correlations for pairs of charged particles are studied\nvia two-particle angular correlations in pp collisions at $\\sqrt{s}=13$ TeV and\np$-$Pb collisions at $\\sqrt{s_\\mathrm{NN}} = 5.02$ TeV. The correlation\nfunctions are measured as a function of relative azimuthal angle\n$\\Delta\\varphi$ and pseudorapidity separation $\\Delta\\eta$ for pairs of primary\ncharged particles within the pseudorapidity interval $|\\eta| < 0.9$ and the\ntransverse-momentum interval $1 < p_{\\rm T} < 4$ GeV/$c$. Flow coefficients are\nextracted for the long-range correlations ($1.6 < |\\Delta\\eta| <1.8$) in\nvarious high-multiplicity event classes using the low-multiplicity template fit\nmethod. The method is used to subtract the enhanced yield of away-side jet\nfragments in high-multiplicity events. These results show decreasing flow\nsignals toward lower multiplicity events. Furthermore, the flow coefficients\nfor events with hard probes, such as jets or leading particles, do not exhibit\nany significant changes compared to those obtained from high-multiplicity\nevents without any specific event selection criteria. The results are compared\nwith hydrodynamic-model calculations, and it is found that a better\nunderstanding of the initial conditions is necessary to describe the results,\nparticularly for low-multiplicity events.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:46:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16592","submitter":"Martin Bowen","authors":"Mathieu Lamblin, Bhavishya Chowrira, Victor Da Costa, Bertrand Vileno,\n  Loic Joly, Samy Boukari, Wolfgang Weber, Romain Bernard, Benoit Gobaut,\n  Michel Hehn, Daniel Lacour, Martin Bowen","title":"Encoding information onto the charge and spin state of a paramagnetic\n  atom using MgO tunnelling spintronics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An electrical current that flows across individual atoms or molecules can\ngenerate exotic quantum-based behavior, from memristive effects to Coulomb\nblockade and the promotion of quantum excited states. These fundamental effects\ntypically appear one at a time in model junctions built using atomic tip or\nlateral techniques. So far, however, a viable industrial pathway for such\ndiscrete state devices has been lacking. Here, we demonstrate that a\ncommercialized device platform can serve as this industrial pathway for quantum\ntechnologies. We have studied magnetic tunnel junctions with a MgO barrier\ncontaining C atoms. The paramagnetic localized electrons due to individual C\natoms generate parallel nanotransport paths across the micronic device as\ndeduced from magnetotransport experiments. Coulomb blockade effects linked to\ntunnelling magnetoresistance peaks can be electrically controlled, leading to a\npersistent memory effect. Our results position MgO tunneling spintronics as a\npromising platform to industrially implement quantum technologies.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:49:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lamblin","Mathieu",""],["Chowrira","Bhavishya",""],["Da Costa","Victor",""],["Vileno","Bertrand",""],["Joly","Loic",""],["Boukari","Samy",""],["Weber","Wolfgang",""],["Bernard","Romain",""],["Gobaut","Benoit",""],["Hehn","Michel",""],["Lacour","Daniel",""],["Bowen","Martin",""]]}
{"id":"2308.16593","submitter":"Weiqin Li","authors":"Weiqin Li, Shun Lei, Qiaochu Huang, Yixuan Zhou, Zhiyong Wu, Shiyin\n  Kang, Helen Meng","title":"Towards Spontaneous Style Modeling with Semi-supervised Pre-training for\n  Conversational Text-to-Speech Synthesis","comments":"Accepted by INTERSPEECH 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL cs.LG eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spontaneous behavior that often occurs in conversations makes speech more\nhuman-like compared to reading-style. However, synthesizing spontaneous-style\nspeech is challenging due to the lack of high-quality spontaneous datasets and\nthe high cost of labeling spontaneous behavior. In this paper, we propose a\nsemi-supervised pre-training method to increase the amount of spontaneous-style\nspeech and spontaneous behavioral labels. In the process of semi-supervised\nlearning, both text and speech information are considered for detecting\nspontaneous behaviors labels in speech. Moreover, a linguistic-aware encoder is\nused to model the relationship between each sentence in the conversation.\nExperimental results indicate that our proposed method achieves superior\nexpressive speech synthesis performance with the ability to model spontaneous\nbehavior in spontaneous-style speech and predict reasonable spontaneous\nbehavior from text.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:50:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Weiqin",""],["Lei","Shun",""],["Huang","Qiaochu",""],["Zhou","Yixuan",""],["Wu","Zhiyong",""],["Kang","Shiyin",""],["Meng","Helen",""]]}
{"id":"2308.16594","submitter":"Jan Horak","authors":"Kenji Fukushima, Jan Horak, Jan M. Pawlowski, Nicolas Wink, Carl\n  Philipp Zelle","title":"The nuclear liquid-gas transition in QCD","comments":"13 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We estimate the nuclear saturation density and the binding energy in a\nnuclear liquid from precision data on the coupling of the four-quark scattering\nvertex in the vector channel, computed within functional QCD. We show that this\ncoupling is directly related to the density-density potential and the latter is\nused for the estimates. In a first qualitative computation we find a saturation\ndensity of 0.2 fm${}^{-3}$ and an upper bound for the binding energy of 21.5\nMeV, in agreement with the empirical values of 0.16 fm${}^{-3}$ and 16 MeV,\nrespectively. We also use the scattering vertex for constructing an emergent\nlow-energy effective theory for the liquid gas transition from QCD correlation\nfunction, whose coupling parameters can be determined within QCD. As a first\nconsistency check of this construction we estimate the in-medium reduction of\nthe nucleon pole mass.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:51:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fukushima","Kenji",""],["Horak","Jan",""],["Pawlowski","Jan M.",""],["Wink","Nicolas",""],["Zelle","Carl Philipp",""]]}
{"id":"2308.16595","submitter":"Gerrit Vos","authors":"Gerrit Vos","title":"Transference of multilinear Fourier and Schur multipliers acting on\n  non-commutative $L_p$-spaces for non-unimodular groups","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In arXiv:2206.00549, transference results between multilinear Fourier and\nSchur multipliers on noncommutative $L_p$-spaces were shown for unimodular\ngroups. We propose a suitable extension of the definition of multilinear\nFourier multipliers for non-unimodular groups, and show that the aforementioned\ntransference results also hold in this more general setting.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:56:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vos","Gerrit",""]]}
{"id":"2308.16596","submitter":"Victor Qu\\'etu","authors":"Victor Qu\\'etu and Marta Milovanovi\\'c","title":"The Quest of Finding the Antidote to Sparse Double Descent","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In energy-efficient schemes, finding the optimal size of deep learning models\nis very important and has a broad impact. Meanwhile, recent studies have\nreported an unexpected phenomenon, the sparse double descent: as the model's\nsparsity increases, the performance first worsens, then improves, and finally\ndeteriorates. Such a non-monotonic behavior raises serious questions about the\noptimal model's size to maintain high performance: the model needs to be\nsufficiently over-parametrized, but having too many parameters wastes training\nresources.\n  In this paper, we aim to find the best trade-off efficiently. More precisely,\nwe tackle the occurrence of the sparse double descent and present some\nsolutions to avoid it. Firstly, we show that a simple $\\ell_2$ regularization\nmethod can help to mitigate this phenomenon but sacrifices the\nperformance/sparsity compromise. To overcome this problem, we then introduce a\nlearning scheme in which distilling knowledge regularizes the student model.\nSupported by experimental results achieved using typical image classification\nsetups, we show that this approach leads to the avoidance of such a phenomenon.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:56:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Qu\u00e9tu","Victor",""],["Milovanovi\u0107","Marta",""]]}
{"id":"2308.16597","submitter":"Ao Xu","authors":"Ao Xu and Bo-Tao Li","title":"Particle-resolved thermal lattice Boltzmann simulation using OpenACC on\n  multi-GPUs","comments":"45 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We utilize the Open Accelerator (OpenACC) approach for graphics processing\nunit (GPU) accelerated particle-resolved thermal lattice Boltzmann (LB)\nsimulation. We adopt the momentum-exchange method to calculate fluid-particle\ninteractions to preserve the simplicity of the LB method. To address load\nimbalance issues, we extend the indirect addressing method to collect\nfluid-particle link information at each timestep and store indices of\nfluid-particle link in a fixed index array. We simulate the sedimentation of\n4,800 hot particles in cold fluids with a domain size of $4000^{2}$, and the\nsimulation achieves 1750 million lattice updates per second (MLUPS) on a single\nGPU. Furthermore, we implement a hybrid OpenACC and message passing interface\n(MPI) approach for multi-GPU accelerated simulation. This approach incorporates\nfour optimization strategies, including building domain lists, utilizing\nrequest-answer communication, overlapping communications with computations, and\nexecuting computation tasks concurrently. By reducing data communication\nbetween GPUs, hiding communication latency through overlapping computation, and\nincreasing the utilization of GPU resources, we achieve improved performance,\nreaching 10846 MLUPS using 8 GPUs. Our results demonstrate that the\nOpenACC-based GPU acceleration is promising for particle-resolved thermal\nlattice Boltzmann simulation.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:57:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xu","Ao",""],["Li","Bo-Tao",""]]}
{"id":"2308.16598","submitter":"Mohammad Hamghalam","authors":"Ramtin Mojtahedi, Mohammad Hamghalam, Richard K. G. Do, and Amber L.\n  Simpson","title":"Towards Optimal Patch Size in Vision Transformers for Tumor Segmentation","comments":null,"journal-ref":"Multiscale Multimodal Medical Imaging. MMMI 2022. Lecture Notes in\n  Computer Science, vol 13594. Springer, Cham","doi":"10.1007/978-3-031-18814-5_11","report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Detection of tumors in metastatic colorectal cancer (mCRC) plays an essential\nrole in the early diagnosis and treatment of liver cancer. Deep learning models\nbackboned by fully convolutional neural networks (FCNNs) have become the\ndominant model for segmenting 3D computerized tomography (CT) scans. However,\nsince their convolution layers suffer from limited kernel size, they are not\nable to capture long-range dependencies and global context. To tackle this\nrestriction, vision transformers have been introduced to solve FCNN's locality\nof receptive fields. Although transformers can capture long-range features,\ntheir segmentation performance decreases with various tumor sizes due to the\nmodel sensitivity to the input patch size. While finding an optimal patch size\nimproves the performance of vision transformer-based models on segmentation\ntasks, it is a time-consuming and challenging procedure. This paper proposes a\ntechnique to select the vision transformer's optimal input multi-resolution\nimage patch size based on the average volume size of metastasis lesions. We\nfurther validated our suggested framework using a transfer-learning technique,\ndemonstrating that the highest Dice similarity coefficient (DSC) performance\nwas obtained by pre-training on training data with a larger tumour volume using\nthe suggested ideal patch size and then training with a smaller one. We\nexperimentally evaluate this idea through pre-training our model on a\nmulti-resolution public dataset. Our model showed consistent and improved\nresults when applied to our private multi-resolution mCRC dataset with a\nsmaller average tumor volume. This study lays the groundwork for optimizing\nsemantic segmentation of small objects using vision transformers. The\nimplementation source code is available\nat:https://github.com/Ramtin-Mojtahedi/OVTPS.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:57:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mojtahedi","Ramtin",""],["Hamghalam","Mohammad",""],["Do","Richard K. G.",""],["Simpson","Amber L.",""]]}
{"id":"2308.16599","submitter":"Felix Wagner","authors":"Felix Wagner and Florian Nachtigall and Lukas Franken and Nikola\n  Milojevic-Dupont and Rafael H.M. Pereira and Nicolas Koch and Jakob Runge and\n  Marta Gonzalez and Felix Creutzig","title":"A Causal Discovery Approach To Learn How Urban Form Shapes Sustainable\n  Mobility Across Continents","comments":"22 pages, 13 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.soc-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Global sustainability requires low-carbon urban transport systems, shaped by\nadequate infrastructure, deployment of low-carbon transport modes and shifts in\ntravel behavior. To adequately implement alterations in infrastructure, it's\nessential to grasp the location-specific cause-and-effect mechanisms that the\nconstructed environment has on travel. Yet, current research falls short in\nrepresenting causal relationships between the 6D urban form variables and\ntravel, generalizing across different regions, and modeling urban form effects\nat high spatial resolution. Here, we address all three gaps by utilizing a\ncausal discovery and an explainable machine learning framework to detect urban\nform effects on intra-city travel based on high-resolution mobility data of six\ncities across three continents. We show that both distance to city center,\ndemographics and density indirectly affect other urban form features. By\nconsidering the causal relationships, we find that location-specific influences\nalign across cities, yet vary in magnitude. In addition, the spread of the city\nand the coverage of jobs across the city are the strongest determinants of\ntravel-related emissions, highlighting the benefits of compact development and\nassociated benefits. Differences in urban form effects across the cities call\nfor a more holistic definition of 6D measures. Our work is a starting point for\nlocation-specific analysis of urban form effects on mobility behavior using\ncausal discovery approaches, which is highly relevant for city planners and\nmunicipalities across continents.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:57:52 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wagner","Felix",""],["Nachtigall","Florian",""],["Franken","Lukas",""],["Milojevic-Dupont","Nikola",""],["Pereira","Rafael H. M.",""],["Koch","Nicolas",""],["Runge","Jakob",""],["Gonzalez","Marta",""],["Creutzig","Felix",""]]}
{"id":"2308.16600","submitter":"Alexandre Rapetti","authors":"Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff and\n  Alexandre Rapetti","title":"The Synchronization Power of Auditable Registers","comments":"28 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Auditability allows to track all the read operations performed on a register.\nIt abstracts the need of data owners to control access to their data, tracking\nwho read which information. This work considers possible formalizations of\nauditing and their ramification for the possibility of providing it.\n  The natural definition is to require a linearization of all write, read and\naudit operations together (atomic auditing). The paper shows that atomic\nauditing is a powerful tool, as it can be used to solve consensus. The number\nof processes that can solve consensus using atomic audit depends on the number\nof processes that can read or audit the register. If there is a single reader\nor a single auditor (the writer), then consensus can be solved among two\nprocesses. If multiple readers and auditors are possible, then consensus can be\nsolved among the same number of processes. This means that strong\nsynchronization primitives are needed to support atomic auditing.\n  We give implementations of atomic audit when there are either multiple\nreaders or multiple auditors (but not both) using primitives with consensus\nnumber 2 (swap and fetch&add). When there are multiple readers and multiple\nauditors, the implementation uses compare&swap.\n  These findings motivate a weaker definition, in which audit operations are\nnot linearized together with the write and read operations (regular auditing).\nWe prove that regular auditing can be implemented from ordinary reads and\nwrites on atomic registers.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:58:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Attiya","Hagit",""],["Del Pozzo","Antonella",""],["Milani","Alessia",""],["Pavloff","Ulysse",""],["Rapetti","Alexandre",""]]}
{"id":"2308.16601","submitter":"Franz Wei{\\ss}er","authors":"Franz Wei{\\ss}er, Nurettin Turan, Dominik Semmler, Wolfgang Utschick","title":"Data-Aided Channel Estimation Utilizing Gaussian Mixture Models","comments":"Submitted to IEEE for possible publication","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 propose two methods that utilize data symbols in addition to\npilot symbols for improved channel estimation quality in a multi-user system,\nso-called semi-blind channel estimation. To this end, a subspace is estimated\nbased on all received symbols and utilized to improve the estimation quality of\na Gaussian mixture model-based channel estimator, which solely uses pilot\nsymbols for channel estimation. Both of the proposed approaches allow for\nparallelization. Even the precomputation of estimation filters, which is\nbeneficial in terms of computational complexity, is enabled by one of the\nproposed methods. Numerical simulations for real channel measurement data\navailable to us show that the proposed methods outperform the studied\nstate-of-the-art channel estimators.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 09:59:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wei\u00dfer","Franz",""],["Turan","Nurettin",""],["Semmler","Dominik",""],["Utschick","Wolfgang",""]]}
{"id":"2308.16602","submitter":"Nesreen Mufid","authors":"Nesreen Mufid","title":"Design Challenges for the Implementation of Smart Homes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR eess.SP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Home automation for many years had faced challenges that limit its spreading\naround the world. These challenges caused by the high cost of Own such a home,\ninflexibility system (cannot be monitored outside the home) and issues to\nachieve optimal security. Our main objective is to design and implement a smart\nhome model that is simple, affordable to the users. The proposed system provide\nflexibility to monitor the home, using the reliable cellular network. The user\nwill be able what is inside the home when he /she is away from home. In\naddition to that, our model overcome the issue of the security by providing\ndifferent sensors that detects smoke, gas, leakage of water and incases of\nburglary. Moreover, a camera will be available in the home to give a full view\nfor the user when he/she is outside the home. The user will be informed by an\napplication on his/she phone incase if there is a fire, water leakage and if\nsomeone break into the house. This will give the user a chance to take an\naction if such cases happened. Furthermore, the user can monitor the lighting\nsystem of the home, by giving the user a chance to turn the lights on and off\nremotely.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:03:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mufid","Nesreen",""]]}
{"id":"2308.16603","submitter":"Mumtaz Hussain","authors":"Gerardo Gonz\\'alez Robert, Mumtaz Hussain, Nikita Shulga, and Benjamin\n  Ward","title":"Weighted approximation for limsup sets","comments":"73 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.DS math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Theorems of Khintchine, Groshev, Jarn\\'ik, and Besicovitch in Diophantine\napproximation are fundamental results on the metric properties of $\\Psi$-well\napproximable sets. These foundational results have since been generalised to\nthe framework of weighted Diophantine approximation for systems of real linear\nforms (matrices). In this article, we prove analogues of these weighted results\nin a range of settings including the $p$-adics (Theorems 7 and 8), complex\nnumbers (Theorems 9 and 10), quaternions (Theorems 11 and 12), and formal power\nseries (Theorems 13 and 14). We also consider approximation by uniformly\ndistributed sequences. Under some assumptions on the approximation functions,\nwe prove a 0-1 dichotomy law (Theorem 15). We obtain divergence results for any\napproximation function under some natural restrictions on the discrepancy\n(Theorems 16, 17, and 19).\n  The key tools in proving the main parts of these results are the weighted\nubiquitous systems and weighted mass transference principle introduced recently\nby Kleinbock and Wang [Adv. Math. 428 (2023), Paper No. 109154], and Wang and\nWu [Math. Ann. 381 (2021), no. 1-2, 243--317] respectively.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:04:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Robert","Gerardo Gonz\u00e1lez",""],["Hussain","Mumtaz",""],["Shulga","Nikita",""],["Ward","Benjamin",""]]}
{"id":"2308.16604","submitter":"Surajit Kalita","authors":"Surajit Kalita, Shruti Bhatporia, Amanda Weltman","title":"Gravitational Lensing in Modified Gravity: A case study for Fast Radio\n  Bursts","comments":"8 pages with 4 figures; comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over the last few decades, a plethora of modifications to general relativity\nhave been proposed to solve a host of cosmological and astrophysical problems.\nMany modified gravity models are now ruled out with further astrophysical\nobservations; some theories are still viable, with, at best, bounds on their\nparameters set by observations to date. More recently, observations of Fast\nRadio Bursts have proven to be remarkably powerful tools to constrain cosmology\nand fundamental physics. In this work, we consider a generic modified gravity\ntheory and consider the implications for gravitational lensing with Fast Radio\nBursts. We use a set of Fast Radio Burst observations to constrain the fraction\nof dark matter made up of primordial black holes in such a theory. We further\nshow that modified gravity adds a screening effect on gravitational lensing\nsimilar to the case when there is plasma in the path of the light ray acting as\na scattering screen.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:06:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kalita","Surajit",""],["Bhatporia","Shruti",""],["Weltman","Amanda",""]]}
{"id":"2308.16605","submitter":"William Pearson","authors":"W. J. Pearson, F. Pistis, M. Figueira, K. Ma{\\l}ek, T. Moutard, D.\n  Vergani, A. Pollo","title":"Influence of star-forming galaxy selection on the galaxy main sequence","comments":"20 pages, 3 appendices, 14 figures, 5 tables, accepted for\n  publication in Astronomy & Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work aims to determine how the galaxy main sequence (MS) changes using\nseven different commonly used methods to select the star-forming galaxies\nwithin VIPERS data over $0.5 \\leq z < 1.2$. The form and redshift evolution of\nthe MS will then be compared between selection methods. The star-forming\ngalaxies were selected using widely known methods: a specific star-formation\nrate (sSFR), Baldwin, Phillips and Terlevich (BPT) diagram, 4000\\AA\\ spectral\nbreak (D4000) cut and four colour-colour cuts: NUVrJ, NUVrK, u-r, and UVJ. The\nmain sequences were then fitted for each of the seven selection methods using a\nMarkov chain Monte Carlo forward modelling routine, fitting both a linear main\nsequence and a MS with a high-mass turn-over to the star-forming galaxies. This\nwas done in four redshift bins of $0.50 \\leq z < 0.62$, $0.62 \\leq z < 0.72$,\n$0.72 \\leq z < 0.85$, and $0.85 \\leq z < 1.20$. The slopes of all star-forming\nsamples were found to either remain constant or increase with redshift, and the\nscatters were approximately constant. There is no clear redshift dependency of\nthe presence of a high-mass turn-over for the majority of samples, with the\nNUVrJ and NUVrK being the only samples with turn-overs only at low redshift. No\nsamples have turn-overs at all redshifts. Star-forming galaxies selected with\nsSFR and u-r are the only samples to have no high-mass turn-over in all\nredshift bins. The normalisation of the MS increases with redshift, as\nexpected. The scatter around the MS is lower than the $\\approx$0.3~dex\ntypically seen in MS studies for all seven samples. The lack, or presence, of a\nhigh-mass turn-over is at least partially a result of the method used to select\nstar-forming galaxies. However, whether a turn-over should be present or not is\nunclear.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:07:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pearson","W. J.",""],["Pistis","F.",""],["Figueira","M.",""],["Ma\u0142ek","K.",""],["Moutard","T.",""],["Vergani","D.",""],["Pollo","A.",""]]}
{"id":"2308.16606","submitter":"Steven Boyd","authors":"K. Abe, N. Akhlaq, R. Akutsu, A. Ali, S. Alonso Monsalve, C. Alt, C.\n  Andreopoulos, M. Antonova, S. Aoki, T. Arihara, Y. Asada, Y. Ashida, E.T.\n  Atkin, M. Barbi, G.J. Barker, G. Barr, D. Barrow, M. Batkiewicz-Kwasniak, V.\n  Berardi, L. Berns, S. Bhadra, A. Blanchet, A. Blondel, S. Bolognesi, T.\n  Bonus, S. Bordoni, S.B. Boyd, A. Bravar, C. Bronner, S. Bron, A. Bubak, M.\n  Buizza Avanzini, J.A. Caballero, N.F. Calabria, S. Cao, D. Carabadjac, A.J.\n  Carter, S.L. Cartwright, M.P. Casado, M.G. Catanesi, A. Cervera, J. Chakrani,\n  D. Cherdack, P.S. Chong, G. Christodoulou, A. Chvirova, M. Cicerchia, J.\n  Coleman, G. Collazuol, L. Cook, A. Cudd, C. Dalmazzone, T. Daret, Yu.I.\n  Davydov, A. De Roeck, G. De Rosa, T. Dealtry, C.C. Delogu, C. Densham, A.\n  Dergacheva, F. Di Lodovico, S. Dolan, D. Douqa, T.A. Doyle, O. Drapier, J.\n  Dumarchez, P. Dunne, K. Dygnarowicz, A. Eguchi, S. Emery-Schrenk, G. Erofeev,\n  A. Ershova, G. Eurin, D. Fedorova, S. Fedotov, M. Feltre, A.J. Finch, G.A.\n  Fiorentini Aguirre, G. Fiorillo, M.D. Fitton, J.M. Franco Pati\\~no, M.\n  Friend, Y. Fujii, Y. Fukuda, Y. Furui, L. Giannessi, C. Giganti, V. Glagolev,\n  M. Gonin, J. Gonz\\'alez Rosa, E.A.G. Goodman, A. Gorin, M. Grassi, M. Guigue,\n  D.R. Hadley, J.T. Haigh, P. Hamacher-Baumann, D.A. Harris, M. Hartz, T.\n  Hasegawa, S. Hassani, N.C. Hastings, Y. Hayato, D. Henaff, M. Hogan, J.\n  Holeczek, A. Holin, T. Holvey, N.T. Hong Van, T. Honjo, A.K. Ichikawa, M.\n  Ikeda, T. Ishida, M. Ishitsuka, H.T. Israel, A. Izmaylov, M. Jakkapu, B.\n  Jamieson, S.J. Jenkins, C. Jes\\'us-Valls, J.J. Jiang, J.Y. Ji, P. Jonsson, S.\n  Joshi, C.K. Jung, P.B. Jurj, M. Kabirnezhad, A.C. Kaboth, T. Kajita, H.\n  Kakuno, J. Kameda, S.P. Kasetti, Y. Kataoka, T. Katori, M. Kawaue, E. Kearns,\n  M. Khabibullin, A. Khotjantsev, T. Kikawa, S. King, V. Kiseeva, J. Kisiel, H.\n  Kobayashi, T. Kobayashi, L. Koch, S. Kodama, A. Konaka, L.L. Kormos, Y.\n  Koshio, T. Koto, K. Kowalik, Y. Kudenko, Y. Kudo, S. Kuribayashi, R. Kurjata,\n  T. Kutter, M. Kuze, M. La Commara, L. Labarga, K. Lachner, J. Lagoda, S.M.\n  Lakshmi, M. Lamers James, M. Lamoureux, A. Langella, J.-F. Laporte, D. Last,\n  N. Latham, M. Laveder, L. Lavitola, M. Lawe, Y. Lee, C. Lin, S.-K. Lin, R.P.\n  Litchfield, S.L. Liu, W. Li, A. Longhin, K.R. Long, A. Lopez Moreno, L.\n  Ludovici, X. Lu, T. Lux, L.N. Machado, L. Magaletti, K. Mahn, M. Malek, M.\n  Mandal, S. Manly, A.D. Marino, L. Marti-Magro, D.G.R. Martin, M. Martini,\n  J.F. Martin, T. Maruyama, T. Matsubara, V. Matveev, C. Mauger, K.\n  Mavrokoridis, E. Mazzucato, N. McCauley, J. McElwee, K.S. McFarland, C.\n  McGrew, J. McKean, A. Mefodiev, G.D. Megias, P. Mehta, L. Mellet, C. Metelko,\n  M. Mezzetto, E. Miller, A. Minamino, O. Mineev, S. Mine, M. Miura, L. Molina\n  Bueno, S. Moriyama, S. Moriyama, P. Morrison, Th.A. Mueller, D. Munford, L.\n  Munteanu, K. Nagai, Y. Nagai, T. Nakadaira, K. Nakagiri, M. Nakahata, Y.\n  Nakajima, A. Nakamura, H. Nakamura, K. Nakamura, K.D. Nakamura, Y. Nakano, S.\n  Nakayama, T. Nakaya, K. Nakayoshi, C.E.R. Naseby, T.V. Ngoc, V.Q. Nguyen, K.\n  Niewczas, S. Nishimori, Y. Nishimura, K. Nishizaki, T. Nosek, F. Nova, P.\n  Novella, J.C. Nugent, H.M. O'Keeffe, L. O'Sullivan, T. Odagawa, W. Okinaga,\n  K. Okumura, T. Okusawa, N. Ospina, Y. Oyama, V. Palladino, V. Paolone, M.\n  Pari, J. Parlone, J. Pasternak, M. Pavin, D. Payne, G.C. Penn, D. Pershey, L.\n  Pickering, C. Pidcott, G. Pintaudi, C. Pistillo, B. Popov, K. Porwit, M.\n  Posiadala-Zezula, Y.S. Prabhu, F. Pupilli, B. Quilain, T. Radermacher, E.\n  Radicioni, B. Radics, M.A. Ram\\'irez, P.N. Ratoff, M. Reh, C. Riccio, E.\n  Rondio, S. Roth, N. Roy, A. Rubbia, A.C. Ruggeri, C.A. Ruggles, A. Rychter,\n  K. Sakashita, F. S\\'anchez, C.M. Schloesser, K. Scholberg, M. Scott, Y.\n  Seiya, T. Sekiguchi, H. Sekiya, D. Sgalaberna, A. Shaikhiev, F. Shaker, M.\n  Shiozawa, W. Shorrock, A. Shvartsman, N. Skrobova, K. Skwarczynski, D.\n  Smyczek, M. Smy, J.T. Sobczyk, H. Sobel, F.J.P. Soler, Y. Sonoda, A.J.\n  Speers, R. Spina, I.A. Suslov, S. Suvorov, A. Suzuki, S.Y. Suzuki, Y. Suzuki,\n  M. Tada, S. Tairafune, S. Takayasu, A. Takeda, Y. Takeuchi, K. Takifuji, H.K.\n  Tanaka, M. Tani, A. Teklu, V.V. Tereshchenko, N. Thamm, L.F. Thompson, W.\n  Toki, C. Touramanis, T. Towstego, K.M. Tsui, T. Tsukamoto, M. Tzanov, Y.\n  Uchida, M. Vagins, D. Vargas, M. Varghese, G. Vasseur, C. Vilela, E. Villa,\n  W.G.S. Vinning, U. Virginet, T. Vladisavljevic, T. Wachala, J.G. Walsh, Y.\n  Wang, L. Wan, D. Wark, M.O. Wascko, A. Weber, R. Wendell, M.J. Wilking, C.\n  Wilkinson, J.R. Wilson, K. Wood, C. Wret, J. Xia, Y.-h. Xu, K. Yamamoto, T.\n  Yamamoto, C. Yanagisawa, G. Yang, T. Yano, K. Yasutome, N. Yershov, U.\n  Yevarouskaya, M. Yokoyama, Y. Yoshimoto, N. Yoshimura, M. Yu, R. Zaki, A.\n  Zalewska, J. Zalipska, K. Zaremba, G. Zarnecki, X. Zhao, T. Zhu, M.\n  Ziembicki, E.D. Zimmerman, M. Zito, S. Zsoldos","title":"Measurements of the $\\nu_{\\mu}$ and $\\bar{\\nu}_{\\mu}$-induced Coherent\n  Charged Pion Production Cross Sections on $^{12}C$ by the T2K experiment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report an updated measurement of the $\\nu_{\\mu}$-induced, and the first\nmeasurement of the $\\bar{\\nu}_{\\mu}$-induced coherent charged pion production\ncross section on $^{12}C$ nuclei in the T2K experiment. This is measured in a\nrestricted region of the final-state phase space for which $p_{\\mu,\\pi} > 0.2$\nGeV, $\\cos(\\theta_{\\mu}) > 0.8$ and $\\cos(\\theta_{\\pi}) > 0.6$, and at a mean\n(anti)neutrino energy of 0.85 GeV using the T2K near detector. The measured\n$\\nu_{\\mu}$ CC coherent pion production flux-averaged cross section on $^{12}C$\nis $(2.98 \\pm 0.37 (stat.) \\pm 0.31 (syst.) \\substack{ +0.49 \\\\ -0.00 }\n\\mathrm{ (Q^2\\,model)}) \\times 10^{-40}~\\mathrm{cm}^{2}$. The new measurement\nof the $\\bar{\\nu}_{\\mu}$-induced cross section on $^{12}{C}$ is $(3.05 \\pm 0.71\n(stat.) \\pm 0.39 (syst.) \\substack{ +0.74 \\\\ -0.00 } \\mathrm{(Q^2\\,model)})\n\\times 10^{-40}~\\mathrm{cm}^{2}$. The results are compatible with both the NEUT\n5.4.0 Berger-Sehgal (2009) and GENIE 2.8.0 Rein-Sehgal (2007) model\npredictions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:07:54 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Abe","K.",""],["Akhlaq","N.",""],["Akutsu","R.",""],["Ali","A.",""],["Monsalve","S. Alonso",""],["Alt","C.",""],["Andreopoulos","C.",""],["Antonova","M.",""],["Aoki","S.",""],["Arihara","T.",""],["Asada","Y.",""],["Ashida","Y.",""],["Atkin","E. T.",""],["Barbi","M.",""],["Barker","G. J.",""],["Barr","G.",""],["Barrow","D.",""],["Batkiewicz-Kwasniak","M.",""],["Berardi","V.",""],["Berns","L.",""],["Bhadra","S.",""],["Blanchet","A.",""],["Blondel","A.",""],["Bolognesi","S.",""],["Bonus","T.",""],["Bordoni","S.",""],["Boyd","S. B.",""],["Bravar","A.",""],["Bronner","C.",""],["Bron","S.",""],["Bubak","A.",""],["Avanzini","M. Buizza",""],["Caballero","J. A.",""],["Calabria","N. F.",""],["Cao","S.",""],["Carabadjac","D.",""],["Carter","A. J.",""],["Cartwright","S. L.",""],["Casado","M. P.",""],["Catanesi","M. G.",""],["Cervera","A.",""],["Chakrani","J.",""],["Cherdack","D.",""],["Chong","P. S.",""],["Christodoulou","G.",""],["Chvirova","A.",""],["Cicerchia","M.",""],["Coleman","J.",""],["Collazuol","G.",""],["Cook","L.",""],["Cudd","A.",""],["Dalmazzone","C.",""],["Daret","T.",""],["Davydov","Yu. I.",""],["De Roeck","A.",""],["De Rosa","G.",""],["Dealtry","T.",""],["Delogu","C. C.",""],["Densham","C.",""],["Dergacheva","A.",""],["Di Lodovico","F.",""],["Dolan","S.",""],["Douqa","D.",""],["Doyle","T. A.",""],["Drapier","O.",""],["Dumarchez","J.",""],["Dunne","P.",""],["Dygnarowicz","K.",""],["Eguchi","A.",""],["Emery-Schrenk","S.",""],["Erofeev","G.",""],["Ershova","A.",""],["Eurin","G.",""],["Fedorova","D.",""],["Fedotov","S.",""],["Feltre","M.",""],["Finch","A. J.",""],["Aguirre","G. A. Fiorentini",""],["Fiorillo","G.",""],["Fitton","M. D.",""],["Pati\u00f1o","J. M. Franco",""],["Friend","M.",""],["Fujii","Y.",""],["Fukuda","Y.",""],["Furui","Y.",""],["Giannessi","L.",""],["Giganti","C.",""],["Glagolev","V.",""],["Gonin","M.",""],["Rosa","J. Gonz\u00e1lez",""],["Goodman","E. A. G.",""],["Gorin","A.",""],["Grassi","M.",""],["Guigue","M.",""],["Hadley","D. R.",""],["Haigh","J. T.",""],["Hamacher-Baumann","P.",""],["Harris","D. A.",""],["Hartz","M.",""],["Hasegawa","T.",""],["Hassani","S.",""],["Hastings","N. C.",""],["Hayato","Y.",""],["Henaff","D.",""],["Hogan","M.",""],["Holeczek","J.",""],["Holin","A.",""],["Holvey","T.",""],["Van","N. T. Hong",""],["Honjo","T.",""],["Ichikawa","A. K.",""],["Ikeda","M.",""],["Ishida","T.",""],["Ishitsuka","M.",""],["Israel","H. T.",""],["Izmaylov","A.",""],["Jakkapu","M.",""],["Jamieson","B.",""],["Jenkins","S. J.",""],["Jes\u00fas-Valls","C.",""],["Jiang","J. J.",""],["Ji","J. Y.",""],["Jonsson","P.",""],["Joshi","S.",""],["Jung","C. K.",""],["Jurj","P. B.",""],["Kabirnezhad","M.",""],["Kaboth","A. C.",""],["Kajita","T.",""],["Kakuno","H.",""],["Kameda","J.",""],["Kasetti","S. P.",""],["Kataoka","Y.",""],["Katori","T.",""],["Kawaue","M.",""],["Kearns","E.",""],["Khabibullin","M.",""],["Khotjantsev","A.",""],["Kikawa","T.",""],["King","S.",""],["Kiseeva","V.",""],["Kisiel","J.",""],["Kobayashi","H.",""],["Kobayashi","T.",""],["Koch","L.",""],["Kodama","S.",""],["Konaka","A.",""],["Kormos","L. L.",""],["Koshio","Y.",""],["Koto","T.",""],["Kowalik","K.",""],["Kudenko","Y.",""],["Kudo","Y.",""],["Kuribayashi","S.",""],["Kurjata","R.",""],["Kutter","T.",""],["Kuze","M.",""],["La Commara","M.",""],["Labarga","L.",""],["Lachner","K.",""],["Lagoda","J.",""],["Lakshmi","S. M.",""],["James","M. Lamers",""],["Lamoureux","M.",""],["Langella","A.",""],["Laporte","J. -F.",""],["Last","D.",""],["Latham","N.",""],["Laveder","M.",""],["Lavitola","L.",""],["Lawe","M.",""],["Lee","Y.",""],["Lin","C.",""],["Lin","S. -K.",""],["Litchfield","R. P.",""],["Liu","S. L.",""],["Li","W.",""],["Longhin","A.",""],["Long","K. R.",""],["Moreno","A. Lopez",""],["Ludovici","L.",""],["Lu","X.",""],["Lux","T.",""],["Machado","L. N.",""],["Magaletti","L.",""],["Mahn","K.",""],["Malek","M.",""],["Mandal","M.",""],["Manly","S.",""],["Marino","A. D.",""],["Marti-Magro","L.",""],["Martin","D. G. R.",""],["Martini","M.",""],["Martin","J. F.",""],["Maruyama","T.",""],["Matsubara","T.",""],["Matveev","V.",""],["Mauger","C.",""],["Mavrokoridis","K.",""],["Mazzucato","E.",""],["McCauley","N.",""],["McElwee","J.",""],["McFarland","K. S.",""],["McGrew","C.",""],["McKean","J.",""],["Mefodiev","A.",""],["Megias","G. D.",""],["Mehta","P.",""],["Mellet","L.",""],["Metelko","C.",""],["Mezzetto","M.",""],["Miller","E.",""],["Minamino","A.",""],["Mineev","O.",""],["Mine","S.",""],["Miura","M.",""],["Bueno","L. Molina",""],["Moriyama","S.",""],["Moriyama","S.",""],["Morrison","P.",""],["Mueller","Th. A.",""],["Munford","D.",""],["Munteanu","L.",""],["Nagai","K.",""],["Nagai","Y.",""],["Nakadaira","T.",""],["Nakagiri","K.",""],["Nakahata","M.",""],["Nakajima","Y.",""],["Nakamura","A.",""],["Nakamura","H.",""],["Nakamura","K.",""],["Nakamura","K. D.",""],["Nakano","Y.",""],["Nakayama","S.",""],["Nakaya","T.",""],["Nakayoshi","K.",""],["Naseby","C. E. R.",""],["Ngoc","T. V.",""],["Nguyen","V. Q.",""],["Niewczas","K.",""],["Nishimori","S.",""],["Nishimura","Y.",""],["Nishizaki","K.",""],["Nosek","T.",""],["Nova","F.",""],["Novella","P.",""],["Nugent","J. C.",""],["O'Keeffe","H. M.",""],["O'Sullivan","L.",""],["Odagawa","T.",""],["Okinaga","W.",""],["Okumura","K.",""],["Okusawa","T.",""],["Ospina","N.",""],["Oyama","Y.",""],["Palladino","V.",""],["Paolone","V.",""],["Pari","M.",""],["Parlone","J.",""],["Pasternak","J.",""],["Pavin","M.",""],["Payne","D.",""],["Penn","G. C.",""],["Pershey","D.",""],["Pickering","L.",""],["Pidcott","C.",""],["Pintaudi","G.",""],["Pistillo","C.",""],["Popov","B.",""],["Porwit","K.",""],["Posiadala-Zezula","M.",""],["Prabhu","Y. S.",""],["Pupilli","F.",""],["Quilain","B.",""],["Radermacher","T.",""],["Radicioni","E.",""],["Radics","B.",""],["Ram\u00edrez","M. A.",""],["Ratoff","P. N.",""],["Reh","M.",""],["Riccio","C.",""],["Rondio","E.",""],["Roth","S.",""],["Roy","N.",""],["Rubbia","A.",""],["Ruggeri","A. C.",""],["Ruggles","C. A.",""],["Rychter","A.",""],["Sakashita","K.",""],["S\u00e1nchez","F.",""],["Schloesser","C. M.",""],["Scholberg","K.",""],["Scott","M.",""],["Seiya","Y.",""],["Sekiguchi","T.",""],["Sekiya","H.",""],["Sgalaberna","D.",""],["Shaikhiev","A.",""],["Shaker","F.",""],["Shiozawa","M.",""],["Shorrock","W.",""],["Shvartsman","A.",""],["Skrobova","N.",""],["Skwarczynski","K.",""],["Smyczek","D.",""],["Smy","M.",""],["Sobczyk","J. T.",""],["Sobel","H.",""],["Soler","F. J. P.",""],["Sonoda","Y.",""],["Speers","A. J.",""],["Spina","R.",""],["Suslov","I. A.",""],["Suvorov","S.",""],["Suzuki","A.",""],["Suzuki","S. Y.",""],["Suzuki","Y.",""],["Tada","M.",""],["Tairafune","S.",""],["Takayasu","S.",""],["Takeda","A.",""],["Takeuchi","Y.",""],["Takifuji","K.",""],["Tanaka","H. K.",""],["Tani","M.",""],["Teklu","A.",""],["Tereshchenko","V. V.",""],["Thamm","N.",""],["Thompson","L. F.",""],["Toki","W.",""],["Touramanis","C.",""],["Towstego","T.",""],["Tsui","K. M.",""],["Tsukamoto","T.",""],["Tzanov","M.",""],["Uchida","Y.",""],["Vagins","M.",""],["Vargas","D.",""],["Varghese","M.",""],["Vasseur","G.",""],["Vilela","C.",""],["Villa","E.",""],["Vinning","W. G. S.",""],["Virginet","U.",""],["Vladisavljevic","T.",""],["Wachala","T.",""],["Walsh","J. G.",""],["Wang","Y.",""],["Wan","L.",""],["Wark","D.",""],["Wascko","M. O.",""],["Weber","A.",""],["Wendell","R.",""],["Wilking","M. J.",""],["Wilkinson","C.",""],["Wilson","J. R.",""],["Wood","K.",""],["Wret","C.",""],["Xia","J.",""],["Xu","Y. -h.",""],["Yamamoto","K.",""],["Yamamoto","T.",""],["Yanagisawa","C.",""],["Yang","G.",""],["Yano","T.",""],["Yasutome","K.",""],["Yershov","N.",""],["Yevarouskaya","U.",""],["Yokoyama","M.",""],["Yoshimoto","Y.",""],["Yoshimura","N.",""],["Yu","M.",""],["Zaki","R.",""],["Zalewska","A.",""],["Zalipska","J.",""],["Zaremba","K.",""],["Zarnecki","G.",""],["Zhao","X.",""],["Zhu","T.",""],["Ziembicki","M.",""],["Zimmerman","E. D.",""],["Zito","M.",""],["Zsoldos","S.",""]]}
{"id":"2308.16607","submitter":"Rapha\\\"el Hahn","authors":"Rapha\\\"el Hahn, Thomas Battard, Oscar Boucher, Yan J. Picard, Hans\n  Lignier, Daniel Comparat, Nolwenn-Amandine Keriel, Colin Lopez, Emanuel\n  Oswald, Morgan Reveillard, Matthieu Viteau","title":"Comparative analysis of recirculating and collimating cesium ovens","comments":"This article may be downloaded for personal use only. Any other use\n  requires prior permission of the author and AIP Publishing. This article\n  appeared in Rev Sci Instrum 1 April 2022; 93 (4): 043302 and may be found at\n  https://pubs.aip.org/aip/rsi/article/93/4/043302/2848701","journal-ref":"Rev Sci Instrum 1 April 2022; 93 (4): 043302","doi":"10.1063/5.0085838","report-no":null,"categories":"physics.atom-ph physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have performed a study of several cesium oven designs. A comparison\nbetween recirculating (or sticking-wall) or collimating (or reemitting-wall)\novens is made in order to extract the most efficient design in terms of beam\nbrightness. Unfortunately, non-reproducible behaviors have been observed, and\nthe most often observed output flux is similar to the sticking-wall case, which\nis the lowest theoretical value of the two cases, with a beam brightness close\nto $10^{18}$ at.sr$^{-1}$.s$^{-1}$.cm$^{-2}$. The reason of this universally\nobserved behavior is unclear despite having tested several materials for the\ncollimating tube. Conclusion on possible improved design based on sticking of\ncesium on several (un)cleaned surface is given.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:08:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hahn","Rapha\u00ebl",""],["Battard","Thomas",""],["Boucher","Oscar",""],["Picard","Yan J.",""],["Lignier","Hans",""],["Comparat","Daniel",""],["Keriel","Nolwenn-Amandine",""],["Lopez","Colin",""],["Oswald","Emanuel",""],["Reveillard","Morgan",""],["Viteau","Matthieu",""]]}
{"id":"2308.16608","submitter":"Wei Liu","authors":"Daniele Barducci, Wei Liu, Arsenii Titov, Zeren Simon Wang, Yu Zhang","title":"Probing the dipole portal to heavy neutral leptons via meson decays at\n  the high-luminosity LHC","comments":"16 pages+refs, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the dipole portal to sterile neutrinos, also called heavy neutral\nleptons (HNLs). The dipole interaction with the photon leads to HNL production\nin meson decays, as well as triggers the HNL decay into an active neutrino and\na photon. HNLs with masses of order of 0.01-1 GeV are naturally long-lived if\nthe dipole coupling is sufficiently small. We perform Monte-Carlo simulations\nand derive the sensitivities of the proposed FASER2 and FACET long-lived\nparticle experiments to HNLs produced via the dipole operator in meson decays\nat the high-luminosity LHC. Our findings show that these future detectors will\nbe complementary to each other, as well as to existing experiments, and will be\nable to probe new parts of the parameter space, especially in the case of the\ndipole operator coupled to the tau neutrino.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:08:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Barducci","Daniele",""],["Liu","Wei",""],["Titov","Arsenii",""],["Wang","Zeren Simon",""],["Zhang","Yu",""]]}
{"id":"2308.16609","submitter":"Zhengyang Mao","authors":"Siyu Yi, Zhengyang Mao, Wei Ju, Yongdao Zhou, Luchen Liu, Xiao Luo,\n  and Ming Zhang","title":"Towards Long-Tailed Recognition for Graph Classification via\n  Collaborative Experts","comments":"Accepted by IEEE Transactions on Big Data (TBD 2024)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.IR cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph classification, aiming at learning the graph-level representations for\neffective class assignments, has received outstanding achievements, which\nheavily relies on high-quality datasets that have balanced class distribution.\nIn fact, most real-world graph data naturally presents a long-tailed form,\nwhere the head classes occupy much more samples than the tail classes, it thus\nis essential to study the graph-level classification over long-tailed data\nwhile still remaining largely unexplored. However, most existing long-tailed\nlearning methods in visions fail to jointly optimize the representation\nlearning and classifier training, as well as neglect the mining of the\nhard-to-classify classes. Directly applying existing methods to graphs may lead\nto sub-optimal performance, since the model trained on graphs would be more\nsensitive to the long-tailed distribution due to the complex topological\ncharacteristics. Hence, in this paper, we propose a novel long-tailed\ngraph-level classification framework via Collaborative Multi-expert Learning\n(CoMe) to tackle the problem. To equilibrate the contributions of head and tail\nclasses, we first develop balanced contrastive learning from the view of\nrepresentation learning, and then design an individual-expert classifier\ntraining based on hard class mining. In addition, we execute gated fusion and\ndisentangled knowledge distillation among the multiple experts to promote the\ncollaboration in a multi-expert framework. Comprehensive experiments are\nperformed on seven widely-used benchmark datasets to demonstrate the\nsuperiority of our method CoMe over state-of-the-art baselines.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:12:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yi","Siyu",""],["Mao","Zhengyang",""],["Ju","Wei",""],["Zhou","Yongdao",""],["Liu","Luchen",""],["Luo","Xiao",""],["Zhang","Ming",""]]}
{"id":"2308.16610","submitter":"Daiki Mizuno","authors":"Toyohiko Aiki, Daiki Mizuno, and Ken Shirakawa","title":"A Class of Initial-Boundary Value Problems Governed by Pseudo-Parabolic\n  Weighted Total Variation Flows","comments":"31 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 class of initial-boundary value problems\ngoverned by pseudo-parabolic total variation flows. The principal\ncharacteristic of our problem lies in the velocity term of the diffusion flux,\na feature that can bring about stronger regularity than what is found in\nstandard parabolic PDEs. Meanwhile, our total variation flow contains singular\ndiffusion, and this singularity may lead to a degeneration of the regularity of\nsolution. The objective of this paper is to clarify the power balance between\nthese conflicting effects. Consequently, we will present mathematical results\nconcerning the well-posedness and regularity of the solution in the Main\nTheorems of this paper.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:14:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Aiki","Toyohiko",""],["Mizuno","Daiki",""],["Shirakawa","Ken",""]]}
{"id":"2308.16611","submitter":"Sohail Ahmed Khan","authors":"Eivind Moholdt, Sohail Ahmed Khan, Duc-Tien Dang-Nguyen","title":"Detecting Out-of-Context Image-Caption Pairs in News: A\n  Counter-Intuitive Method","comments":"ACM International Conference on Content-Based Multimedia Indexing\n  (CBMI '23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The growth of misinformation and re-contextualized media in social media and\nnews leads to an increasing need for fact-checking methods. Concurrently, the\nadvancement in generative models makes cheapfakes and deepfakes both easier to\nmake and harder to detect. In this paper, we present a novel approach using\ngenerative image models to our advantage for detecting Out-of-Context (OOC) use\nof images-caption pairs in news. We present two new datasets with a total of\n$6800$ images generated using two different generative models including (1)\nDALL-E 2, and (2) Stable-Diffusion. We are confident that the method proposed\nin this paper can further research on generative models in the field of\ncheapfake detection, and that the resulting datasets can be used to train and\nevaluate new models aimed at detecting cheapfakes. We run a preliminary\nqualitative and quantitative analysis to evaluate the performance of each image\ngeneration model for this task, and evaluate a handful of methods for computing\nimage similarity.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:16:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Moholdt","Eivind",""],["Khan","Sohail Ahmed",""],["Dang-Nguyen","Duc-Tien",""]]}
{"id":"2308.16612","submitter":"Shuang Xu","authors":"Shuang Xu, Yifan Wang, Zixiang Zhao, Jiangjun Peng, Xiangyong Cao,\n  Deyu Meng","title":"Neural Gradient Regularizer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Owing to its significant success, the prior imposed on gradient maps has\nconsistently been a subject of great interest in the field of image processing.\nTotal variation (TV), one of the most representative regularizers, is known for\nits ability to capture the sparsity of gradient maps. Nonetheless, TV and its\nvariants often underestimate the gradient maps, leading to the weakening of\nedges and details whose gradients should not be zero in the original image.\nRecently, total deep variation (TDV) has been introduced, assuming the sparsity\nof feature maps, which provides a flexible regularization learned from\nlarge-scale datasets for a specific task. However, TDV requires retraining when\nthe image or task changes, limiting its versatility. In this paper, we propose\na neural gradient regularizer (NGR) that expresses the gradient map as the\noutput of a neural network. Unlike existing methods, NGR does not rely on the\nsparsity assumption, thereby avoiding the underestimation of gradient maps. NGR\nis applicable to various image types and different image processing tasks,\nfunctioning in a zero-shot learning fashion, making it a versatile and\nplug-and-play regularizer. Extensive experimental results demonstrate the\nsuperior performance of NGR over state-of-the-art counterparts for a range of\ndifferent tasks, further validating its effectiveness and versatility.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:19:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xu","Shuang",""],["Wang","Yifan",""],["Zhao","Zixiang",""],["Peng","Jiangjun",""],["Cao","Xiangyong",""],["Meng","Deyu",""]]}
{"id":"2308.16613","submitter":"Jie Qin","authors":"Jie Qin","title":"The Brown-Halmos theorems on the Fock space","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we extend the Brown-Halmos theorems to the Fock space and\ninvestigate the range of the Berezin transform. We observe that there are many\nnon-pluriharmonic functions $u$ that can be written as a finite sum\n$B(u)=\\sum_lf_l\\overline{g_l}$, where $f_l,g_l$ are holomorphic functions\nbelonging to the class $\\mathrm{Sym}(\\mathbb{C})^n$. In addition, we answer the\nzero-product problem posed by Bauer and Le in 2011. Our results reveal that the\nBrown-Halmos theorems on the Fock space are more complicated than that on the\nclassical Bergman space.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:19:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Qin","Jie",""]]}
{"id":"2308.16614","submitter":"Eunju Shin","authors":"Eunju Shin","title":"Character varieties on a four-holed sphere","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For each $k\\in\\mathbb{A}^4(\\mathbb{C})$, consider the character variety $X_k$\non a four-holed sphere. We prove that it is decidable whether or not any two\nintegral solutions of $X_k$ are in the same mapping class group orbit. For\nthis, using a delta map and Vieta maps, we will introduce graphs corresponding\nto the orbits and observe the properties of vertices on the graph.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:20:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shin","Eunju",""]]}
{"id":"2308.16615","submitter":"Lossan Bonde","authors":"Lossan Bonde, Severin Dembele","title":"High Accuracy Location Information Extraction from Social Network Texts\n  Using Natural Language Processing","comments":null,"journal-ref":"International Journal on Natural Language Computing (IJNLC)\n  Vol.12, No.4, August 2023","doi":"10.5121/ijnlc.2023.12401","report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Terrorism has become a worldwide plague with severe consequences for the\ndevelopment of nations. Besides killing innocent people daily and preventing\neducational activities from taking place, terrorism is also hindering economic\ngrowth. Machine Learning (ML) and Natural Language Processing (NLP) can\ncontribute to fighting terrorism by predicting in real-time future terrorist\nattacks if accurate data is available. This paper is part of a research project\nthat uses text from social networks to extract necessary information to build\nan adequate dataset for terrorist attack prediction. We collected a set of 3000\nsocial network texts about terrorism in Burkina Faso and used a subset to\nexperiment with existing NLP solutions. The experiment reveals that existing\nsolutions have poor accuracy for location recognition, which our solution\nresolves. We will extend the solution to extract dates and action information\nto achieve the project's goal.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:21:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bonde","Lossan",""],["Dembele","Severin",""]]}
{"id":"2308.16616","submitter":"Jian-Hua Gao","authors":"Jian-Hua Gao, Shi-Zheng Yang","title":"Revisit spin effects induced by thermal vorticity","comments":"23 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We revisit the spin effects induced by thermal vorticity by calculating them\ndirectly from the spin-dependent distribution functions. For the spin-1/2\nparticles, we give the polarization up to the first order of thermal vorticity\nand compare it with the usual result calculated from the spin vector. For the\nspin-1 particles, we give the spin alignment in terms of thermal vorticity.\nAlthough the spin alignment receives only second-order contribution from\nthermal vorticity, we find that some non-diagonal elements in spin density\nmatrix can receive first order contribution. We also find that the spin effects\nfor both Dirac and vector particles will receive extra contribution when the\nspin direction is associated with the particle's momentum.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:21:54 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gao","Jian-Hua",""],["Yang","Shi-Zheng",""]]}
{"id":"2308.16617","submitter":"Tram Thi Ngoc Nguyen","authors":"Tram Thi Ngoc Nguyen","title":"Bi-level iterative regularization for inverse problems in nonlinear PDEs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the ill-posed inverse problem of recovering unknown spatially\ndependent parameters in nonlinear evolution PDEs. We propose a bi-level\nLandweber scheme, where the upper-level parameter reconstruction embeds a\nlower-level state approximation. This can be seen as combining the classical\nreduced setting and the newer all-at-once setting, allowing us to,\nrespectively, utilize well-posedness of the parameter-to-state map, and to\nbypass having to solve nonlinear PDEs exactly. Using this, we derive stopping\nrules for lower- and upper-level iterations and convergence of the bi-level\nmethod. We discuss application to parameter identification for the\nLandau-Lifshitz-Gilbert equation in magnetic particle imaging.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:22:52 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nguyen","Tram Thi Ngoc",""]]}
{"id":"2308.16618","submitter":"Federico Milano","authors":"Federico Milano, Bibi Alhanjari and Georgios Tzounas","title":"Enhancing Frequency Control through Rate of Change of Voltage Feedback","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 proposes a simple and inexpensive technique to improve the\nfrequency control of distributed energy resources. The proposed control\nconsists in modifying the conventional estimated bus frequency signal with an\nadditional feedback signal that utilizes the rate of change of the voltage\nmagnitude measured at the same bus. The case study showcases the benefits of\nthe proposed control and compares its performance with standard frequency\ncontrol schemes through time-domain simulations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:24:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Milano","Federico",""],["Alhanjari","Bibi",""],["Tzounas","Georgios",""]]}
{"id":"2308.16619","submitter":"Max Piochowiak","authors":"Max Piochowiak, Carsten Dachsbacher","title":"Fast Compressed Segmentation Volumes for Scientific Visualization","comments":"IEEE Vis 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Voxel-based segmentation volumes often store a large number of labels and\nvoxels, and the resulting amount of data can make storage, transfer, and\ninteractive visualization difficult. We present a lossless compression\ntechnique which addresses these challenges. It processes individual small\nbricks of a segmentation volume and compactly encodes the labelled regions and\ntheir boundaries by an iterative refinement scheme. The result for each brick\nis a list of labels, and a sequence of operations to reconstruct the brick\nwhich is further compressed using rANS-entropy coding. As the relative\nfrequencies of operations are very similar across bricks, the entropy coding\ncan use global frequency tables for an entire data set which enables efficient\nand effective parallel (de)compression. Our technique achieves high throughput\n(up to gigabytes per second both for compression and decompression) and strong\ncompression ratios of about 1% to 3% of the original data set size while being\napplicable to GPU-based rendering. We evaluate our method for various data sets\nfrom different fields and demonstrate GPU-based volume visualization with\non-the-fly decompression, level-of-detail rendering (with optional on-demand\nstreaming of detail coefficients to the GPU), and a caching strategy for\ndecompressed bricks for further performance improvement.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:25:54 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Piochowiak","Max",""],["Dachsbacher","Carsten",""]]}
{"id":"2308.16620","submitter":"Gareth Jones","authors":"G. C. Jones, H. Ubler, M. Perna, S. Arribas, A. J. Bunker, S.\n  Carniani, S. Charlot, R. Maiolino, B. Rodriguez Del Pino, C. Willott, R. A.\n  A. Bowler, T. Boker, A. J. Cameron, J. Chevallard, G. Cresci, M. Curti, F.\n  D'Eugenio, N. Kumari, A. Saxena, J. Scholtz, G. Venturi, J. Witstok","title":"GA-NIFS: JWST/NIRSpec IFU observations of HFLS3 reveal a dense galaxy\n  group at z~6.3","comments":"23 pages, 14 figures, submitted to A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Massive, starbursting galaxies in the early Universe represent some of the\nmost extreme objects in the study of galaxy evolution. One such source is HFLS3\n(z~6.34), which was originally identified as an extreme starburst galaxy with\nmild gravitational magnification. Here, we present new observations of HFLS3\nwith the JWST/NIRSpec IFU in both low (PRISM/CLEAR; R~100) and high spectral\nresolution (G395H/290LP; R~2700), with high spatial resolution (~0.1\") and\nsensitivity. Thanks to the combination of the NIRSpec data and a new lensing\nmodel with accurate spectroscopic redshifts, we find that the 3\"x3\" field is\ncrowded, with a lensed arc (C, z=6.3425+/-0.0002), two galaxies to the south\n(S1 and S2, z=6.3592+/-0.0001), two galaxies to the west (W1,\nz=6.3550+/-0.0001; W2, z=6.3628+/-0.0001), and two low-redshift interlopers\n(G1, z=3.4806+/-0.0001; G2, z=2.00+/-0.01). We present spectral fits and\nmorpho-kinematic maps for each bright emission line (e.g., [OIII]5007, Halpha,\n[NII]6584) from the R2700 data for all sources except G2. From a line ratio\nanalysis, the galaxies in C are likely powered by star formation, while we\ncannot rule out or confirm the presence of AGN in the other high-redshift\nsources. We perform gravitational lens modelling, finding evidence for a\ntwo-source composition of the lensed central object and a comparable\nmagnification factor (mu=2.1-2.4) to previous work. The projected distances and\nvelocity offsets of each galaxy suggest that they will merge within the next\n~1Gyr. Finally, we examine the dust extinction-corrected SFR of each z>6\nsource, finding that the total star formation (460+/-90 Msol/yr,\nmagnification-corrected) is distributed across the six z~6.34-6.36 objects over\na region of diameter ~11kpc. Altogether, this suggests that HFLS3 is not a\nsingle starburst galaxy, but instead is a merging system of star-forming\ngalaxies in the Epoch of Reionization.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:28:16 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jones","G. C.",""],["Ubler","H.",""],["Perna","M.",""],["Arribas","S.",""],["Bunker","A. J.",""],["Carniani","S.",""],["Charlot","S.",""],["Maiolino","R.",""],["Del Pino","B. Rodriguez",""],["Willott","C.",""],["Bowler","R. A. A.",""],["Boker","T.",""],["Cameron","A. J.",""],["Chevallard","J.",""],["Cresci","G.",""],["Curti","M.",""],["D'Eugenio","F.",""],["Kumari","N.",""],["Saxena","A.",""],["Scholtz","J.",""],["Venturi","G.",""],["Witstok","J.",""]]}
{"id":"2308.16621","submitter":"Raymond Wong","authors":"Raymond Wong, Anh Tran, Bogdan Dovgyy, Claudia Santos Maldonado,\n  Minh-Son Pham","title":"Meta-analysis of literature data in metal additive manufacturing: What\n  can we (and the machine) learn from reported data?","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":"  Obtaining in-depth understanding of the relationships between the additive\nmanufacturing (AM) process, microstructure and mechanical properties is crucial\nto overcome barriers in AM. In this study, database of metal AM was created\nthanks to many literature studies. Subsequently meta-analyses on the data was\nundertaken to provide insights into whether such relationships are well\nreflected in the literature data. The analyses help reveal the bias and what\nthe data tells us, and to what extent machine learning (ML) can learn from the\ndata. The first major bias is associated with common practices in identifying\nthe process based on optimizing the consolidation. Most reports were for\nconsolidation while data on microstructure and mechanical properties was\nsignificantly less. In addition, only high consolidation values was provided,\nso ML was not able to learn the full spectrum of the process - consolidation\nrelationship. The common identification of process maps based on only\nconsolidation also poses another bias as mechanical properties that ultimately\ngovern the quality of an AM build are controlled not only by the consolidation,\nbut also microstructure. Meta-analysis of the literature data also shows weak\ncorrelation between process with consolidation and mechanical properties. This\nweak correlation is attributed to the stated biases and the non-monotonic and\nnon-linear relationships between the process and quality variables.\nFortunately, trained ML models capture well the influence and interactions\nbetween process parameters and quality variables, and predicts accurately the\nyield stress, suggesting that the correlation between process, microstructure\nand yield strength is well reflected in the data. Lastly, due to the current\nlimitation in the process map identification, we propose to identify the\nprocess map based on not only the consolidation, but also mechanical\nproperties.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:29:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wong","Raymond",""],["Tran","Anh",""],["Dovgyy","Bogdan",""],["Maldonado","Claudia Santos",""],["Pham","Minh-Son",""]]}
{"id":"2308.16622","submitter":"Lars-Peter Meyer","authors":"Lars-Peter Meyer, Johannes Frey, Kurt Junghanns, Felix Brei, Kirill\n  Bulert, Sabine Gr\\\"under-Fahrer, Michael Martin","title":"Developing a Scalable Benchmark for Assessing Large Language Models in\n  Knowledge Graph Engineering","comments":"To be published in SEMANTICS 2023 poster track proceedings. SEMANTICS\n  2023 EU: 19th International Conference on Semantic Systems, September 20-22,\n  2023, Leipzig, Germany","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As the field of Large Language Models (LLMs) evolves at an accelerated pace,\nthe critical need to assess and monitor their performance emerges. We introduce\na benchmarking framework focused on knowledge graph engineering (KGE)\naccompanied by three challenges addressing syntax and error correction, facts\nextraction and dataset generation. We show that while being a useful tool, LLMs\nare yet unfit to assist in knowledge graph generation with zero-shot prompting.\nConsequently, our LLM-KG-Bench framework provides automatic evaluation and\nstorage of LLM responses as well as statistical data and visualization tools to\nsupport tracking of prompt engineering and model performance.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:31:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Meyer","Lars-Peter",""],["Frey","Johannes",""],["Junghanns","Kurt",""],["Brei","Felix",""],["Bulert","Kirill",""],["Gr\u00fcnder-Fahrer","Sabine",""],["Martin","Michael",""]]}
{"id":"2308.16623","submitter":"Shruti Tandon","authors":"Vladimir Garcia-Morales, Shruti Tandon, Juergen Kurths, R. I. Sujith","title":"Universality of oscillatory instabilities in fluid mechanical systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Oscillatory instability (OI) arises out of turbulent states in various fluid\nmechanical systems such as aero-acoustic, thermoacoustic and aeroelastic\nsystems. For the time series of the relevant dynamic variable at the onset of\nthe OI, universal scaling behaviors have been experimentally uncovered via the\nHurst exponent and certain spectral measures. By means of a center manifold\nreduction, the spatiotemporal dynamics of these real systems can be mapped to a\ncomplex Ginzburg-Landau equation with a linear global coupling (GCGLE). In this\nletter, we show that the GCGLE is able to capture the universal behavior of the\nOI, elucidating it as a transition between defect to phase turbulence mediated\nby the global coupling.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:37:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Garcia-Morales","Vladimir",""],["Tandon","Shruti",""],["Kurths","Juergen",""],["Sujith","R. I.",""]]}
{"id":"2308.16624","submitter":"Matt Visser","authors":"Joshua Baines (Victoria University of Wellington), Rudeep Gaur\n  (Victoria University of Wellington), and Matt Visser (Victoria University of\n  Wellington)","title":"Defect wormholes are defective","comments":"17 pages; 41 references","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The various \"defect wormholes\" developed by Klinkhamer have recently\nattracted considerable attention -- especially in view of the fact that the\nsimplest example, the so-called \"vacuum defect wormhole\", was claimed to be an\neverywhere-vacuum everywhere-Ricci-flat exact solution to the Einstein\nequations. This claim has been conclusively refuted by Feng, and in the current\narticle we take a deeper look at exactly what goes wrong. The central issue is\nthis: Although Klinkhamer's specific representation of the metric g_{ab} is\nsmooth (C^\\infty) his inverse metric g^{ab} is not even everywhere continuous\n(C^0), being undefined at the wormhole throat. This situation implies that one\nshould very carefully investigate curvature tensors at the throat using the\nIsrael--Lanczos--Sen thin-shell formalism. Doing so reveals the presence of a\ndelta-function energy-condition-violating thin shell of matter at the wormhole\nthroat. The \"defect wormholes\" are thus revealed to be quite ordinary\n\"cut-and-paste\" thin-shell wormholes, but represented in a coordinate system\nwhich is unfortunately pathological at exactly the same place that all the\ninteresting physics occurs.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:42:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Baines","Joshua","","Victoria University of Wellington"],["Gaur","Rudeep","","Victoria University of Wellington"],["Visser","Matt","","Victoria University of\n  Wellington"]]}
{"id":"2308.16625","submitter":"Benedikt Zerulla","authors":"Benedikt Zerulla, Dominik Beutel, Christof Holzer, Ivan\n  Fernandez-Corbaton, Carsten Rockstuhl, Marjan Krsti\\'c","title":"A Multi-Scale Approach to Simulate the Nonlinear Optical Response of\n  Molecular Nanomaterials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nonlinear optics is essential for many recent photonic technologies. Here, we\nintroduce a novel multi-scale approach to simulate the nonlinear optical\nresponse of molecular nanomaterials combining ab initio quantum-chemical and\nclassical Maxwell-scattering computations. In this approach, the first\nhyperpolarizability tensor is computed with time-dependent density-functional\ntheory and translated into a multi-scattering formalism that considers the\noptical interaction between neighboring molecules. A novel object is introduce\nto perform this transition from quantum-chemistry to classical scattering\ntheory: the Hyper-Transition(T)-matrix. With this object at hand, the nonlinear\noptical response from single molecules and also from entire photonic devices\ncan be computed, incorporating the full tensorial and dispersive nature of the\noptical response of the molecules. To demonstrate the applicability of our\nnovel approach, the generation of a second-harmonic signal from a thin film of\na Urea molecular crystal is computed and compared to more traditional\nsimulations. Furthermore, an optical cavity is designed, which enhances the\nsecond-harmonic response of the molecular film by more than two orders of\nmagnitude. Our approach is highly versatile and accurate and can be the working\nhorse for the future exploration of nonlinear photonic molecular materials in\nstructured photonic environments.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:45:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zerulla","Benedikt",""],["Beutel","Dominik",""],["Holzer","Christof",""],["Fernandez-Corbaton","Ivan",""],["Rockstuhl","Carsten",""],["Krsti\u0107","Marjan",""]]}
{"id":"2308.16626","submitter":"Benjalmin Dequ\\^ene","authors":"Benjamin Dequ\\^ene","title":"Canonically Jordan recoverable categories for modules over the path\n  algebra of $A_n$ type quivers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $Q$ be a quiver of $A_n$ type and $\\mathbb{K}$ be an algebraically closed\nfield. A nilpotent endomorphism of a quiver representation induces a linear\ntransformation of the vector space at each vertex. Generically among all\nnilpotent endomorphisms of a fixed representation $X$, there exists a\nwell-defined Jordan form of each of these linear transformations\n$\\operatorname{GenJF}(X)$, called the generic Jordan form data of $X$. A\nsubcategory of $\\operatorname{rep}(Q)$ is Jordan recoverable if we can recover\n$X$ up to isomorphism from its generic Jordan form data.\n  There is a procedure which allows one to invert the map from representations\nto generic Jordan form data. The subcategories for which this procedure works\nare called canonically Jordan recoverable. We focus on the subcategories of\n$\\operatorname{rep}(Q)$ that are canonically Jordan recoverable, and we give a\ncombinatorial characterization of them.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:46:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dequ\u00eane","Benjamin",""]]}
{"id":"2308.16627","submitter":"Maryam Haditale","authors":"M. Haditale and B. Malekolkalami","title":"Thermodynamic Properties of Regular Phantom Black Hole","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Regular Phantom Black Holes (RPBH)s are of theoretical and observational\nimportance, and some properties have been studied. In this work, we study some\nof the thermodynamical properties such as entropy, and temperature, ... in\nthree asymptotically spacetimes: flat, de--Sitter (dS), and Anti-de Sitter\n(AdS). Many of the RPBH properties, including horizon radius, are (directly or\nindirectly) dependent on a scale parameter b. Due to the slightly different\nstructure from Schwarzschild--metrics, the method to express relations between\nthermodynamical variables requires a new function of the scale parameter. We\nalso imply the local and global thermodynamic stability through the Heat\nCapacity (HC) and Gibbs Energy (GB), respectively. The calculations and graphs\nshow the results, in the flat background, are very similar to Schwarzschild\nones. Also, some results show that the asymptotically AdS-RPBH is more\ncompatible with physical laws than the dS and flat backgrounds.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:49:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Haditale","M.",""],["Malekolkalami","B.",""]]}
{"id":"2308.16628","submitter":"Sunny Vagnozzi","authors":"Sunny Vagnozzi","title":"Seven hints that early-time new physics alone is not sufficient to solve\n  the Hubble tension","comments":"39 pages, 18 sub-figures arranged into 11 figures, most of which\n  reproduced (with permission) from other works, many references, \"alone\" is\n  the keyword here. A very pictorial summary of the whole paper is in Fig. 11,\n  not made by me. Accepted for publication in Universe as an invited\n  opinion/review paper in the special issue \"Modified Gravity Approaches to the\n  Tensions of \\Lambda CDM\"","journal-ref":"Universe 9 (2023) 393","doi":"10.3390/universe9090393","report-no":null,"categories":"astro-ph.CO gr-qc hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Hubble tension has now grown to a level of significance which can no\nlonger be ignored and calls for a solution which, despite a huge number of\nattempts, has so far eluded us. Significant efforts in the literature have\nfocused on early-time modifications of $\\Lambda$CDM, introducing new physics\noperating prior to recombination and reducing the sound horizon. In this\nopinion paper I argue that early-time new physics alone will always fall short\nof fully solving the Hubble tension. I base my arguments on seven independent\nhints, related to 1) the ages of the oldest astrophysical objects, 2)\nconsiderations on the sound horizon-Hubble constant degeneracy directions in\ncosmological data, 3) the important role of cosmic chronometers, 4) a number of\n``descending trends'' observed in a wide variety of low-redshift datasets, 5)\nthe early integrated Sachs-Wolfe effect as an early-time consistency test of\n$\\Lambda$CDM, 6) early-Universe physics insensitive and uncalibrated cosmic\nstandard constraints on the matter density, and finally 7) equality\nwavenumber-based constraints on the Hubble constant from galaxy power spectrum\nmeasurements. I argue that a promising way forward should ultimately involve a\ncombination of early- and late-time (but non-local -- in a cosmological sense,\ni.e. at high redshift) new physics, as well as local (i.e. at $z \\sim 0$) new\nphysics, and I conclude by providing reflections with regards to potentially\ninteresting models which may also help with the $S_8$ tension.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:49:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vagnozzi","Sunny",""]]}
{"id":"2308.16629","submitter":"Katarzyna (Kasia) Tych","authors":"Laura-Marie Silbermann, Benjamin Vermeer, Sonja Schmid, Katarzyna\n  (Kasia) Tych","title":"The known unknowns of the Hsp90 chaperone","comments":"29 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM physics.bio-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Molecular chaperones are vital proteins that maintain protein homeostasis by\nassisting in protein folding, activation, degradation, and stress protection.\nAmong them, heat-shock protein 90 (Hsp90) stands out as an essential\nproteostasis hub in eukaryotes, chaperoning hundreds of \"clients\" (substrates).\nAfter decades of research, several \"known unknowns\" about the molecular\nfunction of Hsp90 remain unanswered, hampering rational drug design for the\ntreatment of cancers, neurodegenerative and other diseases. We highlight three\nfundamental open questions, reviewing the current state of the field for each,\nand discuss new opportunities, including single-molecule technologies, to\nanswer the known unknowns of the Hsp90 chaperone.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:51:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Silbermann","Laura-Marie","","Kasia"],["Vermeer","Benjamin","","Kasia"],["Schmid","Sonja","","Kasia"],["Katarzyna","","","Kasia"],["Tych","",""]]}
{"id":"2308.16630","submitter":"Joaqu\\'in D\\'iaz Boils","authors":"Joaquin Diaz Boils, Orlando Galdames Bravo","title":"A lattice-ordered monoid on multilayer networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.GR math.OA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the present paper we introduce a lattice-ordered partial monoid structure\non a suitable set of multilayer networks. We first study a kind of mappings\nthat preserve the partial order and describe the order structure. After that we\ndefine the lattice-ordered monoid and deduce the main properties.\nlattice-ordered monoid, multilayer network, interior mapping, partial\noperation.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:51:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Boils","Joaquin Diaz",""],["Bravo","Orlando Galdames",""]]}
{"id":"2308.16631","submitter":"Marceli Wac","authors":"Marceli Wac, Raul Santos-Rodriguez, Chris McWilliams and Christopher\n  Bourdeaux","title":"Strategies for engaging clinical participants in the co-design of\n  software for healthcare domains","comments":"4 pages, 4 figures, presented at Workgroup on Interactive Systems in\n  Healthcare (WISH) Symposium at ACM (Association of Computing Machinery) CHI\n  conference on Human Factors in Computing Systems in Hamburg 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Co-design is an effective method for designing software, but implementing it\nwithin the clinical setting comes with a set of unique challenges. This makes\nrecruitment and engagement of participants difficult, which has been\ndemonstrated in our study. Our work focused on designing and evaluating a data\nannotation tool, however, different types of interventions had to be carried\nout due to poor engagement with the study. We evaluated the effectiveness and\nfeasibility of each of these strategies, their applicability to different\nstages of co-design research and discussed the barriers to participation\npresent among participants from a clinical background.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 10:51:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wac","Marceli",""],["Santos-Rodriguez","Raul",""],["McWilliams","Chris",""],["Bourdeaux","Christopher",""]]}
{"id":"2308.16632","submitter":"Changli Wu","authors":"Changli Wu, Yiwei Ma, Qi Chen, Haowei Wang, Gen Luo, Jiayi Ji,\n  Xiaoshuai Sun","title":"3D-STMN: Dependency-Driven Superpoint-Text Matching Network for\n  End-to-End 3D Referring Expression Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 3D Referring Expression Segmentation (3D-RES), the earlier approach adopts\na two-stage paradigm, extracting segmentation proposals and then matching them\nwith referring expressions. However, this conventional paradigm encounters\nsignificant challenges, most notably in terms of the generation of lackluster\ninitial proposals and a pronounced deceleration in inference speed. Recognizing\nthese limitations, we introduce an innovative end-to-end Superpoint-Text\nMatching Network (3D-STMN) that is enriched by dependency-driven insights. One\nof the keystones of our model is the Superpoint-Text Matching (STM) mechanism.\nUnlike traditional methods that navigate through instance proposals, STM\ndirectly correlates linguistic indications with their respective superpoints,\nclusters of semantically related points. This architectural decision empowers\nour model to efficiently harness cross-modal semantic relationships, primarily\nleveraging densely annotated superpoint-text pairs, as opposed to the more\nsparse instance-text pairs. In pursuit of enhancing the role of text in guiding\nthe segmentation process, we further incorporate the Dependency-Driven\nInteraction (DDI) module to deepen the network's semantic comprehension of\nreferring expressions. Using the dependency trees as a beacon, this module\ndiscerns the intricate relationships between primary terms and their associated\ndescriptors in expressions, thereby elevating both the localization and\nsegmentation capacities of our model. Comprehensive experiments on the\nScanRefer benchmark reveal that our model not only set new performance\nstandards, registering an mIoU gain of 11.7 points but also achieve a\nstaggering enhancement in inference speed, surpassing traditional methods by\n95.7 times. The code and models are available at\nhttps://github.com/sosppxo/3D-STMN.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:00:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wu","Changli",""],["Ma","Yiwei",""],["Chen","Qi",""],["Wang","Haowei",""],["Luo","Gen",""],["Ji","Jiayi",""],["Sun","Xiaoshuai",""]]}
{"id":"2308.16633","submitter":"Chenwei Wang","authors":"Chenwei Wang, Xiaoyu Liu, Yulin Huang, Siyi Luo, Jifang Pei, Jianyu\n  Yang, Deqing Mao","title":"Semi-Supervised SAR ATR Framework with Transductive Auxiliary\n  Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Convolutional neural networks (CNNs) have achieved high performance in\nsynthetic aperture radar (SAR) automatic target recognition (ATR). However, the\nperformance of CNNs depends heavily on a large amount of training data. The\ninsufficiency of labeled training SAR images limits the recognition performance\nand even invalidates some ATR methods. Furthermore, under few labeled training\ndata, many existing CNNs are even ineffective. To address these challenges, we\npropose a Semi-supervised SAR ATR Framework with transductive Auxiliary\nSegmentation (SFAS). The proposed framework focuses on exploiting the\ntransductive generalization on available unlabeled samples with an auxiliary\nloss serving as a regularizer. Through auxiliary segmentation of unlabeled SAR\nsamples and information residue loss (IRL) in training, the framework can\nemploy the proposed training loop process and gradually exploit the information\ncompilation of recognition and segmentation to construct a helpful inductive\nbias and achieve high performance. Experiments conducted on the MSTAR dataset\nhave shown the effectiveness of our proposed SFAS for few-shot learning. The\nrecognition performance of 94.18\\% can be achieved under 20 training samples in\neach class with simultaneous accurate segmentation results. Facing variances of\nEOCs, the recognition ratios are higher than 88.00\\% when 10 training samples\neach class.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:00:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Chenwei",""],["Liu","Xiaoyu",""],["Huang","Yulin",""],["Luo","Siyi",""],["Pei","Jifang",""],["Yang","Jianyu",""],["Mao","Deqing",""]]}
{"id":"2308.16634","submitter":"Yu-Gang Ma","authors":"Y. T. Cao, X. G. Deng, Y. G. Ma","title":"Effect of initial-state geometric configurations on the nuclear\n  liquid-gas phase transition","comments":"10 pages, 8 figures","journal-ref":"Physical Review C 108, 024610 (2023)","doi":"10.1103/PhysRevC.108.024610","report-no":null,"categories":"nucl-th nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Within the framework of an extended quantum molecular dynamics model, we\nsimulated $^{40}$Ca + $^{16}$O collisions at beam energies ranging from 60 to\n150 MeV/nucleon for $^{16}$O with different $\\alpha$-cluster configurations.\nResults imply that different $\\alpha$-cluster configurations lead to different\nyields of deuteron, triton, $^3$He and $^4$He, but not for proton and neutron.\nWe discuss the effect of geometric fluctuations which are presented by double\nratios of light nuclei, namely $\\mathcal{O}_\\text{p-d-t}$ and\n$\\mathcal{O}_\\text{p-d-He}$. It is found that magnitude hierarchy of geometric\nfluctuations is chain, kite, square and tetrahedron structure of $^{16}$O.\n$\\mathcal{O}_\\text{p-d-t}$ has maximum value around 80 -- 100 MeV/nucleon which\ncould be related to liquid-gas phase transition, that is consistent with\nresults from the charge distribution of the heaviest fragments in the\ncollisions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:02:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cao","Y. T.",""],["Deng","X. G.",""],["Ma","Y. G.",""]]}
{"id":"2308.16635","submitter":"Jin Liu","authors":"Jin Liu, Xi Wang, Xiaomeng Fu, Yesheng Chai, Cai Yu, Jiao Dai, Jizhong\n  Han","title":"MFR-Net: Multi-faceted Responsive Listening Head Generation via\n  Denoising Diffusion Model","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":"  Face-to-face communication is a common scenario including roles of speakers\nand listeners. Most existing research methods focus on producing speaker\nvideos, while the generation of listener heads remains largely overlooked.\nResponsive listening head generation is an important task that aims to model\nface-to-face communication scenarios by generating a listener head video given\na speaker video and a listener head image. An ideal generated responsive\nlistening video should respond to the speaker with attitude or viewpoint\nexpressing while maintaining diversity in interaction patterns and accuracy in\nlistener identity information. To achieve this goal, we propose the\n\\textbf{M}ulti-\\textbf{F}aceted \\textbf{R}esponsive Listening Head Generation\nNetwork (MFR-Net). Specifically, MFR-Net employs the probabilistic denoising\ndiffusion model to predict diverse head pose and expression features. In order\nto perform multi-faceted response to the speaker video, while maintaining\naccurate listener identity preservation, we design the Feature Aggregation\nModule to boost listener identity features and fuse them with other\nspeaker-related features. Finally, a renderer finetuned with identity\nconsistency loss produces the final listening head videos. Our extensive\nexperiments demonstrate that MFR-Net not only achieves multi-faceted responses\nin diversity and speaker identity information but also in attitude and\nviewpoint expression.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:10:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Jin",""],["Wang","Xi",""],["Fu","Xiaomeng",""],["Chai","Yesheng",""],["Yu","Cai",""],["Dai","Jiao",""],["Han","Jizhong",""]]}
{"id":"2308.16636","submitter":"Yu-Gang Ma","authors":"Ru-XIn Cao, Song Zhang, Yu-Gang Ma","title":"Effects of the $\\alpha$-cluster structure and the intrinsic momentum\n  component of nuclei on the longitudinal asymmetry in relativistic heavy-ion\n  collisions","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The longitudinal asymmetry in relativistic heavy-ion collisions arises from\nthe fluctuation in the number of participating nucleons. This asymmetry causes\na rapidity shift in the center of mass of the participant zone. Both the\nrapidity shift and the longitudinal asymmetry have been found to be significant\nat the top LHC energy for collisions of identical nuclei. However, much\ndiscussion of the longitudinal asymmetry has treated the initial condition as a\nnon-zero momentum only contributed only by the number of participants, i.e.,\nthe asymmetry depends only on the number of participating nucleons. In this\nwork, we consider other effects on the longitudinal asymmetry other than\nfluctuation in the number of participants, e.g. the intrinsic momentum\ndistribution as well as $\\alpha$-clustering structure in the target or\nprojectile nuclei for the collisions in the framework of a multiphase transport\n(AMPT) model. By introducing systems with different $\\alpha$-clustering\nstructure and intrinsic momentum distribution, we calculated ratio of different\nsystems' rapidity distribution and extracted expansion coefficient to analyze\nthe difference contributed by these factors. And we investigated the possible\neffect of non-Gaussian distribution on the rapidity distribution. These results\nmay help us to constrain the initial conditions in ultra-relativistic heavy-ion\ncollisions, and suggest a quantitative correction on final state measurement\nand a possible correlation between the initial condition and the final-state\nobservable in LHC and RHIC energy.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:11:37 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cao","Ru-XIn",""],["Zhang","Song",""],["Ma","Yu-Gang",""]]}
{"id":"2308.16637","submitter":"Daniel Siegismund","authors":"Daniel Siegismund, Mario Wieser, Stephan Heyse, Stephan Steigele","title":"Learning Channel Importance for High Content Imaging with Interpretable\n  Deep Input Channel Mixing","comments":"Accepted @ DAGM German Conference on Pattern Recognition (GCPR) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV stat.ML","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Uncovering novel drug candidates for treating complex diseases remain one of\nthe most challenging tasks in early discovery research. To tackle this\nchallenge, biopharma research established a standardized high content imaging\nprotocol that tags different cellular compartments per image channel. In order\nto judge the experimental outcome, the scientist requires knowledge about the\nchannel importance with respect to a certain phenotype for decoding the\nunderlying biology. In contrast to traditional image analysis approaches, such\nexperiments are nowadays preferably analyzed by deep learning based approaches\nwhich, however, lack crucial information about the channel importance. To\novercome this limitation, we present a novel approach which utilizes\nmulti-spectral information of high content images to interpret a certain aspect\nof cellular biology. To this end, we base our method on image blending concepts\nwith alpha compositing for an arbitrary number of channels. More specifically,\nwe introduce DCMIX, a lightweight, scaleable and end-to-end trainable mixing\nlayer which enables interpretable predictions in high content imaging while\nretaining the benefits of deep learning based methods. We employ an extensive\nset of experiments on both MNIST and RXRX1 datasets, demonstrating that DCMIX\nlearns the biologically relevant channel importance without scarifying\nprediction performance.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:11:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Siegismund","Daniel",""],["Wieser","Mario",""],["Heyse","Stephan",""],["Steigele","Stephan",""]]}
{"id":"2308.16638","submitter":"Hasan Nayir","authors":"Hasan Nayir, Erhan Karakoca, Ali G\\\"or\\c{c}in, Khalid Qaraqe","title":"Channel Estimation Using RIDNet Assisted OMP for Hybrid-field THz\n  Massive MIMO Systems","comments":"Accepted to publication in ICC-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The terahertz (THz) band radio access with larger available bandwidth is\nanticipated to provide higher capacities for next-generation wireless\ncommunication systems. However, higher path loss at THz frequencies\nsignificantly limits the wireless communication range. Massive multiple-input\nmultiple-output (mMIMO) is an attractive technology to increase the Rayleigh\ndistance by generating higher gain beams using low wavelength and highly\ndirective antenna array aperture. In addition, both far-field and near-field\ncomponents of the antenna system should be considered for modelling THz\nelectromagnetic propagation, where the channel estimation for this environment\nbecomes a challenging task. This paper proposes a novel channel estimation\nmethod using a recursive information distillation network (RIDNet) together\nwith orthogonal matching pursuit (OMP) for hybrid-field THz mMIMO channels,\nincluding both far-field and near-field components. The simulation experiments\nare performed using the ray-tracing tool. The results indicate that the\nproposed RIDNet-based method consistently provides lower channel estimation\nerrors compared to the conventional OMP algorithm for all signal-to-noise ratio\n(SNR) regimes, and the performance gap becomes higher at low SNR regimes.\nFurthermore, the results imply that the same error performance of the OMP can\nbe achieved by the RIDNet-based method using a lower number of RF chains and\npilot symbols.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:15:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nayir","Hasan",""],["Karakoca","Erhan",""],["G\u00f6r\u00e7in","Ali",""],["Qaraqe","Khalid",""]]}
{"id":"2308.16639","submitter":"Anh Tung Nguyen","authors":"Anh Tung Nguyen, Andr\\'e M. H. Teixeira, Alexander Medvedev","title":"Security Allocation in Networked Control Systems under Stealthy Attacks","comments":"11 pages, 3 figures, and 1 table, journal submission","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 the problem of security allocation in a networked\ncontrol system under stealthy attacks in which the system is comprised of\ninterconnected subsystems represented by vertices. A malicious adversary\nselects a single vertex on which to conduct a stealthy data injection attack to\nmaximally disrupt the local performance while remaining undetected. On the\nother hand, a defender selects several vertices on which to allocate defense\nresources against the adversary. First, the objectives of the adversary and the\ndefender with uncertain targets are formulated in probabilistic ways, resulting\nin an expected worst-case impact of stealthy attacks. Next, we provide a\ngraph-theoretic necessary and sufficient condition under which the cost for the\ndefender and the expected worst-case impact of stealthy attacks are bounded.\nThis condition enables the defender to restrict the admissible actions to a\nsubset of available vertex sets. Then, we cast the problem of security\nallocation in a Stackelberg game-theoretic framework. Finally, the contribution\nof this paper is highlighted by utilizing the proposed admissible actions of\nthe defender in the context of large-scale networks. A numerical example of a\n50-vertex networked control system is presented to validate the obtained\nresults.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:16:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nguyen","Anh Tung",""],["Teixeira","Andr\u00e9 M. H.",""],["Medvedev","Alexander",""]]}
{"id":"2308.16640","submitter":"Liming Ling","authors":"Ling An and Liming Ling","title":"The Riemann-Hilbert approach for the integrable fractional\n  Fokas--Lenells equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a new integrable fractional Fokas--Lenells equation\nby using the completeness of the squared eigenfunctions, dispersion relation,\nand inverse scattering transform. To solve this equation, we employ the\nRiemann-Hilbert approach. Specifically, we focus on the case of the\nreflectionless potential with a simple pole for the zero boundary condition.\nAnd we provide the fractional $N$-soliton solution in determinant form.\nAdditionally, we prove the fractional one-soliton solution rigorously. Notably,\nwe demonstrate that as $|t|\\to\\infty$, the fractional $N$-soliton solution can\nbe expressed as a linear combination of $N$ fractional single-soliton\nsolutions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:23:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["An","Ling",""],["Ling","Liming",""]]}
{"id":"2308.16641","submitter":"Thiago Raszeja","authors":"Rodrigo Bissacot, Bruno Hideki Fukushima-Kimura, Rafael Pereira Lima,\n  Thiago Raszeja","title":"Gibbs Measures on Multidimensional Spaces. Equivalences and a Groupoid\n  Approach","comments":"arXiv admin note: text overlap with arXiv:2008.13727","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.DS math.MP math.OA math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider some of the main notions of Gibbs measures on subshifts\nintroduced by different communities, such as dynamical systems, probability,\noperator algebras, and mathematical physics. For potentials with $d$-summable\nvariation, we prove that several of the definitions considered by these\ncommunities are equivalent. In particular, when the subshift is of finite type\n(SFT), we show that all definitions coincide. In addition, we introduced a\ngroupoid approach to describe some Gibbs measures, allowing us to show the\nequivalence between Gibbs measures and KMS states (the quantum analogous to the\nGibbs measures).\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:23:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bissacot","Rodrigo",""],["Fukushima-Kimura","Bruno Hideki",""],["Lima","Rafael Pereira",""],["Raszeja","Thiago",""]]}
{"id":"2308.16642","submitter":"Liubov Markovich","authors":"L.A. Markovich and J. Borregaard","title":"High-Precision Observable Estimation with Single Qubit Quantum Memory","comments":"20 pages, 4 figures, 1 table. arXiv admin note: text overlap with\n  arXiv:2212.07710","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The estimation of multi-qubit observables is a key task in quantum\ninformation science. The standard approach is to decompose a multi-qubit\nobservable into a weighted sum of Pauli strings. The observable can then be\nestimated from projective single qubit measurements according to the Pauli\nstrings followed by a classical summation. As the number of Pauli strings in\nthe decomposition increases, shot-noise drastically builds up, and the accuracy\nof such estimation can be considerably compromised. Access to a single qubit\nquantum memory, where measurement data may be stored and accumulated can\ncircumvent the build-up of shot noise. Here, we describe a many-qubit\nobservable estimation approach to achieve this with a much lower number of\ninteractions between the multi-qubit device and the single qubit memory\ncompared to previous approaches. Our algorithm offers a reduction in the\nrequired number of measurements for a given target variance that scales\n$N^{\\frac{2}{3}}$ with the number of Pauli strings $N$ in the observable\ndecomposition. The low number of interactions between the multi-qubit device\nand the memory is desirable for noisy intermediate-scale quantum devices.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:32:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Markovich","L. A.",""],["Borregaard","J.",""]]}
{"id":"2308.16643","submitter":"Sharaa A Alqarni","authors":"Sharaa A. Alqarni, Jack D. Briscoe, Clare R. Higgins, Fraser D. Logue,\n  Danielle Pizzey, Thomas G. Robertson-Brown, Ifan G. Hughes","title":"A device for magnetic-field angle control in magneto-optical filters\n  using a solenoid-permanent magnet pair","comments":"8 pages, 6 figures","journal-ref":null,"doi":"10.15128/r2rb68xb893","report-no":null,"categories":"physics.optics physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Atomic bandpass filters are used in a variety of applications due to their\nnarrow bandwidths and high transmission at specific frequencies. Predominantly\nthese filters in the Faraday (Voigt) geometry, using an applied\naxial(transverse) magnetic field with respect to the laser propagation\ndirection. Recently, there has been interest in filters realized with\narbitrary-angle magnetic fields, which have been made by rotating permanent\nmagnets with respect to the $k$-vector of the interrogating laser beam.\nHowever, the magnetic-field angle achievable with this method is limited as\nfield uniformity across the cell decreases as the rotation angle increases. In\nthis work, we propose and demonstrate a new method of generating an\narbitrary-angle magnetic field, using a solenoid to produce a small, and easily\nalterable, axial field, in conjunction with fixed permanent magnets to produce\na large transverse field. We directly measure the fields produced by both\nmethods, finding them to be very similar over the length of the vapor cell. We\nthen compare the transmission profiles of filters produced using both methods,\nagain finding excellent agreement. Finally, we demonstrate the sensitivity of\nfilter profile to changing magnetic-field angle (solenoid current), which\nbecomes easier to exploit with the much improved angle control and precision\noffered by our new design.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:32:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Alqarni","Sharaa A.",""],["Briscoe","Jack D.",""],["Higgins","Clare R.",""],["Logue","Fraser D.",""],["Pizzey","Danielle",""],["Robertson-Brown","Thomas G.",""],["Hughes","Ifan G.",""]]}
{"id":"2308.16644","submitter":"Jonathan Partington","authors":"M. Cristina C\\^amara and Jonathan R. Partington","title":"Paired kernels and their applications","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper considers paired operators in the context of the Lebesgue Hilbert\nspace on the unit circle and its subspace, the Hardy space $H^2$. The kernels\nof such operators, together with their analytic projections, which are\ngeneralizations of Toeplitz kernels, are studied. Results on near-invariance\nproperties, representations, and inclusion relations for these kernels are\nobtained. The existence of a minimal Toeplitz kernel containing any projected\npaired kernel and, more generally, any nearly $S^*$-invariant subspace of\n$H^2$, is derived. The results are applied to describing the kernels of\nfinite-rank asymmetric truncated Toeplitz operators.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:32:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["C\u00e2mara","M. Cristina",""],["Partington","Jonathan R.",""]]}
{"id":"2308.16645","submitter":"Matt Tranter","authors":"J. S. Tamber and D. J. Chappell and J. C. Poore and M. R. Tranter","title":"Detecting Delamination via Nonlinear Wave Scattering in a Bonded Elastic\n  Bar","comments":"12 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we examine the effect of delamination on wave scattering, with\nthe aim of creating a control measure for layered waveguides of various bonding\ntypes. Previous works have considered specific widths of solitary waves for the\nsimulations, without analysing the effect of changing the soliton parameters.\nWe consider two multi-layered structures: one containing delamination\n\"sandwiched\" by perfect bonding and one containing delamination but\n\"sandwiched\" by soft bonding. These structures are modelled by coupled\nBoussinesq-type equations. Matched asymptotic multiple-scale expansions lead to\ncoupled Ostrovsky equations in soft bonded regions and Korteweg-De Vries\nequations in the perfectly bonded and delaminated region. We use the Inverse\nScattering Transform to predict the behaviour in the delaminated regions. In\nboth cases, numerical analysis shows that we can predict the delamination\nlength by changes in the wave structure, and that these changes depend upon the\nFull Width at Half Magnitude (FWHM) of the incident soliton. In the case of\nperfect bonding, we derive a theoretical prediction for the change and confirm\nthis numerically. For the soft bonding case, we numerically identify a similar\nrelationship using the change in amplitude. Therefore we only need to compute\none curve to determine the behaviour for any incident solitary wave, creating a\nframework for designing measurement campaigns for rigorously testing the\nintegrity of layered structures.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:33:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tamber","J. S.",""],["Chappell","D. J.",""],["Poore","J. C.",""],["Tranter","M. R.",""]]}
{"id":"2308.16646","submitter":"Yong Wang","authors":"Yong Wang, Changguo Xiao","title":"Hydrodynamic limit and Newtonian limit from the relativistic Boltzmann\n  equation to the classical Euler equations","comments":"63 pages. All comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The hydrodynamic limit and Newtonian limit are important in the relativistic\nkinetic theory. We justify rigorously the validity of the two independent\nlimits from the special relativistic Boltzmann equation to the classical Euler\nequations without assuming any dependence between the Knudsen number\n$\\varepsilon$ and the light speed $\\mathfrak{c}$. The convergence rates are\nalso obtained. This is achieved by Hilbert expansion of relativistic Boltzmann\nequation. New difficulties arise when tacking the uniform in $\\mathfrak{c}$ and\n$\\varepsilon$ estimates for the Hilbert expansion, which have been overcome by\nestablishing some uniform-in-$\\mathfrak{c}$ estimate for relativistic Boltzmann\noperators.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:36:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Yong",""],["Xiao","Changguo",""]]}
{"id":"2308.16647","submitter":"Malgorzata Bednarska","authors":"Ma{\\l}gorzata Bednarska-Bzd\\k{e}ga, Tomasz {\\L}uczak","title":"On size Ramsey numbers for a pair of cycles","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We show that there exists an absolute constant $A$ such that the size Ramsey\nnumber of a pair of cycles $(C_n$, $C_{2d})$, where $4\\le 2d\\le n$, is bounded\nfrom above by $An$. We also study the restricted size Ramsey number for such a\npair.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:42:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bednarska-Bzd\u0119ga","Ma\u0142gorzata",""],["\u0141uczak","Tomasz",""]]}
{"id":"2308.16648","submitter":"Elliot J. Crowley","authors":"Miguel Espinosa, Elliot J. Crowley","title":"Generate Your Own Scotland: Satellite Image Generation Conditioned on\n  Maps","comments":"13 pages, 6 figures. preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Despite recent advancements in image generation, diffusion models still\nremain largely underexplored in Earth Observation. In this paper we show that\nstate-of-the-art pretrained diffusion models can be conditioned on cartographic\ndata to generate realistic satellite images. We provide two large datasets of\npaired OpenStreetMap images and satellite views over the region of Mainland\nScotland and the Central Belt. We train a ControlNet model and qualitatively\nevaluate the results, demonstrating that both image quality and map fidelity\nare possible. Finally, we provide some insights on the opportunities and\nchallenges of applying these models for remote sensing. Our model weights and\ncode for creating the dataset are publicly available at\nhttps://github.com/miquel-espinosa/map-sat.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:44:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Espinosa","Miguel",""],["Crowley","Elliot J.",""]]}
{"id":"2308.16649","submitter":"Prateksha Udhayanan","authors":"Prateksha Udhayanan, Srikrishna Karanam, and Balaji Vasan Srinivasan","title":"Learning with Multi-modal Gradient Attention for Explainable Composed\n  Image Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of composed image retrieval that takes an input query\nconsisting of an image and a modification text indicating the desired changes\nto be made on the image and retrieves images that match these changes. Current\nstate-of-the-art techniques that address this problem use global features for\nthe retrieval, resulting in incorrect localization of the regions of interest\nto be modified because of the global nature of the features, more so in cases\nof real-world, in-the-wild images. Since modifier texts usually correspond to\nspecific local changes in an image, it is critical that models learn local\nfeatures to be able to both localize and retrieve better. To this end, our key\nnovelty is a new gradient-attention-based learning objective that explicitly\nforces the model to focus on the local regions of interest being modified in\neach retrieval step. We achieve this by first proposing a new visual image\nattention computation technique, which we call multi-modal gradient attention\n(MMGrad) that is explicitly conditioned on the modifier text. We next\ndemonstrate how MMGrad can be incorporated into an end-to-end model training\nstrategy with a new learning objective that explicitly forces these MMGrad\nattention maps to highlight the correct local regions corresponding to the\nmodifier text. By training retrieval models with this new loss function, we\nshow improved grounding by means of better visual attention maps, leading to\nbetter explainability of the models as well as competitive quantitative\nretrieval performance on standard benchmark datasets.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:46:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Udhayanan","Prateksha",""],["Karanam","Srikrishna",""],["Srinivasan","Balaji Vasan",""]]}
{"id":"2308.16650","submitter":"David Azriel","authors":"Almog Peer, David Azriel","title":"Optimal confidence interval for the difference of proportions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Estimating the probability of the binomial distribution is a basic problem,\nwhich appears in almost all introductory statistics courses and is performed\nfrequently in various studies. In some cases, the parameter of interest is a\ndifference between two probabilities, and the current work studies the\nconstruction of confidence intervals for this parameter when the sample size is\nsmall. Our goal is to find the shortest confidence intervals under the\nconstraint of coverage probability being larger than a predetermined level. For\nthe two-sample case, there is no known algorithm that achieves this goal, but\ndifferent heuristics procedures have been suggested, and the present work aims\nat finding optimal confidence intervals. In the one-sample case, there is a\nknown algorithm that finds optimal confidence intervals presented by Blyth and\nStill (1983). It is based on solving small and local optimization problems and\nthen using an inversion step to find the global optimum solution. We show that\nthis approach fails in the two-sample case and therefore, in order to find\noptimal confidence intervals, one needs to solve a global optimization problem,\nrather than small and local ones, which is computationally much harder. We\npresent and discuss the suitable global optimization problem. Using the Gurobi\npackage we find near-optimal solutions when the sample sizes are smaller than\n15, and we compare these solutions to some existing methods, both approximate\nand exact. We find that the improvement in terms of lengths with respect to the\nbest competitor varies between 1.5\\% and 5\\% for different parameters of the\nproblem. Therefore, we recommend the use of the new confidence intervals when\nboth sample sizes are smaller than 15. Tables of the confidence intervals are\ngiven in the Excel file in this link.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:49:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Peer","Almog",""],["Azriel","David",""]]}
{"id":"2308.16651","submitter":"Ishay Be'ery","authors":"Gal Shitrit, Ishay Be'ery, Ido Yerhushalmy","title":"SoccerNet 2023 Tracking Challenge -- 3rd place MOT4MOT Team Technical\n  Report","comments":"3 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The SoccerNet 2023 tracking challenge requires the detection and tracking of\nsoccer players and the ball. In this work, we present our approach to tackle\nthese tasks separately. We employ a state-of-the-art online multi-object\ntracker and a contemporary object detector for player tracking. To overcome the\nlimitations of our online approach, we incorporate a post-processing stage\nusing interpolation and appearance-free track merging. Additionally, an\nappearance-based track merging technique is used to handle the termination and\ncreation of tracks far from the image boundaries. Ball tracking is formulated\nas single object detection, and a fine-tuned YOLOv8l detector with proprietary\nfiltering improves the detection precision. Our method achieves 3rd place on\nthe SoccerNet 2023 tracking challenge with a HOTA score of 66.27.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:51:16 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shitrit","Gal",""],["Be'ery","Ishay",""],["Yerhushalmy","Ido",""]]}
{"id":"2308.16652","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Azimuthal angle correlations of muons produced via heavy-flavor decays\n  in 5.02 TeV Pb+Pb and $pp$ collisions with the ATLAS detector","comments":"33 pages in total, author list starting page 15, 4 figures, submitted\n  to Phys. Rev. Lett. All figures including auxiliary figures are available at\n  https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/HION-2022-19","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-185","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Angular correlations between heavy-quarks provide a unique probe of the\nquark-gluon plasma created in ultra-relativistic heavy-ion collisions. Results\nare presented of a measurement of the azimuthal angle correlations between\nmuons originating from semileptonic decays of heavy-quarks produced in 5.02 TeV\nPb+Pb and $pp$ collisions at the LHC. The muons are measured with transverse\nmomenta and pseudorapidities satisfying $p_{\\mathrm{T}}^\\mu > 4$ GeV and\n$|\\eta^\\mu|<2.4$, respectively. The distributions of azimuthal angle\nseparation, $\\Delta\\phi$, for muon pairs having pseudorapidity separation\n$|\\Delta\\eta|>0.8$, are measured in different Pb+Pb centrality intervals and\ncompared to the same distribution measured in $pp$ collisions at the same\ncenter-of-mass energy. Results are presented separately for muon pairs with\nopposite-sign charges, same-sign charges, and all pairs. A clear peak is\nobserved in all $\\Delta\\phi$ distributions at $\\Delta\\phi\\sim\\pi$, consistent\nwith the parent heavy-quark pairs being produced via hard-scattering processes.\nThe widths of that peak, characterized using Cauchy-Lorentz fits to the\n$\\Delta\\phi$ distributions, are found to not vary significantly as a function\nof Pb+Pb collision centrality and are similar for $pp$ and Pb+Pb collisions.\nThis observation will provide important constraints on theoretical descriptions\nof heavy-quark interactions with the quark-gluon plasma.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:51:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.16653","submitter":"Krishna Menon P","authors":"Priyavrat Deshpande and Krishna Menon","title":"Sketches, moves and partitions: counting regions of deformations of\n  reflection arrangements","comments":"49 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The collection of reflecting hyperplanes of a finite Coxeter group is called\na reflection arrangement and it appears in many subareas of combinatorics and\nrepresentation theory. We focus on the problem of counting regions of\nreflection arrangements and their deformations. Inspired by the recent work of\nBernardi, we show that the notion of moves and sketches can be used to provide\na uniform and explicit bijection between regions of (the Catalan deformation\nof) a reflection arrangement and certain non-nesting partitions. We then use\nthe exponential formula to describe a statistic on these partitions such that\ndistribution is given by the coefficients of the characteristic polynomial.\nFinally, we consider a sub-arrangement of type C arrangement called the\nthreshold arrangement and its Catalan and Shi deformations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:51:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Deshpande","Priyavrat",""],["Menon","Krishna",""]]}
{"id":"2308.16654","submitter":"Emma Van Der Minne","authors":"Emma van der Minne, Lucas Korol, Lidewij M.A. Krakers, Michael\n  Verhage, Carlos M. M. Ros\\'ario, Thijs J. Roskamp, Raymond J. Spiteri, Chiara\n  Biz, Mauro Fianchini, Guus Rijnders, Kees Flipse, Jose Gracia, Guido Mul,\n  Hans Hilgenkamp, Robert J. Green, Gertjan Koster, Christoph Baeumer","title":"Beyond domain alignment: Revealing the effect of intrinsic magnetic\n  order on electrochemical water splitting","comments":"The following article will be submitted to Applied Physics Reviews.\n  Main text (incl. references) 19 pages, 8 figures. Supplementary text 9 pages,\n  13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To reach a long term viable green hydrogen economy, rational design of active\noxygen evolution reaction (OER) catalysts is critical. An important hurdle in\nthis reaction originates from the fact that the reactants are singlet\nmolecules, whereas the oxygen molecule has a triplet ground state with parallel\nspin alignment, implying that magnetic order in the catalyst is essential.\nAccordingly, multiple experimentalists reported a positive effect of external\nmagnetic fields on OER activity of ferromagnetic catalysts. However, it remains\na challenge to investigate the influence of the intrinsic magnetic order on\ncatalytic activity. Here, we tuned the intrinsic magnetic order of epitaxial\nLa$_{0.67}$Sr$_{0.33}$MnO$_{3}$ thin film model catalysts from ferro- to\nparamagnetic by changing the temperature in-situ during water electrolysis.\nUsing this strategy, we show that ferromagnetic ordering below the Curie\ntemperature enhances OER activity. Moreover, we show a slight current density\nenhancement upon application of an external magnetic field and find that the\ndependence of magnetic field direction correlates with the magnetic anisotropy\nin the catalyst film. Our work thus suggests that both the intrinsic magnetic\norder in La$_{0.67}$Sr$_{0.33}$MnO$_{3}$ films and magnetic domain alignment\nincrease their catalytic activity. We observe no long-range magnetic order at\nthe catalytic surface, implying that the OER enhancement is connected to the\nmagnetic order of the bulk catalyst. Combining the effects found with existing\nliterature, we propose a unifying picture for the spin-polarized enhancement in\nmagnetic oxide catalysts.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:53:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["van der Minne","Emma",""],["Korol","Lucas",""],["Krakers","Lidewij M. A.",""],["Verhage","Michael",""],["Ros\u00e1rio","Carlos M. M.",""],["Roskamp","Thijs J.",""],["Spiteri","Raymond J.",""],["Biz","Chiara",""],["Fianchini","Mauro",""],["Rijnders","Guus",""],["Flipse","Kees",""],["Gracia","Jose",""],["Mul","Guido",""],["Hilgenkamp","Hans",""],["Green","Robert J.",""],["Koster","Gertjan",""],["Baeumer","Christoph",""]]}
{"id":"2308.16655","submitter":"Katarina Luki\\'c","authors":"Katarina Luki\\'c","title":"The Jacobi-orthogonality in indefinite scalar product spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize the property of Jacobi-orthogonality to indefinite scalar\nproduct spaces. We compare various principles and investigate relations between\nOsserman, Jacobi-dual, and Jacobi-orthogonal algebraic curvature tensors. We\nshow that every quasi-Clifford tensor is Jacobi-orthogonal. We prove that a\nJacobi-diagonalizable Jacobi-orthogonal tensor is Jacobi-dual whenever J_X has\nno null eigenvectors for all nonnull X. We show that any algebraic curvature\ntensor of dimension 3 is Jacobi-orthogonal if and only if it is of constant\nsectional curvature. We prove that every 4-dimensional Jacobi-diagonalizable\nalgebraic curvature tensor is Jacobi-orthogonal if and only if it is Osserman.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:54:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Luki\u0107","Katarina",""]]}
{"id":"2308.16656","submitter":"Ga\\'etan Facchinetti","authors":"Ga\\'etan Facchinetti, Laura Lopez-Honorez, Yuxiang Qin, Andrei\n  Mesinger","title":"21cm signal sensitivity to dark matter decay","comments":"33 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The redshifted 21cm signal from the Cosmic Dawn is expected to provide\nunprecedented insights into early Universe astrophysics and cosmology. Here we\nexplore how dark matter can heat the intergalactic medium before the first\ngalaxies, leaving a distinctive imprint in the 21cm power spectrum. We provide\nthe first dedicated Fisher matrix forecasts on the sensitivity of the Hydrogen\nEpoch of Reionization Array (HERA) telescope to dark matter decays. We show\nthat with 1000 hours of observation, HERA has the potential to improve current\ncosmological constraints on the dark matter decay lifetime by up to three\norders of magnitude. Even in extreme scenarios with strong X-ray emission from\nearly-forming, metal-free galaxies, the bounds on the decay lifetime would be\nimproved by up to two orders of magnitude. Overall, HERA shall improve on\nexisting limits for dark matter masses below $2$ GeV$/c^2$ for decays into\n$e^+e^-$ and below few MeV$/c^2$ for decays into photons.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:57:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Facchinetti","Ga\u00e9tan",""],["Lopez-Honorez","Laura",""],["Qin","Yuxiang",""],["Mesinger","Andrei",""]]}
{"id":"2308.16657","submitter":"Yuan-Yao He","authors":"Yu-Feng Song, Youjin Deng, Yuan-Yao He","title":"Demystify the mixed-parity pairing of attractive fermions with\n  spin-orbit coupling in optical lattice","comments":"14 pages, 11+5 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":"  The admixture of spin-singlet and spin-triplet pairing states in\nsuperconductors can be typically induced by breaking spatial inversion\nsymmetry. Employing the {\\it numerically exact} auxiliary-field Quantum Monte\nCarlo method, we study such mixed-parity pairing phenomena of attractive\nfermions with Rashba spin-orbit coupling (SOC) in two-dimensional optical\nlattice at finite temperature. We systematically demystify the evolution of the\nessential pairing structure in both singlet and triplet channels versus the\ntemperature, fermion filling, SOC and interaction strengths, via computing the\ncondensate fraction and pair wave function. Our numerical results reveal that\nthe singlet channel dominates in the fermion pairing and the triplet pairing\nhas relatively small contribution to the superfluidity for physically relevant\nparameters. In contrast to the singlet channel mainly consisted of the on-site\nCooper pairs, the triplet pairing has plentiful patterns in real space with the\nlargest contributions from several nearest neighbors. As the SOC strengh\nincreases, the pairing correlation is firstly enhanced and then suppressed for\ntriplet pairing while it's simply weakened in singlet channel. We have also\nobtained the Berezinskii-Kosterlitz-Thouless transition temperatures through\nthe finite-size analysis of condensate fraction. Our results can serve as\nquantitative guide for future optical lattice experiments as well as accurate\nbenchmarks for theories and other numerical methods.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:58:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Song","Yu-Feng",""],["Deng","Youjin",""],["He","Yuan-Yao",""]]}
{"id":"2308.16658","submitter":"Hans-Dieter Lang","authors":"Hans-Dieter Lang, Michel A. Nyffenegger, Heinz Mathis and Xingqi Zhang","title":"Investigating Sparse Reconfigurable Intelligent Surfaces (SRIS) via\n  Maximum Power Transfer Efficiency Method Based on Convex Relaxation","comments":"EuCAP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reconfigurable intelligent surfaces (RISs) are widely considered to become an\nintegral part of future wireless communication systems. Various methodologies\nexist to design such surfaces; however, most consider or require a very large\nnumber of tunable components. This not only raises system complexity, but also\nsignificantly increases power consumption. Sparse RISs (SRISs) consider using a\nsmaller or even minimal number of tunable components to improve overall\nefficiency while maintaining sufficient RIS capability. The versatile\nsemidefinite relaxation-based optimization method previously applied to\ntransmit array antennas is adapted and applied accordingly, to evaluate the\npotential of different SRIS configurations. Because the relaxation is tight in\nall cases, the maximum possible performance is found reliably. Hence, with this\napproach, the trade-off between performance and sparseness of SRIS can be\nanalyzed. Preliminary results show that even a much smaller number of\nreconfigurable elements, e.g. only 50%, can still have a significant impact.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:58:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lang","Hans-Dieter",""],["Nyffenegger","Michel A.",""],["Mathis","Heinz",""],["Zhang","Xingqi",""]]}
{"id":"2308.16659","submitter":"Abhirami Harilal","authors":"Abhirami Harilal, Kyungmin Park, Michael Andrews and Manfred Paulini\n  (on behalf of the CMS Collaboration)","title":"Autoencoder-based Online Data Quality Monitoring for the CMS\n  Electromagnetic Calorimeter","comments":"Submitted to the Proceedings of 21st International Workshop on\n  Advanced Computing and Analysis Techniques in Physics Research ACAT 2022\n  conference","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det cs.LG hep-ex physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The online Data Quality Monitoring system (DQM) of the CMS electromagnetic\ncalorimeter (ECAL) is a crucial operational tool that allows ECAL experts to\nquickly identify, localize, and diagnose a broad range of detector issues that\nwould otherwise hinder physics-quality data taking. Although the existing ECAL\nDQM system has been continuously updated to respond to new problems, it remains\none step behind newer and unforeseen issues. Using unsupervised deep learning,\na real-time autoencoder-based anomaly detection system is developed that is\nable to detect ECAL anomalies unseen in past data. After accounting for spatial\nvariations in the response of the ECAL and the temporal evolution of anomalies,\nthe new system is able to efficiently detect anomalies while maintaining an\nestimated false discovery rate between $10^{-2}$ to $10^{-4}$, beating existing\nbenchmarks by about two orders of magnitude. The real-world performance of the\nsystem is validated using anomalies found in 2018 and 2022 LHC collision data.\nAdditionally, first results from deploying the autoencoder-based system in the\nCMS online DQM workflow for the ECAL barrel during Run 3 of the LHC are\npresented, showing its promising performance in detecting obscure issues that\ncould have been missed in the existing DQM system.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:58:13 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Harilal","Abhirami","","on behalf of the CMS Collaboration"],["Park","Kyungmin","","on behalf of the CMS Collaboration"],["Andrews","Michael","","on behalf of the CMS Collaboration"],["Paulini","Manfred","","on behalf of the CMS Collaboration"]]}
{"id":"2308.16660","submitter":"Julia Lenczewska","authors":"Wojciech Cygan, Tomasz Grzywny, Julia Lenczewska","title":"Asymptotics and geometric flows for a class of nonlocal curvatures","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a family of nonlocal curvatures determined through a kernel which\nis symmetric and bounded from above by a radial and radially non-increasing\nprofile. It turns out that such definition encompasses various variants of\nnonlocal curvatures that have already appeared in the literature, including\nfractional curvature and anisotropic fractional curvature. The main task\nundertaken in the article is to study the limit behaviour of the introduced\nnonlocal curvatures under an appropriate limiting procedure. This enables us to\nrecover known asymptotic results e.g. for fractional curvature, but also for\nanisotropic fractional curvature where we identify the limit object as a\ncurvature being the first variation of the related anisotropic perimeter. Our\nother goal is to prove existence, uniqueness and stability of viscosity\nsolutions to the corresponding level-set parabolic Cauchy problem formulated in\nterms of the investigated nonlocal curvature.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 11:58:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cygan","Wojciech",""],["Grzywny","Tomasz",""],["Lenczewska","Julia",""]]}
{"id":"2308.16661","submitter":"Hasan Abu-Rasheed","authors":"Hasan Abu-Rasheed, Christian Weber and Madjid Fathi","title":"Context based learning: a survey of contextual indicators for\n  personalized and adaptive learning recommendations. A pedagogical and\n  technical perspective","comments":null,"journal-ref":"Front. Educ. 8:1210968 (2023)","doi":"10.3389/feduc.2023.1210968","report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning personalization has proven its effectiveness in enhancing learner\nperformance. Therefore, modern digital learning platforms have been\nincreasingly depending on recommendation systems to offer learners personalized\nsuggestions of learning materials. Learners can utilize those recommendations\nto acquire certain skills for the labor market or for their formal education.\nPersonalization can be based on several factors, such as personal preference,\nsocial connections or learning context. In an educational environment, the\nlearning context plays an important role in generating sound recommendations,\nwhich not only fulfill the preferences of the learner, but also correspond to\nthe pedagogical goals of the learning process. This is because a learning\ncontext describes the actual situation of the learner at the moment of\nrequesting a learning recommendation. It provides information about the learner\ncurrent state of knowledge, goal orientation, motivation, needs, available\ntime, and other factors that reflect their status and may influence how\nlearning recommendations are perceived and utilized. Context aware recommender\nsystems have the potential to reflect the logic that a learning expert may\nfollow in recommending materials to students with respect to their status and\nneeds. In this paper, we review the state-of-the-art approaches for defining a\nuser learning-context. We provide an overview of the definitions available, as\nwell as the different factors that are considered when defining a context.\nMoreover, we further investigate the links between those factors and their\npedagogical foundations in learning theories. We aim to provide a comprehensive\nunderstanding of contextualized learning from both pedagogical and technical\npoints of view. By combining those two viewpoints, we aim to bridge a gap\nbetween both domains, in terms of contextualizing learning recommendations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:00:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Abu-Rasheed","Hasan",""],["Weber","Christian",""],["Fathi","Madjid",""]]}
{"id":"2308.16662","submitter":"Rodrigo Jaeschke-Ubiergo","authors":"R. Jaeschke-Ubiergo, V.K. Bharadwaj, L. \\v{S}mejkal and Jairo Sinova","title":"Supercell Altermagnets","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Altermagnets are compensated magnets with unconvetional $d$, $g$ and $i$-wave\nspin-channel order in reciprocal space. So far the search for new altermagnetic\ncandidates has been focused on materials in which the magnetic unit cell is\nidentical to the non-magnetic one, i.e. magnetic structures with zero\npropagation vector. Here, we substantially broaden the family of altermagnetic\ncandidates by predicting supercell altermagnets. Their magnetic unit cell is\nconstructed by enlarging the paramagnetic primitive unit cell, resulting in a\nnon-zero propagation vector for the magnetic structure. This connection of the\nmagnetic configuration to the ordering of sublattices gives an extra degree of\nfreedom to supercell altermagnets, which can allow for the control over the\norder parameter spatial orientation. We identify realistic candidates MnSe$_2$\nwith a $d$-wave order, and RbCoBr$_3$, CsCoCr$_3$, and BaMnO$_3$ with $g$-wave\norder. We demonstrate the reorientation of the order parameter in MnSe$_2$,\nwhich has two different magnetic configurations, whose energy difference is\nonly 5 meV, opening the possibility of controlling the orientation of the\naltermagnetic order parameter by external perturbations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:01:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jaeschke-Ubiergo","R.",""],["Bharadwaj","V. K.",""],["\u0160mejkal","L.",""],["Sinova","Jairo",""]]}
{"id":"2308.16663","submitter":"Andrea Bracco","authors":"Andrea Bracco, Marco Padovani, Juan D. Soler","title":"The Orion-Taurus ridge: a synchrotron radio loop at the edge of the\n  Orion-Eridanus superbubble","comments":"Accepted for publication in Astronomy & Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large-scale synchrotron loops are recognized as the main source of diffuse\nradio-continuum emission in the Galaxy at intermediate and high Galactic\nlatitudes. Their origin, however, remains rather unexplained. Using a\ncombination of multi-frequency data in the radio band of total and polarized\nintensities, for the first time in this letter, we associate one arc --\nhereafter, the Orion-Taurus ridge -- with the wall of the most prominent\nstellar-feedback blown shell in the Solar neighborhood, namely the\nOrion-Eridanus superbubble. We traced the Orion-Taurus ridge using 3D maps of\ninterstellar dust extinction and column-density maps of molecular gas, $N_{\\rm\nH_2}$. We found the Orion-Taurus ridge at a distance of 400\\,pc, with a\nplane-of-the-sky extent of $180$\\,pc. Its median $N_{\\rm H_2}$ value is\n$(1.4^{+2.6}_{-0.6})\\times 10^{21}$ cm$^{-2}$. Thanks to the broadband\nobservations below 100 MHz of the Long Wavelength Array, we also computed the\nlow-frequency spectral-index map of synchrotron emissivity, $\\beta$, in the\nOrion-Taurus ridge. We found a flat distribution of $\\beta$ with a median value\nof $-2.24^{+0.03}_{-0.02}$ that we interpreted in terms of depletion of\nlow-energy ($<$ GeV) cosmic-ray electrons in recent supernova remnants ($10^5$\n- $10^6$ yrs). Our results are consistent with plane-of-the-sky magnetic-field\nstrengths in the Orion-Taurus ridge larger than a few tens of $\\mu$G ($> 30 -\n40 \\,\\mu$G). We report the first detection of diffuse synchrotron emission from\ncold-neutral, partly molecular, gas in the surroundings of the Orion-Eridanus\nsuperbubble. This observation opens a new perspective to study the multiphase\nand magnetized interstellar medium with the advent of future high-sensitivity\nradio facilities, such as the C-Band All-Sky Survey and the Square Kilometre\nArray.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:12:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bracco","Andrea",""],["Padovani","Marco",""],["Soler","Juan D.",""]]}
{"id":"2308.16664","submitter":"Oleksandr Kyriienko","authors":"Chukwudubem Umeano, Annie E. Paine, Vincent E. Elfving, Oleksandr\n  Kyriienko","title":"What can we learn from quantum convolutional neural networks?","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We can learn from analyzing quantum convolutional neural networks (QCNNs)\nthat: 1) working with quantum data can be perceived as embedding physical\nsystem parameters through a hidden feature map; 2) their high performance for\nquantum phase recognition can be attributed to generation of a very suitable\nbasis set during the ground state embedding, where quantum criticality of spin\nmodels leads to basis functions with rapidly changing features; 3) pooling\nlayers of QCNNs are responsible for picking those basis functions that can\ncontribute to forming a high-performing decision boundary, and the learning\nprocess corresponds to adapting the measurement such that few-qubit operators\nare mapped to full-register observables; 4) generalization of QCNN models\nstrongly depends on the embedding type, and that rotation-based feature maps\nwith the Fourier basis require careful feature engineering; 5) accuracy and\ngeneralization of QCNNs with readout based on a limited number of shots favor\nthe ground state embeddings and associated physics-informed models. We\ndemonstrate these points in simulation, where our results shed light on\nclassification for physical processes, relevant for applications in sensing.\nFinally, we show that QCNNs with properly chosen ground state embeddings can be\nused for fluid dynamics problems, expressing shock wave solutions with good\ngeneralization and proven trainability.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:12:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Umeano","Chukwudubem",""],["Paine","Annie E.",""],["Elfving","Vincent E.",""],["Kyriienko","Oleksandr",""]]}
{"id":"2308.16665","submitter":"Pierre-Alain Mo\\\"ellic","authors":"Clement Gaine, Pierre-Alain Moellic, Olivier Potin, Jean-Max Dutertre","title":"Fault Injection on Embedded Neural Networks: Impact of a Single\n  Instruction Skip","comments":"Accepted at DSD 2023 for AHSA Special Session","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With the large-scale integration and use of neural network models, especially\nin critical embedded systems, their security assessment to guarantee their\nreliability is becoming an urgent need. More particularly, models deployed in\nembedded platforms, such as 32-bit microcontrollers, are physically accessible\nby adversaries and therefore vulnerable to hardware disturbances. We present\nthe first set of experiments on the use of two fault injection means,\nelectromagnetic and laser injections, applied on neural networks models\nembedded on a Cortex M4 32-bit microcontroller platform. Contrary to most of\nstate-of-the-art works dedicated to the alteration of the internal parameters\nor input values, our goal is to simulate and experimentally demonstrate the\nimpact of a specific fault model that is instruction skip. For that purpose, we\nassessed several modification attacks on the control flow of a neural network\ninference. We reveal integrity threats by targeting several steps in the\ninference program of typical convolutional neural network models, which may be\nexploited by an attacker to alter the predictions of the target models with\ndifferent adversarial goals.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:14:37 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gaine","Clement",""],["Moellic","Pierre-Alain",""],["Potin","Olivier",""],["Dutertre","Jean-Max",""]]}
{"id":"2308.16666","submitter":"Carlos Andres Agudelo Serna","authors":"Carlos Andres Agudelo Serna","title":"Study of Zero-Knowledge protocols and Elliptic Curve Cryptography and\n  their implementation in Smart Card environments using Java Card","comments":"16 pages, in Spanish","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper studies the problem of Zero-Knowledge Protocol (ZKP) and elliptic\ncurve cryptographic implementation in a computationally limited environment,\nsuch as, the smart cards, using Java Card. Besides that, it is explained how\nthe zero-knowledge protocol was selected to implement it on a smart card and\nhow the benchmarking was conducted to select this protocol. The paper also\nshows a theoretical development to implement the ZKP protocol using elliptic\ncurve cryptography. Keywords: Authentication; Zero-knowledge; Cryptography;\nElliptic Curve; Java card; Smart cards\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:15:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Serna","Carlos Andres Agudelo",""]]}
{"id":"2308.16667","submitter":"Eduardo Gutierrez-Prieto","authors":"Eduardo Gutierrez-Prieto, Michael Gomez, Pedro M. Reis","title":"Gyrophilia: Harnessing Centrifugal and Euler Forces for Tunable Buckling\n  of a Rotating Elastica","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We investigate the geometrically nonlinear deformation and buckling of a\nslender elastic beam subject to time-dependent `fictitious' (non-inertial)\nforces arising from unsteady rotation. Using a rotary apparatus that accurately\nimposes an angular acceleration around a fixed axis, we demonstrate that\ncentrifugal and Euler forces can be combined to produce tunable structural\ndeformation. Specifically, using an imposed acceleration ramp, the buckling\nonset of a cantilevered beam can be precisely tuned and its deformation\ndirection selected. In a second configuration, a pre-arched beam can be made to\nsnap, on demand, between its two stable states. We also formulate a theoretical\nmodel rooted in Euler's elastica that rationalizes the problem and provides\npredictions in excellent quantitative agreement with the experimental data. Our\nfindings demonstrate an innovative approach to programmable actuation of\nslender rotating structures.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:18:13 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gutierrez-Prieto","Eduardo",""],["Gomez","Michael",""],["Reis","Pedro M.",""]]}
{"id":"2308.16668","submitter":"Sourav Sen","authors":"Apurba Das and Sourav Sen","title":"$2$-term averaging $L_\\infty$-algebras and non-abelian extensions of\n  averaging Lie algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, averaging operators on Lie algebras (also called embedding\ntensors in the physics literature) and associated tensor hierarchies form an\nefficient tool for constructing supergravity and higher gauge theories. A Lie\nalgebra with an averaging operator is called an averaging Lie algebra. In the\npresent paper, we introduce $2$-term averaging $L_\\infty$-algebras and give\ncharacterizations of some particular classes of such homotopy algebras. Next,\nwe study non-abelian extensions of an averaging Lie algebra by another\naveraging Lie algebra. We define the second non-abelian cohomology group to\nclassify the equivalence classes of such non-abelian extensions. Next, given a\nnon-abelian extension of averaging Lie algebras, we show that the obstruction\nfor a pair of averaging Lie algebra automorphisms to be inducible can be seen\nas the image of a suitable Wells map. Finally, we discuss the Wells short exact\nsequence in the above context.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:20:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Das","Apurba",""],["Sen","Sourav",""]]}
{"id":"2308.16669","submitter":"Alison Mitchell","authors":"A. M. W. Mitchell, S. Caroff (for the H.E.S.S. collaboration)","title":"Modelling of highly extended Gamma-ray emission around the Geminga\n  Pulsar as detected with H.E.S.S","comments":"8 pages, 5 figures. In proceedings of ICRC2023 (see also\n  arXiv:2304.02631)","journal-ref":"Proceedings of the 38th International Cosmic Ray Conference\n  (ICRC2023) PoS(ICRC2023)590","doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Geminga is an enigmatic radio-quiet gamma-ray pulsar located at a mere 250 pc\ndistance from Earth. Extended very-high-energy gamma-ray emission around the\npulsar has been detected by multiple water Cherenkov detector based\ninstruments. However, the detection of extended TeV gamma-ray emission around\nthe Geminga pulsar has proven challenging for IACTs due to the angular scale\nexceeding the typical field-of-view. By detailed studies of background\nestimation techniques and characterising systematic effects, a detection of\nhighly extended TeV gamma-ray emission could be confirmed by the H.E.S.S. IACT\narray. Building on the previously announced detection, in this contribution we\nfurther characterise the emission and apply an electron diffusion model to the\ncombined gamma-ray data from the H.E.S.S. and HAWC experiments, as well as\nX-ray data from XMM-Newton.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:22:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mitchell","A. M. W.","","for the H.E.S.S. collaboration"],["Caroff","S.","","for the H.E.S.S. collaboration"]]}
{"id":"2308.16670","submitter":"V\\'ictor J. Exp\\'osito Jim\\'enez","authors":"V\\'ictor J. Exp\\'osito Jim\\'enez, Bernhard Winkler, Joaquim M.\n  Castella Triginer, Heiko Scharke, Hannes Schneider, Eugen Brenner, Georg\n  Macher","title":"Safety of the Intended Functionality Concept Integration into a\n  Validation Tool Suite","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nowadays, the increasing complexity of Advanced Driver Assistance Systems\n(ADAS) and Automated Driving (AD) means that the industry must move towards a\nscenario-based approach to validation rather than relying on established\ntechnology-based methods. This new focus also requires the validation process\nto take into account Safety of the Intended Functionality (SOTIF), as many\nscenarios may trigger hazardous vehicle behaviour. Thus, this work demonstrates\nhow the integration of the SOTIF process within an existing validation tool\nsuite can be achieved. The necessary adaptations are explained with\naccompanying examples to aid comprehension of the approach.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:22:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jim\u00e9nez","V\u00edctor J. Exp\u00f3sito",""],["Winkler","Bernhard",""],["Triginer","Joaquim M. Castella",""],["Scharke","Heiko",""],["Schneider","Hannes",""],["Brenner","Eugen",""],["Macher","Georg",""]]}
{"id":"2308.16671","submitter":"Shenglong Zhou","authors":"Shenglong Zhou, Kaidi Xu, Geoffrey Ye Li","title":"Communication-Efficient Decentralized Federated Learning via One-Bit\n  Compressive Sensing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Decentralized federated learning (DFL) has gained popularity due to its\npracticality across various applications. Compared to the centralized version,\ntraining a shared model among a large number of nodes in DFL is more\nchallenging, as there is no central server to coordinate the training process.\nEspecially when distributed nodes suffer from limitations in communication or\ncomputational resources, DFL will experience extremely inefficient and unstable\ntraining. Motivated by these challenges, in this paper, we develop a novel\nalgorithm based on the framework of the inexact alternating direction method\n(iADM). On one hand, our goal is to train a shared model with a sparsity\nconstraint. This constraint enables us to leverage one-bit compressive sensing\n(1BCS), allowing transmission of one-bit information among neighbour nodes. On\nthe other hand, communication between neighbour nodes occurs only at certain\nsteps, reducing the number of communication rounds. Therefore, the algorithm\nexhibits notable communication efficiency. Additionally, as each node selects\nonly a subset of neighbours to participate in the training, the algorithm is\nrobust against stragglers. Additionally, complex items are computed only once\nfor several consecutive steps and subproblems are solved inexactly using\nclosed-form solutions, resulting in high computational efficiency. Finally,\nnumerical experiments showcase the algorithm's effectiveness in both\ncommunication and computation.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:22:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhou","Shenglong",""],["Xu","Kaidi",""],["Li","Geoffrey Ye",""]]}
{"id":"2308.16672","submitter":"Baptiste Gault","authors":"Eric V. Woods, Se-Ho Kim, Ayman A. El-Zoka, Leigh T. Stephenson,\n  Baptiste Gault","title":"Scalable Substrate Development for Aqueous Biological Samples for Atom\n  Probe Tomography","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reliable and consistent preparation of atom probe tomography (APT) specimens\nfrom aqueous and hydrated biological specimens remains a significant challenge.\nOne particularly difficult process step is the use of a focused ion beam (FIB)\ninstrument for preparing the required needle-shaped specimen, typically\ninvolving a \"lift-out\" procedure of a small sample of material. Here, two\nalternative substrate designs are introduced that enable using FIB only for\nsharpening, along with example APT datasets. The first design is a laser-cut\nFIB-style half-grid close to those used for transmission-electron microscopy,\nthat can be used in a grid holder compatible with APT pucks. The second design\nis a larger, standalone self-supporting substrate called a \"crown\", with\nseveral specimen positions that self-aligns in APT pucks, prepared by\nelectrical discharge machining (EDM). Both designs are made nanoporous, to\nprovide strength to the liquid-substrate interface, using chemical and vacuum\ndealloying. We select alpha brass a simple, widely available, lower-cost\nalternative to previously proposed substrates. We present the resulting\ndesigns, APT data, and provide suggestions to help drive wider community\nadoption.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:22:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Woods","Eric V.",""],["Kim","Se-Ho",""],["El-Zoka","Ayman A.",""],["Stephenson","Leigh T.",""],["Gault","Baptiste",""]]}
{"id":"2308.16673","submitter":"Albert Much","authors":"Albert Much and Rainer Verch","title":"Superluminal local operations in quantum field theory: A ping-pong ball\n  test","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is known that in quantum field theory, localized operations, e.g.\\ given\nby unitary operators in local observable algebras, may lead to non-causal, or\nsuperluminal, state changes within their localization region. In this article,\nit is shown that both in quantum field theory as well as in classical\nrelativistic field theory, there are localized operations which correspond to\n``instantaneous'' spatial rotations (leaving the localization region invariant)\nleading to superluminal effects within the localization region. This shows that\n``impossible measurement scenarios'' which have been investigated in the\nliterature, and which rely on the presence of localized operations that feature\nsuperluminal effects within their localization region, do not only occur in\nquantum field theory, but also in classical field theory.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:23:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Much","Albert",""],["Verch","Rainer",""]]}
{"id":"2308.16674","submitter":"Dimple Saini","authors":"D. Saini, H. Trivedi, S. Veerabathiran","title":"A characterization of invariant subspaces for isometric representations\n  of product system over $\\mathbb{N}_0^{k}$","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using the Wold-von Neumann decomposition for the isometric covariant\nrepresentations due to Muhly and Solel, we prove an explicit representation of\nthe commutant of a doubly commuting pure isometric representation of the\nproduct system over $\\mathbb{N}_0^{k}.$ As an application, we study a complete\ncharacterization of invariant subspaces for a doubly commuting pure isometric\nrepresentation of the product system. This provides us a complete set of\nisomorphic invariants. Finally, we classify a large class of commuting\nisometric representations of the product system.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:25:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Saini","D.",""],["Trivedi","H.",""],["Veerabathiran","S.",""]]}
{"id":"2308.16675","submitter":"Cristina  Costoya","authors":"Cristina Costoya, Rafael Gomes, Antonio Viruel","title":"Realization of permutation modules via Alexandroff spaces","comments":"13 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.CO math.GR math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We raise the question of the realizability of permutation modules in the\ncontext of Kahn's realizability problem for abstract groups and the $G$-Moore\nspace problem. Specifically, given a finite group $G$, we consider a collection\n$\\{M_i\\}_{i=1}^n$ of finitely generated $\\Z G$-modules that admit a submodule\ndecomposition on which $G$ acts by permuting the summands. Then we prove the\nexistence of connected finite spaces $X$ that realize each $M_i$ as its $i$-th\nhomology, $G$ as its group of self-homotopy equivalences $\\E(X)$, and the\naction of $G$ on each $M_i$ as the action of $\\E(X)$ on $H_i(X; \\Z)$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:26:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Costoya","Cristina",""],["Gomes","Rafael",""],["Viruel","Antonio",""]]}
{"id":"2308.16676","submitter":"Weijie Yan","authors":"Wei-Jie Yan, Yun-Kai Xu, Qian Chen, Xiao-Fang Kong, Guo-Hua Gu, A-Jun\n  Shao, Min-Jie Wan","title":"Twofold Structured Features-Based Siamese Network for Infrared Target\n  Tracking","comments":"13 pages,9 figures,references added","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nowadays, infrared target tracking has been a critical technology in the\nfield of computer vision and has many applications, such as motion analysis,\npedestrian surveillance, intelligent detection, and so forth. Unfortunately,\ndue to the lack of color, texture and other detailed information, tracking\ndrift often occurs when the tracker encounters infrared targets that vary in\nsize or shape. To address this issue, we present a twofold structured\nfeatures-based Siamese network for infrared target tracking. First of all, in\norder to improve the discriminative capacity for infrared targets, a novel\nfeature fusion network is proposed to fuse both shallow spatial information and\ndeep semantic information into the extracted features in a comprehensive\nmanner. Then, a multi-template update module based on template update mechanism\nis designed to effectively deal with interferences from target appearance\nchanges which are prone to cause early tracking failures. Finally, both\nqualitative and quantitative experiments are carried out on VOT-TIR 2016\ndataset, which demonstrates that our method achieves the balance of promising\ntracking performance and real-time tracking speed against other out-of-the-art\ntrackers.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:28:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yan","Wei-Jie",""],["Xu","Yun-Kai",""],["Chen","Qian",""],["Kong","Xiao-Fang",""],["Gu","Guo-Hua",""],["Shao","A-Jun",""],["Wan","Min-Jie",""]]}
{"id":"2308.16677","submitter":"Nick R.D. Zhu","authors":"Yang Lei, Hongfei Shu, Kilar Zhang, Rui-Dong Zhu","title":"Quasinormal Modes of C-metric from SCFTs","comments":"46+8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th astro-ph.HE gr-qc hep-ph math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the quasinormal modes (QNM) of the charged C-metric, which\nphysically stands for a charged accelerating black hole, with the help of\nNekrasov's partition function of 4d $\\mathcal{N}=2$ superconformal field\ntheories (SCFTs). The QNM in the charged C-metric are classified into three\ntypes: the photon-surface modes, the accelerating modes and the near-extremal\nmodes, and it is curious how the single quantization condition proposed in\narXiv:2006.06111 can reproduce all the different families. We show that the\nconnection formula encoded in terms of Nekrasov's partition function captures\nall these families of QNM numerically and recovers the asymptotic behavior of\nthe accelerating and the near-extremal modes analytically. Using the connection\nformulae of different 4d $\\mathcal{N}=2$ SCFTs, one can solve both the radial\nand the angular part of the scalar perturbation equation respectively. The same\nalgorithm can be applied to the de Sitter (dS) black holes to calculate both\nthe dS modes and the photon-sphere modes.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:28:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lei","Yang",""],["Shu","Hongfei",""],["Zhang","Kilar",""],["Zhu","Rui-Dong",""]]}
{"id":"2308.16678","submitter":"Riccardo Miccini","authors":"Riccardo Miccini, Alaa Zniber, Cl\\'ement Laroche, Tobias Piechowiak,\n  Martin Schoeberl, Luca Pezzarossa, Ouassim Karrakchou, Jens Spars{\\o}, Mounir\n  Ghogho","title":"Dynamic nsNet2: Efficient Deep Noise Suppression with Early Exiting","comments":"Accepted at the MLSP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Although deep learning has made strides in the field of deep noise\nsuppression, leveraging deep architectures on resource-constrained devices\nstill proved challenging. Therefore, we present an early-exiting model based on\nnsNet2 that provides several levels of accuracy and resource savings by halting\ncomputations at different stages. Moreover, we adapt the original architecture\nby splitting the information flow to take into account the injected dynamism.\nWe show the trade-offs between performance and computational complexity based\non established metrics.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:29:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Miccini","Riccardo",""],["Zniber","Alaa",""],["Laroche","Cl\u00e9ment",""],["Piechowiak","Tobias",""],["Schoeberl","Martin",""],["Pezzarossa","Luca",""],["Karrakchou","Ouassim",""],["Spars\u00f8","Jens",""],["Ghogho","Mounir",""]]}
{"id":"2308.16679","submitter":"Roghayeh Maleki","authors":"Blas Fern\\'andez, Roghayeh Maleki, \\v{S}tefko Miklavi\\v{c}, Giusy\n  Monzillo","title":"Distance-regular graphs with classical parameters that support a uniform\n  structure: case $q \\ge 2$","comments":"arXiv admin note: substantial text overlap with arXiv:2305.08937","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\Gamma=(X,\\mathcal{R})$ denote a finite, simple, connected, and\nundirected non-bipartite graph with vertex set $X$ and edge set $\\mathcal{R}$.\nFix a vertex $x \\in X$, and define $\\mathcal{R}_f = \\mathcal{R} \\setminus \\{yz\n\\mid \\partial(x,y) = \\partial(x,z)\\}$, where $\\partial$ denotes the path-length\ndistance in $\\Gamma$. Observe that the graph $\\Gamma_f=(X,\\mathcal{R}_f)$ is\nbipartite. We say that $\\Gamma$ supports a uniform structure with respect to\n$x$ whenever $\\Gamma_f$ has a uniform structure with respect to $x$ in the\nsense of Miklavi\\v{c} and Terwilliger \\cite{MikTer}.\n  Assume that $\\Gamma$ is a distance-regular graph with classical parameters\n$(D,q,\\alpha,\\beta)$ and diameter $D\\geq 4$. Recall that $q$ is an integer such\nthat $q \\not \\in \\{-1,0\\}$. The purpose of this paper is to study when $\\Gamma$\nsupports a uniform structure with respect to $x$. We studied the case $q \\le 1$\nin \\cite{FMMM}, and so in this paper we assume $q \\geq 2$. Let $T=T(x)$ denote\nthe Terwilliger algebra of $\\Gamma$ with respect to $x$. Under an additional\nassumption that every irreducible $T$-module with endpoint $1$ is thin, we show\nthat if $\\Gamma$ supports a uniform structure with respect to $x$, then either\n$\\alpha = 0$ or $\\alpha=q$, $\\beta=q^2(q^D-1)/(q-1)$, and $D \\equiv 0\n\\pmod{6}$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:29:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fern\u00e1ndez","Blas",""],["Maleki","Roghayeh",""],["Miklavi\u010d","\u0160tefko",""],["Monzillo","Giusy",""]]}
{"id":"2308.16680","submitter":"Michael Kagan","authors":"Michael Kagan and Lukas Heinrich","title":"Branches of a Tree: Taking Derivatives of Programs with Discrete and\n  Branching Randomness in High Energy Physics","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG hep-ex hep-ph physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose to apply several gradient estimation techniques to enable the\ndifferentiation of programs with discrete randomness in High Energy Physics.\nSuch programs are common in High Energy Physics due to the presence of\nbranching processes and clustering-based analysis. Thus differentiating such\nprograms can open the way for gradient based optimization in the context of\ndetector design optimization, simulator tuning, or data analysis and\nreconstruction optimization. We discuss several possible gradient estimation\nstrategies, including the recent Stochastic AD method, and compare them in\nsimplified detector design experiments. In doing so we develop, to the best of\nour knowledge, the first fully differentiable branching program.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:32:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kagan","Michael",""],["Heinrich","Lukas",""]]}
{"id":"2308.16681","submitter":"Jan Simson","authors":"Jan Simson and Florian Pfisterer and Christoph Kern","title":"Everything, Everywhere All in One Evaluation: Using Multiverse Analysis\n  to Evaluate the Influence of Model Design Decisions on Algorithmic Fairness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A vast number of systems across the world use algorithmic decision making\n(ADM) to (partially) automate decisions that have previously been made by\nhumans. When designed well, these systems promise more objective decisions\nwhile saving large amounts of resources and freeing up human time. However,\nwhen ADM systems are not designed well, they can lead to unfair decisions which\ndiscriminate against societal groups. The downstream effects of ADMs critically\ndepend on the decisions made during the systems' design and implementation, as\nbiases in data can be mitigated or reinforced along the modeling pipeline. Many\nof these design decisions are made implicitly, without knowing exactly how they\nwill influence the final system. It is therefore important to make explicit the\ndecisions made during the design of ADM systems and understand how these\ndecisions affect the fairness of the resulting system.\n  To study this issue, we draw on insights from the field of psychology and\nintroduce the method of multiverse analysis for algorithmic fairness. In our\nproposed method, we turn implicit design decisions into explicit ones and\ndemonstrate their fairness implications. By combining decisions, we create a\ngrid of all possible \"universes\" of decision combinations. For each of these\nuniverses, we compute metrics of fairness and performance. Using the resulting\ndataset, one can see how and which decisions impact fairness. We demonstrate\nhow multiverse analyses can be used to better understand variability and\nrobustness of algorithmic fairness using an exemplary case study of predicting\npublic health coverage of vulnerable populations for potential interventions.\nOur results illustrate how decisions during the design of a machine learning\nsystem can have surprising effects on its fairness and how to detect these\neffects using multiverse analysis.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:32:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Simson","Jan",""],["Pfisterer","Florian",""],["Kern","Christoph",""]]}
{"id":"2308.16682","submitter":"Tom Van Wouwe","authors":"Tom Van Wouwe, Seunghwan Lee, Antoine Falisse, Scott Delp, C. Karen\n  Liu","title":"Diffusion Inertial Poser: Human Motion Reconstruction from Arbitrary\n  Sparse IMU Configurations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Motion capture from a limited number of inertial measurement units (IMUs) has\nimportant applications in health, human performance, and virtual reality.\nReal-world limitations and application-specific goals dictate different IMU\nconfigurations (i.e., number of IMUs and chosen attachment body segments),\ntrading off accuracy and practicality. Although recent works were successful in\naccurately reconstructing whole-body motion from six IMUs, these systems only\nwork with a specific IMU configuration. Here we propose a single diffusion\ngenerative model, Diffusion Inertial Poser (DiffIP), which reconstructs human\nmotion in real-time from arbitrary IMU configurations. We show that DiffIP has\nthe benefit of flexibility with respect to the IMU configuration while being as\naccurate as the state-of-the-art for the commonly used six IMU configuration.\nOur system enables selecting an optimal configuration for different\napplications without retraining the model. For example, when only four IMUs are\navailable, DiffIP found that the configuration that minimizes errors in joint\nkinematics instruments the thighs and forearms. However, global translation\nreconstruction is better when instrumenting the feet instead of the thighs.\nAlthough our approach is agnostic to the underlying model, we built DiffIP\nbased on physiologically realistic musculoskeletal models to enable use in\nbiomedical research and health applications.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:36:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Van Wouwe","Tom",""],["Lee","Seunghwan",""],["Falisse","Antoine",""],["Delp","Scott",""],["Liu","C. Karen",""]]}
{"id":"2308.16683","submitter":"Piotr Podlaski","authors":"H. Adhikary, P. Adrich, K.K. Allison, N. Amin, E.V. Andronov, T.\n  Anti\\'ci\\'c, I.-C. Arsene, M. Bajda, Y. Balkova, M. Baszczyk, D. Battaglia,\n  A. Bazgir, S. Bhosale, M. Bielewicz, A. Blondel, M. Bogomilov, Y. Bondar, N.\n  Bostan, A. Brandin, W. Bryli\\'nski, J. Brzychczyk, M. Buryakov, A.F. Camino,\n  M. \\'Cirkovi\\'c, M. Csan\\'ad, J. Cybowska, T. Czopowicz, C. Dalmazzone, N.\n  Davis, A. Dmitriev, P. von Doetinchem, W. Dominik, P. Dorosz, J. Dumarchez,\n  R. Engel, G.A. Feofilov, L. Fields, Z. Fodor, M. Friend, M. Ga\\'zdzicki, O.\n  Golosov, V. Golovatyuk, M. Golubeva, K. Grebieszkow, F. Guber, S.N. Igolkin,\n  S. Ilieva, A. Ivashkin, A. Izvestnyy, K. Kadija, N. Kargin, N. Karpushkin, E.\n  Kashirin, M. Kie{\\l}bowicz, V.A. Kireyeu, H. Kitagawa, R. Kolesnikov, D.\n  Kolev, Y. Koshio, V.N. Kovalenko, S. Kowalski, B. Koz{\\l}owski, A.\n  Krasnoperov, W. Kucewicz, M. Kuchowicz, M. Kuich, A. Kurepin, A. L\\'aszl\\'o,\n  M. Lewicki, G. Lykasov, V.V. Lyubushkin, M. Ma\\'ckowiak-Paw{\\l}owska, Z.\n  Majka, A. Makhnev, B. Maksiak, A.I. Malakhov, A. Marcinek, A.D. Marino, H.-J.\n  Mathes, T. Matulewicz, V. Matveev, G.L. Melkumov, A. Merzlaya, {\\L}. Mik, A.\n  Morawiec, S. Morozov, Y. Nagai, T. Nakadaira, M. Naskret, S. Nishimori, V.\n  Ozvenchuk, O. Panova, V. Paolone, O. Petukhov, I. Pidhurskyi, R. P{\\l}aneta,\n  P. Podlaski, B.A. Popov, B. P\\'orfy, M. Posiada{\\l}a-Zezula, D.S. Prokhorova,\n  D. Pszczel, S. Pu{\\l}awski, J. Puzovi\\'c{\\dag}, R. Renfordt, L. Ren, V.Z.\n  Reyna Ortiz, D. R\\\"ohrich, E. Rondio, M. Roth, {\\L}. Rozp{\\l}ochowski, B.T.\n  Rumberger, M. Rumyantsev, A. Rustamov, M. Rybczynski, A. Rybicki, K.\n  Sakashita, K. Schmidt, A.Yu. Seryakov, P. Seyboth, U.A. Shah, Y. Shiraishi,\n  A. Shukla, M. S{\\l}odkowski, P. Staszel, G. Stefanek, J. Stepaniak, M.\n  Strikhanov, H. Str\\\"obele, T. \\v{S}u\\v{s}a, L. Swiderski, J. Szewi\\'nski, R.\n  Szukiewicz, A. Taranenko, A. Tefelska, D. Tefelski, V. Tereshchenko, A. Toia,\n  R. Tsenov, L. Turko, T.S. Tveter, M. Unger, M. Urbaniak, F.F. Valiev, D.\n  Veberi\\v{c}, V.V. Vechernin, V. Volkov, A. Wickremasinghe, K. W\\'ojcik, O.\n  Wyszy\\'nski, A. Zaitsev, E.D. Zimmerman, A. Zviagina, R. Zwaska","title":"Measurements of $\\pi^\\pm$, $K^\\pm$, $p$ and $\\bar{p}$ spectra in\n  $^{40}$Ar+$^{45}$Sc collisions at 13$A$ to 150$A$ GeV/$c$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The NA61/SHINE experiment at the CERN Super Proton Synchrotron studies the\nonset of deconfinement in strongly interacting matter through a beam energy\nscan of particle production in collisions of nuclei of varied sizes. This paper\npresents results on inclusive double-differential spectra, transverse momentum\nand rapidity distributions and mean multiplicities of $\\pi^\\pm$, $K^\\pm$, $p$\nand $\\bar{p}$ produced in $^{40}$Ar+$^{45}$Sc collisions at beam momenta of\n13$A$, 19$A$, 30$A$, 40$A$, 75$A$ and 150$A$ GeV/$c$. The analysis uses the 10%\nmost central collisions, where the observed forward energy defines centrality.\nThe energy dependence of the $K^\\pm$/$\\pi^\\pm$ ratios as well as of inverse\nslope parameters of the $K^\\pm$ transverse mass distributions are placed in\nbetween those found in inelastic $p$+$p$ and central Pb+Pb collisions. The\nresults obtained here establish a system-size dependence of hadron production\nproperties that so far cannot be explained either within statistical (SMES,\nHRG) or dynamical (EPOS, UrQMD, PHSD, SMASH) models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:37:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Adhikary","H.",""],["Adrich","P.",""],["Allison","K. K.",""],["Amin","N.",""],["Andronov","E. V.",""],["Anti\u0107i\u0107","T.",""],["Arsene","I. -C.",""],["Bajda","M.",""],["Balkova","Y.",""],["Baszczyk","M.",""],["Battaglia","D.",""],["Bazgir","A.",""],["Bhosale","S.",""],["Bielewicz","M.",""],["Blondel","A.",""],["Bogomilov","M.",""],["Bondar","Y.",""],["Bostan","N.",""],["Brandin","A.",""],["Bryli\u0144ski","W.",""],["Brzychczyk","J.",""],["Buryakov","M.",""],["Camino","A. F.",""],["\u0106irkovi\u0107","M.",""],["Csan\u00e1d","M.",""],["Cybowska","J.",""],["Czopowicz","T.",""],["Dalmazzone","C.",""],["Davis","N.",""],["Dmitriev","A.",""],["von Doetinchem","P.",""],["Dominik","W.",""],["Dorosz","P.",""],["Dumarchez","J.",""],["Engel","R.",""],["Feofilov","G. A.",""],["Fields","L.",""],["Fodor","Z.",""],["Friend","M.",""],["Ga\u017adzicki","M.",""],["Golosov","O.",""],["Golovatyuk","V.",""],["Golubeva","M.",""],["Grebieszkow","K.",""],["Guber","F.",""],["Igolkin","S. N.",""],["Ilieva","S.",""],["Ivashkin","A.",""],["Izvestnyy","A.",""],["Kadija","K.",""],["Kargin","N.",""],["Karpushkin","N.",""],["Kashirin","E.",""],["Kie\u0142bowicz","M.",""],["Kireyeu","V. A.",""],["Kitagawa","H.",""],["Kolesnikov","R.",""],["Kolev","D.",""],["Koshio","Y.",""],["Kovalenko","V. N.",""],["Kowalski","S.",""],["Koz\u0142owski","B.",""],["Krasnoperov","A.",""],["Kucewicz","W.",""],["Kuchowicz","M.",""],["Kuich","M.",""],["Kurepin","A.",""],["L\u00e1szl\u00f3","A.",""],["Lewicki","M.",""],["Lykasov","G.",""],["Lyubushkin","V. V.",""],["Ma\u0107kowiak-Paw\u0142owska","M.",""],["Majka","Z.",""],["Makhnev","A.",""],["Maksiak","B.",""],["Malakhov","A. I.",""],["Marcinek","A.",""],["Marino","A. D.",""],["Mathes","H. -J.",""],["Matulewicz","T.",""],["Matveev","V.",""],["Melkumov","G. L.",""],["Merzlaya","A.",""],["Mik","\u0141.",""],["Morawiec","A.",""],["Morozov","S.",""],["Nagai","Y.",""],["Nakadaira","T.",""],["Naskret","M.",""],["Nishimori","S.",""],["Ozvenchuk","V.",""],["Panova","O.",""],["Paolone","V.",""],["Petukhov","O.",""],["Pidhurskyi","I.",""],["P\u0142aneta","R.",""],["Podlaski","P.",""],["Popov","B. A.",""],["P\u00f3rfy","B.",""],["Posiada\u0142a-Zezula","M.",""],["Prokhorova","D. S.",""],["Pszczel","D.",""],["Pu\u0142awski","S.",""],["Puzovi\u0107\u2020","J.",""],["Renfordt","R.",""],["Ren","L.",""],["Ortiz","V. Z. Reyna",""],["R\u00f6hrich","D.",""],["Rondio","E.",""],["Roth","M.",""],["Rozp\u0142ochowski","\u0141.",""],["Rumberger","B. T.",""],["Rumyantsev","M.",""],["Rustamov","A.",""],["Rybczynski","M.",""],["Rybicki","A.",""],["Sakashita","K.",""],["Schmidt","K.",""],["Seryakov","A. Yu.",""],["Seyboth","P.",""],["Shah","U. A.",""],["Shiraishi","Y.",""],["Shukla","A.",""],["S\u0142odkowski","M.",""],["Staszel","P.",""],["Stefanek","G.",""],["Stepaniak","J.",""],["Strikhanov","M.",""],["Str\u00f6bele","H.",""],["\u0160u\u0161a","T.",""],["Swiderski","L.",""],["Szewi\u0144ski","J.",""],["Szukiewicz","R.",""],["Taranenko","A.",""],["Tefelska","A.",""],["Tefelski","D.",""],["Tereshchenko","V.",""],["Toia","A.",""],["Tsenov","R.",""],["Turko","L.",""],["Tveter","T. S.",""],["Unger","M.",""],["Urbaniak","M.",""],["Valiev","F. F.",""],["Veberi\u010d","D.",""],["Vechernin","V. V.",""],["Volkov","V.",""],["Wickremasinghe","A.",""],["W\u00f3jcik","K.",""],["Wyszy\u0144ski","O.",""],["Zaitsev","A.",""],["Zimmerman","E. D.",""],["Zviagina","A.",""],["Zwaska","R.",""]]}
{"id":"2308.16684","submitter":"Chee Seng Chan","authors":"Sze Jue Yang and Quang Nguyen and Chee Seng Chan and Khoa Doan","title":"Everyone Can Attack: Repurpose Lossy Compression as a Natural Backdoor\n  Attack","comments":"14 pages. This paper shows everyone can mount a powerful and stealthy\n  backdoor attack with the widely-used lossy image compression","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The vulnerabilities to backdoor attacks have recently threatened the\ntrustworthiness of machine learning models in practical applications.\nConventional wisdom suggests that not everyone can be an attacker since the\nprocess of designing the trigger generation algorithm often involves\nsignificant effort and extensive experimentation to ensure the attack's\nstealthiness and effectiveness. Alternatively, this paper shows that there\nexists a more severe backdoor threat: anyone can exploit an easily-accessible\nalgorithm for silent backdoor attacks. Specifically, this attacker can employ\nthe widely-used lossy image compression from a plethora of compression tools to\neffortlessly inject a trigger pattern into an image without leaving any\nnoticeable trace; i.e., the generated triggers are natural artifacts. One does\nnot require extensive knowledge to click on the \"convert\" or \"save as\" button\nwhile using tools for lossy image compression. Via this attack, the adversary\ndoes not need to design a trigger generator as seen in prior works and only\nrequires poisoning the data. Empirically, the proposed attack consistently\nachieves 100% attack success rate in several benchmark datasets such as MNIST,\nCIFAR-10, GTSRB and CelebA. More significantly, the proposed attack can still\nachieve almost 100% attack success rate with very small (approximately 10%)\npoisoning rates in the clean label setting. The generated trigger of the\nproposed attack using one lossy compression algorithm is also transferable\nacross other related compression algorithms, exacerbating the severity of this\nbackdoor threat. This work takes another crucial step toward understanding the\nextensive risks of backdoor attacks in practice, urging practitioners to\ninvestigate similar attacks and relevant backdoor mitigation methods.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:38:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yang","Sze Jue",""],["Nguyen","Quang",""],["Chan","Chee Seng",""],["Doan","Khoa",""]]}
{"id":"2308.16685","submitter":"Masha Chernyakova","authors":"Felix Aharonian, Denys Malyshev and Maria Chernyakova","title":"On the nature of the energy-dependent morphology of the composite\n  multi-TeV gamma-ray source HESS J1702-420","comments":"accepted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  HESS J1702-420 is a multi-TeV gamma-ray source with an unusual\nenergy-dependent morphology. The recent H.E.S.S. observations suggest that the\nemission is well described by a combination of point-like HESS J1702-420A\n(dominating at highest energies, $\\gtrsim$ 30 TeV ) and diffuse ($\\sim$\n0.3$^\\circ$) HESS J1702-420B (dominating below $\\lesssim$ 5TeV) sources with\nvery hard (${\\Gamma} \\sim 1.5$) and soft (${\\Gamma}$ ~2.6) power-law spectra,\nrespectively. Here we propose a model which postulates that the proton\naccelerator is located at the position of HESS J1702-420A and is embedded into\na dense molecular cloud that coincides with HESS J1702-420B. In the proposed\nmodel, the VHE radiation of HESS J1702-420 is explained by the pion-decay\nemission from the continuously injected relativistic protons propagating\nthrough a dense cloud. The energy-dependent morphology is defined by the\ndiffusive nature of the low-energy protons propagation, transiting sharply to\n(quasi) ballistic propagation at higher energies. Adopting strong energy\ndependence of the diffusion coefficient, $D \\propto E^\\beta$ with $\\beta \\geq\n1$, we argue that HESS J1702-420 as the system of two gamma-ray sources is the\nresult of the propagation effect. Protons injected by a single accelerator at\nthe rate $Q_0 \\simeq 10^{38} \\, (n_0/100 \\, \\rm cm^{-3})^{-1}\\, (d/ \\,\n0.25\\,kpc)^{-1} \\rm erg/s$ can reasonably reproduce the morphology and fluxes\nof two gamma-ray components.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:38:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Aharonian","Felix",""],["Malyshev","Denys",""],["Chernyakova","Maria",""]]}
{"id":"2308.16686","submitter":"Justyn Maund","authors":"J.R. Maund","title":"Exploring the Polarization of Axially Symmetric Supernovae with\n  Unsupervised Deep Learning","comments":"16 pages, 14 figures, MNRAS accepted","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":"  The measurement of non-zero polarization can be used to infer the presence of\ndepartures from spherical symmetry in supernovae (SNe). The origin of the\nmajority of the intrinsic polarization observed in SNe is in electron\nscattering, which induces a wavelength-independent continuum polarization that\nis generally observed to be low (<1%) for all SN types. The key indicator of\nasymmetry in SNe is the polarization observed across spectral lines, in\nparticular the characteristic ``inverse P Cygni'' profile. The results of a\nsuite of 900 Monte Carlo radiative transfer simulations are presented here.\nThese simulations cover a range of possible axisymmetric structures (including\nunipolar, bipolar and equatorial enhancements) for the line forming region of\nthe Ca II infrared triplet. Using a Variational Autoencoder, 7 key latent\nparameters are learned that describe the relationship between Stokes I and\nStokes q, under the assumption of an axially symmetric line forming region and\nresonant scattering. Likelihood-free inference techniques are used to invert\nthe Stokes I and q line profiles, in the latent space, to derive the underlying\ngeometries. For axially symmetric structures, that yield an observable\n``dominant axis'' on the Stokes $q-u$ plane, we propose the existence of a\ngeometry ``conjugate\" (which is indistinguishable under a rotation of $\\pi\n/2$). Using this machine learning infrastructure, we attempt to identify\npossible geometries associated with spectropolarimetric observations of the\nType Ib SN 2017gax.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:42:16 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Maund","J. R.",""]]}
{"id":"2308.16687","submitter":"Avi Shmidman","authors":"Shaltiel Shmidman, Avi Shmidman, Moshe Koppel","title":"DictaBERT: A State-of-the-Art BERT Suite for Modern Hebrew","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present DictaBERT, a new state-of-the-art pre-trained BERT model for\nmodern Hebrew, outperforming existing models on most benchmarks. Additionally,\nwe release two fine-tuned versions of the model, designed to perform two\nspecific foundational tasks in the analysis of Hebrew texts: prefix\nsegmentation and morphological tagging. These fine-tuned models allow any\ndeveloper to perform prefix segmentation and morphological tagging of a Hebrew\nsentence with a single call to a HuggingFace model, without the need to\nintegrate any additional libraries or code. In this paper we describe the\ndetails of the training as well and the results on the different benchmarks. We\nrelease the models to the community, along with sample code demonstrating their\nuse. We release these models as part of our goal to help further research and\ndevelopment in Hebrew NLP.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:43:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shmidman","Shaltiel",""],["Shmidman","Avi",""],["Koppel","Moshe",""]]}
{"id":"2308.16688","submitter":"Hina Raja","authors":"Hina Raja, Asim Munawar, Mohammad Delsoz, Mohammad Elahi, Yeganeh\n  Madadi, Amr Hassan, Hashem Abu Serhan, Onur Inam, Luis Hermandez, Sang Tran,\n  Wuqas Munir, Alaa Abd-Alrazaq, Hao Chen, and SiamakYousefi","title":"Using Large Language Models to Automate Category and Trend Analysis of\n  Scientific Articles: An Application in Ophthalmology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Purpose: In this paper, we present an automated method for article\nclassification, leveraging the power of Large Language Models (LLM). The\nprimary focus is on the field of ophthalmology, but the model is extendable to\nother fields. Methods: We have developed a model based on Natural Language\nProcessing (NLP) techniques, including advanced LLMs, to process and analyze\nthe textual content of scientific papers. Specifically, we have employed\nzero-shot learning (ZSL) LLM models and compared against Bidirectional and\nAuto-Regressive Transformers (BART) and its variants, and Bidirectional Encoder\nRepresentations from Transformers (BERT), and its variant such as distilBERT,\nSciBERT, PubmedBERT, BioBERT. Results: The classification results demonstrate\nthe effectiveness of LLMs in categorizing large number of ophthalmology papers\nwithout human intervention. Results: To evalute the LLMs, we compiled a dataset\n(RenD) of 1000 ocular disease-related articles, which were expertly annotated\nby a panel of six specialists into 15 distinct categories. The model achieved\nmean accuracy of 0.86 and mean F1 of 0.85 based on the RenD dataset.\nConclusion: The proposed framework achieves notable improvements in both\naccuracy and efficiency. Its application in the domain of ophthalmology\nshowcases its potential for knowledge organization and retrieval in other\ndomains too. We performed trend analysis that enables the researchers and\nclinicians to easily categorize and retrieve relevant papers, saving time and\neffort in literature review and information gathering as well as identification\nof emerging scientific trends within different disciplines. Moreover, the\nextendibility of the model to other scientific fields broadens its impact in\nfacilitating research and trend analysis across diverse disciplines.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:45:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Raja","Hina",""],["Munawar","Asim",""],["Delsoz","Mohammad",""],["Elahi","Mohammad",""],["Madadi","Yeganeh",""],["Hassan","Amr",""],["Serhan","Hashem Abu",""],["Inam","Onur",""],["Hermandez","Luis",""],["Tran","Sang",""],["Munir","Wuqas",""],["Abd-Alrazaq","Alaa",""],["Chen","Hao",""],["SiamakYousefi","",""]]}
{"id":"2308.16689","submitter":"Zhen Yang","authors":"Weihan Wang, Zhen Yang, Bin Xu, Juanzi Li, Yankui Sun","title":"ViLTA: Enhancing Vision-Language Pre-training through Textual\n  Augmentation","comments":"15 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Vision-language pre-training (VLP) methods are blossoming recently, and its\ncrucial goal is to jointly learn visual and textual features via a\ntransformer-based architecture, demonstrating promising improvements on a\nvariety of vision-language tasks. Prior arts usually focus on how to align\nvisual and textual features, but strategies for improving the robustness of\nmodel and speeding up model convergence are left insufficiently explored.\n  In this paper, we propose a novel method ViLTA, comprising of two components\nto further facilitate the model to learn fine-grained representations among\nimage-text pairs. For Masked Language Modeling (MLM), we propose a\ncross-distillation method to generate soft labels to enhance the robustness of\nmodel, which alleviates the problem of treating synonyms of masked words as\nnegative samples in one-hot labels. For Image-Text Matching (ITM), we leverage\nthe current language encoder to synthesize hard negatives based on the context\nof language input, encouraging the model to learn high-quality representations\nby increasing the difficulty of the ITM task. By leveraging the above\ntechniques, our ViLTA can achieve better performance on various vision-language\ntasks. Extensive experiments on benchmark datasets demonstrate that the\neffectiveness of ViLTA and its promising potential for vision-language\npre-training.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:46:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Weihan",""],["Yang","Zhen",""],["Xu","Bin",""],["Li","Juanzi",""],["Sun","Yankui",""]]}
{"id":"2308.16690","submitter":"Wenjing Li","authors":"Wenjing Li, Wei Bian, Kim-Chuan Toh","title":"On solving a rank regularized minimization problem via equivalent\n  factorized column-sparse regularized models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rank regularized minimization problem is an ideal model for the low-rank\nmatrix completion/recovery problem. The matrix factorization approach can\ntransform the high-dimensional rank regularized problem to a low-dimensional\nfactorized column-sparse regularized problem. The latter can greatly facilitate\nfast computations in applicable algorithms, but needs to overcome the\nsimultaneous non-convexity of the loss and regularization functions. In this\npaper, we consider the factorized column-sparse regularized model. Firstly, we\noptimize this model with bound constraints, and establish a certain equivalence\nbetween the optimized factorization problem and rank regularized problem.\nFurther, we strengthen the optimality condition for stationary points of the\nfactorization problem and define the notion of strong stationary point.\nMoreover, we establish the equivalence between the factorization problem and\nits a nonconvex relaxation in the sense of global minimizers and strong\nstationary points. To solve the factorization problem, we design two types of\nalgorithms and give an adaptive method to reduce their computation. The first\nalgorithm is from the relaxation point of view and its iterates own some\nproperties from global minimizers of the factorization problem after finite\niterations. We give some analysis on the convergence of its iterates to the\nstrong stationary point. The second algorithm is designed for directly solving\nthe factorization problem. We improve the PALM algorithm introduced by Bolte et\nal. (Math Program Ser A 146:459-494, 2014) for the factorization problem and\ngive its improved convergence results. Finally, we conduct numerical\nexperiments to show the promising performance of the proposed model and\nalgorithms for low-rank matrix completion.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:50:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Wenjing",""],["Bian","Wei",""],["Toh","Kim-Chuan",""]]}
{"id":"2308.16691","submitter":"Elena V. Mikheeva","authors":"A.M. Malinovsky (1), E.V. Mikheeva (1) ((1) Astro Space Center of P.N.\n  Lebedev Physical Institute of RAS, Moscow, Russia)","title":"Prospects for observing supermassive black hole binaries with the\n  space-ground interferometer","comments":"15 pages, 6 figures, 2 table, accepted for publication in Astronomy\n  Reports","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A list of candidates for \\textit{supermassive binary black holes} (SMBBHs),\ncompiled from available data on the variability in the optical range and the\nshape of the emission spectrum, is analysed. An artificial neural network is\nconstructed to estimate the radiation flux at 240~GHz. For those candidate\nSMBBH for which the network building procedure was feasible, the criterion of\nthe possibility of observing the source at the \\textit{Millimetron Space\nObservatory} (MSO) was tested. The result is presented as a table of 17\ncandidate SMBBHs. Confirmation (or refutation) of the duality of these objects\nby means of observational data which could be commited on a space-ground\ninterferometer with parameters similar to those of the MSO will be an important\nmilestone in the development of the theory of galaxy formation.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:51:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Malinovsky","A. M.",""],["Mikheeva","E. V.",""]]}
{"id":"2308.16692","submitter":"Dong Zhang Zhang","authors":"Xin Zhang, Dong Zhang, Shimin Li, Yaqian Zhou, Xipeng Qiu","title":"SpeechTokenizer: Unified Speech Tokenizer for Speech Large Language\n  Models","comments":"SpeechTokenizer project page is\n  https://0nutation.github.io/SpeechTokenizer.github.io/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Current speech large language models build upon discrete speech\nrepresentations, which can be categorized into semantic tokens and acoustic\ntokens. However, existing speech tokens are not specifically designed for\nspeech language modeling. To assess the suitability of speech tokens for\nbuilding speech language models, we established the first benchmark,\nSLMTokBench. Our results indicate that neither semantic nor acoustic tokens are\nideal for this purpose. Therefore, we propose SpeechTokenizer, a unified speech\ntokenizer for speech large language models. SpeechTokenizer adopts the\nEncoder-Decoder architecture with residual vector quantization (RVQ). Unifying\nsemantic and acoustic tokens, SpeechTokenizer disentangles different aspects of\nspeech information hierarchically across different RVQ layers. Furthermore, We\nconstruct a Unified Speech Language Model (USLM) leveraging SpeechTokenizer.\nExperiments show that SpeechTokenizer performs comparably to EnCodec in speech\nreconstruction and demonstrates strong performance on the SLMTokBench\nbenchmark. Also, USLM outperforms VALL-E in zero-shot Text-to-Speech tasks.\nCode and models are available at\nhttps://github.com/ZhangXInFD/SpeechTokenizer/.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:53:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Xin",""],["Zhang","Dong",""],["Li","Shimin",""],["Zhou","Yaqian",""],["Qiu","Xipeng",""]]}
{"id":"2308.16693","submitter":"Sebastien Aumaitre","authors":"Enzo Francisco, Vincent Bouillaut, Tong Wu and S\\'ebastien Auma\\^itre","title":"Spatio-temporal boundary dissipation measurement in Taylor-Couette flow\n  using Diffusing-Wave Spectroscopy","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Diffusing-Wave Spectroscopy (DWS) allows for the direct measurement of the\nsquared strain-rate tensor. When combined with commonly available high-speed\ncameras, we show that DWS gives direct access to the spatio-temporal variations\nof the viscous dissipation rate of a Newtonian fluid flow. The method is\ndemonstrated using a Taylor-Couette (TC) cell filled with a lipid emulsion or a\n\\ch{TiO2} suspension. We image the boundary dissipation rate in a quantitative\nand time-resolved fashion by shining coherent light at the experimental cell\nand measuring the local correlation time of the speckle pattern. The results\nare validated by comparison with the theoretical prediction for an ideal TC\nflow and with global measurements using a photomultiplier tube and a photon\ncorrelator. We illustrate the method by characterizing the spatial organization\nof the boundary dissipation rate past the Taylor-Couette instability threshold,\nand its spatio-temporal dynamics in the wavy vortex flow that arises beyond a\nsecondary instability threshold. This study paves the way for direct imaging of\nthe dissipation rate in a large variety of flows, including turbulent ones.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:59:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Francisco","Enzo",""],["Bouillaut","Vincent",""],["Wu","Tong",""],["Auma\u00eetre","S\u00e9bastien",""]]}
{"id":"2308.16694","submitter":"Thomas Rush MPhys","authors":"Tom Rush","title":"On the superadditive pressure for 1-typical, one-step, matrix-cocycle\n  potentials","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $(\\Sigma_T,\\sigma)$ be a subshift of finite type with primitive adjacency\nmatrix $T$, $\\psi:\\Sigma_T \\rightarrow \\mathbb{R}$ a H\\\"older continuous\npotential, and $\\mathcal{A}:\\Sigma_T \\rightarrow \\mathrm{GL}_d(\\mathbb{R})$ a\n1-typical, one-step cocycle. For $t \\in \\mathbb{R}$ consider the sequences of\npotentials $\\Phi_t=(\\varphi_{t,n})_{n \\in \\mathbb{N}}$ defined by\n$$\\varphi_{t,n}(x):=S_n \\psi(x) + t\\log \\|\\mathcal{A}^n(x)\\|, \\: \\forall n \\in\n\\mathbb{N}.$$ Using the family of transfer operators defined in this setting by\nPark and Piraino, for all $t<0$ sufficiently close to 0 we prove the existence\nof Gibbs-type measures for the superadditive sequences of potentials $\\Phi_t$.\nThis extends the results of the well-understood subadditive case where $t \\geq\n0$. Prior to this, Gibbs-type measures were only known to exist for $t<0$ in\nthe conformal, the reducible, the positive, or the dominated, planar settings,\nin which case they are Gibbs measures in the classical sense. We further prove\nthat the topological pressure function $t \\mapsto\nP_{\\mathrm{top}}(\\Phi_t,\\sigma)$ is analytic in an open neighbourhood of 0 and\nhas derivative given by the Lyapunov exponents of these Gibbs-type measures. In\naddition, we give an example in this setting for which there does not exist\nGibbs-type measures for $\\Phi_t$ for some values of $t<0$. This is the first\nexample of this phenomenon outside of the reducible setting.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 12:59:54 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Rush","Tom",""]]}
{"id":"2308.16695","submitter":"R\\'emi Leclercq","authors":"Jean-Philippe Chass\\'e and R\\'emi Leclercq","title":"A H\\\"older-type inequality for the Hausdorff distance between\n  Lagrangians","comments":"13 pages, 0 figure, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove a H\\\"older-type inequality (in the spirit of\nJoksimovi\\'c--Seyfaddini [arXiv.org:2207.11813] for the Hausdorff distance\nbetween Lagrangians with respect to the Lagrangian spectral distance or the\nHofer--Chekanov distance. This inequality is established via methods developped\nby the first author [arXiv:2204.02468, arXiv:2108.00555] in order to understand\nthe symplectic geometry of certain collections of Lagrangians under metric\nconstraints.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:00:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chass\u00e9","Jean-Philippe",""],["Leclercq","R\u00e9mi",""]]}
{"id":"2308.16696","submitter":"Xinjie Dai","authors":"Xinjie Dai, Jialin Hong, and Derui Sheng","title":"Error analysis of numerical methods on graded meshes for stochastic\n  Volterra equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents the error analysis of numerical methods on graded meshes\nfor stochastic Volterra equations with weakly singular kernels. We first prove\na novel regularity estimate for the exact solution via analyzing the associated\nconvolution structure. This reveals that the exact solution exhibits an initial\nsingularity in the sense that its H\\\"older continuous exponent on any\nneighborhood of $t=0$ is lower than that on every compact subset of $(0,T]$.\nMotivated by the initial singularity, we then construct the Euler--Maruyama\nmethod, fast Euler--Maruyama method, and Milstein method based on graded\nmeshes. By establishing their pointwise-in-time error estimates, we give the\ngrading exponents of meshes to attain the optimal uniform-in-time convergence\norders, where the convergence orders improve those of the uniform mesh case.\nNumerical experiments are finally reported to confirm the sharpness of\ntheoretical findings.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:00:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dai","Xinjie",""],["Hong","Jialin",""],["Sheng","Derui",""]]}
{"id":"2308.16697","submitter":"Leonardo Pacheco","authors":"Leonardo Pacheco","title":"Game semantics for the constructive $\\mu$-calculus","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We define game semantics for the constructive $\\mu$-calculus and prove its\ncorrectness. We use these game semantics to prove that the $\\mu$-calculus\ncollapses to modal logic over $\\mathsf{CS5}$ frames. Finally, we prove the\ncompleteness of $\\mathsf{\\mu CS5}$ over $\\mathsf{CS5}$ frames.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:02:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pacheco","Leonardo",""]]}
{"id":"2308.16698","submitter":"Julius Karlapp","authors":"Julius Karlapp (1), Ren\\'e Heller (2), Martin Tajmar (1) ((1)\n  Institute of Aerospace Engineering, Technische Universit\\\"at Dresden (GER),\n  (2) Max Planck Institute for Solar System Research, G\\\"ottingen (GER))","title":"Ultrafast transfer of low-mass payloads to Mars and beyond using\n  aerographite solar sails","comments":"submitted to Acta Astronautica, Special Issue for the 8th\n  Interstellar Symposium 2023, 8 pages, 10 Figures (5 col, 5 b/w), 1 Table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With interstellar mission concepts now being under study by various space\nagencies and institutions, a feasible and worthy interstellar precursor mission\nconcept will be key to the success of the long shot. Here we investigate\ninterstellar-bound trajectories of solar sails made of the ultra-light material\naerographite, known for its low density (0.18 kg m$^{-3}$) and high\nabsorptivity ($\\mathcal{A}{\\sim}1$), enabling remarkable solar\nirradiation-based acceleration. Payloads of up to 1 kg can swiftly traverse the\nsolar system and the regions beyond. Our simulations consider various launch\nscenarios from a polar orbit around the Earth with direct outbound trajectories\nand Sun diver launches with subsequent outward acceleration. Utilizing the\npoliastro Python library, we calculate positions, velocities, and accelerations\nfor a 1 kg spacecraft (including 720 g aerographite mass) with 10$^4$ m$^2$ of\ncross-sectional area, corresponding to a 56 m radius. A direct outward Mars\ntransfer yields 65 km s$^{-1}$ in 26 d. The inward Mars transfer, with a sail\ndeployment at a minimum distance of 0.6 AU, achieves 118 km s$^{-1}$ in 126 d.\nTransfer times and velocities vary due to the Earth-Mars constellation and\ninitial injection trajectory. The direct interstellar trajectory peaks at 109\nkm s$^{-1}$, reaching interstellar space in 5.3 yr defined by the heliopause at\n120 AU. Alternatively, the initial Sun dive to 0.6 AU provides 148 km s$^{-1}$\nof escape velocity, reaching the heliopause in 4.2 yr. Values differ based on\nthe minimum distance to the Sun. Presented concepts enable swift Mars flybys\nand interstellar space exploration. For delivery missions of sub-kg payloads,\nthe deceleration remains a challenge.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:02:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Karlapp","Julius",""],["Heller","Ren\u00e9",""],["Tajmar","Martin",""]]}
{"id":"2308.16699","submitter":"Federica Bradascio Dr.","authors":"Federica Bradascio, Halim Ashkar, Jowita Borowska, Jean Damascene\n  Mbarubucyeye, Enzo Oukacha, Fabian Sch\\\"ussler, Hiromasa Suzuki, Alicja\n  Wierzcholska (for the H.E.S.S. and IceCube Collaborations)","title":"H.E.S.S. realtime follow-ups of IceCube high-energy neutrino alerts","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-1546","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The evidence for multi-messenger photon and neutrino emission from the blazar\nTXS 0506+056 has demonstrated the importance of realtime follow-up of neutrino\nevents by various ground- and space-based facilities. The effort of H.E.S.S.\nand other experiments in coordinating observations to obtain quasi-simultaneous\nmultiwavelength flux and spectrum measurements has been critical in measuring\nthe chance coincidence with the high-energy neutrino event IC-170922A and\nconstraining theoretical models. For about a decade, the H.E.S.S. transient\nprogram has included a search for gamma-ray emission associated with\nhigh-energy neutrino alerts, looking for gamma-ray activity from known sources\nand newly detected emitters consistent with the neutrino location. In this\ncontribution, we present an overview of follow-up activities for realtime\nneutrino alerts with H.E.S.S. in 2021 and 2022. Our analysis includes both\npublic IceCube neutrino alerts and alerts exchanged as part of a joint\nH.E.S.S.-IceCube program. We focus on interesting coincidences observed with\ngamma-ray sources, particularly highlighting the significant detection of PKS\n0625-35, an AGN previously detected by H.E.S.S., and three IceCube neutrinos.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:03:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bradascio","Federica","","for the H.E.S.S. and IceCube Collaborations"],["Ashkar","Halim","","for the H.E.S.S. and IceCube Collaborations"],["Borowska","Jowita","","for the H.E.S.S. and IceCube Collaborations"],["Mbarubucyeye","Jean Damascene","","for the H.E.S.S. and IceCube Collaborations"],["Oukacha","Enzo","","for the H.E.S.S. and IceCube Collaborations"],["Sch\u00fcssler","Fabian","","for the H.E.S.S. and IceCube Collaborations"],["Suzuki","Hiromasa","","for the H.E.S.S. and IceCube Collaborations"],["Wierzcholska","Alicja","","for the H.E.S.S. and IceCube Collaborations"]]}
{"id":"2308.16700","submitter":"Rasmus Carl R{\\o}nneberg","authors":"Rasmus C. R{\\o}nneberg, Ra\\'ul Pardo, Andrzej W\\k{a}sowski","title":"Exact and Efficient Bayesian Inference for Privacy Risk Quantification\n  (Extended Version)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Data analysis has high value both for commercial and research purposes.\nHowever, disclosing analysis results may pose severe privacy risk to\nindividuals. Privug is a method to quantify privacy risks of data analytics\nprograms by analyzing their source code. The method uses probability\ndistributions to model attacker knowledge and Bayesian inference to update said\nknowledge based on observable outputs. Currently, Privug uses Markov Chain\nMonte Carlo (MCMC) to perform inference, which is a flexible but approximate\nsolution. This paper presents an exact Bayesian inference engine based on\nmultivariate Gaussian distributions to accurately and efficiently quantify\nprivacy risks. The inference engine is implemented for a subset of Python\nprograms that can be modeled as multivariate Gaussian models. We evaluate the\nmethod by analyzing privacy risks in programs to release public statistics. The\nevaluation shows that our method accurately and efficiently analyzes privacy\nrisks, and outperforms existing methods. Furthermore, we demonstrate the use of\nour engine to analyze the effect of differential privacy in public statistics.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:04:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["R\u00f8nneberg","Rasmus C.",""],["Pardo","Ra\u00fal",""],["W\u0105sowski","Andrzej",""]]}
{"id":"2308.16701","submitter":"Alek Vainshtein","authors":"Misha Gekhtman, Michael Shapiro, and Alek Vainshtein","title":"A unified approach to exotic cluster structures on simple Lie groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a new approach to building log-canonical coordinate charts for any\nsimply-connected simple Lie group $\\G$ and arbitrary Poisson-homogeneous\nbracket on $\\G$ associated with Belavin--Drinfeld data. Given a pair of\nrepresentatives $r, r'$ from two arbitrary Belavin--Drinfeld classes, we build\na rational map from $\\G$ with the Poisson structure defined by two\nappropriately selected representatives from the standard class to $\\G$ equipped\nwith the Poisson structure defined by the pair $r, r'$. In the $A_n$ case, we\nprove that this map is invertible whenever the pair $r, r'$ is drawn from\naperiodic Belavin--Drinfeld data, as defined in~\\cite{GSVple}. We further apply\nthis construction to recover the existence of a regular complete cluster\nstructure compatible with the Poisson structure associated with the pair $r,\nr'$ in the aperiodic case.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:07:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gekhtman","Misha",""],["Shapiro","Michael",""],["Vainshtein","Alek",""]]}
{"id":"2308.16702","submitter":"Wade Bloomquist","authors":"Wade Bloomquist, Hiroaki Karuo, Thang L\\^e","title":"Degenerations Of Skein Algebras And Quantum Traces","comments":"56 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.QA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We introduce a joint generalization, called LRY skein algebras, of Kauffman\nbracket skein algebras (of surfaces) that encompasses both Roger-Yang skein\nalgebras and stated skein algebras. We will show that, over an arbitrary ground\nring which is a commutative domain, the LRY skein algebras are domains and have\ndegenerations (by filtrations) equal to monomial subalgebras of quantum tori.\nThis integrality answers a question of Roger-Yang for the most general ground\nring. We also calculate the Gelfand-Kirillov dimension of LRY algebras and show\nthey are Noetherian if the ground ring is. Moreover they are orderly finitely\ngenerated. To study the LRY algebras and prove the above-mentioned results, we\nconstruct quantum traces, both the so-called X-version for all surfaces and\nalso an A-version for a smaller class of surfaces. We also introduce a modified\nversion of Dehn-Thurston coordinates for curves which are more suitable for the\nstudy of skein algebras as they pick up the highest degree terms of products in\ncertain natural filtrations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:08:15 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bloomquist","Wade",""],["Karuo","Hiroaki",""],["L\u00ea","Thang",""]]}
{"id":"2308.16703","submitter":"Pierre-Alain Mo\\\"ellic","authors":"Kevin Hector, Pierre-Alain Moellic, Mathieu Dumont, Jean-Max Dutertre","title":"Fault Injection and Safe-Error Attack for Extraction of Embedded Neural\n  Network Models","comments":"Accepted at SECAI Workshop, ESORICS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Model extraction emerges as a critical security threat with attack vectors\nexploiting both algorithmic and implementation-based approaches. The main goal\nof an attacker is to steal as much information as possible about a protected\nvictim model, so that he can mimic it with a substitute model, even with a\nlimited access to similar training data. Recently, physical attacks such as\nfault injection have shown worrying efficiency against the integrity and\nconfidentiality of embedded models. We focus on embedded deep neural network\nmodels on 32-bit microcontrollers, a widespread family of hardware platforms in\nIoT, and the use of a standard fault injection strategy - Safe Error Attack\n(SEA) - to perform a model extraction attack with an adversary having a limited\naccess to training data. Since the attack strongly depends on the input\nqueries, we propose a black-box approach to craft a successful attack set. For\na classical convolutional neural network, we successfully recover at least 90%\nof the most significant bits with about 1500 crafted inputs. These information\nenable to efficiently train a substitute model, with only 8% of the training\ndataset, that reaches high fidelity and near identical accuracy level than the\nvictim model.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:09:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hector","Kevin",""],["Moellic","Pierre-Alain",""],["Dumont","Mathieu",""],["Dutertre","Jean-Max",""]]}
{"id":"2308.16704","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Dielectron production in central Pb$-$Pb collisions at\n  $\\sqrt{s_\\mathrm{NN}}$ = 5.02 TeV","comments":"38 pages, 12 captioned figures, 1 table, authors from page 32,\n  submitted to PRC, figures at http://alice-publications.web.cern.ch/node/9679","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-194","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The first measurement of the e$^+$e$^-$ pair production at midrapidity and\nlow invariant mass in central Pb$-$Pb collisions at\n$\\sqrt{s_{\\mathrm{NN}}}=5.02$ TeV at the LHC is presented. The yield of\ne$^+$e$^-$ pairs is compared with a cocktail of expected hadronic decay\ncontributions in the invariant mass ($m_{\\rm ee}$) and pair transverse momentum\n($p_{\\rm T,ee}$) ranges $m_{\\rm ee} < 3.5$ GeV$/c^2$ and $p_{\\rm T,ee} < 8$\nGeV$/c$. For $0.18 < m_{\\rm ee} < 0.5$ GeV$/c^2$ the ratio of data to the\ncocktail of hadronic contributions without $\\rho$ mesons amounts to $1.42 \\pm\n0.12 \\ ({\\rm stat.}) \\pm 0.17 \\ ({\\rm syst.}) \\pm 0.12 \\ ({\\rm cocktail})$ and\n$1.44 \\pm 0.12 \\ ({\\rm stat.}) \\pm 0.17 \\ ({\\rm syst.}) ^{+0.17}_{-0.21} \\\n({\\rm cocktail})$, including or not including medium effects in the estimation\nof the heavy-flavor background, respectively. It is consistent with predictions\nfrom two different models for an additional contribution of thermal e$^+$e$^-$\npairs from the hadronic and partonic phases. In the intermediate-mass range\n($1.2 < m_{\\rm ee} < 2.6$ GeV$/c^2$), the pair transverse impact parameter of\nthe e$^+$e$^-$ pairs (DCA$_{\\rm ee}$) is used for the first time in Pb$-$Pb\ncollisions to separate displaced dielectrons from heavy-flavor hadron decays\nfrom a possible (thermal) contribution produced at the interaction point. The\ndata are consistent with a suppression of e$^+$e$^-$ pairs from ${\\rm\nc\\overline{c}}$ and an additional prompt component. Finally, the first\ndirect-photon measurement in the 10% most central Pb$-$Pb collisions at\n$\\sqrt{s_{\\mathrm{NN}}}=5.02$ TeV is reported via the study of virtual direct\nphotons in the transverse momentum range $1 < p_{\\rm T} < 5$ GeV$/c$. A model\nincluding prompt photons, as well as photons from the pre-equilibrium and\nfluid-dynamic phases, can reproduce the result, while being at the upper edge\nof the data uncertainties.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:13:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16705","submitter":"Nayeon Lee","authors":"Nayeon Lee, Chani Jung, Junho Myung, Jiho Jin, Juho Kim, Alice Oh","title":"CReHate: Cross-cultural Re-annotation of English Hate Speech Dataset","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":"  English datasets predominantly reflect the perspectives of certain\nnationalities, which can lead to cultural biases in models and datasets. This\nis particularly problematic in tasks heavily influenced by subjectivity, such\nas hate speech detection. To delve into how individuals from different\ncountries perceive hate speech, we introduce CReHate, a cross-cultural\nre-annotation of the sampled SBIC dataset. This dataset includes annotations\nfrom five distinct countries: Australia, Singapore, South Africa, the United\nKingdom, and the United States. Our thorough statistical analysis highlights\nsignificant differences based on nationality, with only 59.4% of the samples\nachieving consensus among all countries. We also introduce a culturally\nsensitive hate speech classifier via transfer learning, adept at capturing\nperspectives of different nationalities. These findings underscore the need to\nre-evaluate certain aspects of NLP research, especially with regard to the\nnuanced nature of hate speech in the English language.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:14:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lee","Nayeon",""],["Jung","Chani",""],["Myung","Junho",""],["Jin","Jiho",""],["Kim","Juho",""],["Oh","Alice",""]]}
{"id":"2308.16706","submitter":"ALICE Publications","authors":"ALICE Collaboration","title":"Studying strangeness and baryon production mechanisms through angular\n  correlations between charged $\\Xi$ baryons and identified hadrons in pp\n  collisions at $\\sqrt{s}$ = 13 TeV","comments":"37 pages, 14 captioned figures, 3 tables, authors from page 31,\n  submitted to JHEP, figures at http://alice-publications.web.cern.ch/node/9678","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-198","categories":"hep-ex nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The angular correlations between charged $\\Xi$ baryons and associated\nidentified hadrons (pions, kaons, protons, $\\Lambda$ baryons, and $\\Xi$\nbaryons) are measured in pp collisions at $\\sqrt{s} = 13$ TeV with the ALICE\ndetector to give insight into the particle production mechanisms and balancing\nof quantum numbers on the microscopic level. In particular, the distribution of\nstrangeness is investigated in the correlations between the doubly-strange\n$\\Xi$ baryon and mesons and baryons that contain a single strange quark, K and\n$\\Lambda$. As a reference, the results are compared to $\\Xi\\pi$ and\n$\\Xi\\mathrm{p}$ correlations, where the associated mesons and baryons do not\ncontain a strange valence quark. These measurements are expected to be\nsensitive to whether strangeness is produced through string breaking or in a\nthermal production scenario. Furthermore, the multiplicity dependence of the\ncorrelation functions is measured to look for the turn-on of additional\nparticle production mechanisms with event activity. The results are compared to\npredictions from the string-breaking model PYTHIA 8, including tunes with\nbaryon junctions and rope hadronisation enabled, the cluster hadronisation\nmodel HERWIG 7, and the core-corona model EPOS-LHC. While some aspects of the\nexperimental data are described quantitatively or qualitatively by the Monte\nCarlo models, no one model can match all features of the data. These results\nprovide stringent constraints on the strangeness and baryon number production\nmechanisms in pp collisions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:16:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["ALICE Collaboration","",""]]}
{"id":"2308.16707","submitter":"Hugo Roger Paz Prof.","authors":"Hugo Roger Paz","title":"Causal Analysis of First-Year Course Approval Delays in an Engineering\n  Major Through Inference Techniques","comments":"15 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study addresses the problem of delays in the approval of first-year\ncourses in the Civil Engineering Major at the National University of Tucum\\'an,\nArgentina. Students take an average of 5 years to pass these subjects. Using\nthe DoWhy and Causal Discovery Toolbox tools, we looked to identify the\nunderlying causes of these delays. The analysis revealed that the regulatory\nstructure of the program and the evaluation methods play a crucial role in this\ndelay. Specifically, the accumulation of regular subjects without passing a\nfinal exam was identified as a key factor. These findings can guide\ninterventions to improve student success rates and the effectiveness of the\neducation system in general.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:17:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Paz","Hugo Roger",""]]}
{"id":"2308.16708","submitter":"Sebastian Lubos","authors":"Sebastian Lubos, Thi Ngoc Trang Tran, Seda Polat Erdeniz, Merfat El\n  Mansi, Alexander Felfernig, Manfred Wundara and Gerhard Leitner","title":"Concentrating on the Impact: Consequence-based Explanations in\n  Recommender Systems","comments":"Preprint of the paper to be presented at IntRS'23: Joint Workshop on\n  Interfaces and Human Decision Making for Recommender Systems, September 18,\n  2023, Singapore. paper will be published in the workshop proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommender systems assist users in decision-making, where the presentation\nof recommended items and their explanations are critical factors for enhancing\nthe overall user experience. Although various methods for generating\nexplanations have been proposed, there is still room for improvement,\nparticularly for users who lack expertise in a specific item domain. In this\nstudy, we introduce the novel concept of \\textit{consequence-based\nexplanations}, a type of explanation that emphasizes the individual impact of\nconsuming a recommended item on the user, which makes the effect of following\nrecommendations clearer. We conducted an online user study to examine our\nassumption about the appreciation of consequence-based explanations and their\nimpacts on different explanation aims in recommender systems. Our findings\nhighlight the importance of consequence-based explanations, which were\nwell-received by users and effectively improved user satisfaction in\nrecommender systems. These results provide valuable insights for designing\nengaging explanations that can enhance the overall user experience in\ndecision-making.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:24:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lubos","Sebastian",""],["Tran","Thi Ngoc Trang",""],["Erdeniz","Seda Polat",""],["Mansi","Merfat El",""],["Felfernig","Alexander",""],["Wundara","Manfred",""],["Leitner","Gerhard",""]]}
{"id":"2308.16709","submitter":"Pierre Le Doussal","authors":"Pierre Le Doussal","title":"Dynamics at the edge for independent diffusing particles","comments":"44 pages, 8 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":"  We study the dynamics of the outliers for a large number of independent\nBrownian particles in one dimension. We derive the multi-time joint\ndistribution of the position of the rightmost particle, by two different\nmethods. We obtain the two time joint distribution of the maximum and second\nmaximum positions, and study the counting statistics at the edge. Finally we\nderive the multi-time joint distribution of the running maximum, as well as the\njoint distribution of the arrival time of the first particle at several space\npoints.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:25:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Doussal","Pierre Le",""]]}
{"id":"2308.16710","submitter":"Kyle Knoepfel","authors":"Kyle J. Knoepfel","title":"Meld: Exploring the Feasibility of a Framework-less Framework","comments":"8 pages, 5 figures, 1 table, To be published in Proceedings of CHEP23","journal-ref":null,"doi":null,"report-no":"FERMILAB-CONF-23-465-CSAID","categories":"cs.DC physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  HEP data-processing frameworks are essential ingredients in getting from raw\ndata to physics results. But they are often tricky to use well, and they\npresent a significant learning barrier for the beginning HEP physicist. In\naddition, existing frameworks typically support rigid, collider-based data\nmodels, which do not map well to neutrino-physics experiments like DUNE.\nNeutrino physicists thus expend significant effort working around framework\nlimitations instead of using a framework that directly supports their needs.\n  Presented here is Meld, a Fermilab R&D project, which intends to address\nthese limitations. By leveraging modern C++ capabilities, state-of-the-art\nconcurrency libraries, and a flexible data model, it is possible for beginning\n(and seasoned) HEP physicists to execute framework programs easily and\nefficiently, with minimal coupling to framework-specific constructs. Meld aims\nto directly support the frameworks needs of neutrino experiments like DUNE as\nwell as the more common collider-based experiments.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:25:13 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Knoepfel","Kyle J.",""]]}
{"id":"2308.16711","submitter":"Stefan Weltge","authors":"Jamico Schade, Makrand Sinha, Stefan Weltge","title":"Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set\n  and Knapsack","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM cs.DS math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Standard mixed-integer programming formulations for the stable set problem on\n$n$-node graphs require $n$ integer variables. We prove that this is almost\noptimal: We give a family of $n$-node graphs for which every polynomial-size\nMIP formulation requires $\\Omega(n/\\log^2 n)$ integer variables. By a\npolyhedral reduction we obtain an analogous result for $n$-item knapsack\nproblems. In both cases, this improves the previously known bounds of\n$\\Omega(\\sqrt{n}/\\log n)$ by Cevallos, Weltge & Zenklusen (SODA 2018).\n  To this end, we show that there exists a family of $n$-node graphs whose\nstable set polytopes satisfy the following: any $(1+\\varepsilon/n)$-approximate\nextended formulation for these polytopes, for some constant $\\varepsilon > 0$,\nhas size $2^{\\Omega(n/\\log n)}$. Our proof extends and simplifies the\ninformation-theoretic methods due to G\\\"o\\\"os, Jain & Watson (FOCS 2016, SIAM\nJ. Comput. 2018) who showed the same result for the case of exact extended\nformulations (i.e. $\\varepsilon = 0$).\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:25:13 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Schade","Jamico",""],["Sinha","Makrand",""],["Weltge","Stefan",""]]}
{"id":"2308.16712","submitter":"Tom Westerhout","authors":"Tom Westerhout and Bradford L. Chamberlain","title":"Implementing scalable matrix-vector products for the exact\n  diagonalization methods in quantum many-body physics","comments":"11 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Exact diagonalization is a well-established method for simulating small\nquantum systems. Its applicability is limited by the exponential growth of the\nso-called Hamiltonian matrix that needs to be diagonalized. Physical symmetries\nare usually utilized to reduce the matrix dimension, and distributed-memory\nparallelism is employed to explore larger systems. This paper focuses on the\nimplementation the core distributed algorithms, with a special emphasis on the\nmatrix-vector product operation. Instead of the conventional MPI+X paradigm,\nChapel is chosen as the language for these distributed algorithms.\n  We provide a comprehensive description of the algorithms and present\nperformance and scalability tests. Our implementation outperforms the\nstate-of-the-art MPI-based solution by a factor of 7--8 on 32 compute nodes or\n4096 cores and exhibits very good scaling on up to 256 nodes or 32768 cores.\nThe implementation has 3 times fewer software lines of code than the current\nstate of the art while remaining fully generic.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:26:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Westerhout","Tom",""],["Chamberlain","Bradford L.",""]]}
{"id":"2308.16713","submitter":"Sheng Xu","authors":"Hongtai Jing, Zhengtao Gao, Sheng Xu, Tao Shen, Zhangzhi Peng, Shwai\n  He, Tao You, Shuang Ye, Wei Lin, Siqi Sun","title":"Accurate Prediction of Antibody Function and Structure Using\n  Bio-Inspired Antibody Language Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent decades, antibodies have emerged as indispensable therapeutics for\ncombating diseases, particularly viral infections. However, their development\nhas been hindered by limited structural information and labor-intensive\nengineering processes. Fortunately, significant advancements in deep learning\nmethods have facilitated the precise prediction of protein structure and\nfunction by leveraging co-evolution information from homologous proteins.\nDespite these advances, predicting the conformation of antibodies remains\nchallenging due to their unique evolution and the high flexibility of their\nantigen-binding regions. Here, to address this challenge, we present the\nBio-inspired Antibody Language Model (BALM). This model is trained on a vast\ndataset comprising 336 million 40% non-redundant unlabeled antibody sequences,\ncapturing both unique and conserved properties specific to antibodies. Notably,\nBALM showcases exceptional performance across four antigen-binding prediction\ntasks. Moreover, we introduce BALMFold, an end-to-end method derived from BALM,\ncapable of swiftly predicting full atomic antibody structures from individual\nsequences. Remarkably, BALMFold outperforms those well-established methods like\nAlphaFold2, IgFold, ESMFold, and OmegaFold in the antibody benchmark,\ndemonstrating significant potential to advance innovative engineering and\nstreamline therapeutic antibody development by reducing the need for\nunnecessary trials.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:26:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jing","Hongtai",""],["Gao","Zhengtao",""],["Xu","Sheng",""],["Shen","Tao",""],["Peng","Zhangzhi",""],["He","Shwai",""],["You","Tao",""],["Ye","Shuang",""],["Lin","Wei",""],["Sun","Siqi",""]]}
{"id":"2308.16714","submitter":"Chen Gao","authors":"Si Liu, Chen Gao, Yuan Chen, Xingyu Peng, Xianghao Kong, Kun Wang,\n  Runsheng Xu, Wentao Jiang, Hao Xiang, Jiaqi Ma, Miao Wang","title":"Towards Vehicle-to-everything Autonomous Driving: A Survey on\n  Collaborative Perception","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vehicle-to-everything (V2X) autonomous driving opens up a promising direction\nfor developing a new generation of intelligent transportation systems.\nCollaborative perception (CP) as an essential component to achieve V2X can\novercome the inherent limitations of individual perception, including occlusion\nand long-range perception. In this survey, we provide a comprehensive review of\nCP methods for V2X scenarios, bringing a profound and in-depth understanding to\nthe community. Specifically, we first introduce the architecture and workflow\nof typical V2X systems, which affords a broader perspective to understand the\nentire V2X system and the role of CP within it. Then, we thoroughly summarize\nand analyze existing V2X perception datasets and CP methods. Particularly, we\nintroduce numerous CP methods from various crucial perspectives, including\ncollaboration stages, roadside sensors placement, latency compensation,\nperformance-bandwidth trade-off, attack/defense, pose alignment, etc. Moreover,\nwe conduct extensive experimental analyses to compare and examine current CP\nmethods, revealing some essential and unexplored insights. Specifically, we\nanalyze the performance changes of different methods under different\nbandwidths, providing a deep insight into the performance-bandwidth trade-off\nissue. Also, we examine methods under different LiDAR ranges. To study the\nmodel robustness, we further investigate the effects of various simulated\nreal-world noises on the performance of different CP methods, covering\ncommunication latency, lossy communication, localization errors, and mixed\nnoises. In addition, we look into the sim-to-real generalization ability of\nexisting CP methods. At last, we thoroughly discuss issues and challenges,\nhighlighting promising directions for future efforts. Our codes for\nexperimental analysis will be public at\nhttps://github.com/memberRE/Collaborative-Perception.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:28:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Si",""],["Gao","Chen",""],["Chen","Yuan",""],["Peng","Xingyu",""],["Kong","Xianghao",""],["Wang","Kun",""],["Xu","Runsheng",""],["Jiang","Wentao",""],["Xiang","Hao",""],["Ma","Jiaqi",""],["Wang","Miao",""]]}
{"id":"2308.16715","submitter":"Marco Saldutti","authors":"Marco Saldutti, Yi Yu, George Kountouris, Philip Tr{\\o}st Kristensen\n  and Jesper M{\\o}rk","title":"Carrier diffusion in semiconductor nanoscale resonators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  It is shown that semiconductor nanoscale resonators with extreme dielectric\nconfinement accelerate the diffusion of electron-hole pairs excited by\nnonlinear absorption. These novel cavity designs may lead to optical switches\nwith superior modulation speeds compared to conventional geometries. The\nresponse function of the effective carrier density is computed by an efficient\neigenmode expansion technique. A few eigenmodes of the diffusion equation\nconveniently capture the long-timescale carrier decay rate, which is\nadvantageous compared to time-domain simulations. Notably, the eigenmode\napproach elucidates the contribution to carrier diffusion of the in-plane and\nout-of-plane cavity geometry, which may guide future designs.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:28:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Saldutti","Marco",""],["Yu","Yi",""],["Kountouris","George",""],["Kristensen","Philip Tr\u00f8st",""],["M\u00f8rk","Jesper",""]]}
{"id":"2308.16716","submitter":"Christopher Schwan","authors":"Stefan Dittmaier, Philipp Maierh\\\"ofer, Christopher Schwan, Ramon\n  Winterhalder","title":"Like-Sign W-Boson Scattering at the LHC -- Approximations and Full\n  Next-to-Leading-Order Predictions","comments":"57 pages, 70 figures","journal-ref":null,"doi":null,"report-no":"FR-PHENO-2023-09, IRMP-CP3-23-42","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a new calculation of next-to-leading-order corrections of the\nstrong and electroweak interactions to like-sign W-boson scattering at the\nLarge Hadron Collider, implemented in the Monte Carlo integrator Bonsay. The\ncalculation includes leptonic decays of the $\\mathrm{W}$ bosons. It comprises\nthe whole tower of next-to-leading-order contributions to the cross section,\nwhich scale like $\\alpha_\\mathrm{s}^3\\alpha^4$, $\\alpha_\\mathrm{s}^2\\alpha^5$,\n$\\alpha_\\mathrm{s}\\alpha^6$, and $\\alpha^7$ in the strong and electroweak\ncouplings $\\alpha_\\mathrm{s}$ and $\\alpha$. We present a detailed survey of\nnumerical results confirming the occurrence of large pure electroweak\ncorrections of the order of $\\sim-12\\%$ for integrated cross sections and even\nlarger corrections in high-energy tails of distributions. The electroweak\ncorrections account for the major part of the complete next-to-leading-order\ncorrection, which amounts to $15{-}20\\%$ in size, depending on the details of\nthe event selection chosen for analysing vector-boson-scattering. Moreover, we\ncompare the full next-to-leading-order corrections to approximate results based\non the neglect of contributions that are not enhanced by the vector-boson\nscattering kinematics (VBS approximation) and on resonance expansions for the\n$\\mathrm{W}$-boson decays (double-pole approximation); the quality of this\napproximation is good within $\\sim 1.5\\%$ for integrated cross sections and the\ndominating parts of the differential distributions. Finally, for the\nleading-order predictions, we construct different versions of effective\nvector-boson approximations, which are based on cross-section contributions\nthat are enhanced by collinear emission of $\\mathrm{W}$ bosons off the\ninitial-state (anti)quarks; in line with previous findings in the literature,\nit turns out that the approximative quality is rather limited for applications\nat the LHC.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:32:52 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dittmaier","Stefan",""],["Maierh\u00f6fer","Philipp",""],["Schwan","Christopher",""],["Winterhalder","Ramon",""]]}
{"id":"2308.16717","submitter":"Tina Wach","authors":"T. Wach, A. M. W. Mitchell, V. Joshi, S. Funk (for the H.E.S.S.\n  collaboration)","title":"Joint H.E.S.S. and Fermi-LAT analysis of the region around PSR\n  J1813-1749","comments":"8 pages, 4 figures, 1 table, In proceedings of ICRC2023","journal-ref":"Proceedings of the 38th International Cosmic Ray Conference,\n  PoS(ICRC2023)589","doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  HESS J1813-178 is one of the brightest sources detected during the first HESS\nGalactic Plane survey. The compact source, also detected by MAGIC, is believed\nto be a pulsar wind nebula powered by one of the most powerful pulsars known in\nthe Galaxy, PSR J1813-1749 with a spin-down luminosity of $\\dot{\\mathrm{E}} =\n5.6 \\cdot 10^{37}\\,\\mathrm{erg}\\,\\mathrm{s}^{-1}$. With its extreme physical\nproperties, as well as the pulsar's young age of 5.6 kyrs, the $\\gamma$-rays\ndetected in this region allow us to study the evolution of a highly atypical\nsystem. Previous studies of the region in the GeV energy range show emission\nextended beyond the size of the compact H.E.S.S. source. Using the archival\nH.E.S.S. data with improved background methods, we perform a detailed\nmorphological and spectral analysis of the region. Additionally to the compact,\nbright emission component, we find significantly extended emission, whose\nposition is coincident with HESS J1813-178. We reanalyse the region in GeV and\nderive a joint-model in order to find a continuous description of the emission\nin the region from GeV to TeV. Using the results derived in this analysis, as\nwell as X-ray and radio data of the region, we perform multi-wavelength\nspectral modeling. Possible hadronic or leptonic origins of the $\\gamma$-ray\nemission are investigated, and the diffusion parameters necessary to explain\nthe extended emission are examined.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:33:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wach","T.","","for the H.E.S.S.\n  collaboration"],["Mitchell","A. M. W.","","for the H.E.S.S.\n  collaboration"],["Joshi","V.","","for the H.E.S.S.\n  collaboration"],["Funk","S.","","for the H.E.S.S.\n  collaboration"]]}
{"id":"2308.16718","submitter":"Yu Shi","authors":"Yu Shi, Dong-Dong Wu, Xin Geng, Min-Ling Zhang","title":"Robust Representation Learning for Unreliable Partial Label Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Partial Label Learning (PLL) is a type of weakly supervised learning where\neach training instance is assigned a set of candidate labels, but only one\nlabel is the ground-truth. However, this idealistic assumption may not always\nhold due to potential annotation inaccuracies, meaning the ground-truth may not\nbe present in the candidate label set. This is known as Unreliable Partial\nLabel Learning (UPLL) that introduces an additional complexity due to the\ninherent unreliability and ambiguity of partial labels, often resulting in a\nsub-optimal performance with existing methods. To address this challenge, we\npropose the Unreliability-Robust Representation Learning framework (URRL) that\nleverages unreliability-robust contrastive learning to help the model fortify\nagainst unreliable partial labels effectively. Concurrently, we propose a dual\nstrategy that combines KNN-based candidate label set correction and\nconsistency-regularization-based label disambiguation to refine label quality\nand enhance the ability of representation learning within the URRL framework.\nExtensive experiments demonstrate that the proposed method outperforms\nstate-of-the-art PLL methods on various datasets with diverse degrees of\nunreliability and ambiguity. Furthermore, we provide a theoretical analysis of\nour approach from the perspective of the expectation maximization (EM)\nalgorithm. Upon acceptance, we pledge to make the code publicly accessible.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:37:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shi","Yu",""],["Wu","Dong-Dong",""],["Geng","Xin",""],["Zhang","Min-Ling",""]]}
{"id":"2308.16719","submitter":"Sharvari N P","authors":"Sharvari N P, Dibakar Das, Jyotsna Bapat and Debabrata Das","title":"Energy Efficient UAV-Assisted Emergency Communication with Reliable\n  Connectivity and Collision Avoidance","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Emergency communication is vital for search and rescue operations following\nnatural disasters. Unmanned Aerial Vehicles (UAVs) can significantly assist\nemergency communication by agile positioning, maintaining connectivity during\nrapid motion, and relaying critical disaster-related information to Ground\nControl Stations (GCS). Designing effective routing protocols for relaying\ncrucial data in UAV networks is challenging due to dynamic topology, rapid\nmobility, and limited UAV resources. This paper presents a novel\nenergy-constrained routing mechanism that ensures connectivity, inter-UAV\ncollision avoidance, and network restoration post-UAV fragmentation while\nadapting without a predefined UAV path. The proposed method employs improved Q\nlearning to optimize the next-hop node selection. Considering these factors,\nthe paper proposes a novel, Improved Q-learning-based Multi-hop Routing (IQMR)\nprotocol. Simulation results validate IQMRs adaptability to changing system\nconditions and superiority over QMR, QTAR, and QFANET in energy efficiency and\ndata throughput. IQMR achieves energy consumption efficiency improvements of\n32.27%, 36.35%, and 36.35% over QMR, Q-FANET, and QTAR, along with\nsignificantly higher data throughput enhancements of 53.3%, 80.35%, and 93.36%\nover Q-FANET, QMR, and QTAR.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:37:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["P","Sharvari N",""],["Das","Dibakar",""],["Bapat","Jyotsna",""],["Das","Debabrata",""]]}
{"id":"2308.16720","submitter":"Henrik Eisenmann","authors":"Markus Bachmayr, Henrik Eisenmann, Andr\\'e Uschmajew","title":"Dynamical low-rank tensor approximations to high-dimensional parabolic\n  problems: existence and convergence of spatial discretizations","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 consider dynamical low-rank approximations to parabolic problems on\nhigher-order tensor manifolds in Hilbert spaces. In addition to existence of\nsolutions and their stability with respect to perturbations to the problem\ndata, we show convergence of spatial discretizations. Our framework\naccommodates various standard low-rank tensor formats for multivariate\nfunctions, including tensor train and hierarchical tensors.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:38:13 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bachmayr","Markus",""],["Eisenmann","Henrik",""],["Uschmajew","Andr\u00e9",""]]}
{"id":"2308.16721","submitter":"Nicolas Daans","authors":"Nicolas Daans, V\\'it\\v{e}zslav Kala, Siu Hang Man","title":"Universal quadratic forms and Northcott property of infinite number\n  fields","comments":"preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that if a universal quadratic form exists over an infinite degree,\ntotally real extension of the field of rationals $\\mathbb{Q}$, then the set of\ntotally positive integers in the extension does not have the Northcott\nproperty. In particular, this implies that no universal form exists over the\ncompositum of all totally real Galois fields of a fixed prime degree over\n$\\mathbb{Q}$. Further, by considering the existence of infinitely many square\nclasses of totally positive units, we show that no classical universal form\nexists over the compositum of all such fields of degree $3d$ (for each fixed\nodd integer $d$).\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:38:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Daans","Nicolas",""],["Kala","V\u00edt\u011bzslav",""],["Man","Siu Hang",""]]}
{"id":"2308.16722","submitter":"Andrea Dubla Dr","authors":"L. Vermunt, Y. Seemann, A. Dubla, S. Floerchinger, E. Grossi, A.\n  Kirchner, S. Masciocchi, I. Selyuzhenkov","title":"Mapping QGP properties in Pb--Pb and Xe--Xe collisions at the LHC","comments":"17 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A phenomenological analysis of the experimental measurements of transverse\nmomentum spectra of identified charged hadrons and strange hyperons in \\PbPb\nand \\XeXe collisions at the LHC is presented. The analysis is based on the\nrelativistic fluid dynamics description implemented in the numerically\nefficient \\fluidum approach. Building on our previous work, we separate in our\ntreatment the chemical and kinetic freeze-out, and incorporate the partial\nchemical equilibrium to describe the late stages of the collision evolution.\nThis analysis makes use of Bayesian inference to determine key parameters of\nthe QGP evolution and its properties including the shear and bulk viscosity to\nentropy ratios, the initialisation time, the initial entropy density, and the\nfreeze-out temperatures. The physics parameters and their posterior\nprobabilities are extracted using a global search in multidimensional space\nwith modern machine learning tools, such as ensembles of neural networks. We\nemploy our newly developed fast framework to assess systematic uncertainties in\nthe extracted model parameters by systematically varying key components of our\nanalysis.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:40:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vermunt","L.",""],["Seemann","Y.",""],["Dubla","A.",""],["Floerchinger","S.",""],["Grossi","E.",""],["Kirchner","A.",""],["Masciocchi","S.",""],["Selyuzhenkov","I.",""]]}
{"id":"2308.16723","submitter":"Victor Valad\\~ao","authors":"Victor de Jesus Valad\\~ao","title":"Circulation Statistics in Homogeneous and Isotropic Turbulence","comments":"Ph.D. Thesis - preliminary version","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is the committee version of a Thesis presented to the PostGrad Program\nin Physics of the Physics Institute of the Federal University of Rio de Janeiro\n(UFRJ), as a necessary requirement for the title of Ph.D. in Science (Physics).\nThe development of the Vortex Gas Model (VGM) introduces a novel statistical\nframework for describing the characteristics of velocity circulation. In this\nmodel, the underlying foundations rely on the statistical attributes of two\nfundamental constituents. The first is a GMC field that governs intermittent\nbehavior and the second constituent is a Gaussian Free field responsible for\nthe partial polarization of the vortices in the gas. The model is revisited in\na more sophisticated language, where volume exclusion among vortices is\naddressed. These additions were subsequently validated through numerical\nsimulations of turbulent Navier-Stokes equations. This revised approach\nharmonizes with the multifractal characteristics exhibited by circulation\nstatistics, offering a compelling elucidation for the phenomenon of\nlinearization of the statistical circulation moments, observed in recent\nnumerical simulation.\n  In the end, a field theoretical approach, known as\nMartin-Siggia-Rose-Janssen-de Dominicis (MSRJD) functional method is carried\nout in the context of circulation probability density function. This approach\ndelves into the realm of extreme circulation events, often referred to as\nInstantons, through two distinct methodologies: The First investigates the\nlinear solutions and, by a renormalization group argument a time-rescaling\nsymmetry is discussed. Secondly, a numerical strategy is implemented to tackle\nthe nonlinear instanton equations in the axisymmetric approximation. This\napproach addresses the typical topology exhibited by the velocity field\nassociated with extreme circulation events.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:40:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Valad\u00e3o","Victor de Jesus",""]]}
{"id":"2308.16724","submitter":"Luise Kaven","authors":"Luise F. Kaven, Artur M. Schweidtmann, Jan Keil, Jana Israel, Nadja\n  Wolter, Alexander Mitsos","title":"Data-driven Product-Process Optimization of N-isopropylacrylamide\n  Microgel Flow-Synthesis","comments":"Manuscript: 24 pages, 8 figures; SI: 9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Microgels are cross-linked, colloidal polymer networks with great potential\nfor stimuli-response release in drug-delivery applications, as their size in\nthe nanometer range allows them to pass human cell boundaries. For applications\nwith specified requirements regarding size, producing tailored microgels in a\ncontinuous flow reactor is advantageous because the microgel properties can be\ncontrolled tightly. However, no fully-specified mechanistic models are\navailable for continuous microgel synthesis, as the physical properties of the\nincluded components are only studied partly. To address this gap and accelerate\ntailor-made microgel development, we propose a data-driven optimization in a\nhardware-in-the-loop approach to efficiently synthesize microgels with defined\nsizes. We optimize the synthesis regarding conflicting objectives (maximum\nproduction efficiency, minimum energy consumption, and the desired microgel\nradius) by applying Bayesian optimization via the solver ``Thompson sampling\nefficient multi-objective optimization'' (TS-EMO). We validate the optimization\nusing the deterministic global solver ``McCormick-based Algorithm for\nmixed-integer Nonlinear Global Optimization'' (MAiNGO) and verify three\ncomputed Pareto optimal solutions via experiments. The proposed framework can\nbe applied to other desired microgel properties and reactor setups and has the\npotential of efficient development by minimizing number of experiments and\nmodelling effort needed.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:40:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kaven","Luise F.",""],["Schweidtmann","Artur M.",""],["Keil","Jan",""],["Israel","Jana",""],["Wolter","Nadja",""],["Mitsos","Alexander",""]]}
{"id":"2308.16725","submitter":"Zexin Hu Mr.","authors":"Zexin Hu, Kun Hu, Clinton Mo, Lei Pan, Zhiyong Wang","title":"Terrain Diffusion Network: Climatic-Aware Terrain Generation with\n  Geological Sketch Guidance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sketch-based terrain generation seeks to create realistic landscapes for\nvirtual environments in various applications such as computer games, animation\nand virtual reality. Recently, deep learning based terrain generation has\nemerged, notably the ones based on generative adversarial networks (GAN).\nHowever, these methods often struggle to fulfill the requirements of flexible\nuser control and maintain generative diversity for realistic terrain.\nTherefore, we propose a novel diffusion-based method, namely terrain diffusion\nnetwork (TDN), which actively incorporates user guidance for enhanced\ncontrollability, taking into account terrain features like rivers, ridges,\nbasins, and peaks. Instead of adhering to a conventional monolithic denoising\nprocess, which often compromises the fidelity of terrain details or the\nalignment with user control, a multi-level denoising scheme is proposed to\ngenerate more realistic terrains by taking into account fine-grained details,\nparticularly those related to climatic patterns influenced by erosion and\ntectonic activities. Specifically, three terrain synthesisers are designed for\nstructural, intermediate, and fine-grained level denoising purposes, which\nallow each synthesiser concentrate on a distinct terrain aspect. Moreover, to\nmaximise the efficiency of our TDN, we further introduce terrain and sketch\nlatent spaces for the synthesizers with pre-trained terrain autoencoders.\nComprehensive experiments on a new dataset constructed from NASA Topology\nImages clearly demonstrate the effectiveness of our proposed method, achieving\nthe state-of-the-art performance. Our code and dataset will be publicly\navailable.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:41:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hu","Zexin",""],["Hu","Kun",""],["Mo","Clinton",""],["Pan","Lei",""],["Wang","Zhiyong",""]]}
{"id":"2308.16726","submitter":"Thierry Coquand","authors":"Thierry Coquand","title":"A variation of Reynolds-Hurkens Paradox","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO math.LO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We present a variation of Hurkens paradox, which can itself be seen as a\nvariation of Reynolds result that there is no set theoretic model of\npolymorphism.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:42:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Coquand","Thierry",""]]}
{"id":"2308.16727","submitter":"Muneya Matsui","authors":"Muneya Matsui and Toshiro Watanabe","title":"On convolution closure properties of subexponentiality approaching from\n  densities","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-closedness of subexponentiality by the convolution operation is\nwell-known. We go a step further and show that subexponentiality and\nnon-subexponentiality are generally changeable by the convolution. We also give\nseveral conditions, by which (non-) subexponentiality is kept. Most results are\ngiven with densities, which are easily converted to those for distributions. As\na by-product, we give counterexamples to several past results, which were used\nto derive the non-closedness of the convolution, and modify the original proof.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:43:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Matsui","Muneya",""],["Watanabe","Toshiro",""]]}
{"id":"2308.16728","submitter":"Michael Tait","authors":"John Byrne, Michael Tait, and Craig Timmons","title":"Forbidden subgraphs and complete partitions","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 an $(r,k)$-graph if its vertex set can be partitioned into\n$r$ parts of size at most $k$ with at least one edge between any two parts. Let\n$f(r,H)$ be the minimum $k$ for which there exists an $H$-free $(r,k)$-graph.\nIn this paper we build on the work of Axenovich and Martin, obtaining improved\nbounds on this function when $H$ is a complete bipartite graph, even cycle, or\ntree. Some of these bounds are best possible up to a constant factor and\nconfirm a conjecture of Axenovich and Martin in several cases. We also\ngeneralize this extremal problem to uniform hypergraphs and prove some initial\nresults in that setting.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:46:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Byrne","John",""],["Tait","Michael",""],["Timmons","Craig",""]]}
{"id":"2308.16729","submitter":"Ivano Malavolta","authors":"Ivano Malavolta, Kishan Nirghin, Gian Luca Scoccia, Simone Romano,\n  Salvatore Lombardi, Giuseppe Scanniello, Patricia Lago","title":"JavaScript Dead Code Identification, Elimination, and Empirical\n  Assessment","comments":null,"journal-ref":null,"doi":"10.1109/TSE.2023.3267848","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Web apps are built by using a combination of HTML, CSS, and JavaScript. While\nbuilding modern web apps, it is common practice to make use of third-party\nlibraries and frameworks, as to improve developers' productivity and code\nquality. Alongside these benefits, the adoption of such libraries results in\nthe introduction of JavaScript dead code, i.e., code implementing unused\nfunctionalities. The costs for downloading and parsing dead code can negatively\ncontribute to the loading time and resource usage of web apps. The goal of our\nstudy is two-fold. First, we present Lacuna, an approach for automatically\ndetecting and eliminating JavaScript dead code from web apps. The proposed\napproach supports both static and dynamic analyses, it is extensible and can be\napplied to any JavaScript code base, without imposing constraints on the coding\nstyle or on the use of specific JavaScript constructs. Secondly, by leveraging\nLacuna we conduct an experiment to empirically evaluate the run-time overhead\nof JavaScript dead code in terms of energy consumption, performance, network\nusage, and resource usage in the context of mobile web apps. We applied Lacuna\nfour times on 30 mobile web apps independently developed by third-party\ndevelopers, each time eliminating dead code according to a different\noptimization level provided by Lacuna. Afterward, each different version of the\nweb app is executed on an Android device, while collecting measures to assess\nthe potential run-time overhead caused by dead code. Experimental results,\namong others, highlight that the removal of JavaScript dead code has a positive\nimpact on the loading time of mobile web apps, while significantly reducing the\nnumber of bytes transferred over the network.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:48:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Malavolta","Ivano",""],["Nirghin","Kishan",""],["Scoccia","Gian Luca",""],["Romano","Simone",""],["Lombardi","Salvatore",""],["Scanniello","Giuseppe",""],["Lago","Patricia",""]]}
{"id":"2308.16730","submitter":"Mahmoud Salhab","authors":"Mahmoud Salhab and Khaleel Mershad","title":"Proof of Deep Learning: Approaches, Challenges, and Future Directions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rise of computational power has led to unprecedented performance gains\nfor deep learning models. As more data becomes available and model\narchitectures become more complex, the need for more computational power\nincreases. On the other hand, since the introduction of Bitcoin as the first\ncryptocurrency and the establishment of the concept of blockchain as a\ndistributed ledger, many variants and approaches have been proposed. However,\nmany of them have one thing in common, which is the Proof of Work (PoW)\nconsensus mechanism. PoW is mainly used to support the process of new block\ngeneration. While PoW has proven its robustness, its main drawback is that it\nrequires a significant amount of processing power to maintain the security and\nintegrity of the blockchain. This is due to applying brute force to solve a\nhashing puzzle. To utilize the computational power available in useful and\nmeaningful work while keeping the blockchain secure, many techniques have been\nproposed, one of which is known as Proof of Deep Learning (PoDL). PoDL is a\nconsensus mechanism that uses the process of training a deep learning model as\nproof of work to add new blocks to the blockchain. In this paper, we survey the\nvarious approaches for PoDL. We discuss the different types of PoDL algorithms,\ntheir advantages and disadvantages, and their potential applications. We also\ndiscuss the challenges of implementing PoDL and future research directions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:49:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Salhab","Mahmoud",""],["Mershad","Khaleel",""]]}
{"id":"2308.16731","submitter":"Pierre-David Letourneau","authors":"Pierre-David Letourneau, Dalton Jones, Matthew Morse, M. Harper\n  Langston","title":"An Efficient Framework for Global Non-Convex Polynomial Optimization\n  over the Hypercube","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.MS cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a novel efficient theoretical and numerical framework for solving\nglobal non-convex polynomial optimization problems. We analytically demonstrate\nthat such problems can be efficiently reformulated using a non-linear objective\nover a convex set; further, these reformulated problems possess no spurious\nlocal minima (i.e., every local minimum is a global minimum). We introduce an\nalgorithm for solving these resulting problems using the augmented Lagrangian\nand the method of Burer and Monteiro. We show through numerical experiments\nthat polynomial scaling in dimension and degree is achievable for computing the\noptimal value and location of previously intractable global polynomial\noptimization problems in high dimension.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:49:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Letourneau","Pierre-David",""],["Jones","Dalton",""],["Morse","Matthew",""],["Langston","M. Harper",""]]}
{"id":"2308.16732","submitter":"Emilie Habart","authors":"Emilie Habart, Els Peeters, Olivier Bern\\'e, Boris Trahin, Am\\'elie\n  Canin, Ryan Chown, Ameek Sidhu, Dries Van De Putte, Felipe Alarc\\'on, Ilane\n  Schroetter, Emmanuel Dartois, S\\'ilvia Vicente, Alain Abergel, Edwin A.\n  Bergin, Jeronimo Bernard-Salas, Christiaan Boersma, Emeric Bron, Jan Cami,\n  Sara Cuadrado, Daniel Dicken, Meriem Elyajouri, Asunci\\'on Fuente, Javier R.\n  Goicoechea, Karl D.Gordon, Lina Issa, Christine Joblin, Olga Kannavou, Baria\n  Khan, Ozan Lacinbala, David Languignon, Romane Le Gal, Alexandros\n  Maragkoudakis, Raphael Meshaka, Yoko Okada, Takashi Onaka, Sofia Pasquini,\n  Marc W. Pound, Massimo Robberto, Markus R\\\"ollig, Bethany Schefter,\n  Thi\\'ebaut Schirmer, Benoit Tabone, Alexander G.~G.~M. Tielens, Mark G.\n  Wolfire, Marion Zannese, Nathalie Ysard, Marc-Antoine Miville-Deschenes,\n  Isabel Aleman, Louis Allamandola, Rebecca Auchettl, Giuseppe Antonio Baratta,\n  Salma Bejaoui, Partha P. Bera, John~H.~Black, Francois~Boulanger, Jordy\n  Bouwman, Bernhard Brandl, Philippe Brechignac, Sandra Br\\\"unken, Mridusmita\n  Buragohain, rew Burkhardt, Alessandra Candian, St\\'ephanie Cazaux, Jose\n  Cernicharo, Marin Chabot, Shubhadip Chakraborty, Jason Champion, Sean W.J.\n  Colgan, Ilsa R. Cooke, Audrey Coutens, Nick L.J. Cox, Karine Demyk, Jennifer\n  Donovan Meyer, Sacha Foschino, Pedro Garc\\'ia-Lario, Lisseth Gavilan,\n  Maryvonne Gerin, Carl A. Gottlieb, Pierre Guillard, Antoine Gusdorf, Patrick\n  Hartigan, Jinhua He, Eric Herbst, Liv Hornekaer, Cornelia J\\\"ager, Eduardo\n  Janot-Pacheco, Michael Kaufman, Francisca Kemper, Sarah Kendrew, Maria S.\n  Kirsanova, Pamela Klaassen, Sun Kwok, \\'Alvaro Labiano, Thomas S.-Y. Lai,\n  Timothy J. Lee, Bertrand Lefloch, Franck Le Petit, Aigen Li, Hendrik Linz,\n  Cameron J. Mackie, Suzanne C. Madden, Jo\\\"elle Mascetti, Brett A. McGuire,\n  Pablo Merino, Elisabetta R. Micelotta, Karl Misselt, Jon A. Morse, Giacomo\n  Mulas, Naslim Neelamkodan, Ryou Ohsawa, Alain Omont, Roberta Paladini, Maria\n  Elisabetta Palumbo, Amit Pathak, Yvonne J. Pendleton, Annemieke Petrignani,\n  Thomas Pino, Elena Puga, Naseem Rangwala, Mathias Rapacioli, Alessandra\n  Ricca, Julia Roman-Duval, Joseph~Roser, Evelyne Roueff, Ga\\\"el Rouill\\'e,\n  Farid Salama, Dinalva A. Sales, Karin Sandstrom, Peter Sarre, Ella\n  Sciamma-O'Brien, Kris Sellgren, Sachindev S. Shenoy, David Teyssier, Richard\n  D. Thomas, Aditya Togi, Laurent Verstraete, Adolf N. Witt, Alwyn Wootten,\n  Henning Zettergren, Yong Zhang, Ziwei E. Zhang, Junfeng Zhen","title":"PDRs4All II: JWST's NIR and MIR imaging view of the Orion Nebula","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The JWST has captured the most detailed and sharpest infrared images ever\ntaken of the inner region of the Orion Nebula, the nearest massive star\nformation region, and a prototypical highly irradiated dense photo-dissociation\nregion (PDR). We investigate the fundamental interaction of far-ultraviolet\nphotons with molecular clouds. The transitions across the ionization front\n(IF), dissociation front (DF), and the molecular cloud are studied at\nhigh-angular resolution. These transitions are relevant to understanding the\neffects of radiative feedback from massive stars and the dominant physical and\nchemical processes that lead to the IR emission that JWST will detect in many\nGalactic and extragalactic environments. Due to the proximity of the Orion\nNebula and the unprecedented angular resolution of JWST, these data reveal that\nthe molecular cloud borders are hyper structured at small angular scales of\n0.1-1\" (0.0002-0.002 pc or 40-400 au at 414 pc). A diverse set of features are\nobserved such as ridges, waves, globules and photoevaporated protoplanetary\ndisks. At the PDR atomic to molecular transition, several bright features are\ndetected that are associated with the highly irradiated surroundings of the\ndense molecular condensations and embedded young star. Toward the Orion Bar\nPDR, a highly sculpted interface is detected with sharp edges and density\nincreases near the IF and DF. This was predicted by previous modeling studies,\nbut the fronts were unresolved in most tracers. A complex, structured, and\nfolded DF surface was traced by the H2 lines. This dataset was used to revisit\nthe commonly adopted 2D PDR structure of the Orion Bar. JWST provides us with a\ncomplete view of the PDR, all the way from the PDR edge to the substructured\ndense region, and this allowed us to determine, in detail, where the emission\nof the atomic and molecular lines, aromatic bands, and dust originate.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:50:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Habart","Emilie",""],["Peeters","Els",""],["Bern\u00e9","Olivier",""],["Trahin","Boris",""],["Canin","Am\u00e9lie",""],["Chown","Ryan",""],["Sidhu","Ameek",""],["Van De Putte","Dries",""],["Alarc\u00f3n","Felipe",""],["Schroetter","Ilane",""],["Dartois","Emmanuel",""],["Vicente","S\u00edlvia",""],["Abergel","Alain",""],["Bergin","Edwin A.",""],["Bernard-Salas","Jeronimo",""],["Boersma","Christiaan",""],["Bron","Emeric",""],["Cami","Jan",""],["Cuadrado","Sara",""],["Dicken","Daniel",""],["Elyajouri","Meriem",""],["Fuente","Asunci\u00f3n",""],["Goicoechea","Javier R.",""],["Gordon","Karl D.",""],["Issa","Lina",""],["Joblin","Christine",""],["Kannavou","Olga",""],["Khan","Baria",""],["Lacinbala","Ozan",""],["Languignon","David",""],["Gal","Romane Le",""],["Maragkoudakis","Alexandros",""],["Meshaka","Raphael",""],["Okada","Yoko",""],["Onaka","Takashi",""],["Pasquini","Sofia",""],["Pound","Marc W.",""],["Robberto","Massimo",""],["R\u00f6llig","Markus",""],["Schefter","Bethany",""],["Schirmer","Thi\u00e9baut",""],["Tabone","Benoit",""],["Tielens","Alexander G. ~G. ~M.",""],["Wolfire","Mark G.",""],["Zannese","Marion",""],["Ysard","Nathalie",""],["Miville-Deschenes","Marc-Antoine",""],["Aleman","Isabel",""],["Allamandola","Louis",""],["Auchettl","Rebecca",""],["Baratta","Giuseppe Antonio",""],["Bejaoui","Salma",""],["Bera","Partha P.",""],["~Black","John~H.",""],["Francois~Boulanger","",""],["Bouwman","Jordy",""],["Brandl","Bernhard",""],["Brechignac","Philippe",""],["Br\u00fcnken","Sandra",""],["Buragohain","Mridusmita",""],["Burkhardt","rew",""],["Candian","Alessandra",""],["Cazaux","St\u00e9phanie",""],["Cernicharo","Jose",""],["Chabot","Marin",""],["Chakraborty","Shubhadip",""],["Champion","Jason",""],["Colgan","Sean W. J.",""],["Cooke","Ilsa R.",""],["Coutens","Audrey",""],["Cox","Nick L. J.",""],["Demyk","Karine",""],["Meyer","Jennifer Donovan",""],["Foschino","Sacha",""],["Garc\u00eda-Lario","Pedro",""],["Gavilan","Lisseth",""],["Gerin","Maryvonne",""],["Gottlieb","Carl A.",""],["Guillard","Pierre",""],["Gusdorf","Antoine",""],["Hartigan","Patrick",""],["He","Jinhua",""],["Herbst","Eric",""],["Hornekaer","Liv",""],["J\u00e4ger","Cornelia",""],["Janot-Pacheco","Eduardo",""],["Kaufman","Michael",""],["Kemper","Francisca",""],["Kendrew","Sarah",""],["Kirsanova","Maria S.",""],["Klaassen","Pamela",""],["Kwok","Sun",""],["Labiano","\u00c1lvaro",""],["Lai","Thomas S. -Y.",""],["Lee","Timothy J.",""],["Lefloch","Bertrand",""],["Petit","Franck Le",""],["Li","Aigen",""],["Linz","Hendrik",""],["Mackie","Cameron J.",""],["Madden","Suzanne C.",""],["Mascetti","Jo\u00eblle",""],["McGuire","Brett A.",""],["Merino","Pablo",""],["Micelotta","Elisabetta R.",""],["Misselt","Karl",""],["Morse","Jon A.",""],["Mulas","Giacomo",""],["Neelamkodan","Naslim",""],["Ohsawa","Ryou",""],["Omont","Alain",""],["Paladini","Roberta",""],["Palumbo","Maria Elisabetta",""],["Pathak","Amit",""],["Pendleton","Yvonne J.",""],["Petrignani","Annemieke",""],["Pino","Thomas",""],["Puga","Elena",""],["Rangwala","Naseem",""],["Rapacioli","Mathias",""],["Ricca","Alessandra",""],["Roman-Duval","Julia",""],["Joseph~Roser","",""],["Roueff","Evelyne",""],["Rouill\u00e9","Ga\u00ebl",""],["Salama","Farid",""],["Sales","Dinalva A.",""],["Sandstrom","Karin",""],["Sarre","Peter",""],["Sciamma-O'Brien","Ella",""],["Sellgren","Kris",""],["Shenoy","Sachindev S.",""],["Teyssier","David",""],["Thomas","Richard D.",""],["Togi","Aditya",""],["Verstraete","Laurent",""],["Witt","Adolf N.",""],["Wootten","Alwyn",""],["Zettergren","Henning",""],["Zhang","Yong",""],["Zhang","Ziwei E.",""],["Zhen","Junfeng",""]]}
{"id":"2308.16733","submitter":"Ryan Chown","authors":"Ryan Chown and Ameek Sidhu and Els Peeters and Alexander G. G. M.\n  Tielens and Jan Cami and Olivier Berne and Emilie Habart and Felipe Alarcon\n  and Amelie Canin and Ilane Schroetter and Boris Trahin and Dries Van De Putte\n  and Alain Abergel and Edwin A. Bergin and Jeronimo Bernard-Salas and\n  Christiaan Boersma and Emeric Bron and Sara Cuadrado and Emmanuel Dartois and\n  Daniel Dicken and Meriem El-Yajouri and Asuncion Fuente and Javier R.\n  Goicoechea and Karl D. Gordon and Lina Issa and Christine Joblin and Olga\n  Kannavou and Baria Khan and Ozan Lacinbala and David Languignon and Romane Le\n  Gal and Alexandros Maragkoudakis and Raphael Meshaka and Yoko Okada and\n  Takashi Onaka and Sofia Pasquini and Marc W. Pound and Massimo Robberto and\n  Markus Rollig and Bethany Schefter and Thiebaut Schirmer and Silvia Vicente\n  and Mark G. Wolfire and Marion Zannese and Isabel Aleman and Louis\n  Allamandola and Rebecca Auchettl and Giuseppe Antonio Baratta and Salma\n  Bejaoui and Partha P. Bera and John H. Black and Francois Boulanger and Jordy\n  Bouwman and Bernhard Brandl and Philippe Brechignac and Sandra Brunken and\n  Mridusmita Buragohain and Andrew Burkhardt and Alessandra Candian and\n  Stephanie Cazaux and Jose Cernicharo and Marin Chabot and Shubhadip\n  Chakraborty and Jason Champion and Sean W.J. Colgan and Ilsa R. Cooke and\n  Audrey Coutens and Nick L.J. Cox and Karine Demyk and Jennifer Donovan Meyer\n  and Sacha Foschino and Pedro Garcia-Lario and Lisseth Gavilan and Maryvonne\n  Gerin and Carl A. Gottlieb and Pierre Guillard and Antoine Gusdorf and\n  Patrick Hartigan and Jinhua He and Eric Herbst and Liv Hornekaer and Cornelia\n  Jager and Eduardo Janot-Pacheco and Michael Kaufman and Francisca Kemper and\n  Sarah Kendrew and Maria S. Kirsanova and Pamela Klaassen and Sun Kwok and\n  Alvaro Labiano and Thomas S.-Y. Lai and Timothy J. Lee and Bertrand Lefloch\n  and Franck Le Petit and Aigen Li and Hendrik Linz and Cameron J. Mackie and\n  Suzanne C. Madden and Joelle Mascetti and Brett A. McGuire and Pablo Merino\n  and Elisabetta R. Micelotta and Karl Misselt and Jon A. Morse and Giacomo\n  Mulas and Naslim Neelamkodan and Ryou Ohsawa and Alain Omont and Roberta\n  Paladini and Maria Elisabetta Palumbo and Amit Pathak and Yvonne J. Pendleton\n  and Annemieke Petrignani and Thomas Pino and Elena Puga and Naseem Rangwala\n  and Mathias Rapacioli and Alessandra Ricca and Julia Roman-Duval and Joseph\n  Roser and Evelyne Roueff and Gael Rouillee and Farid Salama and Dinalva A.\n  Sales and Karin Sandstrom and Peter Sarre and Ella Sciamma-O'Brien and Kris\n  Sellgren and Sachindev S. Shenoy and David Teyssier and Richard D. Thomas and\n  Aditya Togi and Laurent Verstraete and Adolf N. Witt and Alwyn Wootten and\n  Henning Zettergren and Yong Zhang and Ziwei E. Zhang and Junfeng Zhen","title":"PDRs4All IV. An embarrassment of riches: Aromatic infrared bands in the\n  Orion Bar","comments":"25 pages, 10 figures, to appear in A&A","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":"  (Abridged) Mid-infrared observations of photodissociation regions (PDRs) are\ndominated by strong emission features called aromatic infrared bands (AIBs).\nThe most prominent AIBs are found at 3.3, 6.2, 7.7, 8.6, and 11.2 $\\mu$m. The\nmost sensitive, highest-resolution infrared spectral imaging data ever taken of\nthe prototypical PDR, the Orion Bar, have been captured by JWST. We provide an\ninventory of the AIBs found in the Orion Bar, along with mid-IR template\nspectra from five distinct regions in the Bar: the molecular PDR, the atomic\nPDR, and the HII region. We use JWST NIRSpec IFU and MIRI MRS observations of\nthe Orion Bar from the JWST Early Release Science Program, PDRs4All (ID: 1288).\nWe extract five template spectra to represent the morphology and environment of\nthe Orion Bar PDR. The superb sensitivity and the spectral and spatial\nresolution of these JWST observations reveal many details of the AIB emission\nand enable an improved characterization of their detailed profile shapes and\nsub-components. While the spectra are dominated by the well-known AIBs at 3.3,\n6.2, 7.7, 8.6, 11.2, and 12.7 $\\mu$m, a wealth of weaker features and\nsub-components are present. We report trends in the widths and relative\nstrengths of AIBs across the five template spectra. These trends yield valuable\ninsight into the photochemical evolution of PAHs, such as the evolution\nresponsible for the shift of 11.2 $\\mu$m AIB emission from class B$_{11.2}$ in\nthe molecular PDR to class A$_{11.2}$ in the PDR surface layers. This\nphotochemical evolution is driven by the increased importance of FUV processing\nin the PDR surface layers, resulting in a \"weeding out\" of the weakest links of\nthe PAH family in these layers. For now, these JWST observations are consistent\nwith a model in which the underlying PAH family is composed of a few species:\nthe so-called 'grandPAHs'.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:50:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chown","Ryan",""],["Sidhu","Ameek",""],["Peeters","Els",""],["Tielens","Alexander G. G. M.",""],["Cami","Jan",""],["Berne","Olivier",""],["Habart","Emilie",""],["Alarcon","Felipe",""],["Canin","Amelie",""],["Schroetter","Ilane",""],["Trahin","Boris",""],["Van De Putte","Dries",""],["Abergel","Alain",""],["Bergin","Edwin A.",""],["Bernard-Salas","Jeronimo",""],["Boersma","Christiaan",""],["Bron","Emeric",""],["Cuadrado","Sara",""],["Dartois","Emmanuel",""],["Dicken","Daniel",""],["El-Yajouri","Meriem",""],["Fuente","Asuncion",""],["Goicoechea","Javier R.",""],["Gordon","Karl D.",""],["Issa","Lina",""],["Joblin","Christine",""],["Kannavou","Olga",""],["Khan","Baria",""],["Lacinbala","Ozan",""],["Languignon","David",""],["Gal","Romane Le",""],["Maragkoudakis","Alexandros",""],["Meshaka","Raphael",""],["Okada","Yoko",""],["Onaka","Takashi",""],["Pasquini","Sofia",""],["Pound","Marc W.",""],["Robberto","Massimo",""],["Rollig","Markus",""],["Schefter","Bethany",""],["Schirmer","Thiebaut",""],["Vicente","Silvia",""],["Wolfire","Mark G.",""],["Zannese","Marion",""],["Aleman","Isabel",""],["Allamandola","Louis",""],["Auchettl","Rebecca",""],["Baratta","Giuseppe Antonio",""],["Bejaoui","Salma",""],["Bera","Partha P.",""],["Black","John H.",""],["Boulanger","Francois",""],["Bouwman","Jordy",""],["Brandl","Bernhard",""],["Brechignac","Philippe",""],["Brunken","Sandra",""],["Buragohain","Mridusmita",""],["Burkhardt","Andrew",""],["Candian","Alessandra",""],["Cazaux","Stephanie",""],["Cernicharo","Jose",""],["Chabot","Marin",""],["Chakraborty","Shubhadip",""],["Champion","Jason",""],["Colgan","Sean W. J.",""],["Cooke","Ilsa R.",""],["Coutens","Audrey",""],["Cox","Nick L. J.",""],["Demyk","Karine",""],["Meyer","Jennifer Donovan",""],["Foschino","Sacha",""],["Garcia-Lario","Pedro",""],["Gavilan","Lisseth",""],["Gerin","Maryvonne",""],["Gottlieb","Carl A.",""],["Guillard","Pierre",""],["Gusdorf","Antoine",""],["Hartigan","Patrick",""],["He","Jinhua",""],["Herbst","Eric",""],["Hornekaer","Liv",""],["Jager","Cornelia",""],["Janot-Pacheco","Eduardo",""],["Kaufman","Michael",""],["Kemper","Francisca",""],["Kendrew","Sarah",""],["Kirsanova","Maria S.",""],["Klaassen","Pamela",""],["Kwok","Sun",""],["Labiano","Alvaro",""],["Lai","Thomas S. -Y.",""],["Lee","Timothy J.",""],["Lefloch","Bertrand",""],["Petit","Franck Le",""],["Li","Aigen",""],["Linz","Hendrik",""],["Mackie","Cameron J.",""],["Madden","Suzanne C.",""],["Mascetti","Joelle",""],["McGuire","Brett A.",""],["Merino","Pablo",""],["Micelotta","Elisabetta R.",""],["Misselt","Karl",""],["Morse","Jon A.",""],["Mulas","Giacomo",""],["Neelamkodan","Naslim",""],["Ohsawa","Ryou",""],["Omont","Alain",""],["Paladini","Roberta",""],["Palumbo","Maria Elisabetta",""],["Pathak","Amit",""],["Pendleton","Yvonne J.",""],["Petrignani","Annemieke",""],["Pino","Thomas",""],["Puga","Elena",""],["Rangwala","Naseem",""],["Rapacioli","Mathias",""],["Ricca","Alessandra",""],["Roman-Duval","Julia",""],["Roser","Joseph",""],["Roueff","Evelyne",""],["Rouillee","Gael",""],["Salama","Farid",""],["Sales","Dinalva A.",""],["Sandstrom","Karin",""],["Sarre","Peter",""],["Sciamma-O'Brien","Ella",""],["Sellgren","Kris",""],["Shenoy","Sachindev S.",""],["Teyssier","David",""],["Thomas","Richard D.",""],["Togi","Aditya",""],["Verstraete","Laurent",""],["Witt","Adolf N.",""],["Wootten","Alwyn",""],["Zettergren","Henning",""],["Zhang","Yong",""],["Zhang","Ziwei E.",""],["Zhen","Junfeng",""]]}
{"id":"2308.16734","submitter":"Ivano Malavolta","authors":"Ruben Horn, Abdellah Lahnaoui, Edgardo Reinoso, Sicheng Peng, Vadim\n  Isakov, Tanjina Islam, Ivano Malavolta","title":"Native vs Web Apps: Comparing the Energy Consumption and Performance of\n  Android Apps and their Web Counterparts","comments":null,"journal-ref":null,"doi":"10.1109/MOBILSoft59058.2023.00013","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Context. Many Internet content platforms, such as Spotify and YouTube,\nprovide their services via both native and Web apps. Even though those apps\nprovide similar features to the end user, using their native version or Web\ncounterpart might lead to different levels of energy consumption and\nperformance. Goal. The goal of this study is to empirically assess the energy\nconsumption and performance of native and Web apps in the context of Internet\ncontent platforms on Android. Method. We select 10 Internet content platforms\nacross 5 categories. Then, we measure them based on the energy consumption,\nnetwork traffic volume, CPU load, memory load, and frame time of their native\nand Web versions; then, we statistically analyze the collected measures and\nreport our results. Results. We confirm that native apps consume significantly\nless energy than their Web counterparts, with large effect size. Web apps use\nmore CPU and memory, with statistically significant difference and large effect\nsize. Therefore, we conclude that native apps tend to require fewer hardware\nresources than their corresponding Web versions. The network traffic volume\nexhibits statistically significant difference in favour of native apps, with\nsmall effect size. Our results do not allow us to draw any conclusion in terms\nof frame time. Conclusions. Based on our results, we advise users to access\nInternet contents using native apps over Web apps, when possible. Also, the\nresults of this study motivate further research on the optimization of the\nusage of runtime resources of mobile Web apps and Android browsers.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:51:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Horn","Ruben",""],["Lahnaoui","Abdellah",""],["Reinoso","Edgardo",""],["Peng","Sicheng",""],["Isakov","Vadim",""],["Islam","Tanjina",""],["Malavolta","Ivano",""]]}
{"id":"2308.16735","submitter":"Felix Wagner MSc.","authors":"Felix Wagner, Zeju Li, Pramit Saha, Konstantinos Kamnitsas","title":"Post-Deployment Adaptation with Access to Source Data via Federated\n  Learning and Source-Target Remote Gradient Alignment","comments":"This version was accepted for the Machine Learning in Medical Imaging\n  (MLMI 2023) workshop at MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deployment of Deep Neural Networks in medical imaging is hindered by\ndistribution shift between training data and data processed after deployment,\ncausing performance degradation. Post-Deployment Adaptation (PDA) addresses\nthis by tailoring a pre-trained, deployed model to the target data distribution\nusing limited labelled or entirely unlabelled target data, while assuming no\naccess to source training data as they cannot be deployed with the model due to\nprivacy concerns and their large size. This makes reliable adaptation\nchallenging due to limited learning signal. This paper challenges this\nassumption and introduces FedPDA, a novel adaptation framework that brings the\nutility of learning from remote data from Federated Learning into PDA. FedPDA\nenables a deployed model to obtain information from source data via remote\ngradient exchange, while aiming to optimize the model specifically for the\ntarget domain. Tailored for FedPDA, we introduce a novel optimization method\nStarAlign (Source-Target Remote Gradient Alignment) that aligns gradients\nbetween source-target domain pairs by maximizing their inner product, to\nfacilitate learning a target-specific model. We demonstrate the method's\neffectiveness using multi-center databases for the tasks of cancer metastases\ndetection and skin lesion classification, where our method compares favourably\nto previous work. Code is available at: https://github.com/FelixWag/StarAlign\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:52:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wagner","Felix",""],["Li","Zeju",""],["Saha","Pramit",""],["Kamnitsas","Konstantinos",""]]}
{"id":"2308.16736","submitter":"Malak  Diab","authors":"Andreas Bartel, Malak Diab, Andreas Frommer, and Michael G\\\"unther","title":"Operator splitting for semi-explicit differential-algebraic equations\n  and port-Hamiltonian DAEs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Operator splitting methods allow to split the operator describing a complex\ndynamical system into a sequence of simpler subsystems and treat each part\nindependently. In the modeling of dynamical problems, systems of (possibly\ncoupled) differential-algebraic equations (DAEs) arise. This motivates the\napplication of operator splittings which are aware of the various structural\nforms of DAEs. Here, we present an approach for the splitting of coupled\nindex-1 DAE as well as for the splitting of port-Hamiltonian DAEs, taking\nadvantage of the energy-conservative and energy-dissipative parts. We provide\nnumerical examples illustrating our second-order convergence results.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:53:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bartel","Andreas",""],["Diab","Malak",""],["Frommer","Andreas",""],["G\u00fcnther","Michael",""]]}
{"id":"2308.16737","submitter":"Reza Mirzaeifard","authors":"Reza Mirzaeifard, Naveen K. D. Venkategowda, Stefan Werner","title":"Robust Networked Federated Learning for Localization","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 addresses the problem of localization, which is inherently\nnon-convex and non-smooth in a federated setting where the data is distributed\nacross a multitude of devices. Due to the decentralized nature of federated\nenvironments, distributed learning becomes essential for scalability and\nadaptability. Moreover, these environments are often plagued by outlier data,\nwhich presents substantial challenges to conventional methods, particularly in\nmaintaining estimation accuracy and ensuring algorithm convergence. To mitigate\nthese challenges, we propose a method that adopts an $L_1$-norm robust\nformulation within a distributed sub-gradient framework, explicitly designed to\nhandle these obstacles. Our approach addresses the problem in its original\nform, without resorting to iterative simplifications or approximations,\nresulting in enhanced computational efficiency and improved estimation\naccuracy. We demonstrate that our method converges to a stationary point,\nhighlighting its effectiveness and reliability. Through numerical simulations,\nwe confirm the superior performance of our approach, notably in outlier-rich\nenvironments, which surpasses existing state-of-the-art localization methods.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:54:37 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mirzaeifard","Reza",""],["Venkategowda","Naveen K. D.",""],["Werner","Stefan",""]]}
{"id":"2308.16738","submitter":"Yubiao Yue","authors":"Yubiao Yue, Jun Xue, Haihua Liang, Bingchun Luo, Zhenzhang Li","title":"US-SFNet: A Spatial-Frequency Domain-based Multi-branch Network for\n  Cervical Lymph Node Lesions Diagnoses in Ultrasound Images","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":"  Ultrasound imaging serves as a pivotal tool for diagnosing cervical lymph\nnode lesions. However, the diagnoses of these images largely hinge on the\nexpertise of medical practitioners, rendering the process susceptible to\nmisdiagnoses. Although rapidly developing deep learning has substantially\nimproved the diagnoses of diverse ultrasound images, there remains a\nconspicuous research gap concerning cervical lymph nodes. The objective of our\nwork is to accurately diagnose cervical lymph node lesions by leveraging a deep\nlearning model. To this end, we first collected 3392 images containing normal\nlymph nodes, benign lymph node lesions, malignant primary lymph node lesions,\nand malignant metastatic lymph node lesions. Given that ultrasound images are\ngenerated by the reflection and scattering of sound waves across varied bodily\ntissues, we proposed the Conv-FFT Block. It integrates convolutional operations\nwith the fast Fourier transform to more astutely model the images. Building\nupon this foundation, we designed a novel architecture, named US-SFNet. This\narchitecture not only discerns variances in ultrasound images from the spatial\ndomain but also adeptly captures microstructural alterations across various\nlesions in the frequency domain. To ascertain the potential of US-SFNet, we\nbenchmarked it against 12 popular architectures through five-fold\ncross-validation. The results show that US-SFNet is SOTA and can achieve 92.89%\naccuracy, 90.46% precision, 89.95% sensitivity and 97.49% specificity,\nrespectively.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:54:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yue","Yubiao",""],["Xue","Jun",""],["Liang","Haihua",""],["Luo","Bingchun",""],["Li","Zhenzhang",""]]}
{"id":"2308.16739","submitter":"Jinkai Zheng","authors":"Jinkai Zheng, Xinchen Liu, Shuai Wang, Lihao Wang, Chenggang Yan, Wu\n  Liu","title":"Parsing is All You Need for Accurate Gait Recognition in the Wild","comments":"16 pages, 14 figures, ACM MM 2023 accepted, project page:\n  https://gait3d.github.io/gait3d-parsing-hp","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Binary silhouettes and keypoint-based skeletons have dominated human gait\nrecognition studies for decades since they are easy to extract from video\nframes. Despite their success in gait recognition for in-the-lab environments,\nthey usually fail in real-world scenarios due to their low information entropy\nfor gait representations. To achieve accurate gait recognition in the wild,\nthis paper presents a novel gait representation, named Gait Parsing Sequence\n(GPS). GPSs are sequences of fine-grained human segmentation, i.e., human\nparsing, extracted from video frames, so they have much higher information\nentropy to encode the shapes and dynamics of fine-grained human parts during\nwalking. Moreover, to effectively explore the capability of the GPS\nrepresentation, we propose a novel human parsing-based gait recognition\nframework, named ParsingGait. ParsingGait contains a Convolutional Neural\nNetwork (CNN)-based backbone and two light-weighted heads. The first head\nextracts global semantic features from GPSs, while the other one learns mutual\ninformation of part-level features through Graph Convolutional Networks to\nmodel the detailed dynamics of human walking. Furthermore, due to the lack of\nsuitable datasets, we build the first parsing-based dataset for gait\nrecognition in the wild, named Gait3D-Parsing, by extending the large-scale and\nchallenging Gait3D dataset. Based on Gait3D-Parsing, we comprehensively\nevaluate our method and existing gait recognition methods. The experimental\nresults show a significant improvement in accuracy brought by the GPS\nrepresentation and the superiority of ParsingGait. The code and dataset are\navailable at https://gait3d.github.io/gait3d-parsing-hp .\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:57:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zheng","Jinkai",""],["Liu","Xinchen",""],["Wang","Shuai",""],["Wang","Lihao",""],["Yan","Chenggang",""],["Liu","Wu",""]]}
{"id":"2308.16740","submitter":"Oliver Porth","authors":"Mahdi Najafi-Ziyazi, Jordy Davelaar, Yosuke Mizuno and Oliver Porth","title":"Flares in the Galactic Centre II: polarisation signatures of flares at\n  mm-wavelengths","comments":"submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent polarimetric mm-observations of the galactic centre by Wielgus et al.\n(2022a) showed sinusoidal loops in the Q-U plane with a duration of one hour.\nThe loops coincide with a quasi-simultaneous X-ray flare. A promising mechanism\nto explain the flaring events are magnetic flux eruptions in magnetically\narrested accretion flows (MAD). In our previous work (Porth et al. 2021), we\nstudied the accretion flow dynamics during flux eruptions. Here, we extend our\nprevious study by investigating whether polarization loops can be a signature\nproduced by magnetic flux eruptions. We find that loops in the Q-U plane are\nrobustly produced in MAD models as they lead to enhanced emissivity of\ncompressed disk material due to orbiting flux bundles. A timing analysis of the\nsynthetic polarized lightcurves demonstrate a polarized excess variability at\ntimescales of ~ 1 hr. The polarization loops are also clearly imprinted on the\ncross-correlation of the Stokes parameters which allows to extract a typical\nperiodicity of 30 min to 1 hr with some evidence for a spin dependence. These\nresults are intrinsic to the MAD state and should thus hold for a wide range of\nastrophysical objects. A subset of GRMHD simulations without saturated magnetic\nflux (single temperature SANE models) also produces Q-U loops. However, in\ndisagreement with the findings of Wielgus et al. (2022a), loops in these\nsimulations are quasi-continuous with a low polarization excess\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:58:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Najafi-Ziyazi","Mahdi",""],["Davelaar","Jordy",""],["Mizuno","Yosuke",""],["Porth","Oliver",""]]}
{"id":"2308.16741","submitter":"Reuben Tan","authors":"Katherine Deng, Arijit Ray, Reuben Tan, Saadia Gabriel, Bryan A.\n  Plummer, Kate Saenko","title":"Socratis: Are large multimodal models emotionally aware?","comments":"ICCV 2023 WECIA","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing emotion prediction benchmarks contain coarse emotion labels which do\nnot consider the diversity of emotions that an image and text can elicit in\nhumans due to various reasons. Learning diverse reactions to multimodal content\nis important as intelligent machines take a central role in generating and\ndelivering content to society. To address this gap, we propose Socratis, a\n\\underline{soc}ietal \\underline{r}e\\underline{a}c\\underline{ti}on\\underline{s}\nbenchmark, where each image-caption (IC) pair is annotated with multiple\nemotions and the reasons for feeling them. Socratis contains 18K free-form\nreactions for 980 emotions on 2075 image-caption pairs from 5 widely-read news\nand image-caption (IC) datasets. We benchmark the capability of\nstate-of-the-art multimodal large language models to generate the reasons for\nfeeling an emotion given an IC pair. Based on a preliminary human study, we\nobserve that humans prefer human-written reasons over 2 times more often than\nmachine-generated ones. This shows our task is harder than standard generation\ntasks because it starkly contrasts recent findings where humans cannot tell\napart machine vs human-written news articles, for instance. We further see that\ncurrent captioning metrics based on large vision-language models also fail to\ncorrelate with human preferences. We hope that these findings and our benchmark\nwill inspire further research on training emotionally aware models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 13:59:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Deng","Katherine",""],["Ray","Arijit",""],["Tan","Reuben",""],["Gabriel","Saadia",""],["Plummer","Bryan A.",""],["Saenko","Kate",""]]}
{"id":"2308.16742","submitter":"Xuan Liu","authors":"Xuan Liu, Yaoqin Xie, Songhui Diao, Shan Tan, and Xiaokun Liang","title":"Unsupervised CT Metal Artifact Reduction by Plugging Diffusion Priors in\n  Dual Domains","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":"  During the process of computed tomography (CT), metallic implants often cause\ndisruptive artifacts in the reconstructed images, impeding accurate diagnosis.\nSeveral supervised deep learning-based approaches have been proposed for\nreducing metal artifacts (MAR). However, these methods heavily rely on training\nwith simulated data, as obtaining paired metal artifact CT and clean CT data in\nclinical settings is challenging. This limitation can lead to decreased\nperformance when applying these methods in clinical practice. Existing\nunsupervised MAR methods, whether based on learning or not, typically operate\nwithin a single domain, either in the image domain or the sinogram domain. In\nthis paper, we propose an unsupervised MAR method based on the diffusion model,\na generative model with a high capacity to represent data distributions.\nSpecifically, we first train a diffusion model using CT images without metal\nartifacts. Subsequently, we iteratively utilize the priors embedded within the\npre-trained diffusion model in both the sinogram and image domains to restore\nthe degraded portions caused by metal artifacts. This dual-domain processing\nempowers our approach to outperform existing unsupervised MAR methods,\nincluding another MAR method based on the diffusion model, which we have\nqualitatively and quantitatively validated using synthetic datasets. Moreover,\nour method demonstrates superior visual results compared to both supervised and\nunsupervised methods on clinical datasets.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:00:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Xuan",""],["Xie","Yaoqin",""],["Diao","Songhui",""],["Tan","Shan",""],["Liang","Xiaokun",""]]}
{"id":"2308.16743","submitter":"Jacopo Panerati","authors":"Spencer Teetaert (1), Wenda Zhao (1), Niu Xinyuan (2), Hashir Zahir\n  (2), Huiyu Leong (2), Michel Hidalgo (3), Gerardo Puga (3), Tomas Lorente\n  (3), Nahuel Espinosa (3), John Alejandro Duarte Carrasco (3), Kaizheng Zhang\n  (4), Jian Di (4), Tao Jin (4), Xiaohan Li (4), Yijia Zhou (4), Xiuhua Liang\n  (4), Chenxu Zhang (4), Antonio Loquercio (5), Siqi Zhou (1 and 6), Lukas\n  Brunke (1 and 6), Melissa Greeff (1), Wolfgang Hoenig (7), Jacopo Panerati\n  (1), Angela P. Schoellig (1 and 6) ((1) University of Toronto Institute for\n  Aerospace Studies, (2) Team H2, (3) Team Ekumen, (4) University of Science\n  and Technology of China, (5) University of California Berkeley, (6) Technical\n  University of Munich, (7) Technical University of Berlin)","title":"A Remote Sim2real Aerial Competition: Fostering Reproducibility and\n  Solutions' Diversity in Robotics Challenges","comments":"13 pages, 16 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shared benchmark problems have historically been a fundamental driver of\nprogress for scientific communities. In the context of academic conferences,\ncompetitions offer the opportunity to researchers with different origins,\nbackgrounds, and levels of seniority to quantitatively compare their ideas. In\nrobotics, a hot and challenging topic is sim2real-porting approaches that work\nwell in simulation to real robot hardware. In our case, creating a hybrid\ncompetition with both simulation and real robot components was also dictated by\nthe uncertainties around travel and logistics in the post-COVID-19 world.\nHence, this article motivates and describes an aerial sim2real robot\ncompetition that ran during the 2022 IEEE/RSJ International Conference on\nIntelligent Robots and Systems, from the specification of the competition task,\nto the details of the software infrastructure supporting simulation and\nreal-life experiments, to the approaches of the top-placed teams and the\nlessons learned by participants and organizers.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:02:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Teetaert","Spencer","","1 and 6"],["Zhao","Wenda","","1 and 6"],["Xinyuan","Niu","","1 and 6"],["Zahir","Hashir","","1 and 6"],["Leong","Huiyu","","1 and 6"],["Hidalgo","Michel","","1 and 6"],["Puga","Gerardo","","1 and 6"],["Lorente","Tomas","","1 and 6"],["Espinosa","Nahuel","","1 and 6"],["Carrasco","John Alejandro Duarte","","1 and 6"],["Zhang","Kaizheng","","1 and 6"],["Di","Jian","","1 and 6"],["Jin","Tao","","1 and 6"],["Li","Xiaohan","","1 and 6"],["Zhou","Yijia","","1 and 6"],["Liang","Xiuhua","","1 and 6"],["Zhang","Chenxu","","1 and 6"],["Loquercio","Antonio","","1 and 6"],["Zhou","Siqi","","1 and 6"],["Brunke","Lukas","","1 and 6"],["Greeff","Melissa","","1 and 6"],["Hoenig","Wolfgang","","1 and 6"],["Panerati","Jacopo","","1 and 6"],["Schoellig","Angela P.","","1 and 6"]]}
{"id":"2308.16744","submitter":"Mohsen Koohi Esfahani","authors":"Mohsen Koohi Esfahani, Paolo Boldi, Hans Vandierendonck, Peter\n  Kilpatrick, Sebastiano Vigna","title":"MS-BioGraphs: Sequence Similarity Graph Datasets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.AR cs.CE cs.DM cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Progress in High-Performance Computing in general, and High-Performance Graph\nProcessing in particular, is highly dependent on the availability of\npublicly-accessible, relevant, and realistic data sets.\n  To ensure continuation of this progress, we (i) investigate and optimize the\nprocess of generating large sequence similarity graphs as an HPC challenge and\n(ii) demonstrate this process in creating MS-BioGraphs, a new family of\npublicly available real-world edge-weighted graph datasets with up to $2.5$\ntrillion edges, that is, $6.6$ times greater than the largest graph published\nrecently. The largest graph is created by matching (i.e., all-to-all similarity\naligning) $1.7$ billion protein sequences. The MS-BioGraphs family includes\nalso seven subgraphs with different sizes and direction types.\n  We describe two main challenges we faced in generating large graph datasets\nand our solutions, that are, (i) optimizing data structures and algorithms for\nthis multi-step process and (ii) WebGraph parallel compression technique. We\npresent a comparative study of structural characteristics of MS-BioGraphs.\n  The datasets are available online on\nhttps://blogs.qub.ac.uk/DIPSA/MS-BioGraphs .\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:04:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Esfahani","Mohsen Koohi",""],["Boldi","Paolo",""],["Vandierendonck","Hans",""],["Kilpatrick","Peter",""],["Vigna","Sebastiano",""]]}
{"id":"2308.16745","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Measurements of longitudinal flow decorrelations in $pp$ and Xe+Xe\n  collisions with the ATLAS detector","comments":"Comments: 31 pages in total, author list starting page 15, 5 figures,\n  submitted to Phys. Rev. Lett. All figures including auxiliary figures are\n  available at\n  https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/HION-2022-17/","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-184","categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Measurements of longitudinal flow decorrelations in 13 TeV $pp$ and 5.44 TeV\nXe+Xe collisions with the ATLAS detector are presented. The measurements are\nperformed using the two-particle correlation method, combining charged-particle\ntracks within $|\\eta| < 2.5$ with either calorimeter energy clusters or towers\nwithin $4.0<|\\eta|<4.9$. A template-based subtraction procedure is used to\nremove non-flow effects in both the $pp$ and the Xe+Xe analyses. The dependence\nof the longitudinal flow decorrelations on the pseudorapidity separation\nbetween the particles is characterized via the slope parameter $F_n$ for the\nelliptic ($n=2$) and triangular ($n=3$) harmonic moments. The results are\nreported as a function of charged-particle multiplicity for the $pp$ and Xe+Xe\ncollision systems. Comparing the data to a color string-based model of the\ninitial geometry indicates that in $pp$ and peripheral Xe+Xe collisions,\nsub-nucleonic structure and fluctuations in longitudinal energy deposition are\nneeded to describe the data.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:06:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.16746","submitter":"Yuehua Su","authors":"Dezhong Cao and Yuehua Su","title":"Post-experiment coincidence counting method for coincidence detection\n  techniques","comments":"5 pages, 1 figure","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":"  Recently, two coincidence detection techniques, the coincidence\nangle-resolved photoemission spectroscopy (cARPES) and the coincidence\ninelastic neutron scattering (cINS), have been proposed to detect directly the\ntwo-body correlations of strongly correlated electrons in particle-particle\nchannel or two-spin channel. In the original proposals, there is a coincidence\ndetector which records the coincidence probability of two photoelectric\nprocesses or two neutron-scattering processes. In this article, we present a\n{\\it post-experiment} coincidence counting method for the proposed coincidence\ndetection techniques without a coincidence detector. It requires a\ntime-resolved {\\it pulse} photon or neutron source. Suppose $I_{d_1}^{(1)}$\nrecords the emitted photoelectron or the scattered neutron arrived at the\ndetector $D_1$ and similarly $I_{d_2}^{(1)}$ records the counting arrived at\nthe detector $D_2$ within one time window between sequential two incident\npulses. The coincidence counting can be defined by $I_d^{(2)}=I_{d_1}^{(1)}\n\\times I_{d_2}^{(1)}$, which records the coincidence probability of two\nphotoelectric processes or two neutron-scattering processes within this time\nwindow. Therefore, $I_d^{(2)}$ involves the two-body correlations of the target\nelectrons. The previously proposed cARPES and cINS can be implemented upon the\ntime-resolved angle-resolved photoemission spectroscopy (ARPES) and inelastic\nneutron scattering (INS) experimental apparatuses with pulse sources.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:06:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cao","Dezhong",""],["Su","Yuehua",""]]}
{"id":"2308.16747","submitter":"Gonzalo Garcia-Atance Fatjo PhD","authors":"Gonzalo Garcia-Atance Fatjo","title":"Prediction of ultrasonic cavitation with a dimensionless number, towards\n  higher reproducibility","comments":"11 pages, 3538 words, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultrasonic cavitation is the formation of vapour cavities within a liquid due\nto the action of an ultrasound source. It is widely used for homogenization,\ndispersion, deagglomeration, erosion, cleaning, milling, emulsification,\nextraction, disintegration and sonochemistry. On the other hand, the so-called\ncavitation number is used to assess the likelihood of cavitation in fluid flows\nwithin a conduit or around a hydrofoil but it is not valid in ultrasonic\ncavitation since there is no fluid flow. A recently formulated number predicts\nthe cavitation in case of sudden accelerations. The tip surface of an\nultrasonic probe is subjected to a continuous repetition of alternating\naccelerations at high frequency. Therefore, the use of the recently formulated\nnumber in ultrasonic cavitation is explored here. Simulations of the ultrasonic\nprobe in water just at the condition of cavitation onset have been performed\nfor a combination of probe diameters from 0.2 to 100 mm and frequencies 20, 30,\n40, 100 and 1000 KHz. The recently formulated number is applied to these\ncombinations and it is found that can be used to predict ultrasonic cavitation.\nConsequently, the dimensionless number can be used to decide the conditions to\navoid or generate cavitation when a fluid is sonicated and to increase\nreproducibility in such conditions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:06:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fatjo","Gonzalo Garcia-Atance",""]]}
{"id":"2308.16748","submitter":"Hanwen Kang","authors":"Yaoqiang Pan, Hao Cao, Kewei Hu, Hanwen Kang, Xing Wang","title":"A Novel Mapping and Navigation Framework for Robot Autonomy in Orchards","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Target detection is a basic task to divide the object types in the orchard\npoint cloud global map, which is used to count the overall situation of the\norchard. And provide necessary information for unmanned navigation planning of\nagricultural vehicles. In order to divide the fruit trees and the ground in the\npoint cloud global map of the standardized orchard, and provide the orchard\noverall information for the path planning of autonomous vehicles in the natural\norchard environment. A fruit tree detection method based on the Yolo-V7 network\nis proposed, which can effectively detect fruit tree targets from multi-sensor\nfused radar point cloud, reduce the 3D point cloud information of the point\ncloud map to 2D for the fruit tree point cloud in the Yolo-V7 network detection\nmap, and project the prediction results into the point cloud map. Generally,\nthe target detection network based on PointNet has the problem of low speed and\nlarge computational load. The method proposed in this paper is fast and low\ncomputational load and is suitable for deployment in mobile robots. From the\nexperimental results, the recall rate and accuracy rate of the proposed method\nin orchard fruit tree detection are 0.4 and 0.696 respectively, and its weight\nand reasoning time are 7.4 M and 28 ms respectively. The experimental results\nshow that this method can achieve the robustness and efficiency of real-time\ndetection of orchard fruit trees.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:10:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pan","Yaoqiang",""],["Cao","Hao",""],["Hu","Kewei",""],["Kang","Hanwen",""],["Wang","Xing",""]]}
{"id":"2308.16749","submitter":"Shengmao Zhu","authors":"Qingtao Chen, Kefeng Liu and Shengmao Zhu","title":"Cyclotomic expansions for double twist knots with an odd number of\n  half-twists","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math-ph math.MP math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note, we compute the cyclotomic expansion formula for colored Jones\npolynomial of double twist knots with an odd number of half-twists\n$\\mathcal{K}_{p,\\frac{s}{2}}$ by using the Kauffman bracket skein theory. It\nanswers a question proposed by Lovejoy and Osburn in 2019.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:10:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Qingtao",""],["Liu","Kefeng",""],["Zhu","Shengmao",""]]}
{"id":"2308.16750","submitter":"Andrea Lucchini","authors":"Karmele Garatea Zaballa and Andrea Lucchini","title":"The non-two-primes graph of a finite group","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To any finite group $G$, we may associate a graph whose vertices are the\nelements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and\nonly if the order of the subgroup $\\langle x, y\\rangle$ is divisible by at\nleast 3 distinct primes. We prove that the subgraph of this graph induced by\nthe non-isolated vertices is connected and has diameter at most 5.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:12:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zaballa","Karmele Garatea",""],["Lucchini","Andrea",""]]}
{"id":"2308.16751","submitter":"Emilien Denoual","authors":"E. Denoual, L. Berg\\'e, X. Davoine, L. Gremillet","title":"Modeling terahertz emissions from energetic electrons and ions in foil\n  targets irradiated by ultraintense femtosecond laser pulses","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Terahertz (THz) emissions from fast electron and ion currents driven in\nrelativistic, femtosecond laser-foil interactions are examined theoretically.\nWe first consider the radiation from the energetic electrons exiting the\nbackside of the target. Our kinetic model takes account of the coherent\ntransition radiation due to these electrons crossing the plasma-vacuum\ninterface as well as of the synchrotron radiation due to their deflection and\ndeceleration in the sheath field they set up in vacuum. After showing that both\nmechanisms tend to largely compensate each other when all the electrons are\npulled back into the target, we investigate the scaling of the net radiation\nwith the sheath field strength. We then demonstrate the sensitivity of this\nradiation to a percent-level fraction of escaping electrons. We also study the\ninfluence of the target thickness and laser focusing. The same sheath field\nthat confines most of the fast electrons around the target rapidly sets into\nmotion the surface ions. We describe the THz emission from these accelerated\nions and their accompanying hot electrons by means of a plasma expansion model\nthat allows for finite foil size and multidimensional effects. Again, we\nexplore the dependencies of this radiation mechanism on the laser-target\nparameters. Under conditions typical of current ultrashort laser-solid\nexperiments, we find that the THz radiation from the expanding plasma is much\nless energetic -- by one to three orders of magnitude -- than that due to the\nearly-time motion of the fast electrons.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:13:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Denoual","E.",""],["Berg\u00e9","L.",""],["Davoine","X.",""],["Gremillet","L.",""]]}
{"id":"2308.16752","submitter":"Reza Mirzaeifard","authors":"Reza Mirzaeifard, Naveen K. D. Venkategowda, Alexander Jung, Stefan\n  Werner","title":"Moreau Envelope ADMM for Decentralized Weakly Convex 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":"  This paper proposes a proximal variant of the alternating direction method of\nmultipliers (ADMM) for distributed optimization. Although the current versions\nof ADMM algorithm provide promising numerical results in producing solutions\nthat are close to optimal for many convex and non-convex optimization problems,\nit remains unclear if they can converge to a stationary point for weakly convex\nand locally non-smooth functions. Through our analysis using the Moreau\nenvelope function, we demonstrate that MADM can indeed converge to a stationary\npoint under mild conditions. Our analysis also includes computing the bounds on\nthe amount of change in the dual variable update step by relating the gradient\nof the Moreau envelope function to the proximal function. Furthermore, the\nresults of our numerical experiments indicate that our method is faster and\nmore robust than widely-used approaches.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:16:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mirzaeifard","Reza",""],["Venkategowda","Naveen K. D.",""],["Jung","Alexander",""],["Werner","Stefan",""]]}
{"id":"2308.16753","submitter":"Abhijit Anand","authors":"Abhijit Anand, Venktesh V, Vinay Setty, Avishek Anand","title":"Context Aware Query Rewriting for Text Rankers using LLM","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Query rewriting refers to an established family of approaches that are\napplied to underspecified and ambiguous queries to overcome the vocabulary\nmismatch problem in document ranking. Queries are typically rewritten during\nquery processing time for better query modelling for the downstream ranker.\nWith the advent of large-language models (LLMs), there have been initial\ninvestigations into using generative approaches to generate pseudo documents to\ntackle this inherent vocabulary gap. In this work, we analyze the utility of\nLLMs for improved query rewriting for text ranking tasks. We find that there\nare two inherent limitations of using LLMs as query re-writers -- concept drift\nwhen using only queries as prompts and large inference costs during query\nprocessing. We adopt a simple, yet surprisingly effective, approach called\ncontext aware query rewriting (CAR) to leverage the benefits of LLMs for query\nunderstanding. Firstly, we rewrite ambiguous training queries by context-aware\nprompting of LLMs, where we use only relevant documents as context.Unlike\nexisting approaches, we use LLM-based query rewriting only during the training\nphase. Eventually, a ranker is fine-tuned on the rewritten queries instead of\nthe original queries during training. In our extensive experiments, we find\nthat fine-tuning a ranker using re-written queries offers a significant\nimprovement of up to 33% on the passage ranking task and up to 28% on the\ndocument ranking task when compared to the baseline performance of using\noriginal queries.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:19:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Anand","Abhijit",""],["V","Venktesh",""],["Setty","Vinay",""],["Anand","Avishek",""]]}
{"id":"2308.16754","submitter":"Eric Werneburg","authors":"Eric Arthur Werneburg","title":"Training Neural Networks Using Reproducing Kernel Space Interpolation\n  and Model Reduction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce and study the theory of training neural networks using\ninterpolation techniques from reproducing kernel Hilbert space theory. We\ngeneralize the method to Krein spaces, and show that widely-used neural network\narchitectures are subsets of reproducing kernel Krein spaces (RKKS). We study\nthe concept of \"associated Hilbert spaces\" of RKKS and develop techniques to\nimprove upon the expressivity of various activation functions. Next, using\nconcepts from the theory of functions of several complex variables, we prove a\ncomputationally applicable, multidimensional generalization of the celebrated\nAdamjan- Arov-Krein (AAK) theorem. The theorem yields a novel class of neural\nnetworks, called Prolongation Neural Networks (PNN). We demonstrate that, by\napplying the multidimensional AAK theorem to gain a PNN, one can gain\nperformance superior to both our interpolatory methods and current\nstate-of-the-art methods in noisy environments. We provide useful illustrations\nof our methods in practice.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:21:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Werneburg","Eric Arthur",""]]}
{"id":"2308.16755","submitter":"Peng-Xiang Ma","authors":"Peng-Xiang Ma, Xu Feng, Mikhail Gorchtein, Lu-Chang Jin, Keh-Fei Liu,\n  Chien-Yeah Seng, Bi-Geng Wang and Zhao-Long Zhang","title":"Lattice QCD Calculation of Electroweak Box Contributions to Superallowed\n  Nuclear and Neutron Beta Decays","comments":"9 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-ph nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the first lattice QCD calculation of the universal axial $\\gamma\nW$-box contribution $\\square_{\\gamma W}^{VA}$ to both superallowed nuclear and\nneutron beta decays. This contribution emerges as a significant component\nwithin the theoretical uncertainties surrounding the extraction of $|V_{ud}|$\nfrom superallowed decays. Our calculation is conducted using two domain wall\nfermion ensembles at the physical pion mass. To construct the nucleon 4-point\ncorrelation functions, we employ the random sparsening field technique.\nFurthermore, we incorporate long-distance contributions to the hadronic\nfunction using the infinite-volume reconstruction method. Upon performing the\ncontinuum extrapolation, we arrive at $\\square_{\\gamma\nW}^{VA}=3.65(8)_{\\mathrm{lat}}(1)_{\\mathrm{PT}}\\times10^{-3}$. Consequently,\nthis yields a slightly higher value of\n$|V_{ud}|=0.97386(11)_{\\mathrm{exp.}}(9)_{\\mathrm{RC}}(27)_{\\mathrm{NS}}$,\nreducing the previous $2.1\\sigma$ tension with the CKM unitarity to\n$1.8\\sigma$. Additionally, we calculate the vector $\\gamma W$-box contribution\nto the axial charge $g_A$, denoted as $\\square_{\\gamma W}^{VV}$, and explore\nits potential implications.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:22:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ma","Peng-Xiang",""],["Feng","Xu",""],["Gorchtein","Mikhail",""],["Jin","Lu-Chang",""],["Liu","Keh-Fei",""],["Seng","Chien-Yeah",""],["Wang","Bi-Geng",""],["Zhang","Zhao-Long",""]]}
{"id":"2308.16756","submitter":"John Robert Oakley","authors":"J. Robert Oakley","title":"Large volume fibered knots in 3-manifolds","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We prove that for hyperbolic fibered knots in any closed, connected, oriented\n3-manifold the volume and genus are unrelated. As an application we answer a\nquestion of Hirose, Kalfagianni, and Kin about volumes of mapping tori that are\ndouble branched covers.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:23:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Oakley","J. Robert",""]]}
{"id":"2308.16757","submitter":"Fabian Coupette","authors":"Fabian Coupette and Tanja Schilling","title":"Universal Approach to Critical Percolation","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Percolation problems appear in a large variety of different contexts ranging\nfrom the design of composite materials to vaccination strategies on community\nnetworks. The key observable for many applications is the percolation\nthreshold. Unlike the universal critical exponents, the percolation threshold\ndepends explicitly on the specific system properties. As a consequence,\ntheoretical approaches to the percolation threshold are rare and generally\ntailored to the specific application.\n  Yet, any percolating cluster forms a discrete network the emergence of which\ncan be cast as a graph problem and analyzed using branching processes. We\npropose a general mapping of any kind of percolation problem onto a branching\nprocess which provides rigorous lower bounds of the percolation threshold.\nThese bounds progressively tighten as we incorporate more information into the\ntheory. We showcase our approach for different continuum problems finding\naccurate predictions with almost no effort. Our approach is based on first\nprinciples and does not require fitting parameters. As such it offers an\nimportant theoretical reference in a field that is dominated by simulation\nstudies and heuristic fit functions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:26:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Coupette","Fabian",""],["Schilling","Tanja",""]]}
{"id":"2308.16758","submitter":"Cuican Yu","authors":"Cuican Yu, Guansong Lu, Yihan Zeng, Jian Sun, Xiaodan Liang, Huibin\n  Li, Zongben Xu, Songcen Xu, Wei Zhang, Hang Xu","title":"Towards High-Fidelity Text-Guided 3D Face Generation and Manipulation\n  Using only Images","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":"  Generating 3D faces from textual descriptions has a multitude of\napplications, such as gaming, movie, and robotics. Recent progresses have\ndemonstrated the success of unconditional 3D face generation and text-to-3D\nshape generation. However, due to the limited text-3D face data pairs,\ntext-driven 3D face generation remains an open problem. In this paper, we\npropose a text-guided 3D faces generation method, refer as TG-3DFace, for\ngenerating realistic 3D faces using text guidance. Specifically, we adopt an\nunconditional 3D face generation framework and equip it with text conditions,\nwhich learns the text-guided 3D face generation with only text-2D face data. On\ntop of that, we propose two text-to-face cross-modal alignment techniques,\nincluding the global contrastive learning and the fine-grained alignment\nmodule, to facilitate high semantic consistency between generated 3D faces and\ninput texts. Besides, we present directional classifier guidance during the\ninference process, which encourages creativity for out-of-domain generations.\nCompared to the existing methods, TG-3DFace creates more realistic and\naesthetically pleasing 3D faces, boosting 9% multi-view consistency (MVIC) over\nLatent3D. The rendered face images generated by TG-3DFace achieve higher FID\nand CLIP score than text-to-2D face/image generation models, demonstrating our\nsuperiority in generating realistic and semantic-consistent textures.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:26:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yu","Cuican",""],["Lu","Guansong",""],["Zeng","Yihan",""],["Sun","Jian",""],["Liang","Xiaodan",""],["Li","Huibin",""],["Xu","Zongben",""],["Xu","Songcen",""],["Zhang","Wei",""],["Xu","Hang",""]]}
{"id":"2308.16759","submitter":"Zheng Xing","authors":"Zheng Xing and Junting Chen","title":"Constructing Indoor Region-based Radio Map without Location Labels","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Radio map construction requires a large amount of radio measurement data with\nlocation labels, which imposes a high deployment cost. This paper develops a\nregion-based radio map from received signal strength (RSS) measurements without\nlocation labels. The construction is based on a set of blindly collected RSS\nmeasurement data from a device that visits each region in an indoor area\nexactly once, where the footprints and timestamps are not recorded. The main\nchallenge is to cluster the RSS data and match clusters with the physical\nregions. Classical clustering algorithms fail to work as the RSS data naturally\nappears as non-clustered due to multipaths and noise. In this paper, a signal\nsubspace model with a sequential prior is constructed for the RSS data, and an\nintegrated segmentation and clustering algorithm is developed, which is shown\nto find the globally optimal solution in a special case. Furthermore, the\nclustered data is matched with the physical regions using a graph-based\napproach. Based on real measurements from an office space, the proposed scheme\nreduces the region localization error by roughly 50% compared to a weighted\ncentroid localization (WCL) baseline, and it even outperforms some supervised\nlocalization schemes, including k-nearest neighbor (KNN), support vector\nmachine (SVM), and deep neural network (DNN), which require labeled data for\ntraining.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:27:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xing","Zheng",""],["Chen","Junting",""]]}
{"id":"2308.16760","submitter":"Aiguo Xu Prof. Dr.","authors":"Aiguo Xu","title":"Brief introduction to discrete Boltzmann modeling and analysis method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We briefly introduce several fundamental problems that cause the creation of\nDiscrete Boltzmann modeling and analysis Method(DBM), corresponding solutions,\nthe relationship and difference between DBM and traditional fluid modeling and\nother kinetic methods, and some applications of DBM and\ndiscrete/non-equilibrium effects.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:28:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xu","Aiguo",""]]}
{"id":"2308.16761","submitter":"Qijiong Liu","authors":"Qijiong Liu, Jiaren Xiao, Lu Fan, Jieming Zhu, Xiao-Ming Wu","title":"Co-evolving Vector Quantization for ID-based Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Category information plays a crucial role in enhancing the quality and\npersonalization of recommendations. Nevertheless, the availability of item\ncategory information is not consistently present, particularly in the context\nof ID-based recommendations. In this work, we propose an alternative approach\nto automatically learn and generate entity (i.e., user and item) categorical\ninformation at different levels of granularity, specifically for ID-based\nrecommendation. Specifically, we devise a co-evolving vector quantization\nframework, namely COVE, which enables the simultaneous learning and refinement\nof code representation and entity embedding in an end-to-end manner, starting\nfrom the randomly initialized states. With its high adaptability, COVE can be\neasily integrated into existing recommendation models. We validate the\neffectiveness of COVE on various recommendation tasks including list\ncompletion, collaborative filtering, and click-through rate prediction, across\ndifferent recommendation models. We will publish the code and data for other\nresearchers to reproduce our work.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:29:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Qijiong",""],["Xiao","Jiaren",""],["Fan","Lu",""],["Zhu","Jieming",""],["Wu","Xiao-Ming",""]]}
{"id":"2308.16762","submitter":"Yunfeng Liang","authors":"Ji-Gui Cheng, Yun-Feng Liang and En-Wei Liang","title":"Search for the gamma-ray spectral lines with the DAMPE and the Fermi-LAT\n  observations","comments":"14 pages, 10 figures. Accepted for publication in PRD","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Weakly interacting massive particles, as a major candidate of dark matter\n(DM), may directly annihilate or decay into high-energy photons, producing\nmonochromatic spectral lines in the gamma-ray band. These spectral lines, if\ndetected, are smoking-gun signatures for the existence of new physics. Using\nthe 5 years of DAMPE and 13 years of Fermi-LAT data, we search for line-like\nsignals in the energy range of 3 GeV to 1 TeV from the Galactic halo. Different\nregions of interest are considered to accommodate different DM density\nprofiles. We do not find any significant line structure, and the previously\nreported line-like feature at $\\sim$133 GeV is also not detected in our\nanalysis. Adopting a local DM density of $\\rho_{\\rm local}=0.4\\,{\\rm\nGeV\\,cm^{-3}}$, we derive 95% confidence level constraints on the\nvelocity-averaged cross-section of $\\langle{\\sigma v}\\rangle_{\\gamma\\gamma}\n\\lesssim 4 \\times 10^{-28}\\,{\\rm cm^{3}\\,s^{-1}}$ and the decay lifetime of\n$\\tau_{\\gamma\\nu} \\gtrsim 5 \\times 10^{29}\\,{\\rm s}$ at 100 GeV, achieving the\nstrongest constraints to date for the line energies of 6-660 GeV. The\nimprovement stems from the longer Fermi-LAT data set used and the inclusion of\nDAMPE data in the analysis. The simultaneous use of two independent data sets\ncould also reduce the systematic uncertainty of the search.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:30:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cheng","Ji-Gui",""],["Liang","Yun-Feng",""],["Liang","En-Wei",""]]}
{"id":"2308.16763","submitter":"Kairui Hu Mr","authors":"Kairui Hu, Ming Yan, Joey Tianyi Zhou, Ivor W. Tsang, Wen Haw Chong,\n  Yong Keong Yap","title":"Ladder-of-Thought: Using Knowledge as Steps to Elevate Stance Detection","comments":"5 pages, 2 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Chain-of-Thought Prompting (CoT) reinforces the reasoning capabilities of\nLarge Language Models (LLMs) through the generation of intermediate rationales.\nHowever, these enhancements predominantly benefit large-scale models, leaving\nsmall LMs without significant performance improvements when directly applying\nCoT. Despite the advanced reasoning capabilities of LLMs, CoT relies primarily\non their pre-trained internal knowledge. The external knowledge that is\npreviously unknown to the model remains unexploited. This omission becomes\npronounced in tasks such as stance detection, where the external background\nknowledge plays a pivotal role. Additionally, the large-scale architecture of\nLLMs inevitably present efficiency challenges during deployment. To address\nthese challenges, we introduce the Ladder-of-Thought (LoT) for stance\ndetection. Grounded in a dual-phase Cascaded Optimization framework, LoT\ndirects the model to incorporate high-quality external knowledge, enhancing the\nintermediate rationales it generates. These bolstered rationales subsequently\nserve as the foundation for more precise predictions - akin to how a ladder\nfacilitates reaching elevated goals. LoT achieves a balance between efficiency\nand accuracy, making it an adaptable and efficient framework for stance\ndetection. Our empirical evaluations underscore LoT's effectiveness, marking a\n16% improvement over ChatGPT and a 10% enhancement compared to ChatGPT with\nCoT.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:31:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hu","Kairui",""],["Yan","Ming",""],["Zhou","Joey Tianyi",""],["Tsang","Ivor W.",""],["Chong","Wen Haw",""],["Yap","Yong Keong",""]]}
{"id":"2308.16764","submitter":"Pietro Conzinu","authors":"Denis Bitnaya, Pietro Conzinu and Giovanni Marozzi","title":"On the stability of string-hole gas","comments":"17 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th astro-ph.CO gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Focusing on a string-hole gas within the pre-big bang scenario, we study the\nstability of its solutions in the phase space. We firstly extend the analysis\npresent in the literature relaxing the ideal-gas properties of the string-hole\ngas, taking into account a (bulk-)viscosity term. Then we consider the case of\na theory described by a complete O(d,d)-invariant action up to all orders in\n$\\alpha^{\\prime}$-corrections (the Hohm-Zwiebach action), studying the\nstability of the string-hole gas solution with or without the introduction of\nthe viscosity term. Furthermore, the bulk viscosity is also considered for two\ndifferent first order $\\alpha^{\\prime}$-corrected actions: the\nGasperini-Maggiore-Veneziano-action and the Meissner-action. The results\nobtained show how the viscosity can help to stabilize the string-hole gas\nsolution, obtaining constraints on the equation of state of the gas.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:33:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bitnaya","Denis",""],["Conzinu","Pietro",""],["Marozzi","Giovanni",""]]}
{"id":"2308.16765","submitter":"Carlos E. Arreche","authors":"Carlos E. Arreche and Yi Zhang","title":"Twisted Mahler discrete residues","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently we constructed Mahler discrete residues for rational functions and\nshowed they comprise a complete obstruction to the Mahler summability problem\nof deciding whether a given rational function $f(x)$ is of the form\n$g(x^p)-g(x)$ for some rational function $g(x)$ and an integer $p > 1$. Here we\ndevelop a notion of $\\lambda$-twisted Mahler discrete residues for\n$\\lambda\\in\\mathbb{Z}$, and show that they similarly comprise a complete\nobstruction to the twisted Mahler summability problem of deciding whether a\ngiven rational function $f(x)$ is of the form $p^\\lambda g(x^p)-g(x)$ for some\nrational function $g(x)$ and an integer $p>1$. We provide some initial\napplications of twisted Mahler discrete residues to differential creative\ntelescoping problems for Mahler functions and to the differential Galois theory\nof linear Mahler equations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:38:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Arreche","Carlos E.",""],["Zhang","Yi",""]]}
{"id":"2308.16766","submitter":"Sydney Mason","authors":"Sydney Mason and Ileana-Cristina Benea-Chelmus","title":"Hybrid silicon-organic Huygens' metasurface for phase modulation","comments":"10 pages, 5 figures","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":"  Spatial light modulators have desirable applications in sensing and free\nspace communication because they create an interface between the optical and\nelectronic realms. Electro-optic modulators allow for high-speed intensity\nmanipulation of an electromagnetic wavefront. However, most surfaces of this\nsort pose limitations due to their ability to modulate intensity rather than\nphase. Here we investigate an electro-optic modulator formed from a\nsilicon-organic Huygens' metasurface. In a simulation-based study, we discover\na metasurface design immersed in high-performance electro-optic molecules that\ncan achieve near-full resonant transmission with phase coverage over the full\n2$\\pi$ range. Through the electro-optic effect, we show 140$^\\circ$ (0.79$\\pi$)\nmodulation over a range of -100 to 100 V at 1330 nm while maintaining\nnear-constant transmitted field intensity (between 0.66 and 0.8). These results\npotentiate the fabrication of a high-speed spatial light modulator with the\nresolved parameters.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:40:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mason","Sydney",""],["Benea-Chelmus","Ileana-Cristina",""]]}
{"id":"2308.16767","submitter":"Markus Postl","authors":"Florian Thaler (1), Franz Rammerstorfer (1), Jon Ander Gomez (2), Raul\n  Garcia Crespo (2), Leticia Pasqual (2) and Markus Postl (1) ((1) Virtual\n  Vehicle Research GmbH, (2) Solver Intelligent Analytics)","title":"Reinforcement learning for safety-critical control of an automated\n  vehicle","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present our approach for the development, validation and deployment of a\ndata-driven decision-making function for the automated control of a vehicle.\nThe decisionmaking function, based on an artificial neural network is trained\nto steer the mobile robot SPIDER towards a predefined, static path to a target\npoint while avoiding collisions with obstacles along the path. The training is\nconducted by means of proximal policy optimisation (PPO), a state of the art\nalgorithm from the field of reinforcement learning. The resulting controller is\nvalidated using KPIs quantifying its capability to follow a given path and its\nreactivity on perceived obstacles along the path. The corresponding tests are\ncarried out in the training environment. Additionally, the tests shall be\nperformed as well in the robotics situation Gazebo and in real world scenarios.\nFor the latter the controller is deployed on a FPGA-based development platform,\nthe FRACTAL platform, and integrated into the SPIDER software stack.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:41:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Thaler","Florian",""],["Rammerstorfer","Franz",""],["Gomez","Jon Ander",""],["Crespo","Raul Garcia",""],["Pasqual","Leticia",""],["Postl","Markus",""]]}
{"id":"2308.16768","submitter":"Bahar Bidaran","authors":"Bahar Bidaran, Francesco La Barbera, Anna Pasquali, Glenn van de Ven,\n  Reynier Peletier, Jesus Falc\\'on-Barroso, Dimitri A. Gadotti, Agnieszka\n  Sybilska, Eva K. Grebel","title":"On the accretion of a new group of galaxies onto Virgo: III. The stellar\n  population radial gradients of dEs","comments":"18 pages, 8 figures, accepted in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using MUSE data, we investigate the radial gradients of stellar population\nproperties (namely age, [M/H], and the abundance ratio of $\\alpha$ elements\n[$\\alpha$/Fe]) for a sample of nine dwarf early-type (dE) galaxies with\nlog(M$_{\\star}$/M$_{\\odot}$) $\\sim$ 9.0 and an infall time onto the Virgo\ncluster of 2-3Gyr ago. We followed a similar approach as in Bidaran et al.\n(2022) to derive their stellar population properties and star formation\nhistories (SFHs) through fitting observed spectral indices and full spectral\nfitting, respectively. We find that these nine dE galaxies have truncated\n[Mg/Fe]vs.[Fe/H] profiles than equally-massive Virgo dE galaxies with longer\npast infall times. Short profiles of three dE galaxies are the result of their\nintense star formation which has been quenched long before their accretion onto\nthe Virgo cluster, possibly as a result of their group environment. In the\nremaining six dE galaxies, profiles mainly trace a recent episode of star burst\nwithin 0.4R$_{\\rm e}$ which results in higher light-weighted [$\\alpha$/Fe]\nvalues. The latter SFH peak can be due to ram pressure exerted by the Virgo\ncluster at the time of the accretion of the dE galaxies. Also, we show that\nyounger, more metal-rich and less $\\alpha$-enhanced stellar populations\ndominate their inner regions (i.e., < 0.4R$_{\\rm e}$) resulting in mainly flat\n$\\nabla_{\\rm age}$, negative $\\nabla_{\\rm [M/H]}$ and positive $\\nabla_{\\rm\n[\\alpha/Fe]}$. We find that with increasing log($\\sigma_{\\rm Re}$) of dE\ngalaxies, $\\nabla_{\\rm age}$ and $\\nabla_{\\rm [\\alpha/Fe]}$ flatten, and the\nlatter correlation persists even after including early-type galaxies up to\nlog($\\sigma_{\\rm Re}$ $\\sim$ 2.5), possibly due to the more extended star\nformation activity in the inner regions of dEs, as opposed to more massive\nearly-type galaxies.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:44:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bidaran","Bahar",""],["La Barbera","Francesco",""],["Pasquali","Anna",""],["van de Ven","Glenn",""],["Peletier","Reynier",""],["Falc\u00f3n-Barroso","Jesus",""],["Gadotti","Dimitri A.",""],["Sybilska","Agnieszka",""],["Grebel","Eva K.",""]]}
{"id":"2308.16769","submitter":"Qin Lin","authors":"Colman McGuan, Chansu Yu, Qin Lin","title":"Towards Low-Barrier Cybersecurity Research and Education for Industrial\n  Control Systems","comments":"accepted to the 20th Annual IEEE International Conference on\n  Intelligence and Security Informatics (ISI)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The protection of Industrial Control Systems (ICS) that are employed in\npublic critical infrastructures is of utmost importance due to catastrophic\nphysical damages cyberattacks may cause. The research community requires\ntestbeds for validation and comparing various intrusion detection algorithms to\nprotect ICS. However, there exist high barriers to entry for research and\neducation in the ICS cybersecurity domain due to expensive hardware, software,\nand inherent dangers of manipulating real-world systems. To close the gap,\nbuilt upon recently developed 3D high-fidelity simulators, we further showcase\nour integrated framework to automatically launch cyberattacks, collect data,\ntrain machine learning models, and evaluate for practical chemical and\nmanufacturing processes. On our testbed, we validate our proposed intrusion\ndetection model called Minimal Threshold and Window SVM (MinTWin SVM) that\nutilizes unsupervised machine learning via a one-class SVM in combination with\na sliding window and classification threshold. Results show that MinTWin SVM\nminimizes false positives and is responsive to physical process anomalies.\nFurthermore, we incorporate our framework with ICS cybersecurity education by\nusing our dataset in an undergraduate machine learning course where students\ngain hands-on experience in practicing machine learning theory with a practical\nICS dataset. All of our implementations have been open-sourced.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:46:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["McGuan","Colman",""],["Yu","Chansu",""],["Lin","Qin",""]]}
{"id":"2308.16770","submitter":"David Graus","authors":"Jarno Vrolijk and David Graus","title":"Enhancing PLM Performance on Labour Market Tasks via Instruction-based\n  Finetuning and Prompt-tuning with Rules","comments":"accepted for publication at RecSys in HR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The increased digitization of the labour market has given researchers,\neducators, and companies the means to analyze and better understand the labour\nmarket. However, labour market resources, although available in high volumes,\ntend to be unstructured, and as such, research towards methodologies for the\nidentification, linking, and extraction of entities becomes more and more\nimportant. Against the backdrop of this quest for better labour market\nrepresentations, resource constraints and the unavailability of large-scale\nannotated data cause a reliance on human domain experts. We demonstrate the\neffectiveness of prompt-based tuning of pre-trained language models (PLM) in\nlabour market specific applications. Our results indicate that cost-efficient\nmethods such as PTR and instruction tuning without exemplars can significantly\nincrease the performance of PLMs on downstream labour market applications\nwithout introducing additional model layers, manual annotations, and data\naugmentation.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:47:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vrolijk","Jarno",""],["Graus","David",""]]}
{"id":"2308.16771","submitter":"Rick Steinert","authors":"Rick Steinert, Saskia Altmann","title":"Linking microblogging sentiments to stock price movement: An application\n  of GPT-4","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST q-fin.CP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper investigates the potential improvement of the GPT-4 Language\nLearning Model (LLM) in comparison to BERT for modeling same-day daily stock\nprice movements of Apple and Tesla in 2017, based on sentiment analysis of\nmicroblogging messages. We recorded daily adjusted closing prices and\ntranslated them into up-down movements. Sentiment for each day was extracted\nfrom messages on the Stocktwits platform using both LLMs. We develop a novel\nmethod to engineer a comprehensive prompt for contextual sentiment analysis\nwhich unlocks the true capabilities of modern LLM. This enables us to carefully\nretrieve sentiments, perceived advantages or disadvantages, and the relevance\ntowards the analyzed company. Logistic regression is used to evaluate whether\nthe extracted message contents reflect stock price movements. As a result,\nGPT-4 exhibited substantial accuracy, outperforming BERT in five out of six\nmonths and substantially exceeding a naive buy-and-hold strategy, reaching a\npeak accuracy of 71.47 % in May. The study also highlights the importance of\nprompt engineering in obtaining desired outputs from GPT-4's contextual\nabilities. However, the costs of deploying GPT-4 and the need for fine-tuning\nprompts highlight some practical considerations for its use.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:49:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Steinert","Rick",""],["Altmann","Saskia",""]]}
{"id":"2308.16772","submitter":"Srdjan Ostojic","authors":"Srdjan Ostojic and Stefano Fusi","title":"The computational role of structure in neural activity and connectivity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One major challenge of neuroscience is finding interesting structures in a\nseemingly disorganized neural activity. Often these structures have\ncomputational implications that help to understand the functional role of a\nparticular brain area. Here we outline a unified approach to characterize these\nstructures by inspecting the representational geometry and the modularity\nproperties of the recorded activity, and show that this approach can also\nreveal structures in connectivity. We start by setting up a general framework\nfor determining geometry and modularity in activity and connectivity and\nrelating these properties with computations performed by the network. We then\nuse this framework to review the types of structure found in recent works on\nmodel networks performing three classes of computations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:49:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ostojic","Srdjan",""],["Fusi","Stefano",""]]}
{"id":"2308.16773","submitter":"Andreas Morr","authors":"Andreas Morr, Keno Riechers, Leonardo Rydin Gorj\\~ao, Niklas Boers","title":"Anticipating critical transitions in multi-dimensional systems driven by\n  time- and state-dependent noise","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The anticipation of bifurcation-induced transitions in dynamical systems has\ngained relevance in various fields of the natural, social, and economic\nsciences. When approaching a co-dimension 1 bifurcation, the feedbacks that\nstabilise the initial state weaken and eventually vanish; a process referred to\nas critical slowing down (CSD). This motivates the use of variance and lag-1\nautocorrelation as indicators of CSD. Both indicators rely on linearising the\nsystem's restoring rate. Additionally, the use of variance is limited to time-\nand state-independent driving noise, strongly constraining the generality of\nCSD. Here, we propose a data-driven approach based on deriving a Langevin\nequation to detect local stability changes and anticipate bifurcation-induced\ntransitions in systems with generally time- and state-dependent noise. Our\napproach substantially generalizes the conditions underlying existing early\nwarning indicators, which we showcase in different examples. Changes in\ndeterministic dynamics can be clearly discriminated from changes in the driving\nnoise. This reduces the risk of false and missed alarms of conventional CSD\nindicators significantly in settings with time-dependent or multiplicative\nnoise. In multi-dimensional systems, our method can greatly advance the\nunderstanding of the coupling between system components and can avoid risks of\nmissing CSD due to dimension reduction, which existing approaches suffer from.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:50:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Morr","Andreas",""],["Riechers","Keno",""],["Gorj\u00e3o","Leonardo Rydin",""],["Boers","Niklas",""]]}
{"id":"2308.16774","submitter":"Antonio Mastropaolo","authors":"Antonio Mastropaolo, Fiorella Zampetti, Massimiliano Di Penta,\n  Gabriele Bavota","title":"Toward Automatically Completing GitHub Workflows","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Continuous integration and delivery (CI/CD) are nowadays at the core of\nsoftware development. Their benefits come at the cost of setting up and\nmaintaining the CI/CD pipeline, which requires knowledge and skills often\northogonal to those entailed in other software-related tasks. While several\nrecommender systems have been proposed to support developers across a variety\nof tasks, little automated support is available when it comes to setting up and\nmaintaining CI/CD pipelines. We present GH-WCOM (GitHub Workflow COMpletion), a\nTransformer-based approach supporting developers in writing a specific type of\nCI/CD pipelines, namely GitHub workflows. To deal with such a task, we designed\nan abstraction process to help the learning of the transformer while still\nmaking GH-WCOM able to recommend very peculiar workflow elements such as tool\noptions and scripting elements. Our empirical study shows that GH-WCOM provides\nup to 34.23% correct predictions, and the model's confidence is a reliable\nproxy for the recommendations' correctness likelihood.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:53:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mastropaolo","Antonio",""],["Zampetti","Fiorella",""],["Di Penta","Massimiliano",""],["Bavota","Gabriele",""]]}
{"id":"2308.16775","submitter":"Nhat Minh Le","authors":"Minh Le, Nhan Nguyen, and Ngoc Hoang Luong","title":"Efficacy of Neural Prediction-Based NAS for Zero-Shot NAS Paradigm","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In prediction-based Neural Architecture Search (NAS), performance indicators\nderived from graph convolutional networks have shown significant success. These\nindicators, achieved by representing feed-forward structures as component\ngraphs through one-hot encoding, face a limitation: their inability to evaluate\narchitecture performance across varying search spaces. In contrast, handcrafted\nperformance indicators (zero-shot NAS), which use the same architecture with\nrandom initialization, can generalize across multiple search spaces. Addressing\nthis limitation, we propose a novel approach for zero-shot NAS using deep\nlearning. Our method employs Fourier sum of sines encoding for convolutional\nkernels, enabling the construction of a computational feed-forward graph with a\nstructure similar to the architecture under evaluation. These encodings are\nlearnable and offer a comprehensive view of the architecture's topological\ninformation. An accompanying multi-layer perceptron (MLP) then ranks these\narchitectures based on their encodings. Experimental results show that our\napproach surpasses previous methods using graph convolutional networks in terms\nof correlation on the NAS-Bench-201 dataset and exhibits a higher convergence\nrate. Moreover, our extracted feature representation trained on each\nNAS-Benchmark is transferable to other NAS-Benchmarks, showing promising\ngeneralizability across multiple search spaces. The code is available at:\nhttps://github.com/minh1409/DFT-NPZS-NAS\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:54:06 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Le","Minh",""],["Nguyen","Nhan",""],["Luong","Ngoc Hoang",""]]}
{"id":"2308.16776","submitter":"Xiaorang Guo","authors":"Xiaorang Guo, Kun Qin and Martin Schulz","title":"HiSEP-Q: A Highly Scalable and Efficient Quantum Control Processor for\n  Superconducting Qubits","comments":"The paper is accepted by the 41st IEEE International Conference on\n  Computer Design (ICCD), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum computing promises an effective way to solve targeted problems that\nare classically intractable. Among them, quantum computers built with\nsuperconducting qubits are considered one of the most advanced technologies,\nbut they suffer from short coherence times. This can get exaggerated when they\nare controlled directly by general-purpose host machines, which leads to the\nloss of quantum information. To mitigate this, we need quantum control\nprocessors (QCPs) positioned between quantum processing units and host machines\nto reduce latencies. However, existing QCPs are built on top of designs with no\nor inefficient scalability, requiring a large number of instructions when\nscaling to more qubits. In addition, interactions between current QCPs and host\nmachines require frequent data transmissions and offline computations to obtain\nfinal results, which limits the performance of quantum computers.\n  In this paper, we propose a QCP called HiSEP-Q featuring a novel quantum\ninstruction set architecture (QISA) and its microarchitecture implementation.\nFor efficient control, we utilize mixed-type addressing modes and mixed-length\ninstructions in HiSEP-Q, which provides an efficient way to concurrently\naddress more than 100 qubits. Further, for efficient read-out and analysis, we\ndevelop a novel onboard accumulation and sorting unit, which eliminates the\ndata transmission of raw data between the QCPs and host machines and enables\nreal-time result processing. Compared to the state-of-the-art, our proposed\nQISA achieves at least 62% and 28% improvements in encoding efficiency with\nreal and synthetic quantum circuits, respectively. We also validate the\nmicroarchitecture on a field-programmable gate array, which exhibits low power\nand resource consumption. Both hardware and ISA evaluations demonstrate that\nHiSEP-Q features high scalability and efficiency toward the number of\ncontrolled qubits.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:54:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Guo","Xiaorang",""],["Qin","Kun",""],["Schulz","Martin",""]]}
{"id":"2308.16777","submitter":"Minheng Ni","authors":"Minheng Ni, Yabo Zhang, Kailai Feng, Xiaoming Li, Yiwen Guo, Wangmeng\n  Zuo","title":"Ref-Diff: Zero-shot Referring Image Segmentation with Generative Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Zero-shot referring image segmentation is a challenging task because it aims\nto find an instance segmentation mask based on the given referring\ndescriptions, without training on this type of paired data. Current zero-shot\nmethods mainly focus on using pre-trained discriminative models (e.g., CLIP).\nHowever, we have observed that generative models (e.g., Stable Diffusion) have\npotentially understood the relationships between various visual elements and\ntext descriptions, which are rarely investigated in this task. In this work, we\nintroduce a novel Referring Diffusional segmentor (Ref-Diff) for this task,\nwhich leverages the fine-grained multi-modal information from generative\nmodels. We demonstrate that without a proposal generator, a generative model\nalone can achieve comparable performance to existing SOTA weakly-supervised\nmodels. When we combine both generative and discriminative models, our Ref-Diff\noutperforms these competing methods by a significant margin. This indicates\nthat generative models are also beneficial for this task and can complement\ndiscriminative models for better referring segmentation. Our code is publicly\navailable at https://github.com/kodenii/Ref-Diff.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:55:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ni","Minheng",""],["Zhang","Yabo",""],["Feng","Kailai",""],["Li","Xiaoming",""],["Guo","Yiwen",""],["Zuo","Wangmeng",""]]}
{"id":"2308.16778","submitter":"Jacob Fronk","authors":"Jacob Fronk, Torben Kr\\\"uger, and Yuriy Nemish","title":"Norm Convergence Rate for Multivariate Quadratic Polynomials of Wigner\n  Matrices","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.FA math.MP math.OA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study Hermitian non-commutative quadratic polynomials of multiple\nindependent Wigner matrices. We prove that, with the exception of some specific\nreducible cases, the limiting spectral density of the polynomials always has a\nsquare root growth at its edges and prove an optimal local law around these\nedges. Combining these two results, we establish that, as the dimension $N$ of\nthe matrices grows to infinity, the operator norm of such polynomials $q$\nconverges to a deterministic limit with a rate of convergence of\n$N^{-2/3+o(1)}$. Here, the exponent in the rate of convergence is optimal. For\nthe specific reducible cases, we also provide a classification of all possible\nedge behaviours.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:56:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fronk","Jacob",""],["Kr\u00fcger","Torben",""],["Nemish","Yuriy",""]]}
{"id":"2308.16779","submitter":"Caterina Cocchi","authors":"Hanen Hamdi, Jannis Krumland, Ana M. Valencia, Carlos-Andres Palma,\n  and Caterina Cocchi","title":"Interlayer vibrational hybrid normal mode enabling molecular chiral\n  phonons","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":"  Organic/inorganic interfaces formed by monolayer substrates and conjugated\nmolecular adsorbates are attractive material platforms leveraging the\nmodularity of organic compounds together with the long-range phenomena typical\nof condensed matter. New quantum states are known to be generated by electronic\ninteractions in these systems as well as by their coupling with light. However,\nlittle is still known about hybrid vibrational modes. In this work, we discover\nfrom first principles the existence of an infrared-active chiral phonon mode in\na pyrene-decorated MoSe$_{2}$ monolayer given by the combination of a\nfrustrated rotation of the molecule around its central axis and an optical mode\nin the substrate. Our results suggest the possibility to enable phonon\nchirality in molecular superlattices.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:57:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hamdi","Hanen",""],["Krumland","Jannis",""],["Valencia","Ana M.",""],["Palma","Carlos-Andres",""],["Cocchi","Caterina",""]]}
{"id":"2308.16780","submitter":"Ailing Wang","authors":"Ailing Wang, Tao An, Yingkang Zhang, Xiaopeng Cheng, Luis C. Ho,\n  Kenneth I. Kellermann, Willem A. Baan","title":"VLBI Observations of a sample of Palomar-Green quasars II:\n  characterising the parsec-scale radio emission","comments":"This paper has been accepted by MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study uses multi-frequency Very Long Baseline Interferometry (VLBI) to\nstudy the radio emission from 10 radio-quiet quasars (RQQs) and four radio-loud\nquasars (RLQs). The diverse morphologies, radio spectra, and brightness\ntemperatures observed in the VLBI images of these RQQs, together with the\nvariability in their GHz spectra and VLBI flux densities, shed light on the\norigins of their nuclear radio emission. The total radio emission of RQQs\nappears to originate from non-thermal synchrotron radiation due to a\ncombination of active galactic nuclei and star formation activities. However,\nour data suggest that the VLBI-detected radio emission from these RQQs is\nprimarily associated with compact jets or corona, with extended emissions such\nas star formation and large-scale jets being resolved by the high resolution of\nthe VLBI images. Wind emission models are not in complete agreement the VLBI\nobservations. Unlike RLQs, where the parsec-scale radio emission is dominated\nby a relativistically boosted core, the radio cores of RQQs are either not\ndominant or are mixed with significant jet emission. RQQs with compact cores or\ncore-jet structures typically have more pronounced variability, with flat or\ninverted spectra, whereas jet-dominated RQQs have steep spectra and\nunremarkable variability. Future high-resolution observations of more RQQs\ncould help to determine the fraction of different emission sources and their\nassociated physical mechanisms.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:58:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Ailing",""],["An","Tao",""],["Zhang","Yingkang",""],["Cheng","Xiaopeng",""],["Ho","Luis C.",""],["Kellermann","Kenneth I.",""],["Baan","Willem A.",""]]}
{"id":"2308.16781","submitter":"Xiang Li","authors":"Xiang Li","title":"StratMed: Relevance Stratification for Low-resource Medication\n  Recommendation","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":"  With the growing imbalance between limited medical resources and escalating\ndemands, AI-based clinical tasks have become paramount. Medication\nrecommendation, as a sub-domain, aims to amalgamate longitudinal patient\nhistory with medical knowledge, assisting physicians in prescribing safer and\nmore accurate medication combinations. Existing methods overlook the inherent\nlong-tail distribution in medical data, lacking balanced representation between\nhead and tail data, which leads to sub-optimal model performance. To address\nthis challenge, we introduce StratMed, a model that incorporates an innovative\nrelevance stratification mechanism. It harmonizes discrepancies in data\nlong-tail distribution and strikes a balance between the safety and accuracy of\nmedication combinations. Specifically, we first construct a pre-training method\nusing deep learning networks to obtain entity representation. After that, we\ndesign a pyramid-like data stratification method to obtain more generalized\nentity relationships by reinforcing the features of unpopular entities. Based\non this relationship, we designed two graph structures to express medication\nprecision and safety at the same level to obtain visit representations.\nFinally, the patient's historical clinical information is fitted to generate\nmedication combinations for the current health condition. Experiments on the\nMIMIC-III dataset demonstrate that our method has outperformed current\nstate-of-the-art methods in four evaluation metrics (including safety and\naccuracy).\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 14:59:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Xiang",""]]}
{"id":"2308.16782","submitter":"Jiang Zeng","authors":"Ming-Jian Ding, Jiang Zeng","title":"Some new results on Minuscule polynomial of type A","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bourn and Erickson (arXiv:2307.02652) recently studied a polynomial $N_n(x)$\nconnecting the earth mover's distance to minuscule lattices of Type A, coined\nMinuscule polynomial of type A in this paper. They proved that this polynomial\nis palindromic and unimodal, and conjectured its real-rootedness as well as a\nremarkable formula when $x=1$. In this paper, we shall confirm these\nconjectures and further prove that the coefficients are asymptotically normal\nand the coefficient matrix of $N_n(x)$ is totally positive.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:00:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ding","Ming-Jian",""],["Zeng","Jiang",""]]}
{"id":"2308.16783","submitter":"Lie-Wen Chen","authors":"Zheng Cao, Lie-Wen Chen","title":"Neutron Star vs Quark Star in the Multimessenger Era","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-ph nucl-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neutron stars (NSs) which could contain exotic degrees of freedom in the core\nand the self-bound quark stars (QSs) made purely of absolutely stable\ndeconfined quark matter are still two main candidates for the compact objects\nobserved in pulsars and gravitational wave (GW) events in binary star mergers.\nWe perform a Bayesian model-agnostic inference of the properties of NSs and QSs\nby combining multi-messenger data of GW170817, GW190425, PSR J0030+0451, PSR\nJ0740+6620, PSR J1614-2230, PSR J0348+0432 as well as ab initio calculations\nfrom perturbative quantum chromodynamics and chiral effective field theory. We\nfind the NS scenario is strongly favored against the QS scenario with a Bayes\nfactor of NS over QS $\\mathcal{B}^\\text{NS}_\\text{QS} = 11.5$. In addition, the\npeak of the squared sound velocity $c_s^2 \\sim 0.5c^2$ around $3.5$ times\nnuclear saturation density $n_0$ observed in the NS case disappears in the QS\ncase which suggests that the $c_s^2$ first increases and then saturates at\n$c_s^2 \\sim 0.5c^2$ above $\\sim 4n_0$. The sound velocity and trace anomaly are\nfound to approach the conformal limit in the core of heavy NSs with mass $M\n\\gtrsim 2M_{\\odot}$, but not in the core of QSs.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:00:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cao","Zheng",""],["Chen","Lie-Wen",""]]}
{"id":"2308.16784","submitter":"Shuigen Liu","authors":"Shuigen Liu, Sebastian Reich and Xin T. Tong","title":"Dropout Ensemble Kalman inversion for high dimensional inverse problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ensemble Kalman inversion (EKI) is an ensemble-based method to solve inverse\nproblems. Its gradient-free formulation makes it an attractive tool for\nproblems with involved formulation. However, EKI suffers from the ''subspace\nproperty'', i.e., the EKI solutions are confined in the subspace spanned by the\ninitial ensemble. It implies that the ensemble size should be larger than the\nproblem dimension to ensure EKI's convergence to the correct solution. Such\nscaling of ensemble size is impractical and prevents the use of EKI in high\ndimensional problems. To address this issue, we propose a novel approach using\ndropout regularization to mitigate the subspace problem. We prove that\ndropout-EKI converges in the small ensemble settings, and the computational\ncost of the algorithm scales linearly with dimension. We also show that\ndropout-EKI reaches the optimal query complexity, up to a constant factor.\nNumerical examples demonstrate the effectiveness of our approach.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:01:46 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Shuigen",""],["Reich","Sebastian",""],["Tong","Xin T.",""]]}
{"id":"2308.16785","submitter":"Qi Gao","authors":"Qi Gao, Wei Xu, Mowei Shen, Zaifeng Gao","title":"Agent Teaming Situation Awareness (ATSA): A Situation Awareness\n  Framework for Human-AI Teaming","comments":"52 pages,5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rapid advancements in artificial intelligence (AI) have led to a growing\ntrend of human-AI teaming (HAT) in various fields. As machines continue to\nevolve from mere automation to a state of autonomy, they are increasingly\nexhibiting unexpected behaviors and human-like cognitive/intelligent\ncapabilities, including situation awareness (SA). This shift has the potential\nto enhance the performance of mixed human-AI teams over all-human teams,\nunderscoring the need for a better understanding of the dynamic SA interactions\nbetween humans and machines. To this end, we provide a review of leading SA\ntheoretical models and a new framework for SA in the HAT context based on the\nkey features and processes of HAT. The Agent Teaming Situation Awareness (ATSA)\nframework unifies human and AI behavior, and involves bidirectional, and\ndynamic interaction. The framework is based on the individual and team SA\nmodels and elaborates on the cognitive mechanisms for modeling HAT. Similar\nperceptual cycles are adopted for the individual (including both human and AI)\nand the whole team, which is tailored to the unique requirements of the HAT\ncontext. ATSA emphasizes cohesive and effective HAT through structures and\ncomponents, including teaming understanding, teaming control, and the world, as\nwell as adhesive transactive part. We further propose several future research\ndirections to expand on the distinctive contributions of ATSA and address the\nspecific and pressing next steps.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:02:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gao","Qi",""],["Xu","Wei",""],["Shen","Mowei",""],["Gao","Zaifeng",""]]}
{"id":"2308.16786","submitter":"Erio Tosatti","authors":"Erio Tosatti","title":"My friend Alex M\\\"uller","comments":"To appear on Physica C Superconductivity -- K. Alex M\\\"uller memorial\n  issue","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Alex, the main discoverer of high Tc superconductivity, was also a dear\nfriend. Here I offer a few frank anecdotes, possibly inaccurate in some details\nbut heartfelt and accurate in the substance, as a personal tribute to our\nfriendship.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:03:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tosatti","Erio",""]]}
{"id":"2308.16787","submitter":"Simone Casale Brunet","authors":"Simone Casale-Brunet, Leonardo Chiariglione, Marco Mattavelli","title":"Exploring the data of blockchain-based metaverses","comments":"In Proceedings of the IEEE International Conference on Metaverse\n  Computing, Networking and Applications (IEEE METACOM 2023), June 26--28,\n  2023, Japan","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years the concept of metaverse has evolved in the attempt of\ndefining richer immersive and interactive environments supporting various types\nof virtual experiences and interactions among users. This has led to the\nemergence of various different metaverse platforms that utilize blockchain\ntechnology and non-fungible tokens (NFTs) to establish ownership of metaverse\nelements and attach features and information to it. This article will delve\ninto the heterogeneity of the data involved in these metaverse platforms, as\nwell as highlight some dynamics and features of them. Moreover, the paper\nintroduces a metaverse analysis tool developed by the authors, which leverages\nmachine learning techniques to collect and analyze daily data, including\nblockchain transactions, platform-specific metadata, and social media trends.\nExperimental results are reported are presented with a use-case scenario\nfocused on the trading of digital parcels, commonly referred to as metaverse\nreal estate.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:03:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Casale-Brunet","Simone",""],["Chiariglione","Leonardo",""],["Mattavelli","Marco",""]]}
{"id":"2308.16788","submitter":"Antonio M. Peralta","authors":"Antonio M. Peralta","title":"Metric invariants in Banach and Jordan--Banach algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.OA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this note we collect some significant contributions on metric invariants\nfor complex Banach algebras and Jordan--Banach algebras established during the\nlast fifteen years. This note is mainly expository, but it also contains\ncomplete proofs and arguments, which in many cases are new or have been\nsimplified. We have also included several new results. The common goal in the\nresults is to seek for \"natural\" subsets, $\\mathfrak{S}_{A},$ associated with\neach complex Banach or Jordan--Banach algebra $A$, sets which when equipped\nwith a certain metric, $d_{A}$, enjoys the property that each surjective\nisometry from $(\\mathfrak{S}_{A},d_A)$ to a similar set,\n$(\\mathfrak{S}_{B},d_B),$ associated with another Banach or Jordan--Banach\nalgebra $B$, extends to a surjective real-linear isometry from $A$ onto $B$. In\ncase of a positive answer to this question, the problem of discussing whether\nin such a case the algebras $A$ and $B$ are in fact isomorphic or Jordan\nisomorphic is the subsequent question. The main results presented here will\ncover the cases in which the sets $(\\mathfrak{S}_{A},d_A)$ and\n$(\\mathfrak{S}_{B},d_B)$ are in one of the following situations:\n  $(\\checkmark)$ Subsets of the set of invertible elements in a unital complex\nBanach algebra or in a unital complex Jordan--Banach algebra with the metric\ninduced by the norm. Specially in the cases of unital C$^*$- and\nJB$^*$-algebras.\n  $(\\checkmark)$ The sets of positive invertible elements in unital C$^*$- or\nJB$^*$-algebras with respect to the metric induced by the norm and with respect\nto the Thompson's metric.\n  $(\\checkmark)$ Subsets of the set of unitary elements in unital C$^*$- and\nJB$^*$-algebras.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:03:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Peralta","Antonio M.",""]]}
{"id":"2308.16789","submitter":"Qiyang Zhao","authors":"Qiyang Zhao, Hang Zou, Mehdi Bennis, Merouane Debbah, Ebtesam\n  Almazrouei, Faouzi Bader","title":"Joint Semantic-Native Communication and Inference via Minimal Simplicial\n  Structures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we study the problem of semantic communication and inference,\nin which a student agent (i.e. mobile device) queries a teacher agent (i.e.\ncloud sever) to generate higher-order data semantics living in a simplicial\ncomplex. Specifically, the teacher first maps its data into a k-order\nsimplicial complex and learns its high-order correlations. For effective\ncommunication and inference, the teacher seeks minimally sufficient and\ninvariant semantic structures prior to conveying information. These minimal\nsimplicial structures are found via judiciously removing simplices selected by\nthe Hodge Laplacians without compromising the inference query accuracy.\nSubsequently, the student locally runs its own set of queries based on a masked\nsimplicial convolutional autoencoder (SCAE) leveraging both local and remote\nteacher's knowledge. Numerical results corroborate the effectiveness of the\nproposed approach in terms of improving inference query accuracy under\ndifferent channel conditions and simplicial structures. Experiments on a\ncoauthorship dataset show that removing simplices by ranking the Laplacian\nvalues yields a 85% reduction in payload size without sacrificing accuracy.\nJoint semantic communication and inference by masked SCAE improves query\naccuracy by 25% compared to local student based query and 15% compared to\nremote teacher based query. Finally, incorporating channel semantics is shown\nto effectively improve inference accuracy, notably at low SNR values.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:04:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhao","Qiyang",""],["Zou","Hang",""],["Bennis","Mehdi",""],["Debbah","Merouane",""],["Almazrouei","Ebtesam",""],["Bader","Faouzi",""]]}
{"id":"2308.16790","submitter":"Thomas John","authors":"Thomas P John, Robert J Poole, Adam Kowalski, Claudio P Fonte","title":"A comparison between the FENE-P and sPTT constitutive models in Large\n  Amplitude Oscillatory Shear (LAOS)","comments":"Submitted to Journal of Fluid Mechanics","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The FENE-P and sPTT viscoelastic models are widely used for modelling of\ncomplex fluids. Although they are derived from distinct micro-structural\ntheories, these models can become mathematically identical in steady and\nhomogeneous flows with a particular choice of the value of the model\nparameters. However, even with this choice of parameter values, the model\nresponses are known to differ from each other in transient flows. In this work,\nwe investigate the responses of the FENE-P and sPTT constitutive models in\nLarge Amplitude Oscillatory Shear (LAOS). In steady-shear, the shear stress\nscales with the non-dimensional group $Wi/(aL) \\ (Wi\\sqrt{\\epsilon})$ for the\nFENE-P (sPTT) model, where $Wi$ is the Weissenberg number, $L^2$ is the limit\nof extensibility in the FENE-P model ($a$ being $L^2/(L^2-3)$) and $\\epsilon$\nis the extensibility parameter in the sPTT model. Our numerical and analytical\nresults show that, in LAOS, the FENE-P model only shows this universality for\nlarge values of $L^2$ whereas the sPTT model shows this universality for all\nvalues of$\\epsilon$. In the strongly non-linear region, there is a drastic\ndifference between the responses of the two models, with the FENE-P model\nexhibiting strong shear stress overshoots which manifest as self-intersecting\nsecondary loops in the viscous Lissajous curves. We quantify the non-linearity\nexhibited by each constitutive model using the Sequence of Physical Processes\nframework. Despite the high degree of non-linearity exhibited by the FENE-P\nmodel, we also show using fully non-linear 1D simulations that it does not\nshear band in LAOS within the range of conditions studied.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:06:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["John","Thomas P",""],["Poole","Robert J",""],["Kowalski","Adam",""],["Fonte","Claudio P",""]]}
{"id":"2308.16791","submitter":"Sam E. Brady","authors":"Sam E. Brady, Llibert Arest\\'e Sal\\'o, Katy Clough, Pau Figueras,\n  Annamalai P. S","title":"Solving the initial conditions problem for modified gravity theories","comments":"9 pages, 4 figures, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modified gravity theories such as Einstein scalar Gauss Bonnet (EsGB) contain\nhigher derivative terms in the spacetime curvature in their action, which\nresults in modifications to the Hamiltonian and momentum constraints of the\ntheory. In principle, such modifications may affect the principal part of the\noperator in the resulting elliptic equations, and so further complicate the\nalready highly non-linear, coupled constraints that apply to the initial data\nin numerical relativity simulations of curved spacetimes. However, since these\nare effective field theories, we expect the additional curvature terms to be\nsmall, which motivates treating them simply as an additional source in the\nconstraints, and iterating to find a solution to the full problem. In this work\nwe implement and test a modification to the CTT/CTTK methods of solving the\nconstraints for the case of the most general four derivative, parity invariant\nscalar-tensor theory, and show that solutions can be found in both\nasymptotically flat/black hole and periodic/cosmological spacetimes, even up to\ncouplings of order unity in the theory. Such methods will allow for numerical\ninvestigations of a much broader class of initial data than has previously been\npossible in these theories, and should be straightforward to extend to similar\nmodels in the Horndeski class.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:08:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Brady","Sam E.",""],["Sal\u00f3","Llibert Arest\u00e9",""],["Clough","Katy",""],["Figueras","Pau",""],["S","Annamalai P.",""]]}
{"id":"2308.16792","submitter":"Ramiro Godoy-Diana","authors":"Tao Liu, Beno\\^it Semin, Ramiro Godoy-Diana, Jos\\'e Eduardo Wesfreid","title":"Lift-up and streak waviness drive the self-sustained process in\n  wall-bounded transition to turbulence","comments":"12 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":"  Flow field measurements from a Couette-Poiseuille experiment are used to\nexamine quantitatively certain steps of the self-sustained process (SSP) of\nwall-bounded transition to turbulence. Although the different parts of the SSP\nhave been discussed at large in the literature, direct measurements from\nexperiment are scarce and, to our knowledge, the present results are the first\nto show, using a local analysis of the turbulent patterns, that: (1) the\namplitude of streamwise rolls is related to streak waviness, bringing a\nquantitative picture to one of the main physical mechanisms of Waleffe's model\nof SSP ; and (2), at low waviness, direct measurements of the correlation\nbetween the streak and roll amplitudes, respectively probed by the streamwise\nand wall-normal velocity perturbations, quantify the lift-up effect.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:09:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Tao",""],["Semin","Beno\u00eet",""],["Godoy-Diana","Ramiro",""],["Wesfreid","Jos\u00e9 Eduardo",""]]}
{"id":"2308.16793","submitter":"Yushan Su","authors":"Chao Han, Yushan Su, Wei Wang, Jia-Lu Zhang","title":"Hybrid Renormalization for Quasi Distribution Amplitudes of A Light\n  Baryon","comments":"25 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop a hybrid scheme to renormalize quasi distribution amplitudes of a\nlight baryon on the lattice, which combines the self-renormalization and ratio\nscheme. By employing self-renormalization, the UV divergences and linear\ndivergence at large spatial separations in quasi distribution amplitudes are\nremoved without introducing extra nonperturbative effects, while making a ratio\nwith respect to the zero-momentum matrix element can properly remove the UV\ndivergences in small spatial separations. As a specific application,\ndistribution amplitudes of the $\\Lambda$ baryon made of $uds$ are investigated,\nand the requisite equal-time correlators, which define quasi distribution\namplitudes in coordinate space, are perturbatively calculated up to the\nnext-to-leading order in strong coupling constant $\\alpha_s$. These\nperturbative equal-time correlators are used to convert lattice QCD matrix\nelements to the continuum space during the renormalization process.\nSubsequently, quasi distribution amplitudes are matched onto lightcone\ndistribution amplitudes by integrating out hard modes and the corresponding\nhard kernels are derived up to next-to-leading order in $\\alpha_s$ including\nthe hybrid counterterms. These results are valuable in the lattice-based\ninvestigation of the lightcone distribution amplitudes of a light baryon from\nthe first principles of QCD.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:11:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Han","Chao",""],["Su","Yushan",""],["Wang","Wei",""],["Zhang","Jia-Lu",""]]}
{"id":"2308.16794","submitter":"Tobias K\\\"onig","authors":"Tobias K\\\"onig","title":"An exceptional property of the one-dimensional Bianchi-Egnell inequality","comments":"23 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, for $d \\geq 1$ and $s \\in (0,\\frac{d}{2})$, we study the\nBianchi-Egnell quotient \\[ \\mathcal Q(f) = \\inf_{f \\in \\dot{H}^s(\\mathbb R^d)\n\\setminus \\mathcal B} \\frac{\\|(-\\Delta)^{s/2} f\\|_{L^2(\\mathbb R^d)}^2 -\nS_{d,s} \\|f\\|_{L^{\\frac{2d}{d-2s}}(\\mathbb\nR^d)}^2}{\\text{dist}_{\\dot{H}^s(\\mathbb R^d)}(f, \\mathcal B)^2}, \\qquad f \\in\n\\dot{H}^s(\\mathbb R^d) \\setminus \\mathcal B, \\] where $S_{d,s}$ is the best\nSobolev constant and $\\mathcal B$ is the manifold of Sobolev optimizers. By a\nfine asymptotic analysis, we prove that when $d = 1$, there is a neighborhood\nof $\\mathcal B$ on which the quotient $\\mathcal Q(f)$ is larger than the lowest\nvalue attainable by sequences converging to $\\mathcal B$. This behavior is\nsurprising because it is contrary to the situation in dimension $d \\geq 2$\ndescribed recently in \\cite{Koenig}.\n  This leads us to conjecture that for $d = 1$, $\\mathcal Q(f)$ has no\nminimizer on $\\dot{H}^s(\\mathbb R^d) \\setminus \\mathcal B$, which again would\nbe contrary to the situation in $d \\geq 2$.\n  As a complement of the above, we study a family of test functions which\ninterpolates between one and two Talenti bubbles, for every $d \\geq 1$. For $d\n\\geq 2$, this family yields an alternative proof of the main result of\n\\cite{Koenig}. For $d =1$ we make some numerical observations which support the\nconjecture stated above.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:14:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["K\u00f6nig","Tobias",""]]}
{"id":"2308.16795","submitter":"John Mendonca","authors":"John Mendon\\c{c}a, Alon Lavie, Isabel Trancoso","title":"Towards Multilingual Automatic Dialogue Evaluation","comments":"SIGDIAL23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The main limiting factor in the development of robust multilingual dialogue\nevaluation metrics is the lack of multilingual data and the limited\navailability of open sourced multilingual dialogue systems. In this work, we\npropose a workaround for this lack of data by leveraging a strong multilingual\npretrained LLM and augmenting existing English dialogue data using Machine\nTranslation. We empirically show that the naive approach of finetuning a\npretrained multilingual encoder model with translated data is insufficient to\noutperform the strong baseline of finetuning a multilingual model with only\nsource data. Instead, the best approach consists in the careful curation of\ntranslated data using MT Quality Estimation metrics, excluding low quality\ntranslations that hinder its performance.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:15:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mendon\u00e7a","John",""],["Lavie","Alon",""],["Trancoso","Isabel",""]]}
{"id":"2308.16796","submitter":"Nicholas Vieira","authors":"Nicholas Vieira, John J. Ruan, Daryl Haggard, Nicole M. Ford, Maria R.\n  Drout, Rodrigo Fern\\'andez","title":"Spectroscopic r-Process Abundance Retrieval for Kilonovae II:\n  Lanthanides in the Inferred Abundance Patterns of Multi-Component Ejecta from\n  the GW170817 Kilonova","comments":"15 pages, 5 figures in body + 10 pages, 9 figures in appendix;\n  submitted to ApJ; comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In kilonovae, freshly-synthesized $r$-process elements imprint features on\noptical spectra, as observed in AT2017gfo, the counterpart to the GW170817\nbinary neutron star merger. However, measuring the $r$-process compositions of\nthe merger ejecta is computationally challenging. Vieira et al. (2023)\nintroduced Spectroscopic $r$-Process Abundance Retrieval for Kilonovae (SPARK),\na software tool to infer elemental abundance patterns of the ejecta, and\nassociate spectral features with particular species. Previously, we applied\nSPARK to the 1.4 day spectrum of AT2017gfo and inferred its abundance pattern\nfor the first time, characterized by electron fraction $Y_e=0.31$, a\nsubstantial abundance of strontium, and a dearth of lanthanides and heavier\nelements. This ejecta is consistent with wind from a remnant hypermassive\nneutron star and/or accretion disk. We now extend our inference to spectra at\n2.4 and 3.4 days, and test the need for multi-component ejecta, where we\nstratify the ejecta in composition. The ejecta at 1.4 and 2.4 days is described\nby the same single blue component. At 3.4 days, a new redder component with\nlower $Y_e=0.16$ and a significant abundance of lanthanides emerges. This new\nredder component is consistent with dynamical ejecta and/or neutron-rich ejecta\nfrom a magnetized accretion disk. As expected from photometric modelling, this\ncomponent emerges as the ejecta expands, the photosphere recedes, and the\nearlier bluer component dims. At 3.4 days, we find an ensemble of lanthanides,\nwith the presence of cerium most concrete. This presence of lanthanides has\nimportant implications for the contribution of kilonovae to the $r$-process\nabundances observed in the Universe.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:16:52 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vieira","Nicholas",""],["Ruan","John J.",""],["Haggard","Daryl",""],["Ford","Nicole M.",""],["Drout","Maria R.",""],["Fern\u00e1ndez","Rodrigo",""]]}
{"id":"2308.16797","submitter":"John Mendonca","authors":"John Mendon\\c{c}a, Patr\\'icia Pereira, Jo\\~ao Paulo Carvalho, Alon\n  Lavie, Isabel Trancoso","title":"Simple LLM Prompting is State-of-the-Art for Robust and Multilingual\n  Dialogue Evaluation","comments":"DSTC11 best paper for Track 4","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite significant research effort in the development of automatic dialogue\nevaluation metrics, little thought is given to evaluating dialogues other than\nin English. At the same time, ensuring metrics are invariant to semantically\nsimilar responses is also an overlooked topic. In order to achieve the desired\nproperties of robustness and multilinguality for dialogue evaluation metrics,\nwe propose a novel framework that takes advantage of the strengths of current\nevaluation models with the newly-established paradigm of prompting Large\nLanguage Models (LLMs). Empirical results show our framework achieves state of\nthe art results in terms of mean Spearman correlation scores across several\nbenchmarks and ranks first place on both the Robust and Multilingual tasks of\nthe DSTC11 Track 4 \"Automatic Evaluation Metrics for Open-Domain Dialogue\nSystems\", proving the evaluation capabilities of prompted LLMs.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:19:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mendon\u00e7a","John",""],["Pereira","Patr\u00edcia",""],["Carvalho","Jo\u00e3o Paulo",""],["Lavie","Alon",""],["Trancoso","Isabel",""]]}
{"id":"2308.16798","submitter":"Sheng Yang","authors":"Sheng Yang, Liangyu Wu, Zekai Zheng, Masahiro Ogihara, Kangrou Guo,\n  Wenzhan Ouyang, Yaxing He","title":"The stability of unevenly spaced planetary systems","comments":"6 pages, 3 figures, accepted for publication in Icarus","journal-ref":"Icarus, Volume 406, 2023, 115757","doi":"10.1016/j.icarus.2023.115757","report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Studying the orbital stability of multi-planet systems is essential to\nunderstand planet formation, estimate the stable time of an observed planetary\nsystem, and advance population synthesis models. Although previous studies have\nprimarily focused on ideal systems characterized by uniform orbital\nseparations, in reality a diverse range of orbital separations exists among\nplanets within the same system. This study focuses on investigating the\ndynamical stability of systems with non-uniform separation. We considered a\nsystem with 10 planets with masses of $10^{-7}$ solar masses around a central\nstar with a mass of $1$ solar mass. We performed more than 100,000 runs of\nN-body simulations with different parameters. Results demonstrate that reducing\nmerely one pair of planetary spacing leads to an order of magnitude shorter\norbital crossing times that could be formulated based on the Keplerian periods\nof the closest separation pair. Furthermore, the first collisions are found to\nbe closely associated with the first encounter pair that is likely to be the\nclosest separation pair initially. We conclude that when estimating the orbital\ncrossing time and colliding pairs in a realistic situation, updating the\nformula derived for evenly spaced systems would be necessary.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:20:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yang","Sheng",""],["Wu","Liangyu",""],["Zheng","Zekai",""],["Ogihara","Masahiro",""],["Guo","Kangrou",""],["Ouyang","Wenzhan",""],["He","Yaxing",""]]}
{"id":"2308.16799","submitter":"Vincent Blay","authors":"Vincent Blay, Felix Grases","title":"Research directions for kidney stone disease","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kidney stone disease poses a major burden to patients and healthcare systems\naround the world. The formation of kidney stones may occur over months or\nyears, but many patients are diagnosed at a late stage, suffer excruciating\npain, and require surgical intervention to physically remove the stones. The\nprevalence of kidney stones has increased during recent decades to over 10% in\nmany developed countries, suggesting a link with environmental and behavioral\nfactors. Recurrence rates are also high. In terms of their impact and scale,\nkidney stones are an ongoing pandemic. The causes and mechanisms of kidney\nstone formation are diverse and often unknown, resulting in varied compositions\nand different anatomical locations being affected. A better understanding of\nthese processes could enable earlier diagnoses through more sensitive and\nscalable biomarkers, as well as more effective preventives and therapeutics.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:21:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Blay","Vincent",""],["Grases","Felix",""]]}
{"id":"2308.16800","submitter":"Andreas Roth","authors":"Andreas Roth, Thomas Liebig","title":"Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural\n  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":"  Our study reveals new theoretical insights into over-smoothing and feature\nover-correlation in deep graph neural networks. We show the prevalence of\ninvariant subspaces, demonstrating a fixed relative behavior that is unaffected\nby feature transformations. Our work clarifies recent observations related to\nconvergence to a constant state and a potential over-separation of node states,\nas the amplification of subspaces only depends on the spectrum of the\naggregation function. In linear scenarios, this leads to node representations\nbeing dominated by a low-dimensional subspace with an asymptotic convergence\nrate independent of the feature transformations. This causes a rank collapse of\nthe node representations, resulting in over-smoothing when smooth vectors span\nthis subspace, and over-correlation even when over-smoothing is avoided. Guided\nby our theory, we propose a sum of Kronecker products as a beneficial property\nthat can provably prevent over-smoothing, over-correlation, and rank collapse.\nWe empirically extend our insights to the non-linear case, demonstrating the\ninability of existing models to capture linearly independent features.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:22:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Roth","Andreas",""],["Liebig","Thomas",""]]}
{"id":"2308.16801","submitter":"Mohsen Zand","authors":"Mohsen Zand, Ali Etemad, Michael Greenspan","title":"Multiscale Residual Learning of Graph Convolutional Sequence Chunks for\n  Human Motion Prediction","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A new method is proposed for human motion prediction by learning temporal and\nspatial dependencies. Recently, multiscale graphs have been developed to model\nthe human body at higher abstraction levels, resulting in more stable motion\nprediction. Current methods however predetermine scale levels and combine\nspatially proximal joints to generate coarser scales based on human priors,\neven though movement patterns in different motion sequences vary and do not\nfully comply with a fixed graph of spatially connected joints. Another problem\nwith graph convolutional methods is mode collapse, in which predicted poses\nconverge around a mean pose with no discernible movements, particularly in\nlong-term predictions. To tackle these issues, we propose ResChunk, an\nend-to-end network which explores dynamically correlated body components based\non the pairwise relationships between all joints in individual sequences.\nResChunk is trained to learn the residuals between target sequence chunks in an\nautoregressive manner to enforce the temporal connectivities between\nconsecutive chunks. It is hence a sequence-to-sequence prediction network which\nconsiders dynamic spatio-temporal features of sequences at multiple levels. Our\nexperiments on two challenging benchmark datasets, CMU Mocap and Human3.6M,\ndemonstrate that our proposed method is able to effectively model the sequence\ninformation for motion prediction and outperform other techniques to set a new\nstate-of-the-art. Our code is available at\nhttps://github.com/MohsenZand/ResChunk.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:23:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zand","Mohsen",""],["Etemad","Ali",""],["Greenspan","Michael",""]]}
{"id":"2308.16802","submitter":"Miquel Colom-Bernadich","authors":"M. Colom i Bernadich, V. Balakrishnan, E. Barr, M. Berezina, M.\n  Burgay, S. Buchner, D. J. Champion, G. Desvignes, P. C. C. Freire, K.\n  Grunthal, M. Kramer, Y. Men, P. V. Padmanabh, A. Parthasarathy, D. Pillay, I.\n  Rammala, S. Sengupta, and V. Venkatraman Krishnan","title":"The MPIfR-MeerKAT Galactic Plane Survey II. The eccentric double neutron\n  star system PSR J1208-5936 and a neutron star merger rate update","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The MMGPS-L is the most sensitive pulsar survey in the Southern Hemisphere.\nWe present a follow-up study of one of these new discoveries, PSR J1208-5936, a\n28.71-ms recycled pulsar in a double neutron star system with an orbital period\nof Pb=0.632 days and an eccentricity of e=0.348. Through timing of almost one\nyear of observations, we detected the relativistic advance of periastron\n(0.918(1) deg/yr), resulting in a total system mass of Mt=2.586(5) Mo. We also\nachieved low-significance constraints on the amplitude of the Einstein delay\nand Shapiro delay, in turn yielding constraints on the pulsar mass\n(Mp=1.26(+0.13/-0.25) Mo), the companion mass (Mc=1.32(+0.25/-0.13) Mo, and the\ninclination angle (i=57(2) degrees). This system is highly eccentric compared\nto other Galactic field double neutron stars with similar periods, possibly\nhinting at a larger-than-usual supernova kick during the formation of the\nsecond-born neutron star. The binary will merge within 7.2(2) Gyr due to the\nemission of gravitational waves. With the improved sensitivity of the MMGPS-L,\nwe updated the Milky Way neutron star merger rate to be 25(+19/-9) Myr$^{-1}$\nwithin 90% credible intervals, which is lower than previous studies based on\nknown Galactic binaries owing to the lack of further detections despite the\nhighly sensitive nature of the survey. This implies a local cosmic neutron star\nmerger rate of 293(+222/-103} Gpc/yr, consistent with LIGO and Virgo O3\nobservations. With this, we predict the observation of 10(+8/-4) neutron star\nmerger events during the LIGO-Virgo-KAGRA O4 run. We predict the uncertainties\non the component masses and the inclination angle will be reduced to\n5x10$^{-3}$ Mo and 0.4 degrees after two decades of timing, and that in at\nleast a decade from now the detection of the shift in Pb and the sky proper\nmotion will serve to make an independent constraint of the distance to the\nsystem.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:24:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bernadich","M. Colom i",""],["Balakrishnan","V.",""],["Barr","E.",""],["Berezina","M.",""],["Burgay","M.",""],["Buchner","S.",""],["Champion","D. J.",""],["Desvignes","G.",""],["Freire","P. C. C.",""],["Grunthal","K.",""],["Kramer","M.",""],["Men","Y.",""],["Padmanabh","P. V.",""],["Parthasarathy","A.",""],["Pillay","D.",""],["Rammala","I.",""],["Sengupta","S.",""],["Krishnan","V. Venkatraman",""]]}
{"id":"2308.16803","submitter":"Nicolas Vallis","authors":"Nicolas Vallis, Paolo Craievich, Mattia Sch\\\"ar, Riccardo Zennaro,\n  Bernard Auchmann, Hans-Heinrich Braun, Maria Ilaria Besana, Michal Duda, Reto\n  Fortunati, Henrique Garcia Rodrigues, Dominique Hauenstein, Rasmus Ischebeck\n  Rasmus, Pavle Jurani\\'c, Jaap Kosse, Fabio Marcellini, Thomas Uli Michlmayr,\n  Stefan M\\\"uller, Marco Pedrozzi, Renzo Rotundo, Gian Luca Orlandi, Mike\n  Seidel, Nick Parsifal Strohmaier and Mariia Zykova","title":"The P$^3$ Experiment: A Positron Source Demonstrator for Future Lepton\n  Colliders","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph hep-ex","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The PSI Positron Production (P$^3$ or P-cubed) experiment is a demonstrator\nfor a e+ source and capture system with potential to improve the\nstate-of-the-art e+ yield by an order of magnitude. The experiment is driven by\nthe FCC-ee injector study and will be hosted in the SwissFEL facility at the\nPaul Scherrer Institute in Switzerland. This paper is an overview of the P$^3$\ndesign at an advanced stage, with a particular emphasis on a novel e+ capture\nsystem and its associated beam dynamics. Additionally, a concept for the\nexperiment diagnostics is presented, as well as the key points of the ongoing\ninstallation works.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:25:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vallis","Nicolas",""],["Craievich","Paolo",""],["Sch\u00e4r","Mattia",""],["Zennaro","Riccardo",""],["Auchmann","Bernard",""],["Braun","Hans-Heinrich",""],["Besana","Maria Ilaria",""],["Duda","Michal",""],["Fortunati","Reto",""],["Rodrigues","Henrique Garcia",""],["Hauenstein","Dominique",""],["Rasmus","Rasmus Ischebeck",""],["Jurani\u0107","Pavle",""],["Kosse","Jaap",""],["Marcellini","Fabio",""],["Michlmayr","Thomas Uli",""],["M\u00fcller","Stefan",""],["Pedrozzi","Marco",""],["Rotundo","Renzo",""],["Orlandi","Gian Luca",""],["Seidel","Mike",""],["Strohmaier","Nick Parsifal",""],["Zykova","Mariia",""]]}
{"id":"2308.16804","submitter":"Xusheng Zhu","authors":"Xusheng Zhu, Wen Chen, Zhendong Li, Qingqing Wu, Ziheng Zhang, Kunlun\n  Wang, and Jun Li","title":"On the Performance of RIS-Aided Spatial Scattering Modulation for mmWave\n  Transmission","comments":"arXiv admin note: substantial text overlap with arXiv:2307.14662","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 a state-of-the-art reconfigurable intelligent\nsurface (RIS)-assisted spatial scattering modulation (SSM) scheme for\nmillimeter-wave (mmWave) systems, where a more practical scenario that the RIS\nis near the transmitter while the receiver is far from RIS is considered. To\nthis end, the line-of-sight (LoS) and non-LoS links are utilized in the\ntransmitter-RIS and RIS-receiver channels, respectively. By employing the\nmaximum likelihood detector at the receiver, the conditional pairwise error\nprobability (CPEP) expression for the RIS-SSM scheme is derived under the two\nscenarios that the received beam demodulation is correct or not. Furthermore,\nthe union upper bound of average bit error probability (ABEP) is obtained based\non the CPEP expression. Finally, the derivation results are exhaustively\nvalidated by the Monte Carlo simulations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:25:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhu","Xusheng",""],["Chen","Wen",""],["Li","Zhendong",""],["Wu","Qingqing",""],["Zhang","Ziheng",""],["Wang","Kunlun",""],["Li","Jun",""]]}
{"id":"2308.16805","submitter":"Indrani Bose","authors":"Indrani Bose","title":"Emergent phenomena in living systems: a statistical mechanical\n  perspective","comments":"29 pages, 4 figures","journal-ref":"Journal of Biosciences 47, 22 (2022)","doi":"10.1007/s12038-021-00247-2","report-no":null,"categories":"cond-mat.stat-mech physics.bio-ph q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A natural phenomenon occurring in a living system is an outcome of the\ndynamics of the specific biological network underlying the phenomenon. The\ncollective dynamics have both deterministic and stochastic components. The\nstochastic nature of the key processes like gene expression and cell\ndifferentiation give rise to fluctuations (noise) in the levels of the\nbiomolecules and this combined with nonlinear interactions give rise to a\nnumber of emergent phenomena. In this review, we describe and discuss some of\nthese phenomena which have the character of phase transitions in physical\nsystems. We specifically focus on noise-induced transitions in a stochastic\nmodel of gene expression and in a population genetics model which have no\nanalogs when the dynamics are solely deterministic in nature. Some of these\ntransitions exhibit critical-point phenomena belonging to the mean-field Ising\nuniversality class of equilibrium phase transitions. A number of other\nexamples, ranging from biofilms to homeostasis in adult tissues, are also\ndiscussed which exhibit behavior similar to critical phenomena in equilibrium\nand nonequilbrium phase transitions. The examples illustrate how the subject of\nstatistical mechanics provides a bridge between theoretical models and\nexperimental observations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:25:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bose","Indrani",""]]}
{"id":"2308.16806","submitter":"Tatiana Webb","authors":"Tatiana A. Webb, Afrin N. Tamanna, Xiaxin Ding, Jikai Xu, Lia\n  Krusin-Elbaum, Cory R. Dean, Dmitri N. Basov and Abhay N. Pasupathy","title":"Tunable magnetic domains in ferrimagnetic MnSb$_2$Te$_4$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Highly tunable properties make Mn(Bi,Sb)$_2$Te$_4$ a rich playground for\nexploring the interplay between band topology and magnetism: On one end,\nMnBi$_2$Te$_4$ is an antiferromagnetic topological insulator, while the\nmagnetic structure of MnSb$_2$Te$_4$ (MST) can be tuned between\nantiferromagnetic and ferrimagnetic. Motivated to control electronic properties\nthrough real-space magnetic textures, we use magnetic force microscopy (MFM) to\nimage the domains of ferrimagnetic MST. We find that magnetic field tunes\nbetween stripe and bubble domain morphologies, raising the possibility of\ntopological spin textures. Moreover, we combine in situ transport with domain\nmanipulation and imaging to both write MST device properties and directly\nmeasure the scaling of the Hall response with domain area. This work\ndemonstrates measurement of the local anomalous Hall response using MFM, and\nopens the door to reconfigurable domain-based devices in the M(B,S)T family.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:27:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Webb","Tatiana A.",""],["Tamanna","Afrin N.",""],["Ding","Xiaxin",""],["Xu","Jikai",""],["Krusin-Elbaum","Lia",""],["Dean","Cory R.",""],["Basov","Dmitri N.",""],["Pasupathy","Abhay N.",""]]}
{"id":"2308.16807","submitter":"Biswajit Sahoo","authors":"Hare Krishna and Biswajit Sahoo","title":"Universality of Loop Corrected Soft Theorems in 4d","comments":"56 pages + appendices","journal-ref":null,"doi":null,"report-no":"YITP-SB-2023-26","categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In \\cite{1808.03288}, logarithmic correction to subleading soft photon and\nsoft graviton theorems have been derived in four spacetime dimensions from the\nratio of IR-finite S-matrices. This has been achieved after factoring out\nIR-divergent components from the traditional electromagnetic and gravitational\nS-matrices using Grammer-Yennie prescription. Although the loop corrected\nsubleading soft theorems are derived from one-loop scattering amplitudes\ninvolving scalar particles in a minimally coupled theory with scalar contact\ninteraction, it has been conjectured that the soft factors are universal\n(theory independent) and one-loop exact (don't receive corrections from higher\nloops).\n  This paper extends the analysis conducted in \\cite{1808.03288} to encompass\ngeneral spinning particle scattering with non-minimal couplings permitted by\ngauge invariance and general coordinate invariance. By re-deriving the\n$\\ln\\omega$ soft factors in this generic setup, we establish their universal\nnature. Furthermore, we summarize the results of loop corrected soft photon and\ngraviton theorems up to sub-subleading order, which follows from the analysis\nof one and two loop QED and quantum gravity S-matrices. While the classical\nversions of these soft factors have already been derived in the literature, we\nput forth conjectures regarding the quantum soft factors and outline potential\nstrategies for their derivation.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:30:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Krishna","Hare",""],["Sahoo","Biswajit",""]]}
{"id":"2308.16808","submitter":"Songling Shan","authors":"Songling Shan","title":"Towards the Overfull Conjecture","comments":"arXiv admin note: text overlap with arXiv:2205.08564,\n  arXiv:2105.05286","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 simple graph with maximum degree denoted as $\\Delta(G)$. An\noverfull subgraph $H$ of $G$ is a subgraph satisfying the condition $|E(H)| >\n\\Delta(G)\\lfloor \\frac{1}{2}|V(H)| \\rfloor$. In 1986, Chetwynd and Hilton\nproposed the Overfull Conjecture, stating that a graph $G$ with maximum degree\n$\\Delta(G)> \\frac{1}{3}|V(G)|$ has chromatic index equal to $\\Delta(G)$ if and\nonly if it does not contain any overfull subgraph. The Overfull Conjecture has\nmany implications. For example, it implies a polynomial-time algorithm for\ndetermining the chromatic index of graphs $G$ with $\\Delta(G) >\n\\frac{1}{3}|V(G)|$, and implies several longstanding conjectures in the area of\ngraph edge colorings. In this paper, we make the first improvement towards the\nconjecture when not imposing a minimum degree condition on the graph: for any\n$0<\\varepsilon \\le \\frac{1}{22}$, there exists a positive integer $n_0$ such\nthat if $G$ is a graph on $n\\ge n_0$ vertices with $\\Delta(G) \\ge\n(1-\\varepsilon)n$, then the Overfull Conjecture holds for $G$. The previous\nbest result in this direction, due to Chetwynd and Hilton from 1989, asserts\nthe conjecture for graphs $G$ with $\\Delta(G) \\ge |V(G)|-3$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:33:13 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shan","Songling",""]]}
{"id":"2308.16809","submitter":"Gabriel Conant","authors":"G. Conant, C. Terry","title":"Pseudofinite proofs of the stable graph regularity lemma","comments":"15 pages, submitted as a chapter in a forthcoming title of the Fields\n  Institute Monographs book series","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This expository article is based on two lectures given by the first author at\nthe Fields Institute in the Fall 2021 Thematic Program on Trends in Pure and\nApplied Model Theory.\n  We give a detailed proof of a qualitative version of the Mallaris-Shelah\nregularity lemma for stable graphs using only basic local stability theory and\nan ultraproduct construction. This proof strategy was first established by\nMalliaris and Pillay, and later simplified by Pillay. We provide some further\nsimplifications, and also explain how the pseudofinite approach can be used to\nobtain a qualitative strengthening (compared to previous proofs) in terms of\n\"functional error\". To illustrate the extra leverage obtained by functional\nerror, we give an elementary argument for extracting equipartitions from\narbitrary partitions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:34:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Conant","G.",""],["Terry","C.",""]]}
{"id":"2308.16810","submitter":"Keisuke Okamura","authors":"Keisuke Okamura","title":"Atlas of Science Collaboration, 1971-2020","comments":"6+121 pages, many figures, 49 MB","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL cs.CY cs.SI physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The evolving landscape of interinstitutional collaborative research across 15\nnatural science disciplines is explored using the open data sourced from\nOpenAlex. This extensive exploration spans the years from 1971 to 2020,\nfacilitating a thorough investigation of leading scientific output producers\nand their collaborative relationships based on coauthorships. The findings are\nvisually presented on world maps and other diagrams, offering a clear and\ninsightful portrayal of notable variations in both national and international\ncollaboration patterns across various fields and time periods. These visual\nrepresentations serve as valuable resources for science policymakers, diplomats\nand institutional researchers, providing them with a comprehensive overview of\nglobal collaboration and aiding their intuitive grasp of the evolving nature of\nthese partnerships over time.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:11:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Okamura","Keisuke",""]]}
{"id":"2308.16811","submitter":"Aaron Baumgarten","authors":"Aaron S. Baumgarten, Justin Moreno, Brett Kuwik, Sohanjit Ghosh, Ryan\n  Hurley, K.T. Ramesh","title":"A predictive model for fluid-saturated, brittle granular materials\n  during high-velocity impact events","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Granular materials -- aggregates of many discrete, disconnected solid\nparticles -- are ubiquitous in natural and industrial settings. Predictive\nmodels for their behavior have wide ranging applications, e.g. in defense,\nmining, construction, pharmaceuticals, and the exploration of planetary\nsurfaces. In many of these applications, granular materials mix and interact\nwith liquids and gases, changing their effective behavior in non-intuitive\nways. Although such materials have been studied for more than a century, a\nunified description of their behaviors remains elusive.\n  In this work, we develop a model for granular materials and mixtures that is\nusable under particularly challenging conditions: high-velocity impact events.\nThis model combines descriptions for the many deformation mechanisms that are\nactivated during impact -- particle fracture and breakage; pore collapse and\ndilation; shock loading; and pore fluid coupling -- within a thermo-mechanical\nframework based on poromechanics and mixture theory. This approach allows for\nsimultaneous modeling of the granular material and the pore fluid, and includes\nboth their independent motions and their complex interactions. A general form\nof the model is presented alongside its specific application to two types of\nsands that have been studied in the literature. The model predictions are shown\nto closely match experimental observation of these materials through several\nGPa stresses, and simulations are shown to capture the different dynamic\nresponses of dry and fully-saturated sand to projectile impacts at 1.3 km/s.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:40:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Baumgarten","Aaron S.",""],["Moreno","Justin",""],["Kuwik","Brett",""],["Ghosh","Sohanjit",""],["Hurley","Ryan",""],["Ramesh","K. T.",""]]}
{"id":"2308.16812","submitter":"Benjamin Landon","authors":"Benjamin Landon, Philippe Sosoe","title":"Tail estimates for the stationary stochastic six vertex model and ASEP","comments":"49 pages, 7 figures. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work studies the tail exponents for the height function of the\nstationary stochastic six vertex model in the moderate deviations regime. For\nthe upper tail of the height function we find upper and lower bounds of\nmatching order, with a tail exponent of $\\frac{3}{2}$, characteristic of KPZ\ndistributions. We also obtain an upper bound for the lower tail of the same\norder.\n  Our results for the stochastic six vertex model hold under a restriction on\nthe model parameters for which a certain ``microscopic concavity'' condition\nholds. Nevertheless, our estimates are sufficiently strong to pass through the\ndegeneration of the stochastic six vertex model to the ASEP. We therefore\nobtain tail estimates for both the current as well as the location of a second\nclass particle in the ASEP with stationary (Bernoulli) initial data. Our\nestimates complement the variance bounds obtained in the seminal work of\nBal\\'azs and Sepp\\\"al\\\"ainen.}\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:40:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Landon","Benjamin",""],["Sosoe","Philippe",""]]}
{"id":"2308.16813","submitter":"Tim Scargill","authors":"Tim Scargill and Ying Chen and Tianyi Hu and Maria Gorlatova","title":"SiTAR: Situated Trajectory Analysis for In-the-Wild Pose Error\n  Estimation","comments":"To appear in Proceedings of IEEE ISMAR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Virtual content instability caused by device pose tracking error remains a\nprevalent issue in markerless augmented reality (AR), especially on smartphones\nand tablets. However, when examining environments which will host AR\nexperiences, it is challenging to determine where those instability artifacts\nwill occur; we rarely have access to ground truth pose to measure pose error,\nand even if pose error is available, traditional visualizations do not connect\nthat data with the real environment, limiting their usefulness. To address\nthese issues we present SiTAR (Situated Trajectory Analysis for Augmented\nReality), the first situated trajectory analysis system for AR that\nincorporates estimates of pose tracking error. We start by developing the first\nuncertainty-based pose error estimation method for visual-inertial simultaneous\nlocalization and mapping (VI-SLAM), which allows us to obtain pose error\nestimates without ground truth; we achieve an average accuracy of up to 96.1%\nand an average F1 score of up to 0.77 in our evaluations on four VI-SLAM\ndatasets. Next we present our SiTAR system, implemented for ARCore devices,\ncombining a backend that supplies uncertainty-based pose error estimates with a\nfrontend that generates situated trajectory visualizations. Finally, we\nevaluate the efficacy of SiTAR in realistic conditions by testing three\nvisualization techniques in an in-the-wild study with 15 users and 13 diverse\nenvironments; this study reveals the impact both environment scale and the\nproperties of surfaces present can have on user experience and task\nperformance.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:41:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Scargill","Tim",""],["Chen","Ying",""],["Hu","Tianyi",""],["Gorlatova","Maria",""]]}
{"id":"2308.16814","submitter":"Rahman Khorramfar","authors":"Rahman Khorramfar, Morgan Santoni-Colvin, Saurabh Amin, Leslie K.\n  Norford, Audun Botterud, Dharik Mallapragada","title":"Cost-effective Planning of Decarbonized Power-Gas Infrastructure to Meet\n  the Challenges of Heating Electrification","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":"  Building heat electrification is central to economy-wide decarbonization\nefforts and directly affects energy infrastructure planning through increasing\nelectricity demand and reduces the use of gas infrastructure that also serves\nthe power sector. However, the simultaneous effects on both the power and gas\nsystems have yet to be rigorously evaluated. Offering two key contributions, we\ndevelop a modeling framework to project end-use demand for electricity and gas\nin the buildings sector under various electrification pathways and evaluate\ntheir impact on co-optimized bulk power-gas infrastructure investments and\noperations under deep decarbonization scenarios. Applying the framework to\nstudy the U.S. New England region in 2050 across 20 weather scenarios, we find\nhigh electrification of the residential sector can increase sectoral peak and\ntotal electricity demands by up to 62-160% and 47-65% respectively relative to\nbusiness-as-usual trajectories. Employing demand-side measures like building\nenvelope improvements under high electrification, however, can reduce the\nmagnitude and weather sensitivity of peak load as well as reduce combined power\nand gas demand by 29-31% relative to the present day. Notably, a combination of\nhigh electrification and envelope improvements yields the lowest bulk power-gas\nsystem cost outcomes. We also find that inter-annual weather-driven variations\nin demand result in up to 20% variation in optimal power sector investments,\nwhich highlights the importance of capturing weather sensitivity for planning\npurposes.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:42:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Khorramfar","Rahman",""],["Santoni-Colvin","Morgan",""],["Amin","Saurabh",""],["Norford","Leslie K.",""],["Botterud","Audun",""],["Mallapragada","Dharik",""]]}
{"id":"2308.16815","submitter":"Kouichi Taira","authors":"Kouichi Taira and Hiroyoshi Tamori","title":"Strichartz estimates for the $(k,a)$-generalized Laguerre operators","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we prove Strichartz estimates for the $(k,a)$-generalized\nLaguerre operators $a^{-1}(-|x|^{2-a}\\Delta_k+|x|^a)$ which were introduced by\nBen Sa\\\"{\\i}d-Kobayashi-{\\0}rsted, and for the operators $|x|^{2-a}\\Delta_k$.\nHere $k$ denotes a non-negative multiplicity function for the Dunkl Laplacian\n$\\Delta_k$ and $a$ denotes a positive real number satisfying certain\nconditions. The cases $a=1,2$ were studied previously. We consider more general\ncases here. The proof depends on symbol-type estimates of special functions and\na discrete analog of the stationary phase theorem inspired by the work of\nIonescu-Jerison.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:44:22 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Taira","Kouichi",""],["Tamori","Hiroyoshi",""]]}
{"id":"2308.16816","submitter":"Jeevan Jankar","authors":"Jeevan Jankar (1), Jie Yang (2) and Abhyuday Mandal (1) ((1)\n  Department of Statistics, University of Georgia, Athens, 30602, GA, (2)\n  Department of Mathematics, Statistics, and Computer Science, University of\n  Illinois at Chicago, Chicago, 60607, IL.)","title":"A General Equivalence Theorem for Crossover Designs under Generalized\n  Linear Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the help of Generalized Estimating Equations, we identify locally\nD-optimal crossover designs for generalized linear models. We adopt the\nvariance of parameters of interest as the objective function, which is\nminimized using constrained optimization to obtain optimal crossover designs.\nIn this case, the traditional general equivalence theorem could not be used\ndirectly to check the optimality of obtained designs. In this manuscript, we\nderive a corresponding general equivalence theorem for crossover designs under\ngeneralized linear models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:46:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jankar","Jeevan",""],["Yang","Jie",""],["Mandal","Abhyuday",""]]}
{"id":"2308.16817","submitter":"Nicolas Raymond","authors":"Rayan Fahs, Lo\\\"ic Le Treust, Nicolas Raymond, San Vu Ngoc","title":"Boundary states of the Robin magnetic Laplacian","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article tackles the spectral analysis of the Robin Laplacian on a smooth\nbounded two-dimensional domain in the presence of a constant magnetic field. In\nthe semiclassical limit, a uniform description of the spectrum located between\nthe Landau levels is obtained. The corresponding eigenfunctions, called edge\nstates, are exponentially localized near the boundary. By means of a microlocal\ndimensional reduction, our unifying approach allows on the one hand to derive a\nvery precise Weyl law and a proof of quantum magnetic oscillations for excited\nstates, and on the other hand to refine simultaneously old results about the\nlow-lying eigenvalues in the Robin case and recent ones about edge states in\nthe Dirichlet case.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:49:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fahs","Rayan",""],["Treust","Lo\u00efc Le",""],["Raymond","Nicolas",""],["Ngoc","San Vu",""]]}
{"id":"2308.16818","submitter":"Weijia Zhang","authors":"Weijia Zhang, Le Zhang, Jindong Han, Hao Liu, Jingbo Zhou, Yu Mei, Hui\n  Xiong","title":"Irregular Traffic Time Series Forecasting Based on Asynchronous\n  Spatio-Temporal Graph Convolutional Network","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":"  Accurate traffic forecasting at intersections governed by intelligent traffic\nsignals is critical for the advancement of an effective intelligent traffic\nsignal control system. However, due to the irregular traffic time series\nproduced by intelligent intersections, the traffic forecasting task becomes\nmuch more intractable and imposes three major new challenges: 1) asynchronous\nspatial dependency, 2) irregular temporal dependency among traffic data, and 3)\nvariable-length sequence to be predicted, which severely impede the performance\nof current traffic forecasting methods. To this end, we propose an Asynchronous\nSpatio-tEmporal graph convolutional nEtwoRk (ASeer) to predict the traffic\nstates of the lanes entering intelligent intersections in a future time window.\nSpecifically, by linking lanes via a traffic diffusion graph, we first propose\nan Asynchronous Graph Diffusion Network to model the asynchronous spatial\ndependency between the time-misaligned traffic state measurements of lanes.\nAfter that, to capture the temporal dependency within irregular traffic state\nsequence, a learnable personalized time encoding is devised to embed the\ncontinuous time for each lane. Then we propose a Transformable Time-aware\nConvolution Network that learns meta-filters to derive time-aware convolution\nfilters with transformable filter sizes for efficient temporal convolution on\nthe irregular sequence. Furthermore, a Semi-Autoregressive Prediction Network\nconsisting of a state evolution unit and a semiautoregressive predictor is\ndesigned to effectively and efficiently predict variable-length traffic state\nsequences. Extensive experiments on two real-world datasets demonstrate the\neffectiveness of ASeer in six metrics.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:49:21 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Weijia",""],["Zhang","Le",""],["Han","Jindong",""],["Liu","Hao",""],["Zhou","Jingbo",""],["Mei","Yu",""],["Xiong","Hui",""]]}
{"id":"2308.16819","submitter":"Johannes Wolf K\\\"unzel","authors":"Johannes K\\\"unzel, Anna Hilsmann, Peter Eisert","title":"BTSeg: Barlow Twins Regularization for Domain Adaptation in Semantic\n  Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Semantic image segmentation is a critical component in many computer vision\nsystems, such as autonomous driving. In such applications, adverse conditions\n(heavy rain, night time, snow, extreme lighting) on the one hand pose specific\nchallenges, yet are typically underrepresented in the available datasets.\nGenerating more training data is cumbersome and expensive, and the process\nitself is error-prone due to the inherent aleatoric uncertainty. To address\nthis challenging problem, we propose BTSeg, which exploits image-level\ncorrespondences as weak supervision signal to learn a segmentation model that\nis agnostic to adverse conditions. To this end, our approach uses the Barlow\ntwins loss from the field of unsupervised learning and treats images taken at\nthe same location but under different adverse conditions as \"augmentations\" of\nthe same unknown underlying base image. This allows the training of a\nsegmentation model that is robust to appearance changes introduced by different\nadverse conditions. We evaluate our approach on ACDC and the new challenging\nACG benchmark to demonstrate its robustness and generalization capabilities.\nOur approach performs favorably when compared to the current state-of-the-art\nmethods, while also being simpler to implement and train. The code will be\nreleased upon acceptance.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:49:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["K\u00fcnzel","Johannes",""],["Hilsmann","Anna",""],["Eisert","Peter",""]]}
{"id":"2308.16820","submitter":"Seunghun Jeon","authors":"Seunghun Jeon, Moonkyu Jung, Suyoung Choi, Beomjoon Kim, Jemin Hwangbo","title":"Learning Whole-body Manipulation for Quadrupedal Robot","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We propose a learning-based system for enabling quadrupedal robots to\nmanipulate large, heavy objects using their whole body. Our system is based on\na hierarchical control strategy that uses the deep latent variable embedding\nwhich captures manipulation-relevant information from interactions,\nproprioception, and action history, allowing the robot to implicitly understand\nobject properties. We evaluate our framework in both simulation and real-world\nscenarios. In the simulation, it achieves a success rate of 93.6 % in\naccurately re-positioning and re-orienting various objects within a tolerance\nof 0.03 m and 5 {\\deg}. Real-world experiments demonstrate the successful\nmanipulation of objects such as a 19.2 kg water-filled drum and a 15.3 kg\nplastic box filled with heavy objects while the robot weighs 27 kg. Unlike\nprevious works that focus on manipulating small and light objects using\nprehensile manipulation, our framework illustrates the possibility of using\nquadrupeds for manipulating large and heavy objects that are ungraspable with\nthe robot's entire body. Our method does not require explicit object modeling\nand offers significant computational efficiency compared to optimization-based\nmethods. The video can be found at $\\href{https://youtu.be/fO_PVr27QxU}{this \\\nhttp \\ URL}$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:50:22 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jeon","Seunghun",""],["Jung","Moonkyu",""],["Choi","Suyoung",""],["Kim","Beomjoon",""],["Hwangbo","Jemin",""]]}
{"id":"2308.16821","submitter":"Heliudson Bernardo","authors":"Heliudson Bernardo, Fangyi Guo","title":"Brane motion in a compact space: adiabatic perturbations of brane-bulk\n  coupled fluids","comments":"15 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th astro-ph.CO gr-qc","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  When a brane is moving in a compact space, bulk-probing signals originating\nat the brane can arrive back at the brane outside the lightcone of the emitting\nevent. In this letter, we study how adiabatic perturbations in the brane fluid,\ncoupled to a bulk fluid, propagate in the moving brane. In the non-dissipative\nregime, we find an effective sound speed for such perturbations, depending on\nthe brane and bulk fluid energy densities, equations of state, and brane speed.\nIn the tight-coupling approximation, the effective sound speed might be\nsuperluminal for brane and bulk fluids that satisfy the strong energy\ncondition. This has immediate consequences for brane-world cosmology models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:51:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bernardo","Heliudson",""],["Guo","Fangyi",""]]}
{"id":"2308.16822","submitter":"Arthur Leroy","authors":"Chunchao Ma, Arthur Leroy, Mauricio Alvarez","title":"Latent Variable Multi-output Gaussian Processes for Hierarchical\n  Datasets","comments":"29 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Multi-output Gaussian processes (MOGPs) have been introduced to deal with\nmultiple tasks by exploiting the correlations between different outputs.\nGenerally, MOGPs models assume a flat correlation structure between the\noutputs. However, such a formulation does not account for more elaborate\nrelationships, for instance, if several replicates were observed for each\noutput (which is a typical setting in biological experiments). This paper\nproposes an extension of MOGPs for hierarchical datasets (i.e. datasets for\nwhich the relationships between observations can be represented within a tree\nstructure). Our model defines a tailored kernel function accounting for\nhierarchical structures in the data to capture different levels of correlations\nwhile leveraging the introduction of latent variables to express the underlying\ndependencies between outputs through a dedicated kernel. This latter feature is\nexpected to significantly improve scalability as the number of tasks increases.\nAn extensive experimental study involving both synthetic and real-world data\nfrom genomics and motion capture is proposed to support our claims.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:52:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ma","Chunchao",""],["Leroy","Arthur",""],["Alvarez","Mauricio",""]]}
{"id":"2308.16823","submitter":"Luca Carai","authors":"Marco Abbadini, Guram Bezhanishvili, Luca Carai","title":"Vietoris endofunctor for closed relations and its de Vries dual","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize the classic Vietoris endofunctor to the category of compact\nHausdorff spaces and closed relations. The lift of a closed relation is done by\ngeneralizing the construction of the Egli-Milner order. We describe the dual\nendofunctor on the category of de Vries algebras and subordinations. This is\ndone in several steps, by first generalizing the construction of Venema and\nVosmaer to the category of boolean algebras and subordinations, then lifting it\nup to $\\mathsf{S5}$-subordination algebras, and finally using MacNeille\ncompletions to further lift it to de Vries algebras. Among other things, this\nyields a generalization of Johnstone's pointfree construction of the Vietoris\nendofunctor to the category of compact regular frames and preframe\nhomomorphisms.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:53:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Abbadini","Marco",""],["Bezhanishvili","Guram",""],["Carai","Luca",""]]}
{"id":"2308.16824","submitter":"Daoguang Zan","authors":"Daoguang Zan, Ailun Yu, Bo Shen, Jiaxin Zhang, Taihong Chen, Bing\n  Geng, Bei Chen, Jichuan Ji, Yafen Yao, Yongji Wang, Qianxiang Wang","title":"Can Programming Languages Boost Each Other via Instruction Tuning?","comments":"Work in progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.PL cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When human programmers have mastered a programming language, it would be\neasier when they learn a new programming language. In this report, we focus on\nexploring whether programming languages can boost each other during the\ninstruction fine-tuning phase of code large language models. We conduct\nextensive experiments of 8 popular programming languages (Python, JavaScript,\nTypeScript, C, C++, Java, Go, HTML) on StarCoder. Results demonstrate that\nprogramming languages can significantly improve each other. For example,\nCodeM-Python 15B trained on Python is able to increase Java by an absolute\n17.95% pass@1 on HumanEval-X. More surprisingly, we found that CodeM-HTML 7B\ntrained on the HTML corpus can improve Java by an absolute 15.24% pass@1. Our\ntraining data is released at https://github.com/NL2Code/CodeM.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:53:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zan","Daoguang",""],["Yu","Ailun",""],["Shen","Bo",""],["Zhang","Jiaxin",""],["Chen","Taihong",""],["Geng","Bing",""],["Chen","Bei",""],["Ji","Jichuan",""],["Yao","Yafen",""],["Wang","Yongji",""],["Wang","Qianxiang",""]]}
{"id":"2308.16825","submitter":"Jianxiong Gao","authors":"Jianxiong Gao, Xuelin Qian, Yikai Wang, Tianjun Xiao, Tong He, Zheng\n  Zhang and Yanwei Fu","title":"Coarse-to-Fine Amodal Segmentation with Shape Prior","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":"  Amodal object segmentation is a challenging task that involves segmenting\nboth visible and occluded parts of an object. In this paper, we propose a novel\napproach, called Coarse-to-Fine Segmentation (C2F-Seg), that addresses this\nproblem by progressively modeling the amodal segmentation. C2F-Seg initially\nreduces the learning space from the pixel-level image space to the\nvector-quantized latent space. This enables us to better handle long-range\ndependencies and learn a coarse-grained amodal segment from visual features and\nvisible segments. However, this latent space lacks detailed information about\nthe object, which makes it difficult to provide a precise segmentation\ndirectly. To address this issue, we propose a convolution refine module to\ninject fine-grained information and provide a more precise amodal object\nsegmentation based on visual features and coarse-predicted segmentation. To\nhelp the studies of amodal object segmentation, we create a synthetic amodal\ndataset, named as MOViD-Amodal (MOViD-A), which can be used for both image and\nvideo amodal object segmentation. We extensively evaluate our model on two\nbenchmark datasets: KINS and COCO-A. Our empirical results demonstrate the\nsuperiority of C2F-Seg. Moreover, we exhibit the potential of our approach for\nvideo amodal object segmentation tasks on FISHBOWL and our proposed MOViD-A.\nProject page at: http://jianxgao.github.io/C2F-Seg.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:56:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gao","Jianxiong",""],["Qian","Xuelin",""],["Wang","Yikai",""],["Xiao","Tianjun",""],["He","Tong",""],["Zhang","Zheng",""],["Fu","Yanwei",""]]}
{"id":"2308.16826","submitter":"Kathryn Lester","authors":"Kathryn Lester, Steve Howell, Rachel Matson, Elise Furlan, Crystal\n  Gnilka, Colin Littlefield, David Ciardi, Mark Everett, Sergio Fajardo-Acosta,\n  and Catherine Clark","title":"Visual Orbits & Alignments of Planet Hosting Binary Systems","comments":"Accepted for publication in AJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Roughly half of Solar-type planet hosts have stellar companions, so\nunderstanding how these binary companions affect the formation and evolution of\nplanets is an important component to understanding planetary systems overall.\nMeasuring the dynamical properties of planet host binaries enables a valuable\ntest of planet formation in multi-star systems and requires knowledge of the\nbinary orbital parameters. Using high resolution imaging, we have measured the\nrelative astrometry and visual orbits of 13 binary systems where one of the\nstars is known to host a transiting exoplanet. Our results indicate that the\nmutual inclination between the orbits of the binary hosts and the transiting\nplanets are well aligned. Our results for close binary systems (a<100 AU)\ncomplement past work for wide planet host binaries from Gaia.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:56:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lester","Kathryn",""],["Howell","Steve",""],["Matson","Rachel",""],["Furlan","Elise",""],["Gnilka","Crystal",""],["Littlefield","Colin",""],["Ciardi","David",""],["Everett","Mark",""],["Fajardo-Acosta","Sergio",""],["Clark","Catherine",""]]}
{"id":"2308.16827","submitter":"Ali Hadizadeh Moghadam","authors":"Ali Hadizadeh Moghadam, Payman Kazemikhah, Hossein Aghababa","title":"Using 1-Factorization from Graph Theory for Quantum Speedups on Clique\n  Problems","comments":"14 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The clique problems, including $k$-CLIQUE and Triangle Finding, form an\nimportant class of computational problems; the former is an NP-complete\nproblem, while the latter directly gives lower bounds for Matrix\nMultiplication. A number of previous efforts have approached these problems\nwith Quantum Computing methods, such as Amplitude Amplification. In this paper,\nwe provide new Quantum oracle designs based on the 1-factorization of complete\ngraphs, all of which have depth $O(n)$ instead of the $O(n^2)$ presented in\nprevious studies. Also, we discuss the usage of one of these oracles in\nbringing the Triangle Finding time complexity down to $O(n^{2.25} poly(log\nn))$, compared to the $O(n^{2.38})$ classical record. Finally, we benchmark the\nnumber of required Amplitude Amplification iterations for another presented\noracle, for solving $k$-CLIQUE.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 15:59:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Moghadam","Ali Hadizadeh",""],["Kazemikhah","Payman",""],["Aghababa","Hossein",""]]}
{"id":"2308.16828","submitter":"Rishabh Datta","authors":"Rishabh Datta, Faez Ahmed, Jack D Hare","title":"Machine learning assisted analysis of visible spectroscopy in\n  pulsed-power-driven plasmas","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use machine learning models to predict ion density and electron\ntemperature from visible emission spectra, in a high energy density\npulsed-power-driven aluminum plasma, generated by an exploding wire array.\nRadiation transport simulations, which use spectral emissivity and opacity\nvalues generated using the collisional-radiative code PrismSPECT, are used to\ndetermine the spectral intensity generated by the plasma along the\nspectrometer's line of sight. The spectra exhibit Al-II and Al-III lines, whose\nline ratios and line widths vary with the density and temperature of the\nplasma. These calculations provide a 2500-size synthetic dataset of\n400-dimensional intensity spectra, which is used to train and compare the\nperformance of multiple machine learning models on a 3-variable regression\ntask. The AutoGluon model performs best, with an R2-score of roughly 98% for\ndensity and temperature predictions. Simpler models (random forest, k-nearest\nneighbor, and deep neural network) also exhibit high R2-scores (>90%) for\ndensity and temperature predictions. These results demonstrate the potential of\nmachine learning in providing rapid or real-time analysis of emission\nspectroscopy data in pulsed-power-driven plasmas.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:02:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Datta","Rishabh",""],["Ahmed","Faez",""],["Hare","Jack D",""]]}
{"id":"2308.16829","submitter":"Annalisa Cardellini","authors":"Martina Crippa, Annalisa Cardellini, Matteo Cioni, G\\'abor Cs\\'anyi,\n  and Giovanni M. Pavan","title":"Machine learning of microscopic structure-dynamics relationships in\n  complex molecular systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In many complex molecular systems, the macroscopic ensemble's properties are\ncontrolled by microscopic dynamic events (or fluctuations) that are often\ndifficult to detect via pattern-recognition approaches. Discovering the\nrelationships between local structural environments and the dynamical events\noriginating from them would allow unveiling microscopic level\nstructure-dynamics relationships fundamental to understand the macroscopic\nbehavior of complex systems. Here we show that, by coupling advanced structural\n(e.g., Smooth Overlap of Atomic Positions, SOAP) with local dynamical\ndescriptors (e.g., Local Environment and Neighbor Shuffling, LENS) in a unique\ndataset, it is possible to improve both individual SOAP- and LENS-based\nanalyses, obtaining a more complete characterization of the system under study.\nAs representative examples, we use various molecular systems with diverse\ninternal structural dynamics. On the one hand, we demonstrate how the\ncombination of structural and dynamical descriptors facilitates decoupling\nrelevant dynamical fluctuations from noise, overcoming the intrinsic limits of\nthe individual analyses. Furthermore, machine learning approaches also allow\nextracting from such combined structural/dynamical dataset useful\nmicroscopic-level relationships, relating key local dynamical events (e.g.,\nLENS fluctuations) occurring in the systems to the local structural (SOAP)\nenvironments they originate from. Given its abstract nature, we believe that\nsuch an approach will be useful in revealing hidden microscopic\nstructure-dynamics relationships fundamental to rationalize the behavior of a\nvariety of complex systems, not necessarily limited to the atomistic and\nmolecular scales.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:02:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Crippa","Martina",""],["Cardellini","Annalisa",""],["Cioni","Matteo",""],["Cs\u00e1nyi","G\u00e1bor",""],["Pavan","Giovanni M.",""]]}
{"id":"2308.16830","submitter":"Mingao Yuan","authors":"Mingao Yuan","title":"On the Randi\\'{c} index and its variants of network data","comments":"to appear","journal-ref":"TEST 2023","doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Summary statistics play an important role in network data analysis. They can\nprovide us with meaningful insight into the structure of a network. The\nRandi\\'{c} index is one of the most popular network statistics that has been\nwidely used for quantifying information of biological networks, chemical\nnetworks, pharmacologic networks, etc. A topic of current interest is to find\nbounds or limits of the Randi\\'{c} index and its variants. A number of bounds\nof the indices are available in literature. Recently, there are several\nattempts to study the limits of the indices in the Erd\\H{o}s-R\\'{e}nyi random\ngraph by simulation. In this paper, we shall derive the limits of the\nRandi\\'{c} index and its variants of an inhomogeneous Erd\\H{o}s-R\\'{e}nyi\nrandom graph. Our results charaterize how network heterogeneity affects the\nindices and provide new insights about the Randi\\'{c} index and its variants.\nFinally we apply the indices to several real-world networks.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:03:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yuan","Mingao",""]]}
{"id":"2308.16831","submitter":"Steven Redford","authors":"Steven A. Redford, Jonathan Colen, Jordan L. Shivers, Sasha Zemsky,\n  Mehdi Molaei, Carlos Floyd, Paul V. Ruijgrok, Vincenzo Vitelli, Zev Bryant,\n  Aaron R. Dinner, and Margaret L. Gardel","title":"Motor crosslinking augments elasticity in active nematics","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":"  In active materials, uncoordinated internal stresses lead to emergent\nlong-range flows. An understanding of how the behavior of active materials\ndepends on mesoscopic (hydrodynamic) parameters is developing, but there\nremains a gap in knowledge concerning how hydrodynamic parameters depend on the\nproperties of microscopic elements. In this work, we combine experiments and\nmultiscale modeling to relate the structure and dynamics of active nematics\ncomposed of biopolymer filaments and molecular motors to their microscopic\nproperties, in particular motor processivity, speed, and valency. We show that\ncrosslinking of filaments by both motors and passive crosslinkers not only\naugments the contributions to nematic elasticity from excluded volume effects\nbut dominates them. By altering motor kinetics we show that a competition\nbetween motor speed and crosslinking results in a nonmonotonic dependence of\nnematic flow on motor speed. By modulating passive filament crosslinking we\nshow that energy transfer into nematic flow is in large part dictated by\ncrosslinking. Thus motor proteins both generate activity and contribute to\nnematic elasticity. Our results provide new insights for rationally engineering\nactive materials.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:05:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Redford","Steven A.",""],["Colen","Jonathan",""],["Shivers","Jordan L.",""],["Zemsky","Sasha",""],["Molaei","Mehdi",""],["Floyd","Carlos",""],["Ruijgrok","Paul V.",""],["Vitelli","Vincenzo",""],["Bryant","Zev",""],["Dinner","Aaron R.",""],["Gardel","Margaret L.",""]]}
{"id":"2308.16832","submitter":"Randy Fishman","authors":"R.S. Fishman, T. Berlijn, J. Villanova, and L. Lindsay","title":"Magnon Orbital Angular Momentum of Ferromagnetic Honeycomb and Zig-Zag\n  Lattices","comments":"13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  By expanding the gauge $\\lambda_n(k)$ for magnon band $n$ in harmonics of\nmomentum ${\\bf k} =(k,\\phi )$, we demonstrate that the only observable\ncomponent of the magnon orbital angular momentum $O_n({\\bf k})$ is its angular\naverage over all angles $\\phi$, denoted by $F_n(k)$. For both the FM honeycomb\nand zig-zag lattices, we show that $F_n(k)$ is nonzero in the presence of a\nDzyalloshinzkii-Moriya (DM) interaction. The FM zig-zag lattice model with\nexchange interactions $0<J_1< J_2$ provides a new system where the effects of\norbital angular momentum are observable. For the zig-zag model with equal\nexchange interactions $J_{1x}$ and $J_{1y}$ along the $x$ and $y$ axis, the\nmagnon bands are degenerate along the boundaries of the Brillouin zone with\n$k_x-k_y =\\pm \\pi/a$ and the Chern numbers $C_n$ are not well defined. However,\na revised model with $J_{1y}\\ne J_{1x}$ lifts those degeneracy and produces\nwell-defined Chern numbers of $C_n=\\pm 1$ for the two magnon bands. When\n$J_{1y}=J_{1x}$, the thermal conductivity $\\kappa^{xy}(T)$ of the FM zig-zag\nlattice is largest for $J_2/J_1>6$ but is still about four times smaller than\nthat of the FM honeycomb lattice at high temperatures. Due to the removal of\nband degeneracies, $\\kappa^{xy}(T)$ is slightly enhanced when $J_{1y}\\ne\nJ_{1x}$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:08:20 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fishman","R. S.",""],["Berlijn","T.",""],["Villanova","J.",""],["Lindsay","L.",""]]}
{"id":"2308.16833","submitter":"Federico Castellani","authors":"Francesco Bigazzi, Federico Castellani","title":"Resonance contributions to nucleon spin structure in Holographic QCD","comments":"43 pages, 17 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study polarized inelastic electron-nucleon scattering at low momentum\ntransfer, in the Witten-Sakai-Sugimoto model of holographic QCD. We focus in\nparticular on resonance production contributions to the nucleon spin structure\nfunctions. Our analysis includes both spin $3/2$ and spin $1/2$ low-lying\nnucleon resonances with positive and negative parity. We determine, in turn,\nthe helicity amplitudes for nucleon-resonance transitions and the resonance\ncontributions to the neutron and proton generalized spin polarizabilities.\nExtrapolating the model parameters to realistic QCD data, our analysis,\ntriggered by recent experimental results from Jefferson Lab, agrees with the\nobservation that the $\\Delta(1232)$ resonance gives the dominant contribution\nto the forward spin polarizabilities at low momentum transfer. The contribution\nis negative and increases towards zero as the momentum transfer increases. As\nexpected, the contribution of the $\\Delta(1232)$ to the longitudinal-transverse\npolarizabilities is instead negligible. Our analysis shows that different spin\n$1/2$ resonances give different contributions, in sign and magnitude, to the\ngeneralized longitudinal-transverse spin polarizabilities. In the proton case\nthey globally give rise to a positive function which decreases towards zero as\nthe momentum transfer increases. In the neutron case, the net effect produces a\nnegative increasing function. These features are in qualitative agreement with\nexperimental data.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:08:54 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bigazzi","Francesco",""],["Castellani","Federico",""]]}
{"id":"2308.16834","submitter":"S. Alan Stern","authors":"S.A. Stern, O.L. White, Wm. Grundy, B.A. Keeney, J.D. Hofgartner, D.\n  Nesvorny, W.B. McKinnon, D.C. Richardson, J.C. Marohnic, A.J. Verbiscer, S.D.\n  Benecchi, P.M. Schenk, J.M. Moore","title":"The Properties and Origins of Kuiper Belt Object Arrokoth's Large Mounds","comments":"24 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 report on a study of the mounds that dominate the appearance of Kuiper\nBelt Object (KBO) (486958) Arrokoth's larger lobe, named Wenu. We compare the\ngeological context of these mounds, measure and intercompare their shapes,\nsizes/orientations, reflectance, and colors. We find the mounds are broadly\nself-similar in many respects and interpret them as the original building\nblocks of Arrokoth. It remains unclear why these building blocks are so similar\nin size, and this represents a new constrain and challenge for solar system\nformation models. We then discuss the interpretation of this interpretation.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:10:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Stern","S. A.",""],["White","O. L.",""],["Grundy","Wm.",""],["Keeney","B. A.",""],["Hofgartner","J. D.",""],["Nesvorny","D.",""],["McKinnon","W. B.",""],["Richardson","D. C.",""],["Marohnic","J. C.",""],["Verbiscer","A. J.",""],["Benecchi","S. D.",""],["Schenk","P. M.",""],["Moore","J. M.",""]]}
{"id":"2308.16835","submitter":"Zhiying Feng","authors":"Zhiying Feng, Xu Chen, Qiong Wu, Wen Wu, Xiaoxi Zhang, and Qianyi\n  Huang","title":"FedDD: Toward Communication-efficient Federated Learning with\n  Differential Parameter Dropout","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated Learning (FL) requires frequent exchange of model parameters, which\nleads to long communication delay, especially when the network environments of\nclients vary greatly. Moreover, the parameter server needs to wait for the\nslowest client (i.e., straggler, which may have the largest model size, lowest\ncomputing capability or worst network condition) to upload parameters, which\nmay significantly degrade the communication efficiency. Commonly-used client\nselection methods such as partial client selection would lead to the waste of\ncomputing resources and weaken the generalization of the global model. To\ntackle this problem, along a different line, in this paper, we advocate the\napproach of model parameter dropout instead of client selection, and\naccordingly propose a novel framework of Federated learning scheme with\nDifferential parameter Dropout (FedDD). FedDD consists of two key modules:\ndropout rate allocation and uploaded parameter selection, which will optimize\nthe model parameter uploading ratios tailored to different clients'\nheterogeneous conditions and also select the proper set of important model\nparameters for uploading subject to clients' dropout rate constraints.\nSpecifically, the dropout rate allocation is formulated as a convex\noptimization problem, taking system heterogeneity, data heterogeneity, and\nmodel heterogeneity among clients into consideration. The uploaded parameter\nselection strategy prioritizes on eliciting important parameters for uploading\nto speedup convergence. Furthermore, we theoretically analyze the convergence\nof the proposed FedDD scheme. Extensive performance evaluations demonstrate\nthat the proposed FedDD scheme can achieve outstanding performances in both\ncommunication efficiency and model convergence, and also possesses a strong\ngeneralization capability to data of rare classes.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:10:22 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Feng","Zhiying",""],["Chen","Xu",""],["Wu","Qiong",""],["Wu","Wen",""],["Zhang","Xiaoxi",""],["Huang","Qianyi",""]]}
{"id":"2308.16836","submitter":"Shaohuan Zhou","authors":"Shaohuan Zhou, Shun Lei, Weiya You, Deyi Tuo, Yuren You, Zhiyong Wu,\n  Shiyin Kang, Helen Meng","title":"Towards Improving the Expressiveness of Singing Voice Synthesis with\n  BERT Derived Semantic Information","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents an end-to-end high-quality singing voice synthesis (SVS)\nsystem that uses bidirectional encoder representation from Transformers (BERT)\nderived semantic embeddings to improve the expressiveness of the synthesized\nsinging voice. Based on the main architecture of recently proposed VISinger, we\nput forward several specific designs for expressive singing voice synthesis.\nFirst, different from the previous SVS models, we use text representation of\nlyrics extracted from pre-trained BERT as additional input to the model. The\nrepresentation contains information about semantics of the lyrics, which could\nhelp SVS system produce more expressive and natural voice. Second, we further\nintroduce an energy predictor to stabilize the synthesized voice and model the\nwider range of energy variations that also contribute to the expressiveness of\nsinging voice. Last but not the least, to attenuate the off-key issues, the\npitch predictor is re-designed to predict the real to note pitch ratio. Both\nobjective and subjective experimental results indicate that the proposed SVS\nsystem can produce singing voice with higher-quality outperforming VISinger.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:12:01 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhou","Shaohuan",""],["Lei","Shun",""],["You","Weiya",""],["Tuo","Deyi",""],["You","Yuren",""],["Wu","Zhiyong",""],["Kang","Shiyin",""],["Meng","Helen",""]]}
{"id":"2308.16837","submitter":"Babak Samadi","authors":"Azam Sadat Ahmadi, Nasrin Soltankhah and Babak Samadi","title":"Limited packings: related vertex partitions and duality issues","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A $k$-limited packing partition ($k$LP partition) of a graph $G$ is a\npartition of $V(G)$ into $k$-limited packing sets. We consider the $k$LP\npartitions with minimum cardinality (with emphasis on $k=2$). The minimum\ncardinality is called $k$LP partition number of $G$ and denoted by\n$\\chi_{\\times k}(G)$. This problem is the dual problem of $k$-tuple domatic\npartitioning as well as a generalization of the well-studied $2$-distance\ncoloring problem in graphs.\n  We give the exact value of $\\chi_{\\times2}$ for trees and bound it for\ngeneral graphs. A section of this paper is devoted to the dual of this problem,\nwhere we give a solution to an open problem posed in $1998$. We also revisit\nthe total limited packing number in this paper and prove that the problem of\ncomputing this parameter is NP-hard even for some special families of graphs.\nWe give some inequalities concerning this parameter and discuss the difference\nbetween $2$TLP number and $2$LP number with emphasis on trees.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:12:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ahmadi","Azam Sadat",""],["Soltankhah","Nasrin",""],["Samadi","Babak",""]]}
{"id":"2308.16838","submitter":"Fei Xu","authors":"Fei Xu and Chenyou Zheng","title":"On cohomological characterizations of endotrivial modules","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.CT math.RT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Given a general finite group $G$, there are various finite categories whose\ncohomology theories are of great interests. Recently Balmer and Grodal gave\nsome new characterizations of the groups of endotrivial modules, via \\v{C}ech\ncohomology and category cohomology, respectively, defined on certain orbit\ncategories. These two seemingly different approaches share a common root in\ntopos theory. We shall demonstrate the connection, which leads to a better\nunderstanding as well as new characterizations of the group of endotrivial\nmodules.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:13:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xu","Fei",""],["Zheng","Chenyou",""]]}
{"id":"2308.16839","submitter":"Frederic Jia","authors":"Hewei Frederic Jia","title":"Twist operator correlators and isomonodromic tau functions from modular\n  Hamiltonians","comments":"24 pages, 4 figures; comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech cond-mat.str-el math-ph math.MP nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a novel approach for computing the twist operator correlators\n(TOC) in two-dimensional conformal field theories (2d CFT) and the closely\nrelated isomonodromic tau functions. The method stems from the formal path\nintegral representation of the ground state reduced density matrix in 2d CFT,\nand exploits properties of the associated modular Hamiltonians. For a class of\ngenus-zero TOC/tau functions associated with branched covers with non-abelian\nmonodromy group, we present: i) a determinantal representation derived from the\ncorrelation matrix method for free fermions, and ii) a formal integral\nrepresentation derived from the universal single-interval modular Hamiltonians.\nFor the class of genus-zero TOC/tau functions, we also argue an approximate\nfactorization property, utilizing the known ground state correlation structure\nof large-$c$ holographic CFT and the universality of genus-zero TOCs. We\nprovide explicit examples for verifying the determinantal representation and\nthe approximate factorization property.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:16:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jia","Hewei Frederic",""]]}
{"id":"2308.16840","submitter":"Xinyu Zhou","authors":"XinYu Zhou, H Wang, Q M Liu, S J Zhang, S X Xu, Q Wu, R S Li, L Yue, T\n  C Hu, J Y Yuan, S S Han, T Dong, D Wu and N L Wang","title":"Direct measurement of photoinduced transient conducting state in\n  multilayer 2H-MoTe2","comments":"Phys.Rev.Applied accepted, 9 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultrafast light-matter interaction has emerged as a powerful tool to control\nand probe the macroscopic properties of functional materials, especially\ntwo-dimensional transition metal dichalcogenides which can form different\nstructural phases with distinct physical properties. However, it is often\ndifficult to accurately determine the transient optical constants. In this\nwork, we developed a near-infrared pump - terahertz to midinfrared (12-22 THz)\nprobe system in transmission geometry to measure the transient optical\nconductivity in 2H-MoTe2 layered material. By performing separate measurements\non bulk and thin-film samples, we are able to overcome issues related to\nnonuniform substrate thickness and penetration depth mismatch and to extract\nthe transient optical constants reliably. Our results show that photoexcitation\nat 690 nm induces a transient insulator-metal transition, while photoexcitation\nat 2 um has a much smaller effect due to the photon energy being smaller than\nthe band gap of the material. Combining this with a single-color pump-probe\nmeasurement, we show that the transient response evolves towards 1T' phase at\nhigher flunece. Our work provides a comprehensive understanding of the\nphotoinduced phase transition in the 2H-MoTe2 system.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:17:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhou","XinYu",""],["Wang","H",""],["Liu","Q M",""],["Zhang","S J",""],["Xu","S X",""],["Wu","Q",""],["Li","R S",""],["Yue","L",""],["Hu","T C",""],["Yuan","J Y",""],["Han","S S",""],["Dong","T",""],["Wu","D",""],["Wang","N L",""]]}
{"id":"2308.16841","submitter":"Claudio Alexandre Piedade","authors":"Maria Elisa Fernandes, Claudio Alexandre Piedade","title":"The degrees of the orientation-preserving automorphism groups of\n  toroidal maps and hypermaps","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is an exploration of the faithful transitive permutation\nrepresentations of the orientation-preserving automorphisms groups of highly\nsymmetric toroidal maps and hypermaps. The main theorems of this paper give a\nlist of all possible degrees of these specific groups. This extends prior\naccomplishments of the authors, wherein their focus was confined to the study\nof the automorphisms groups of toroidal regular maps and hypermaps.\n  In addition the authors bring out the recently developed {\\sc GAP} package\n{\\sc corefreesub} that can be used to find faithful transitive permutation\nrepresentations of any group. With the aid of this powerful tool, the authors\nshow how Schreier coset graphs of the automorphism groups of toroidal maps and\nhypermaps can be easily constructed.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:20:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fernandes","Maria Elisa",""],["Piedade","Claudio Alexandre",""]]}
{"id":"2308.16842","submitter":"Xinyi Wen","authors":"Xinyi Wen, Mehrnaz Anvari, Leonardo Rydin Gorjao, G.Cigdem Yalcin,\n  Veit Hagenmeyer, Benjamin Schafer","title":"Non-standard power grid frequency statistics in Asia, Australia, and\n  Europe","comments":"7 pages; 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The power-grid frequency reflects the balance between electricity supply and\ndemand. Measuring the frequency and its variations allows monitoring of the\npower balance in the system and, thus, the grid stability. In addition, gaining\ninsight into the characteristics of frequency variations and defining precise\nevaluation metrics for these variations enables accurate assessment of the\nperformance of forecasts and synthetic models of the power-grid frequency.\nPrevious work was limited to a few geographical regions and did not quantify\nthe observed effects. In this contribution, we analyze and quantify the\nstatistical and stochastic properties of self-recorded power-grid frequency\ndata from various synchronous areas in Asia, Australia, and Europe at a\nresolution of one second. Revealing non-standard statistics of both empirical\nand synthetic frequency data, we effectively constrain the space of possible\n(stochastic) power-grid frequency models and share a range of analysis tools to\nbenchmark any model or characterize empirical data. Furthermore, we emphasize\nthe need to analyze data from a large range of synchronous areas to obtain\ngenerally applicable models.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:22:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wen","Xinyi",""],["Anvari","Mehrnaz",""],["Gorjao","Leonardo Rydin",""],["Yalcin","G. Cigdem",""],["Hagenmeyer","Veit",""],["Schafer","Benjamin",""]]}
{"id":"2308.16843","submitter":"Enrico Vitale","authors":"Sandra Mantovani, Mariano Messora, Enrico M. Vitale","title":"Homotopy torsion theories","comments":"37 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the context of categories equipped with a structure of nullhomotopies, we\nintroduce the notion of homotopy torsion theory. As special cases, we recover\npretorsion theories as well as torsion theories in multi-pointed categories and\nin pre-pointed categories. Using the structure of nullhomotopies induced by the\ncanonical string of adjunctions between a category A and the category Arr(A) of\narrows, we give a new proof of the correspondence between orthogonal\nfactorization systems in A and homotopy torsion theories in Arr(A), avoiding\nthe request on the existence of pullbacks and pushouts in A. Moreover, such a\ncorrespondence is extended to weakly orthogonal factorization systems and weak\nhomotopy torsion theories.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:22:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mantovani","Sandra",""],["Messora","Mariano",""],["Vitale","Enrico M.",""]]}
{"id":"2308.16844","submitter":"Huali Zhang","authors":"Huali Zhang, Feng Du, Xiaoying Zheng, Shuaishuai Luo, Yi Wu, Hao\n  Zheng, Shengtao Cui, Zhe Sun, Zhengtai Liu, Dawei Shen, Michael Smidman, Yu\n  Song, Ming Shi, Zhicheng Zhong, Chao Cao, Huiqiu Yuan and Yang Liu","title":"Electronic band reconstruction across the insulator-metal transition in\n  colossal magnetoresistive EuCd2P2","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While colossal magnetoresistance (CMR) in Eu-based compounds is often\nassociated with strong spin-carrier interactions, the underlying reconstruction\nof the electronic bands is much less understood from spectroscopic experiments.\nHere using angle-resolved photoemission, we directly observe an electronic band\nreconstruction across the insulator-metal (and magnetic) transition in the\nrecently discovered CMR compound EuCd2P2. This transition is manifested by a\nlarge magnetic band splitting associated with the magnetic order, as well as\nunusual energy shifts of the valence bands: both the large ordered moment of Eu\nand carrier localization in the paramagnetic phase are crucial. Our results\nprovide spectroscopic evidence for an electronic structure reconstruction\nunderlying the enormous CMR observed in EuCd2P2, which could be important for\nunderstanding Eu-based CMR materials, as well as designing CMR materials based\non large-moment rare-earth magnets.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:23:40 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Huali",""],["Du","Feng",""],["Zheng","Xiaoying",""],["Luo","Shuaishuai",""],["Wu","Yi",""],["Zheng","Hao",""],["Cui","Shengtao",""],["Sun","Zhe",""],["Liu","Zhengtai",""],["Shen","Dawei",""],["Smidman","Michael",""],["Song","Yu",""],["Shi","Ming",""],["Zhong","Zhicheng",""],["Cao","Chao",""],["Yuan","Huiqiu",""],["Liu","Yang",""]]}
{"id":"2308.16845","submitter":"Thomas Willwacher","authors":"Michael Borinsky and Benjamin Br\\\"uck and Thomas Willwacher","title":"Weight 2 cohomology of graph complexes of cyclic operads and the\n  handlebody group","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the weight 2 (resp.~top$-2$) cohomology of the Feynman transforms\nof the cyclic (co)operads $\\mathsf{BV}$, $D\\mathsf{BV}$, $\\mathsf{Grav}$ and\n$\\mathsf{HyCom}$. Using a result of Giansiracusa we compute in particular the\nweight top$-2$-cohomology of the handlebody group. We compare the result to the\nweight top$-2$ cohomology of the moduli space of curves $\\mathcal M_{g,n}$,\nrecently computed by Payne and the last-named author. We also provide another\nproof of a recent result of Hainaut--Petersen identifying the\ntop-weight-cohomology of the handlebody group with the Kontsevich graph\ncohomology.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:24:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Borinsky","Michael",""],["Br\u00fcck","Benjamin",""],["Willwacher","Thomas",""]]}
{"id":"2308.16846","submitter":"Yicheng Feng","authors":"STAR Collaboration","title":"Upper Limit on the Chiral Magnetic Effect in Isobar Collisions at the\n  Relativistic Heavy-Ion Collider","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The chiral magnetic effect (CME) is a phenomenon that arises from the QCD\nanomaly in the presence of an external magnetic field. The experimental search\nfor its evidence has been one of the key goals of the physics program of the\nRelativistic Heavy-Ion Collider. The STAR collaboration has previously\npresented the results of a blind analysis of isobar collisions\n(${^{96}_{44}\\text{Ru}}+{^{96}_{44}\\text{Ru}}$,\n${^{96}_{40}\\text{Zr}}+{^{96}_{40}\\text{Zr}}$) in the search for the CME. The\nisobar ratio ($Y$) of CME-sensitive observable, charge separation scaled by\nelliptic anisotropy, is close to but systematically larger than the inverse\nmultiplicity ratio, the naive background baseline. This indicates the potential\nexistence of a CME signal and the presence of remaining nonflow background due\nto two- and three-particle correlations which are different between the\nisobars. In this post-blind analysis, we estimate the contributions from those\nnonflow correlations as a background baseline to $Y$, utilizing the isobar data\nas well as HIJING simulations. This baseline is found consistent with the\nisobar ratio measurement, and an upper limit of 10% at 95% confidence level is\nextracted for the CME fraction in the charge separation measurement in isobar\ncollisions at $\\sqrt{s_{\\rm NN}}=200$ GeV.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:24:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["STAR Collaboration","",""]]}
{"id":"2308.16847","submitter":"Thomas Kerdreux","authors":"Alexandre Tuel and Thomas Kerdreux and Claudia Hulbert and Bertrand\n  Rouet-Leduc","title":"Diffusion Models for Interferometric Satellite Aperture Radar","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":"  Probabilistic Diffusion Models (PDMs) have recently emerged as a very\npromising class of generative models, achieving high performance in natural\nimage generation. However, their performance relative to non-natural images,\nlike radar-based satellite data, remains largely unknown. Generating large\namounts of synthetic (and especially labelled) satellite data is crucial to\nimplement deep-learning approaches for the processing and analysis of\n(interferometric) satellite aperture radar data. Here, we leverage PDMs to\ngenerate several radar-based satellite image datasets. We show that PDMs\nsucceed in generating images with complex and realistic structures, but that\nsampling time remains an issue. Indeed, accelerated sampling strategies, which\nwork well on simple image datasets like MNIST, fail on our radar datasets. We\nprovide a simple and versatile open-source\nhttps://github.com/thomaskerdreux/PDM_SAR_InSAR_generation to train, sample and\nevaluate PDMs using any dataset on a single GPU.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:26:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tuel","Alexandre",""],["Kerdreux","Thomas",""],["Hulbert","Claudia",""],["Rouet-Leduc","Bertrand",""]]}
{"id":"2308.16848","submitter":"David Pfau","authors":"David Pfau and Simon Axelrod and Halvard Sutterud and Ingrid von Glehn\n  and James S. Spencer","title":"Natural Quantum Monte Carlo Computation of Excited States","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cs.LG physics.chem-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a variational Monte Carlo algorithm for estimating the lowest\nexcited states of a quantum system which is a natural generalization of the\nestimation of ground states. The method has no free parameters and requires no\nexplicit orthogonalization of the different states, instead transforming the\nproblem of finding excited states of a given system into that of finding the\nground state of an expanded system. Expected values of arbitrary observables\ncan be calculated, including off-diagonal expectations between different states\nsuch as the transition dipole moment. Although the method is entirely general,\nit works particularly well in conjunction with recent work on using neural\nnetworks as variational Ansatze for many-electron systems, and we show that by\ncombining this method with the FermiNet and Psiformer Ansatze we can accurately\nrecover vertical excitation energies and oscillator strengths on molecules as\nlarge as benzene. Beyond the examples on molecules presented here, we expect\nthis technique will be of great interest for applications of variational\nquantum Monte Carlo to atomic, nuclear and condensed matter physics.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:27:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pfau","David",""],["Axelrod","Simon",""],["Sutterud","Halvard",""],["von Glehn","Ingrid",""],["Spencer","James S.",""]]}
{"id":"2308.16849","submitter":"Lance Marinelli","authors":"Cain Edie-Michell and Lance Marinelli","title":"The construction of a $E_7$-like quantum subgroup of $SU(3)$","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this short note we construct an embedding of the planar algebra for\n$\\overline{\\operatorname{Rep}(U_q(sl_3))}$ at $q = e^{2\\pi i \\frac{1}{24}}$\ninto the graph planar algebra of di Francesco and Zuber's candidate graph\n$\\mathcal{E}_4^{12}$. Via the graph planar algebra embedding theorem we thus\nconstruct a rank 11 module category over\n$\\overline{\\operatorname{Rep}(U_q(sl_3))}$ whose graph for action by the vector\nrepresentation is $\\mathcal{E}_4^{12}$. This fills a small gap in the\nliterature on the construction of $\\overline{\\operatorname{Rep}(U_q(sl_3))}$\nmodule categories. As a consequence of our construction, we obtain the\nprincipal graphs of subfactors constructed abstractly by Evans and Pugh.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:30:20 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Edie-Michell","Cain",""],["Marinelli","Lance",""]]}
{"id":"2308.16850","submitter":"Cameron Gates Rudd","authors":"Cameron Gates Rudd","title":"Stretch laminations and hyperbolic Dehn surgery","comments":"26 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"MPIM-Bonn-2023","categories":"math.GT math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study maximal stretch laminations associated to certain best Lipschitz\ncircle valued maps in Dehn surgery families of hyperbolic 3-manifolds. For\nthese maps, we give a criterion based on the Thurston norm and Dehn filling\nslope length to determine when such a stretch lamination is a union of Dehn\nfilling core curves. We use this to show there exist infinitely many examples\nwhere the homotopy class of the circle valued map includes a fibration and\nwhere the laminations have only closed leaves. This gives information about\nnon-maximal horospherical orbit closures in the infinite cyclic covers\nassociated to these fibrations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:34:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Rudd","Cameron Gates",""]]}
{"id":"2308.16851","submitter":"D\\'aniel Garamv\\\"olgyi","authors":"D\\'aniel Garamv\\\"olgyi","title":"Stress-linked pairs of vertices and the generic stress matroid","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.AG math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a graph $G$ and a mapping $p : V(G) \\rightarrow \\mathbb{R}^d$, we say\nthat the pair $(G,p)$ is a ($d$-dimensional) realization of $G$. Two\nrealizations $(G,p)$ and $(G,q)$ are equivalent if each of the point pairs\ncorresponding to the edges of $G$ have the same distance under the embeddings\n$p$ and $q$. A pair of vertices $\\{u,v\\}$ is globally linked in $G$ in\n$\\mathbb{R}^d$ if for every generic realization $(G,p)$ and every equivalent\nrealization $(G,q)$, $(G+uv,p)$ and $(G+uv,q)$ are also equivalent.\n  In this paper we introduce the notion of $d$-stress-linked vertex pairs.\nRoughly speaking, a pair of vertices $\\{u,v\\}$ is $d$-stress-linked in $G$ if\nthe edge $uv$ is generically stressed in $G+uv$ and for every generic\n$d$-dimensional realization $(G,p)$, every configuration $q$ that satisfies all\nof the equilibrium stresses of $(G,p)$ also satisfies the equilibrium stresses\nof $(G+uv,p)$. Among other results, we show that $d$-stress-linked vertex pairs\nare globally linked in $\\mathbb{R}^d$, and we give a combinatorial\ncharacterization of $2$-stress-linked vertex pairs that matches the conjecture\nof Jackson et al. about the characterization of globally linked pairs in\n$\\mathbb{R}^2$.\n  As a key tool, we introduce and study the \"algebraic dual\" of the\n$d$-dimensional generic rigidity matroid of a graph, which we call the\n$d$-dimensional generic stress matroid of the graph. We believe that our\nresults about this matroid, which describes the global behaviour of equilibrium\nstresses of generic realizations of $G$, may be of independent interest.\n  We use our results to give positive answers to conjectures of Jord\\'an,\nConnelly, and Grasegger et al.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:47:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Garamv\u00f6lgyi","D\u00e1niel",""]]}
{"id":"2308.16852","submitter":"I. S. Burmistrov","authors":"S. S. Babkin and I. S. Burmistrov","title":"Boundary multifractality in the spin quantum Hall symmetry class with\n  interaction","comments":"14 LaTeX pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generalized multifractality characterizes system size dependence of pure\nscaling local observables at Anderson transitions in all ten symmetry classes\nof disordered systems. Recently, the concept of generalized multifractality has\nbeen extended to boundaries of critical disordered noninteracting systems. Here\nwe study the generalized boundary multifractality in the presence of\nelectron-electron interaction, focusing on the spin quantum Hall symmetry class\n(class C). Employing the two-loop renormalization group analysis within\nFinkel'stein nonlinear sigma model we compute the anomalous dimensions of the\npure scaling operators located at the boundary of the system. We find that\ngeneralized boundary multifractal exponents are twice larger than their bulk\ncounterparts. Exact symmetry relations between generalized boundary\nmultifractal exponents in the case of noninteracting systems are explicitly\nbroken by the interaction.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:49:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Babkin","S. S.",""],["Burmistrov","I. S.",""]]}
{"id":"2308.16853","submitter":"Katherine Raoux","authors":"Katherine Raoux and Matthew Hedden","title":"A 4-dimensional rational genus bound","comments":"33 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a 4-dimensional analogue of the rational Seifert genus of a knot\n$K\\subset Y$, which we call the rational slice genus, that measures the\ncomplexity of a homology class in $H_2(Y\\times [0,1],K;\\mathbb{Q})$. Our main\ntheorem is a lower bound for the rational slice genus of a knot in terms of its\nHeegaard Floer $\\tau$ invariants. To prove this, we bound the $\\tau$ invariants\nof any satellite link whose pattern is a closed braid in terms of the $\\tau$\ninvariants of the companion knot, a result which should be of independent\nvalue. Our techniques also produce rational PL slice genus bounds.\n  As applications, we use our bounds to prove that Floer simple knots have\nrational slice genus equal to their rational Seifert genus. We also show that\nthere exist sequences of knots in a fixed 3-manifold whose PL slice genus is\nunbounded. In addition, we produce stronger bounds for the slice genus of knots\nrelative to the rational longitude, and use these to produce a rational\nslice-Bennequin bound for knots in contact manifolds with non-trivial contact\ninvariant.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:55:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Raoux","Katherine",""],["Hedden","Matthew",""]]}
{"id":"2308.16854","submitter":"Murad Alim","authors":"Murad Alim, Florian Beck, Anna Biggs, Daniel Bryan","title":"Special geometry, quasi-modularity and attractor flow for BPS structures","comments":"80 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.AG math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study mathematical structures on the moduli spaces of BPS structures of\n$\\mathcal{N}=2$ theories. Guided by the realization of BPS structures within\ntype IIB string theory on non-compact Calabi-Yau threefolds, we develop a\nnotion of BPS variation of Hodge structure which gives rise to special K\\\"ahler\ngeometry as well as to Picard-Fuchs equations governing the central charges of\nthe BPS structure. We focus our study on cases with complex one dimensional\nmoduli spaces and charge lattices of rank two including Argyres-Douglas $A_2$\nas well as Seiberg-Witten $SU(2)$ theories. In these cases the moduli spaces\nare identified with modular curves and we determine the expressions of the\ncentral charges in terms of quasi-modular forms of the corresponding duality\ngroups. We furthermore determine the curves of marginal stability and study the\nattractor flow in these examples, showing that it provides another way of\ndetermining the complete BPS spectrum in these cases.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:55:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Alim","Murad",""],["Beck","Florian",""],["Biggs","Anna",""],["Bryan","Daniel",""]]}
{"id":"2308.16855","submitter":"Mehdi Behroozi","authors":"Mehdi Behroozi and Reyhaneh Mohammadi and Cody Dunne","title":"Space Partitioning Schemes and Algorithms for Generating Regular and\n  Spiral Treemaps","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Treemaps have been widely applied to the visualization of hierarchical data.\nA treemap takes a weighted tree and visualizes its leaves in a nested planar\ngeometric shape, with sub-regions partitioned such that each sub-region has an\narea proportional to the weight of its associated leaf nodes. Efficiently\ngenerating visually appealing treemaps that also satisfy other quality criteria\nis an interesting problem that has been tackled from many directions. We\npresent an optimization model and five new algorithms for this problem,\nincluding two divide and conquer approaches and three spiral treemap\nalgorithms. Our optimization model is able to generate superior treemaps that\ncould serve as a benchmark for comparing the quality of more computationally\nefficient algorithms. Our divide and conquer and spiral algorithms either\nimprove the performance of their existing counterparts with respect to aspect\nratio and stability or perform competitively. Our spiral algorithms also expand\ntheir applicability to a wider range of input scenarios. Four of these\nalgorithms are computationally efficient as well with quasilinear running times\nand the last algorithm achieves a cubic running time. A full version of this\npaper with all appendices, data, and source codes is available at\n\\anonymizeOSF{\\OSFSupplementText}.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:57:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Behroozi","Mehdi",""],["Mohammadi","Reyhaneh",""],["Dunne","Cody",""]]}
{"id":"2308.16856","submitter":"Marco Di Renzo","authors":"Andrea Abrardo, Alberto Toccafondi, and Marco Di Renzo","title":"Analysis and Optimization of Reconfigurable Intelligent Surfaces Based\n  on $S$-Parameters Multiport Network Theory","comments":"Submitted to a conference (invited)","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 consider a reconfigurable intelligent surface (RIS) and\nmodel it by using multiport network theory. We first compare the representation\nof RIS by using $Z$-parameters and $S$-parameters, by proving their equivalence\nand discussing their distinct features. Then, we develop an algorithm for\noptimizing the RIS configuration in the presence of electromagnetic mutual\ncoupling. We show that the proposed algorithm based on optimizing the\n$S$-parameters results in better performance than existing algorithms based on\noptimizing the $Z$-parameters. This is attributed to the fact that small\nperturbations of the step size of the proposed algorithm result in larger\nvariations of the $S$-parameters, hence increasing the convergence speed of the\nalgorithm.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:58:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Abrardo","Andrea",""],["Toccafondi","Alberto",""],["Di Renzo","Marco",""]]}
{"id":"2308.16857","submitter":"Md Simul Hasan Talukder","authors":"Md Sakib Ullah Sourav, Mohammad Sultan Mahmud, Md Simul Hasan\n  Talukder, Rejwan Bin Sulaiman, Abdullah Yasin","title":"IoMT-Blockchain based Secured Remote Patient Monitoring Framework for\n  Neuro-Stimulation Device","comments":"8 Figures and 2 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biomedical Engineering's Internet of Medical Things (IoMT) is helping to\nimprove the accuracy, dependability, and productivity of electronic equipment\nin the healthcare business. Real-time sensory data from patients may be\ndelivered and subsequently analyzed through rapid development of wearable IoMT\ndevices, such as neuro-stimulation devices with a range of functions. Data from\nthe Internet of Things is gathered, analyzed, and stored in a single location.\nHowever, single-point failure, data manipulation, privacy difficulties, and\nother challenges might arise as a result of centralization. Due to its\ndecentralized nature, blockchain (BC) can alleviate these issues. The viability\nof establishing a non-invasive remote neurostimulation system employing\nIoMT-based transcranial Direct Current Stimulation is investigated in this work\n(tDCS). A hardware-based prototype tDCS device has been developed that can be\noperated over the internet using an android application. Our suggested\nframework addresses the problems of IoMTBC-based systems, meets the criteria of\nreal-time remote patient monitoring systems, and incorporates literature best\npractices in the relevant fields.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 16:59:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sourav","Md Sakib Ullah",""],["Mahmud","Mohammad Sultan",""],["Talukder","Md Simul Hasan",""],["Sulaiman","Rejwan Bin",""],["Yasin","Abdullah",""]]}
{"id":"2308.16858","submitter":"Alessandro Benfenati","authors":"Alessandro Benfenati, Emilie Chouzenoux, Giorgia Franchini, Salla\n  Latva-Aijo, Dominik Narnhofer, Jean-Christophe Pesquet, Sebastian J. Scott,\n  Mahsa Yousefi","title":"Majorization-Minimization for sparse SVMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Several decades ago, Support Vector Machines (SVMs) were introduced for\nperforming binary classification tasks, under a supervised framework. Nowadays,\nthey often outperform other supervised methods and remain one of the most\npopular approaches in the machine learning arena. In this work, we investigate\nthe training of SVMs through a smooth sparse-promoting-regularized squared\nhinge loss minimization. This choice paves the way to the application of quick\ntraining methods built on majorization-minimization approaches, benefiting from\nthe Lipschitz differentiabililty of the loss function. Moreover, the proposed\napproach allows us to handle sparsity-preserving regularizers promoting the\nselection of the most significant features, so enhancing the performance.\nNumerical tests and comparisons conducted on three different datasets\ndemonstrate the good performance of the proposed methodology in terms of\nqualitative metrics (accuracy, precision, recall, and F 1 score) as well as\ncomputational cost.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:03:16 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Benfenati","Alessandro",""],["Chouzenoux","Emilie",""],["Franchini","Giorgia",""],["Latva-Aijo","Salla",""],["Narnhofer","Dominik",""],["Pesquet","Jean-Christophe",""],["Scott","Sebastian J.",""],["Yousefi","Mahsa",""]]}
{"id":"2308.16859","submitter":"Mishfad Shaikh Veedu","authors":"Mishfad Shaikh Veedu, Deepjyoti Deka, and Murti V. Salapaka","title":"Information Theoretically Optimal Sample Complexity of Learning\n  Dynamical Directed Acyclic Graphs","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG cs.SY eess.SY math.OC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this article, the optimal sample complexity of learning the underlying\ninteraction/dependencies of a Linear Dynamical System (LDS) over a Directed\nAcyclic Graph (DAG) is studied. The sample complexity of learning a DAG's\nstructure is well-studied for static systems, where the samples of nodal states\nare independent and identically distributed (i.i.d.). However, such a study is\nless explored for DAGs with dynamical systems, where the nodal states are\ntemporally correlated. We call such a DAG underlying an LDS as \\emph{dynamical}\nDAG (DDAG). In particular, we consider a DDAG where the nodal dynamics are\ndriven by unobserved exogenous noise sources that are wide-sense stationary\n(WSS) in time but are mutually uncorrelated, and have the same {power spectral\ndensity (PSD)}. Inspired by the static settings, a metric and an algorithm\nbased on the PSD matrix of the observed time series are proposed to reconstruct\nthe DDAG. The equal noise PSD assumption can be relaxed such that\nidentifiability conditions for DDAG reconstruction are not violated. For the\nLDS with WSS (sub) Gaussian exogenous noise sources, it is shown that the\noptimal sample complexity (or length of state trajectory) needed to learn the\nDDAG is $n=\\Theta(q\\log(p/q))$, where $p$ is the number of nodes and $q$ is the\nmaximum number of parents per node. To prove the sample complexity upper bound,\na concentration bound for the PSD estimation is derived, under two different\nsampling strategies. A matching min-max lower bound using generalized Fano's\ninequality also is provided, thus showing the order optimality of the proposed\nalgorithm.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:03:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Veedu","Mishfad Shaikh",""],["Deka","Deepjyoti",""],["Salapaka","Murti V.",""]]}
{"id":"2308.16860","submitter":"Naruhiko Aizawa","authors":"N. Aizawa, Ren Ito and Toshiya Tanaka","title":"$\\mathbb{Z}_2^2$-graded supersymmetry via superfield on minimal\n  $\\mathbb{Z}_2^2$-superspace","comments":"20 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph hep-th math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A superfield formalism for the minimal $\\mathbb{Z}_2^2$-graded version of\nsupersymmetry is developed. This is done by using the recently introduced\ndefinition of integration on the minimal $\\mathbb{Z}_2^2$-superspace. It is\nshown that one may construct $\\mathbb{Z}_2^2$-supersymmetric action by the\nprocedure similar to the standard supersymmetry. However, the Lagrangian\nobtained has very general interaction terms, which give rise to a\n$\\mathbb{Z}_2^2$-graded extension of many known theories defined in\ntwo-dimensional spacetime. As an illustration, we will give a\n$\\mathbb{Z}_2^2$-extension of the sine-Gordon model different from the one\nalready discussed in the literature.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:04:05 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Aizawa","N.",""],["Ito","Ren",""],["Tanaka","Toshiya",""]]}
{"id":"2308.16861","submitter":"Xiang Li","authors":"Xiang Li, Beibei Feng, Tianning Zang, Shuyuan Zhao, and Jingrun Ma","title":"Facing Unknown: Open-World Encrypted Traffic Classification Based on\n  Contrastive Pre-Training","comments":"Accepted by 2023 IEEE ISCC, 6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traditional Encrypted Traffic Classification (ETC) methods face a significant\nchallenge in classifying large volumes of encrypted traffic in the open-world\nassumption, i.e., simultaneously classifying the known applications and\ndetecting unknown applications. We propose a novel Open-World Contrastive\nPre-training (OWCP) framework for this. OWCP performs contrastive pre-training\nto obtain a robust feature representation. Based on this, we determine the\nspherical mapping space to find the marginal flows for each known class, which\nare used to train GANs to synthesize new flows similar to the known parts but\ndo not belong to any class. These synthetic flows are assigned to Softmax's\nunknown node to modify the classifier, effectively enhancing sensitivity\ntowards known flows and significantly suppressing unknown ones. Extensive\nexperiments on three datasets show that OWCP significantly outperforms existing\nETC and generic open-world classification methods. Furthermore, we conduct\ncomprehensive ablation studies and sensitivity analyses to validate each\nintegral component of OWCP.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:04:20 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Xiang",""],["Feng","Beibei",""],["Zang","Tianning",""],["Zhao","Shuyuan",""],["Ma","Jingrun",""]]}
{"id":"2308.16862","submitter":"Otmar Ertl","authors":"Otmar Ertl","title":"UltraLogLog: A Practical and More Space-Efficient Alternative to\n  HyperLogLog for Approximate Distinct Counting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since its invention HyperLogLog has become the standard algorithm for\napproximate distinct counting. Due to its space efficiency and suitability for\ndistributed systems, it is widely used and also implemented in numerous\ndatabases. This work presents UltraLogLog, which shares the same practical\nproperties as HyperLogLog. It is commutative, idempotent, mergeable, and has a\nfast guaranteed constant-time insert operation. At the same time, it requires\n28% less space to encode the same amount of distinct count information, which\ncan be extracted using the maximum likelihood method. Alternatively, a simpler\nand faster estimator is proposed, which still achieves a space reduction of\n24%, but at an estimation speed comparable to that of HyperLogLog. In a\nnon-distributed setting where martingale estimation can be used, UltraLogLog is\nable to reduce space by 17%. Moreover, its smaller entropy and its 8-bit\nregisters lead to better compaction when using standard compression algorithms.\nAll this is verified by experimental results that are in perfect agreement with\nthe theoretical analysis which also outlines potential for even more\nspace-efficient data structures. A production-ready Java implementation of\nUltraLogLog has been released as part of the open-source Hash4j library.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:04:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ertl","Otmar",""]]}
{"id":"2308.16863","submitter":"Chinmay Prabhakar","authors":"Chinmay Prabhakar, Hongwei Bran Li, Johannes C. Paetzold, Timo Loehr,\n  Chen Niu, Mark M\\\"uhlau, Daniel Rueckert, Benedikt Wiestler, Bjoern Menze","title":"Self-pruning Graph Neural Network for Predicting Inflammatory Disease\n  Activity in Multiple Sclerosis from Brain MR Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multiple Sclerosis (MS) is a severe neurological disease characterized by\ninflammatory lesions in the central nervous system. Hence, predicting\ninflammatory disease activity is crucial for disease assessment and treatment.\nHowever, MS lesions can occur throughout the brain and vary in shape, size and\ntotal count among patients. The high variance in lesion load and locations\nmakes it challenging for machine learning methods to learn a globally effective\nrepresentation of whole-brain MRI scans to assess and predict disease.\nTechnically it is non-trivial to incorporate essential biomarkers such as\nlesion load or spatial proximity. Our work represents the first attempt to\nutilize graph neural networks (GNN) to aggregate these biomarkers for a novel\nglobal representation. We propose a two-stage MS inflammatory disease activity\nprediction approach. First, a 3D segmentation network detects lesions, and a\nself-supervised algorithm extracts their image features. Second, the detected\nlesions are used to build a patient graph. The lesions act as nodes in the\ngraph and are initialized with image features extracted in the first stage.\nFinally, the lesions are connected based on their spatial proximity and the\ninflammatory disease activity prediction is formulated as a graph\nclassification task. Furthermore, we propose a self-pruning strategy to\nauto-select the most critical lesions for prediction. Our proposed method\noutperforms the existing baseline by a large margin (AUCs of 0.67 vs. 0.61 and\n0.66 vs. 0.60 for one-year and two-year inflammatory disease activity,\nrespectively). Finally, our proposed method enjoys inherent explainability by\nassigning an importance score to each lesion for the overall prediction. Code\nis available at https://github.com/chinmay5/ms_ida.git\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:05:14 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Prabhakar","Chinmay",""],["Li","Hongwei Bran",""],["Paetzold","Johannes C.",""],["Loehr","Timo",""],["Niu","Chen",""],["M\u00fchlau","Mark",""],["Rueckert","Daniel",""],["Wiestler","Benedikt",""],["Menze","Bjoern",""]]}
{"id":"2308.16864","submitter":"Marcus Gomes Jr. Mr.","authors":"Marcus N. Gomes Jr., Marcio H. Giacomoni, Fabricio A. R. Navarro,\n  Eduardo M. Mendiondo","title":"Global Optimization-Based Calibration Algorithm for a 2D Distributed\n  Hydrologic-Hydrodynamic and Water Quality Model","comments":"Preprint submitted to Journal of Hydrology","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph math.OC nlin.CG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Hydrodynamic models with rain-on-the-grid capabilities are usually\ncomputationally expensive. This makes the use of automatic calibration\nalgorithms hard to apply due to the large number of model runs. However, with\nthe recent advances in parallel processing, computational resources, and\nincreasing high-resolution climatologic and GIS data, high-resolution\nhydrodynamic models can be used for optimization-based calibration. This paper\npresents a global optimization-based algorithm to calibrate a fully distributed\nhydrologic-hydrodynamic and water quality model (HydroPol2D) using observed\ndata (i.e., discharge, or pollutant concentration) as input. The algorithm can\nfind a near-optimal set of parameters to explain observed gauged data. The\nmodeling framework presented here, although applied in a poorly-gauged\ncatchment, can be adapted for catchments with more detailed observations. We\napplied the algorithm in different cases of the V-Tilted Catchment, the\nWooden-Board catchment, and in an existing urban catchment with heterogeneous\ndata. The results of automatic calibration indicate $\\mathrm{NSE} = 0.99$ for\nthe V-Tilted catchment, $\\mathrm{RMSE} = 830~\\mathrm{mgL^{-1}}$ for salt\nconcentration pollutographs (i.e., 8.3% of the event mean concentration), and\n$\\mathrm{NSE} = 0.89$ for the urban catchment case study. This paper also\nexplores the issue of equifinality in modeling calibration (EqMC). Equifinality\nis defined as the set of different parameter combinations that can provide\nequally good or accepted results, within the physical parameter ranges. EqMC\ndecreases with the number of events and increases with the choice of partially\nor nonproducing runoff ones. Furthermore, results indicate that providing more\naccurate parameter ranges based on a priori knowledge of the catchment is\nfundamental to reduce the chances of finding a set of parameters with\nequifinality.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:06:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gomes","Marcus N.","Jr."],["Giacomoni","Marcio H.",""],["Navarro","Fabricio A. R.",""],["Mendiondo","Eduardo M.",""]]}
{"id":"2308.16865","submitter":"Jules Lamers","authors":"Gwena\\\"el Ferrando, Jules Lamers, Fedor Levkovich-Maslyuk, Didina\n  Serban","title":"Bethe ansatz inside Calogero-Sutherland models","comments":"42 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI cond-mat.str-el hep-th math-ph math.MP math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the trigonometric quantum spin-Calogero-Sutherland model, and the\nHaldane-Shastry spin chain as a special case, using a Bethe-ansatz analysis. We\nharness the model's Yangian symmetry to import the standard tools of\nintegrability for Heisenberg spin chains into the world of integrable\nlong-range models with spins. From the transfer matrix with a diagonal twist we\nconstruct Heisenberg-style symmetries (Bethe algebra) that refine the usual\nhierarchy of commuting Hamiltonians (quantum determinant) of the\nspin-Calogero-Sutherland model. We compute the first few of these new conserved\ncharges explicitly, and diagonalise them by Bethe ansatz inside each\nirreducible Yangian representation. This yields a new eigenbasis for the\nspin-Calogero-Sutherland model that generalises the Yangian Gelfand-Tsetlin\nbasis of Takemura and Uglov. The Bethe-ansatz analysis involves non-generic\nvalues of the inhomogeneities. Our review of the inhomogeneous Heisenberg XXX\nchain, with special attention to how the Bethe ansatz works in the presence of\nfusion, may be of independent interest.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:06:26 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ferrando","Gwena\u00ebl",""],["Lamers","Jules",""],["Levkovich-Maslyuk","Fedor",""],["Serban","Didina",""]]}
{"id":"2308.16866","submitter":"Sergey Pyatkov Grigor'evich","authors":"Sergey Pyatkov and Lyubov Neustroeva","title":"Point sources identification problems with pointwise overdetermination","comments":"This article is actually a survey of the results obtained in the\n  previous articles of the authors. In some model cases, we discuss the\n  uniqueness and existence results for some classes of inverse problems. The\n  results uses a new approach based on asymptotic representations of the Green\n  function of the corresponding elliptic problem","journal-ref":"Mathematical Notes of NEFU, 29(2) (2022), 43-58","doi":"10.25587/SVFU.2022.32.61.004","report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This article is devoted to inverse problems of recovering point sources in\nmathematical models of heat and mass transfer. The main attention is paid to\nwell-posedness questions of these inverse problems with pointwise\noverdetermination conditions. We present conditions for existence and\nuniqueness of solutions to the problem, display non-uniqueness examples, and,\nin model situations, we give estimates on the number of measurements that allow\ncompletely identify sources and their locations. The results rely on asymptotic\nrepresentations of Green functions of the corresponding elliptic problems with\na parameter. They can be used in constructing new numerical algorithms for\ndetermining a solution.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:06:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pyatkov","Sergey",""],["Neustroeva","Lyubov",""]]}
{"id":"2308.16867","submitter":"Fatemah Ayatollah Zadeh Shirazi","authors":"Fatemah Ayatollah Zadeh Shirazi, Elahe Hakimi, Arezoo Hosseini, Reza\n  Rezavand","title":"Uniformizable functional Alexandroff spaces","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the following text we show that the Alexandroff space $X$ is uniformizable\nif and only if the collection of all smallest neighbourhoods is a partition of\n$X$. Moreover the Alexandroff space $X$ is uniformizable and functional\nAlexandroff ($k-$primal) if and only if the collection of all smallest\nneighbourhoods is a partition of $X$ into its finite subsets.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:08:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shirazi","Fatemah Ayatollah Zadeh",""],["Hakimi","Elahe",""],["Hosseini","Arezoo",""],["Rezavand","Reza",""]]}
{"id":"2308.16868","submitter":"Volker Deringer","authors":"Joe D. Morrow, Chinonso Ugwumadu, David A. Drabold, Stephen R.\n  Elliott, Andrew L. Goodwin, Volker L. Deringer","title":"Understanding defects in amorphous silicon with million-atom simulations\n  and machine learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The structure of amorphous silicon is widely thought of as a\nfourfold-connected random network, and yet it is defective atoms, with fewer or\nmore than four bonds, that make it particularly interesting. Despite many\nattempts to explain such \"dangling-bond\" and \"floating-bond\" defects,\nrespectively, a unified understanding is still missing. Here, we show that\natomistic machine-learning methods can reveal the complex structural and\nenergetic landscape of defects in amorphous silicon. We study an\nultra-large-scale, quantum-accurate structural model containing a million\natoms, and more than ten thousand defects, allowing reliable defect-related\nstatistics to be obtained. We combine structural descriptors and\nmachine-learned local atomic energies to develop a universal classification of\nthe different types of defects in amorphous silicon. The results suggest a\nrevision of the established floating-bond model by showing that\nfivefold-coordinated atoms in amorphous silicon exhibit a wide range of local\nenvironments, and it is shown that fivefold (but not threefold) coordination\ndefects tend to cluster together. Our study provides new insights into one of\nthe most widely studied amorphous solids, and has general implications for\nmodelling and understanding defects in disordered materials beyond silicon\nalone.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:09:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Morrow","Joe D.",""],["Ugwumadu","Chinonso",""],["Drabold","David A.",""],["Elliott","Stephen R.",""],["Goodwin","Andrew L.",""],["Deringer","Volker L.",""]]}
{"id":"2308.16869","submitter":"Joachim Kerner","authors":"Patrizio Bifulco and Joachim Kerner","title":"Some spectral comparison results on infinite quantum graphs","comments":"11 pages, 3 figures, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we establish spectral comparison results for Schr\\\"odinger\noperators on a certain class of infinite quantum graphs, using recent results\nobtained in the finite setting. We also show that new features do appear on\ninfinite quantum graphs such as a modified local Weyl law. In this sense, we\nregard this paper as a starting point for a more thorough investigation of\nspectral comparison results on more general infinite metric graphs.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:09:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bifulco","Patrizio",""],["Kerner","Joachim",""]]}
{"id":"2308.16870","submitter":"Wissam Kontar","authors":"Wissam Kontar, Xinzhi Zhong, Soyoung Ahn","title":"Learning Driver Models for Automated Vehicles via Knowledge Sharing and\n  Personalization","comments":"10 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper describes a framework for learning Automated Vehicles (AVs) driver\nmodels via knowledge sharing between vehicles and personalization. The innate\nvariability in the transportation system makes it exceptionally challenging to\nexpose AVs to all possible driving scenarios during empirical experimentation\nor testing. Consequently, AVs could be blind to certain encounters that are\ndeemed detrimental to their safe and efficient operation. It is then critical\nto share knowledge across AVs that increase exposure to driving scenarios\noccurring in the real world. This paper explores a method to collaboratively\ntrain a driver model by sharing knowledge and borrowing strength across\nvehicles while retaining a personalized model tailored to the vehicle's unique\nconditions and properties. Our model brings a federated learning approach to\ncollaborate between multiple vehicles while circumventing the need to share raw\ndata between them. We showcase our method's performance in experimental\nsimulations. Such an approach to learning finds several applications across\ntransportation engineering including intelligent transportation systems,\ntraffic management, and vehicle-to-vehicle communication. Code and sample\ndataset are made available at the project page https://github.com/wissamkontar.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:18:15 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kontar","Wissam",""],["Zhong","Xinzhi",""],["Ahn","Soyoung",""]]}
{"id":"2308.16871","submitter":"Benjamin Muller","authors":"Benjamin Muller, Belen Alastruey, Prangthip Hansanti, Elahe Kalbassi,\n  Christophe Ropers, Eric Michael Smith, Adina Williams, Luke Zettlemoyer,\n  Pierre Andrews and Marta R. Costa-juss\\`a","title":"The Gender-GAP Pipeline: A Gender-Aware Polyglot Pipeline for Gender\n  Characterisation in 55 Languages","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Gender biases in language generation systems are challenging to mitigate. One\npossible source for these biases is gender representation disparities in the\ntraining and evaluation data. Despite recent progress in documenting this\nproblem and many attempts at mitigating it, we still lack shared methodology\nand tooling to report gender representation in large datasets. Such\nquantitative reporting will enable further mitigation, e.g., via data\naugmentation. This paper describes the Gender-GAP Pipeline (for Gender-Aware\nPolyglot Pipeline), an automatic pipeline to characterize gender representation\nin large-scale datasets for 55 languages. The pipeline uses a multilingual\nlexicon of gendered person-nouns to quantify the gender representation in text.\nWe showcase it to report gender representation in WMT training data and\ndevelopment data for the News task, confirming that current data is skewed\ntowards masculine representation. Having unbalanced datasets may indirectly\noptimize our systems towards outperforming one gender over the others. We\nsuggest introducing our gender quantification pipeline in current datasets and,\nideally, modifying them toward a balanced representation.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:20:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Muller","Benjamin",""],["Alastruey","Belen",""],["Hansanti","Prangthip",""],["Kalbassi","Elahe",""],["Ropers","Christophe",""],["Smith","Eric Michael",""],["Williams","Adina",""],["Zettlemoyer","Luke",""],["Andrews","Pierre",""],["Costa-juss\u00e0","Marta R.",""]]}
{"id":"2308.16872","submitter":"Bhaswati Mookerjea","authors":"Bhaswati Mookerjea (TIFR, Mumbai, India), Goeran Sandell (IofA, Univ\n  of Hawaii), Rolf Guesten (MPIfR, Bonn), Helmut Wiesemeyer (MPIfR, Bonn), Yoko\n  Okada (Uni of Cologne) Karl Jacobs (Uni of Cologne)","title":"Constraining the geometry of the reflection nebula NGC 2023 with [O I]:\n  Emission & Absorption","comments":"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 have mapped the NGC 2023 reflection nebula in the 63 and 145 micron\ntransitions of [O I] and the 158 micron [C II] spectral lines using the\nheterodyne receiver upGREAT on SOFIA. The observations were used to identify\nthe diffuse and dense components of the PDR traced by the [C II] and [O I]\nemission, respectively. The velocity-resolved observations reveal the presence\nof a significant column of low-excitation atomic oxygen, seen in absorption in\nthe [O I] 63 micron spectra, amounting to about 20-60% of the oxygen column\nseen in emission in the [O I] 145 micron spectra. Some self-absorption is also\nseen in [C II], but for the most part it is hardly noticeable. The [C II] and\n[O I] 63 micron spectra show strong red- and blue-shifted wings due to photo\nevaporation flows especially in the southeastern and southern part of the\nreflection nebula, where comparison with the mid- and high-J CO emission\nindicates that the C+ region is expanding into a dense molecular cloud. Using a\ntwo-slab toy model the large-scale self-absorption seen in [O I] 63 micron is\nreadily explained as originating in foreground low-excitation gas associated\nwith the source. Similar columns have also been observed recently in other\nGalactic photon-dominated-regions (PDRs). These results have two implications:\nfor the velocity-unresolved extra-galactic observations this could impact the\nuse of [O I] 63 micron as a tracer of massive star formation and secondly the\nwidespread self-absorption in [O I] 63 micron leads to underestimate of the\ncolumn density of atomic oxygen derived from this tracer and necessitates the\nuse of alternative indirect methods.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:21:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mookerjea","Bhaswati","","TIFR, Mumbai, India"],["Sandell","Goeran","","IofA, Univ\n  of Hawaii"],["Guesten","Rolf","","MPIfR, Bonn"],["Wiesemeyer","Helmut","","MPIfR, Bonn"],["Okada","Yoko","","Uni of Cologne"],["Jacobs","Karl","","Uni of Cologne"]]}
{"id":"2308.16873","submitter":"Jakob G\\\"unther","authors":"Jakob G\\\"unther, Alberto Baiardi, Markus Reiher, Matthias Christandl","title":"More Quantum Chemistry with Fewer Qubits","comments":"59 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.str-el physics.bio-ph physics.chem-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum computation is the most promising new paradigm for the simulation of\nphysical systems composed of electrons and atomic nuclei. An atomistic problem\nin chemistry, solid-state physics, materials science, or molecular biology can\nbe mapped to a representation on a (digital) quantum computer. Any such\nrepresentation will be reduced dimensional as, for instance, accomplished by\nactive-orbital-space approaches. While it is, in principle, obvious how to\nimprove on the representation by including more orbitals, this is usually\nunfeasible in practice (e.g., because of the limited number of qubits available\non a quantum computer) and severely compromises the accuracy of the obtained\nresults. Here, we propose a quantum algorithm that improves on the\nrepresentation of the physical problem by virtue of second-order perturbation\ntheory. In particular, our quantum algorithm evaluates the second-order energy\ncorrection through a series of time-evolution steps under the unperturbed\nHamiltonian ($H$), which allows us to take advantage of an underlying structure\nthat $H$ might have. For multireference perturbation theory, we exploit that\n$H$ is diagonal for virtual orbitals and show that the number of qubits is\nindependent of the number of virtual orbitals. Moreover, our perturbation\ntheory quantum algorithm can be applied to Symmetry-Adapted Perturbation Theory\n(SAPT). Here, we use the fact that $H$ is the sum of two commuting monomer\nHamiltonians, which makes it possible to calculate the full second-order energy\ncorrection of SAPT while only having access to the state of one of the monomers\nat a time. As such, we reduce the quantum hardware requirements for quantum\nchemistry by leveraging perturbation theory.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:21:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["G\u00fcnther","Jakob",""],["Baiardi","Alberto",""],["Reiher","Markus",""],["Christandl","Matthias",""]]}
{"id":"2308.16874","submitter":"Alberto Dionigi","authors":"Alberto Dionigi, Simone Felicioni, Mirko Leomanni, Gabriele Costante","title":"D-VAT: End-to-End Visual Active Tracking for Micro Aerial Vehicles","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 active tracking is a growing research topic in robotics due to its key\nrole in applications such as human assistance, disaster recovery, and\nsurveillance. In contrast to passive tracking, active tracking approaches\ncombine vision and control capabilities to detect and actively track the\ntarget. Most of the work in this area focuses on ground robots, while the very\nfew contributions on aerial platforms still pose important design constraints\nthat limit their applicability. To overcome these limitations, in this paper we\npropose D-VAT, a novel end-to-end visual active tracking methodology based on\ndeep reinforcement learning that is tailored to micro aerial vehicle platforms.\nThe D-VAT agent computes the vehicle thrust and angular velocity commands\nneeded to track the target by directly processing monocular camera\nmeasurements. We show that the proposed approach allows for precise and\ncollision-free tracking operations, outperforming different state-of-the-art\nbaselines on simulated environments which differ significantly from those\nencountered during training.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:21:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dionigi","Alberto",""],["Felicioni","Simone",""],["Leomanni","Mirko",""],["Costante","Gabriele",""]]}
{"id":"2308.16875","submitter":"Neil Dizon","authors":"Neil D. Dizon and Jeffrey A. Hogan","title":"Holistic Processing of Colour Images Using Novel Quaternion-Valued\n  Wavelets on the Plane","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the applicability of quaternion-valued wavelets on the plane\nto holistic colour image processing. We present a methodology for decomposing\nand reconstructing colour images using quaternionic wavelet filters associated\nto recently developed quaternion-valued wavelets on the plane. We consider\ncompression, enhancement, segmentation, and denoising techniques to demonstrate\nquaternion-valued wavelets as a promising tool for holistic colour image\nprocessing.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:22:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Dizon","Neil D.",""],["Hogan","Jeffrey A.",""]]}
{"id":"2308.16876","submitter":"Jiaben Chen","authors":"Jiaben Chen, Huaizu Jiang","title":"SportsSloMo: A New Benchmark and Baselines for Human-centric Video Frame\n  Interpolation","comments":"Project Page: https://neu-vi.github.io/SportsSlomo/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Human-centric video frame interpolation has great potential for improving\npeople's entertainment experiences and finding commercial applications in the\nsports analysis industry, e.g., synthesizing slow-motion videos. Although there\nare multiple benchmark datasets available in the community, none of them is\ndedicated for human-centric scenarios. To bridge this gap, we introduce\nSportsSloMo, a benchmark consisting of more than 130K video clips and 1M video\nframes of high-resolution ($\\geq$720p) slow-motion sports videos crawled from\nYouTube. We re-train several state-of-the-art methods on our benchmark, and the\nresults show a decrease in their accuracy compared to other datasets. It\nhighlights the difficulty of our benchmark and suggests that it poses\nsignificant challenges even for the best-performing methods, as human bodies\nare highly deformable and occlusions are frequent in sports videos. To improve\nthe accuracy, we introduce two loss terms considering the human-aware priors,\nwhere we add auxiliary supervision to panoptic segmentation and human keypoints\ndetection, respectively. The loss terms are model agnostic and can be easily\nplugged into any video frame interpolation approaches. Experimental results\nvalidate the effectiveness of our proposed loss terms, leading to consistent\nperformance improvement over 5 existing models, which establish strong baseline\nmodels on our benchmark. The dataset and code can be found at:\nhttps://neu-vi.github.io/SportsSlomo/.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:23:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Jiaben",""],["Jiang","Huaizu",""]]}
{"id":"2308.16877","submitter":"Zane Fink","authors":"Zane Fink, Konstantinos Parasyris, Giorgis Georgakoudis, Harshitha\n  Menon","title":"HPAC-Offload: Accelerating HPC Applications with Portable Approximate\n  Computing on the GPU","comments":"12 pages, 12 pages. Accepted at SC23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The end of Dennard scaling and the slowdown of Moore's law led to a shift in\ntechnology trends toward parallel architectures, particularly in HPC systems.\nTo continue providing performance benefits, HPC should embrace Approximate\nComputing (AC), which trades application quality loss for improved performance.\nHowever, existing AC techniques have not been extensively applied and evaluated\nin state-of-the-art hardware architectures such as GPUs, the primary execution\nvehicle for HPC applications today.\n  This paper presents HPAC-Offload, a pragma-based programming model that\nextends OpenMP offload applications to support AC techniques, allowing portable\napproximations across different GPU architectures. We conduct a comprehensive\nperformance analysis of HPAC-Offload across GPU-accelerated HPC applications,\nrevealing that AC techniques can significantly accelerate HPC applications\n(1.64x LULESH on AMD, 1.57x NVIDIA) with minimal quality loss (0.1%). Our\nanalysis offers deep insights into the performance of GPU-based AC that guide\nthe future development of AC algorithms and systems for these architectures.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:32:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fink","Zane",""],["Parasyris","Konstantinos",""],["Georgakoudis","Giorgis",""],["Menon","Harshitha",""]]}
{"id":"2308.16878","submitter":"Jing Liu","authors":"Jing Liu, Fangfang Zheng, Boxi Yu, Saif Jabari","title":"On the Role of Non-Localities in Fundamental Diagram Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the role of non-localities in speed-density data used to fit\nfundamental diagrams from vehicle trajectories. We demonstrate that the use of\nanticipated densities results in a clear classification of speed-density data\ninto stationary and non-stationary points, namely, acceleration and\ndeceleration regimes and their separating boundary. The separating boundary\nrepresents a locus of stationary traffic states, i.e., the fundamental diagram.\nTo fit fundamental diagrams, we develop an enhanced cross entropy minimization\nmethod that honors equilibrium traffic physics. We illustrate the effectiveness\nof our proposed approach by comparing it with the traditional approach that\nuses local speed-density states and least squares estimation. Our experiments\nshow that the separating boundary in our approach is invariant to varying\ntrajectory samples within the same spatio-temporal region, providing further\nevidence that the separating boundary is indeed a locus of stationary traffic\nstates.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:36:11 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Jing",""],["Zheng","Fangfang",""],["Yu","Boxi",""],["Jabari","Saif",""]]}
{"id":"2308.16879","submitter":"Chen Zhao","authors":"Yujie Lin, Chen Zhao, Minglai Shao, Xujiang Zhao, Haifeng Chen","title":"Adaptation Speed Analysis for Fairness-aware Causal Models","comments":"CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For example, in machine translation tasks, to achieve bidirectional\ntranslation between two languages, the source corpus is often used as the\ntarget corpus, which involves the training of two models with opposite\ndirections. The question of which one can adapt most quickly to a domain shift\nis of significant importance in many fields. Specifically, consider an original\ndistribution p that changes due to an unknown intervention, resulting in a\nmodified distribution p*. In aligning p with p*, several factors can affect the\nadaptation rate, including the causal dependencies between variables in p. In\nreal-life scenarios, however, we have to consider the fairness of the training\nprocess, and it is particularly crucial to involve a sensitive variable (bias)\npresent between a cause and an effect variable. To explore this scenario, we\nexamine a simple structural causal model (SCM) with a cause-bias-effect\nstructure, where variable A acts as a sensitive variable between cause (X) and\neffect (Y). The two models, respectively, exhibit consistent and contrary\ncause-effect directions in the cause-bias-effect SCM. After conducting unknown\ninterventions on variables within the SCM, we can simulate some kinds of domain\nshifts for analysis. We then compare the adaptation speeds of two models across\nfour shift scenarios. Additionally, we prove the connection between the\nadaptation speeds of the two models across all interventions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:36:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lin","Yujie",""],["Zhao","Chen",""],["Shao","Minglai",""],["Zhao","Xujiang",""],["Chen","Haifeng",""]]}
{"id":"2308.16880","submitter":"Inwoo Hwang","authors":"Inwoo Hwang, Hyeonwoo Kim, Young Min Kim","title":"Text2Scene: Text-driven Indoor Scene Stylization with Part-aware Details","comments":"Accepted to CVPR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose Text2Scene, a method to automatically create realistic textures\nfor virtual scenes composed of multiple objects. Guided by a reference image\nand text descriptions, our pipeline adds detailed texture on labeled 3D\ngeometries in the room such that the generated colors respect the hierarchical\nstructure or semantic parts that are often composed of similar materials.\nInstead of applying flat stylization on the entire scene at a single step, we\nobtain weak semantic cues from geometric segmentation, which are further\nclarified by assigning initial colors to segmented parts. Then we add texture\ndetails for individual objects such that their projections on image space\nexhibit feature embedding aligned with the embedding of the input. The\ndecomposition makes the entire pipeline tractable to a moderate amount of\ncomputation resources and memory. As our framework utilizes the existing\nresources of image and text embedding, it does not require dedicated datasets\nwith high-quality textures designed by skillful artists. To the best of our\nknowledge, it is the first practical and scalable approach that can create\ndetailed and realistic textures of the desired style that maintain structural\ncontext for scenes with multiple objects.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:37:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Hwang","Inwoo",""],["Kim","Hyeonwoo",""],["Kim","Young Min",""]]}
{"id":"2308.16881","submitter":"Pedro Miguel Campos","authors":"Pedro Miguel Campos, Jos\\'e Francisco Rodrigues","title":"On fractional and classical hyperbolic obstacle-type problems","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider weak solutions for the obstacle-type viscoelastic ($\\nu>0$) and\nvery weak solutions for the obstacle inviscid ($\\nu=0$) Dirichlet problems for\nthe heterogeneous and anisotropic wave equation in a fractional framework based\non the Riesz fractional gradient $D^s$ ($0<s<1$). We use weak solutions of the\nviscous problem to obtain very weak solutions of the inviscid problem when\n$\\nu\\searrow 0$. We prove that the weak and very weak solutions of those\nproblems in the fractional setting converge as $s\\nearrow 1$ to a weak solution\nand to a very weak solution, respectively, of the correspondent problems in the\nclassical framework.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:37:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Campos","Pedro Miguel",""],["Rodrigues","Jos\u00e9 Francisco",""]]}
{"id":"2308.16882","submitter":"Chaojin Qing","authors":"Chaojin Qing, Zilong Wang, Qing Ye, Wenhui Liu, and Linsi He","title":"Amplitude Prediction from Uplink to Downlink CSI against Receiver\n  Distortion in FDD Systems","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In frequency division duplex (FDD) massive multiple-input multiple-output\n(mMIMO) systems, the reciprocity mismatch caused by receiver distortion\nseriously degrades the amplitude prediction performance of channel state\ninformation (CSI). To tackle this issue, from the perspective of distortion\nsuppression and reciprocity calibration, a lightweight neural network-based\namplitude prediction method is proposed in this paper. Specifically, with the\nreceiver distortion at the base station (BS), conventional methods are employed\nto extract the amplitude feature of uplink CSI. Then, learning along the\ndirection of the uplink wireless propagation channel, a dedicated and\nlightweight distortion-learning network (Dist-LeaNet) is designed to restrain\nthe receiver distortion and calibrate the amplitude reciprocity between the\nuplink and downlink CSI. Subsequently, by cascading, a single hidden\nlayer-based amplitude-prediction network (Amp-PreNet) is developed to\naccomplish amplitude prediction of downlink CSI based on the strong amplitude\nreciprocity. Simulation results show that, considering the receiver distortion\nin FDD systems, the proposed scheme effectively improves the amplitude\nprediction accuracy of downlink CSI while reducing the transmission and\nprocessing delay.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:39:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Qing","Chaojin",""],["Wang","Zilong",""],["Ye","Qing",""],["Liu","Wenhui",""],["He","Linsi",""]]}
{"id":"2308.16883","submitter":"Margarita Safonova Dr.","authors":"Olag Pratim Bordoloi (1), Yuri A. Shchekinov (2), P. Shalima (3), M.\n  Safonova (4) and Rupjyoti Gogoi (1) ((1) Tezpur University, Napaam, Assam,\n  India, (2) Raman Research Institute, Bengaluru, India, (3) Manipal Centre for\n  Natural Sciences, Centre of Excellence, Manipal Academy of Higher Education,\n  Manipal, Karnataka, India, (4) Indian Institute of Astrophysics, Bengaluru,\n  India)","title":"Unravelling multi-temperature dust populations in the dwarf galaxy\n  Holmberg II","comments":"7 pages, 4 figures, submitted to Letters to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Holmberg II - a dwarf galaxy in the nearby M81 group - is a very informative\nsource of distribution of gas and dust in the interstellar discs.\nHigh-resolution observations in the infrared (IR) allows us to distinguish\nisolated star-forming regions, photodissociation (PDR) and HII regions,\nremnants of supernovae (SNe) explosions and, as such, can provide information\nabout more relevant physical processes. In this paper we analyse dust emission\nin the wavelength range 4.5 to 160 micron using the data from IR space\nobservatories at 27 different locations across the galaxy. We observe that the\nderived spectra can be represented by multiple dust populations with different\ntemperatures, which are found to be independent of their locations in the\ngalaxy. By comparing the dust temperatures with the far ultraviolet (FUV)\nintensities observed by the UVIT instrument onboard AstroSat, we find that for\nlocations showing a 100 micron peak, the temperature of cold (20 to 30 K) dust\ngrains show a dependence on the FUV intensities, while such dependence is not\nobserved for the other locations. We believe that the approach described here\ncan be a good tool in revealing different dust populations in other nearby\ngalaxies with available high spatial resolution data.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:40:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bordoloi","Olag Pratim",""],["Shchekinov","Yuri A.",""],["Shalima","P.",""],["Safonova","M.",""],["Gogoi","Rupjyoti",""]]}
{"id":"2308.16884","submitter":"Lucas Bandarkar","authors":"Lucas Bandarkar, Davis Liang, Benjamin Muller, Mikel Artetxe, Satya\n  Narayan Shukla, Donald Husa, Naman Goyal, Abhinandan Krishnan, Luke\n  Zettlemoyer, Madian Khabsa","title":"The Belebele Benchmark: a Parallel Reading Comprehension Dataset in 122\n  Language Variants","comments":"27 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present Belebele, a multiple-choice machine reading comprehension (MRC)\ndataset spanning 122 language variants. Significantly expanding the language\ncoverage of natural language understanding (NLU) benchmarks, this dataset\nenables the evaluation of text models in high-, medium-, and low-resource\nlanguages. Each question is based on a short passage from the Flores-200\ndataset and has four multiple-choice answers. The questions were carefully\ncurated to discriminate between models with different levels of general\nlanguage comprehension. The English dataset on its own proves difficult enough\nto challenge state-of-the-art language models. Being fully parallel, this\ndataset enables direct comparison of model performance across all languages. We\nuse this dataset to evaluate the capabilities of multilingual masked language\nmodels (MLMs) and large language models (LLMs). We present extensive results\nand find that despite significant cross-lingual transfer in English-centric\nLLMs, much smaller MLMs pretrained on balanced multilingual data still\nunderstand far more languages. We also observe that larger vocabulary size and\nconscious vocabulary construction correlate with better performance on\nlow-resource languages. Overall, Belebele opens up new avenues for evaluating\nand analyzing the multilingual capabilities of NLP systems.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:43:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bandarkar","Lucas",""],["Liang","Davis",""],["Muller","Benjamin",""],["Artetxe","Mikel",""],["Shukla","Satya Narayan",""],["Husa","Donald",""],["Goyal","Naman",""],["Krishnan","Abhinandan",""],["Zettlemoyer","Luke",""],["Khabsa","Madian",""]]}
{"id":"2308.16885","submitter":"James Davies","authors":"James Davies","title":"Chromatic number of spacetime","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math-ph math.MG math.MP math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that every finite colouring of $\\mathbb{Q}^3 \\subset \\mathbb{R}^3$\ncontains a monochromatic pair of points $(x,y,z),(x',y',z')$ with $(x-x')^2 +\n(y-y')^2 - (z-z')^2 = 1$.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:44:12 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Davies","James",""]]}
{"id":"2308.16886","submitter":"Ludwig Schneider","authors":"Hyun Park, Boyuan Yu, Juhae Park, Ge Sun, Emad Tajkhorshid, Juan J. de\n  Pablo, and Ludwig Schneider","title":"Prediction of Diblock Copolymer Morphology via Machine Learning","comments":"51 page, 11 Figures and 5 figures in the SI","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A machine learning approach is presented to accelerate the computation of\nblock polymer morphology evolution for large domains over long timescales. The\nstrategy exploits the separation of characteristic times between coarse-grained\nparticle evolution on the monomer scale and slow morphological evolution over\nmesoscopic scales. In contrast to empirical continuum models, the proposed\napproach learns stochastically driven defect annihilation processes directly\nfrom particle-based simulations. A UNet architecture that respects different\nboundary conditions is adopted, thereby allowing periodic and fixed substrate\nboundary conditions of arbitrary shape. Physical concepts are also introduced\nvia the loss function and symmetries are incorporated via data augmentation.\nThe model is validated using three different use cases. Explainable artificial\nintelligence methods are applied to visualize the morphology evolution over\ntime. This approach enables the generation of large system sizes and long\ntrajectories to investigate defect densities and their evolution under\ndifferent types of confinement. As an application, we demonstrate the\nimportance of accessing late-stage morphologies for understanding particle\ndiffusion inside a single block. This work has implications for directed\nself-assembly and materials design in micro-electronics, battery materials, and\nmembranes.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:45:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Park","Hyun",""],["Yu","Boyuan",""],["Park","Juhae",""],["Sun","Ge",""],["Tajkhorshid","Emad",""],["de Pablo","Juan J.",""],["Schneider","Ludwig",""]]}
{"id":"2308.16887","submitter":"Rui-Qing Xiao","authors":"John Ellis, Hong-Jian He, Rui-Qing Xiao","title":"Probing Neutral Triple Gauge Couplings with $Z^* \\gamma\\, (\\nu \\bar \\nu\n  \\gamma)$ Production at Hadron Colliders","comments":null,"journal-ref":null,"doi":null,"report-no":"KCL-PH-TH/2023-39, CERN-TH-2023-129","categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study probes of neutral triple gauge couplings (nTGCs) via $Z^*\\gamma$\nproduction followed by off-shell decays $Z^*\\to\\nu\\bar{\\nu}$ at the LHC and\nfuture $pp$ colliders, including both CP-conserving (CPC) and CP-violating\n(CPV) couplings. We present the dimension-8 SMEFT operators contributing to\nnTGCs and derive the correct form factor formulation for the off-shell vertices\n$Z^*\\gamma V^*$ ($V=Z,\\gamma$) by matching them with the dimension-8 SMEFT\noperators. Our analysis includes new contributions enhanced by the large\noff-shell momentum of $Z^*$, beyond those of the conventional $Z\\gamma V^*$\nvertices with on-shell $Z\\gamma$. We analyze the sensitivity reaches for\nprobing the CPC/CPV nTGC form factors and the new physics scales of the\ndimension-8 nTGC operators at the LHC and future 100TeV $pp$ colliders. We also\ncompare our predictions with the existing LHC measurements of CPC nTGCs in the\n$\\nu\\bar{\\nu}\\gamma$ channel.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:49:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ellis","John",""],["He","Hong-Jian",""],["Xiao","Rui-Qing",""]]}
{"id":"2308.16888","submitter":"Airton Deppman Dr.","authors":"Rafael P. Baptista, Lucas Q. Rocha, D. P. Menezes, Luis A. Trevisan,\n  Constantino Tsallis and Airton Deppman","title":"Evidence of fractal structures in hadrons","comments":"23 pages, 11 figures, supplementary material","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study focuses on the presence of (multi)fractal structures in confined\nhadronic matter through the momentum distributions of mesons produced in\nproton-proton collisions between 23 GeV and 63 GeV. The analysis demonstrates\nthat the $q$-exponential behaviour of the particle momentum distributions is\nconsistent with fractal characteristics, exhibiting fractal structures in\nconfined hadronic matter with features similar to those observed in the\ndeconfined quark-gluon plasma (QGP) regime. Furthermore, the systematic\nanalysis of meson production in hadronic collisions at energies below 1 TeV\nsuggests that specific fractal parameters are universal, independently of\nconfinement or deconfinement, while others may be influenced by the quark\ncontent of the produced meson. These results pave the way for further research\nexploring the implications of fractal structures on various physical\ndistributions and offer insights into the nature of the phase transition\nbetween confined and deconfined regimes.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:49:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Baptista","Rafael P.",""],["Rocha","Lucas Q.",""],["Menezes","D. P.",""],["Trevisan","Luis A.",""],["Tsallis","Constantino",""],["Deppman","Airton",""]]}
{"id":"2308.16889","submitter":"Mariam Yahya","authors":"Mariam Yahya, Setareh Maghsudi, and Slawomir Stanczak","title":"Federated Learning in UAV-Enhanced Networks: Joint Coverage and\n  Convergence Time Optimization","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":"  Federated learning (FL) involves several devices that collaboratively train a\nshared model without transferring their local data. FL reduces the\ncommunication overhead, making it a promising learning method in UAV-enhanced\nwireless networks with scarce energy resources. Despite the potential,\nimplementing FL in UAV-enhanced networks is challenging, as conventional UAV\nplacement methods that maximize coverage increase the FL delay significantly.\nMoreover, the uncertainty and lack of a priori information about crucial\nvariables, such as channel quality, exacerbate the problem. In this paper, we\nfirst analyze the statistical characteristics of a UAV-enhanced wireless sensor\nnetwork (WSN) with energy harvesting. We then develop a model and solution\nbased on the multi-objective multi-armed bandit theory to maximize the network\ncoverage while minimizing the FL delay. Besides, we propose another solution\nthat is particularly useful with large action sets and strict energy\nconstraints at the UAVs. Our proposal uses a scalarized best-arm identification\nalgorithm to find the optimal arms that maximize the ratio of the expected\nreward to the expected energy cost by sequentially eliminating one or more arms\nin each round. Then, we derive the upper bound on the error probability of our\nmulti-objective and cost-aware algorithm. Numerical results show the\neffectiveness of our approach.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:50:54 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yahya","Mariam",""],["Maghsudi","Setareh",""],["Stanczak","Slawomir",""]]}
{"id":"2308.16890","submitter":"Shuai Bai","authors":"Shuai Bai, Shusheng Yang, Jinze Bai, Peng Wang, Xingxuan Zhang,\n  Junyang Lin, Xinggang Wang, Chang Zhou, Jingren Zhou","title":"TouchStone: Evaluating Vision-Language Models by Language Models","comments":"https://github.com/OFA-Sys/TouchStone","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large vision-language models (LVLMs) have recently witnessed rapid\nadvancements, exhibiting a remarkable capacity for perceiving, understanding,\nand processing visual information by connecting visual receptor with large\nlanguage models (LLMs). However, current assessments mainly focus on\nrecognizing and reasoning abilities, lacking direct evaluation of\nconversational skills and neglecting visual storytelling abilities. In this\npaper, we propose an evaluation method that uses strong LLMs as judges to\ncomprehensively evaluate the various abilities of LVLMs. Firstly, we construct\na comprehensive visual dialogue dataset TouchStone, consisting of open-world\nimages and questions, covering five major categories of abilities and 27\nsubtasks. This dataset not only covers fundamental recognition and\ncomprehension but also extends to literary creation. Secondly, by integrating\ndetailed image annotations we effectively transform the multimodal input\ncontent into a form understandable by LLMs. This enables us to employ advanced\nLLMs for directly evaluating the quality of the multimodal dialogue without\nrequiring human intervention. Through validation, we demonstrate that powerful\nLVLMs, such as GPT-4, can effectively score dialogue quality by leveraging\ntheir textual capabilities alone, aligning with human preferences. We hope our\nwork can serve as a touchstone for LVLMs' evaluation and pave the way for\nbuilding stronger LVLMs. The evaluation code is available at\nhttps://github.com/OFA-Sys/TouchStone.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:52:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bai","Shuai",""],["Yang","Shusheng",""],["Bai","Jinze",""],["Wang","Peng",""],["Zhang","Xingxuan",""],["Lin","Junyang",""],["Wang","Xinggang",""],["Zhou","Chang",""],["Zhou","Jingren",""]]}
{"id":"2308.16891","submitter":"Yanjie Ze","authors":"Yanjie Ze, Ge Yan, Yueh-Hua Wu, Annabella Macaluso, Yuying Ge,\n  Jianglong Ye, Nicklas Hansen, Li Erran Li, Xiaolong Wang","title":"GNFactor: Multi-Task Real Robot Learning with Generalizable Neural\n  Feature Fields","comments":"CoRL 2023 Oral. Website: https://yanjieze.com/GNFactor/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is a long-standing problem in robotics to develop agents capable of\nexecuting diverse manipulation tasks from visual observations in unstructured\nreal-world environments. To achieve this goal, the robot needs to have a\ncomprehensive understanding of the 3D structure and semantics of the scene. In\nthis work, we present $\\textbf{GNFactor}$, a visual behavior cloning agent for\nmulti-task robotic manipulation with $\\textbf{G}$eneralizable $\\textbf{N}$eural\nfeature $\\textbf{F}$ields. GNFactor jointly optimizes a generalizable neural\nfield (GNF) as a reconstruction module and a Perceiver Transformer as a\ndecision-making module, leveraging a shared deep 3D voxel representation. To\nincorporate semantics in 3D, the reconstruction module utilizes a\nvision-language foundation model ($\\textit{e.g.}$, Stable Diffusion) to distill\nrich semantic information into the deep 3D voxel. We evaluate GNFactor on 3\nreal robot tasks and perform detailed ablations on 10 RLBench tasks with a\nlimited number of demonstrations. We observe a substantial improvement of\nGNFactor over current state-of-the-art methods in seen and unseen tasks,\ndemonstrating the strong generalization ability of GNFactor. Our project\nwebsite is https://yanjieze.com/GNFactor/ .\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:52:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ze","Yanjie",""],["Yan","Ge",""],["Wu","Yueh-Hua",""],["Macaluso","Annabella",""],["Ge","Yuying",""],["Ye","Jianglong",""],["Hansen","Nicklas",""],["Li","Li Erran",""],["Wang","Xiaolong",""]]}
{"id":"2308.16892","submitter":"Yi Luo","authors":"Rongzhi Gu, Yi Luo","title":"ReZero: Region-customizable Sound Extraction","comments":"13 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.AI cs.SD","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We introduce region-customizable sound extraction (ReZero), a general and\nflexible framework for the multi-channel region-wise sound extraction (R-SE)\ntask. R-SE task aims at extracting all active target sounds (e.g., human\nspeech) within a specific, user-defined spatial region, which is different from\nconventional and existing tasks where a blind separation or a fixed, predefined\nspatial region are typically assumed. The spatial region can be defined as an\nangular window, a sphere, a cone, or other geometric patterns. Being a solution\nto the R-SE task, the proposed ReZero framework includes (1) definitions of\ndifferent types of spatial regions, (2) methods for region feature extraction\nand aggregation, and (3) a multi-channel extension of the band-split RNN\n(BSRNN) model specified for the R-SE task. We design experiments for different\nmicrophone array geometries, different types of spatial regions, and\ncomprehensive ablation studies on different system configurations. Experimental\nresults on both simulated and real-recorded data demonstrate the effectiveness\nof ReZero. Demos are available at https://innerselfm.github.io/rezero/.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:53:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Gu","Rongzhi",""],["Luo","Yi",""]]}
{"id":"2308.16893","submitter":"Amber Xie","authors":"Amber Xie, Youngwoon Lee, Pieter Abbeel, Stephen James","title":"Language-Conditioned Path Planning","comments":"Conference on Robot Learning, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Contact is at the core of robotic manipulation. At times, it is desired (e.g.\nmanipulation and grasping), and at times, it is harmful (e.g. when avoiding\nobstacles). However, traditional path planning algorithms focus solely on\ncollision-free paths, limiting their applicability in contact-rich tasks. To\naddress this limitation, we propose the domain of Language-Conditioned Path\nPlanning, where contact-awareness is incorporated into the path planning\nproblem. As a first step in this domain, we propose Language-Conditioned\nCollision Functions (LACO) a novel approach that learns a collision function\nusing only a single-view image, language prompt, and robot configuration. LACO\npredicts collisions between the robot and the environment, enabling flexible,\nconditional path planning without the need for manual object annotations, point\ncloud data, or ground-truth object meshes. In both simulation and the real\nworld, we demonstrate that LACO can facilitate complex, nuanced path plans that\nallow for interaction with objects that are safe to collide, rather than\nprohibiting any collision.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:56:13 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xie","Amber",""],["Lee","Youngwoon",""],["Abbeel","Pieter",""],["James","Stephen",""]]}
{"id":"2308.16894","submitter":"Manuel Kaufmann","authors":"Manuel Kaufmann, Jie Song, Chen Guo, Kaiyue Shen, Tianjian Jiang,\n  Chengcheng Tang, Juan Zarate, Otmar Hilliges","title":"EMDB: The Electromagnetic Database of Global 3D Human Pose and Shape in\n  the Wild","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present EMDB, the Electromagnetic Database of Global 3D Human Pose and\nShape in the Wild. EMDB is a novel dataset that contains high-quality 3D SMPL\npose and shape parameters with global body and camera trajectories for\nin-the-wild videos. We use body-worn, wireless electromagnetic (EM) sensors and\na hand-held iPhone to record a total of 58 minutes of motion data, distributed\nover 81 indoor and outdoor sequences and 10 participants. Together with\naccurate body poses and shapes, we also provide global camera poses and body\nroot trajectories. To construct EMDB, we propose a multi-stage optimization\nprocedure, which first fits SMPL to the 6-DoF EM measurements and then refines\nthe poses via image observations. To achieve high-quality results, we leverage\na neural implicit avatar model to reconstruct detailed human surface geometry\nand appearance, which allows for improved alignment and smoothness via a dense\npixel-level objective. Our evaluations, conducted with a multi-view volumetric\ncapture system, indicate that EMDB has an expected accuracy of 2.3 cm\npositional and 10.6 degrees angular error, surpassing the accuracy of previous\nin-the-wild datasets. We evaluate existing state-of-the-art monocular RGB\nmethods for camera-relative and global pose estimation on EMDB. EMDB is\npublicly available under https://ait.ethz.ch/emdb\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:56:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kaufmann","Manuel",""],["Song","Jie",""],["Guo","Chen",""],["Shen","Kaiyue",""],["Jiang","Tianjian",""],["Tang","Chengcheng",""],["Zarate","Juan",""],["Hilliges","Otmar",""]]}
{"id":"2308.16895","submitter":"Leindert A. Boogaard","authors":"Leindert A. Boogaard, Steven Gillman, Jens Melinder, Fabian Walter,\n  Luis Colina, G\\\"oran \\\"Ostlin, Karina I. Caputi, Edoardo Iani, Pablo\n  P\\'erez-Gonz\\'alez, Paul van der Werf, Thomas R. Greve, Gillian Wright,\n  Almudena Alonso-Herrero, Javier \\'Alvarez-M\\'arquez, Marianna Annunziatella,\n  Arjan Bik, Sarah Bosman, Luca Costantin, Alejandro Crespo G\\'omez, Dan\n  Dicken, Andreas Eckart, Jens Hjorth, Iris Jermann, Alvaro Labiano, Danial\n  Langeroodi, Romain A. Meyer, Florian Pei{\\ss}ker, John P. Pye, Pierluigi\n  Rinaldi, Tuomo V. Tikkanen, Martin Topinka, Thomas Henning","title":"MIDIS: JWST/MIRI reveals the Stellar Structure of ALMA-selected Galaxies\n  in the Hubble-UDF at Cosmic Noon","comments":"19 pages, 10 figures, 1 table, submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present deep James Webb Space Telescope (JWST)/MIRI F560W observations of\na flux-limited, ALMA-selected sample of 28 galaxies at z=0.5-3.6 in the Hubble\nUltra Deep Field (HUDF). The data from the MIRI Deep Imaging Survey (MIDIS)\nreveal the stellar structure of the HUDF galaxies at rest-wavelengths of >1\nmicron for the first time. We revise the stellar mass estimates using new JWST\nphotometry and find good agreement with pre-JWST analysis; the few\ndiscrepancies can be explained by blending issues in the earlier\nlower-resolution Spitzer data. At z~2.5, the resolved rest-frame near-infrared\n(1.6 micron) structure of the galaxies is significantly more smooth and\ncentrally concentrated than seen by HST at rest-frame 450 nm (F160W), with\neffective radii of Re(F560W)=1-5 kpc and S\\'ersic indices mostly close to an\nexponential (disk-like) profile (n~1), up to n~5 (excluding AGN). We find an\naverage size ratio of Re(F560W)/Re(F160W)~0.7 that decreases with stellar mass.\nThe stellar structure of the ALMA-selected galaxies is indistinguishable from a\nHUDF reference sample of galaxies with comparable MIRI flux density. We\nsupplement our analysis with custom-made, position-dependent, empirical PSF\nmodels for the F560W observations. The results imply that an older and smoother\nstellar structure is in place in massive gas-rich, star-forming galaxies at\nCosmic Noon, despite a more clumpy rest-frame optical appearance, placing\nadditional constraints on galaxy formation simulations. As a next step,\nmatched-resolution, resolved ALMA observations will be crucial to further link\nthe mass- and light-weighted galaxy structures to the dusty interstellar\nmedium.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:57:04 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Boogaard","Leindert A.",""],["Gillman","Steven",""],["Melinder","Jens",""],["Walter","Fabian",""],["Colina","Luis",""],["\u00d6stlin","G\u00f6ran",""],["Caputi","Karina I.",""],["Iani","Edoardo",""],["P\u00e9rez-Gonz\u00e1lez","Pablo",""],["van der Werf","Paul",""],["Greve","Thomas R.",""],["Wright","Gillian",""],["Alonso-Herrero","Almudena",""],["\u00c1lvarez-M\u00e1rquez","Javier",""],["Annunziatella","Marianna",""],["Bik","Arjan",""],["Bosman","Sarah",""],["Costantin","Luca",""],["G\u00f3mez","Alejandro Crespo",""],["Dicken","Dan",""],["Eckart","Andreas",""],["Hjorth","Jens",""],["Jermann","Iris",""],["Labiano","Alvaro",""],["Langeroodi","Danial",""],["Meyer","Romain A.",""],["Pei\u00dfker","Florian",""],["Pye","John P.",""],["Rinaldi","Pierluigi",""],["Tikkanen","Tuomo V.",""],["Topinka","Martin",""],["Henning","Thomas",""]]}
{"id":"2308.16896","submitter":"Wenzhao Zheng","authors":"Sicheng Zuo, Wenzhao Zheng, Yuanhui Huang, Jie Zhou, Jiwen Lu","title":"PointOcc: Cylindrical Tri-Perspective View for Point-based 3D Semantic\n  Occupancy Prediction","comments":"Code is available at https://github.com/wzzheng/PointOcc","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":"  Semantic segmentation in autonomous driving has been undergoing an evolution\nfrom sparse point segmentation to dense voxel segmentation, where the objective\nis to predict the semantic occupancy of each voxel in the concerned 3D space.\nThe dense nature of the prediction space has rendered existing efficient\n2D-projection-based methods (e.g., bird's eye view, range view, etc.)\nineffective, as they can only describe a subspace of the 3D scene. To address\nthis, we propose a cylindrical tri-perspective view to represent point clouds\neffectively and comprehensively and a PointOcc model to process them\nefficiently. Considering the distance distribution of LiDAR point clouds, we\nconstruct the tri-perspective view in the cylindrical coordinate system for\nmore fine-grained modeling of nearer areas. We employ spatial group pooling to\nmaintain structural details during projection and adopt 2D backbones to\nefficiently process each TPV plane. Finally, we obtain the features of each\npoint by aggregating its projected features on each of the processed TPV planes\nwithout the need for any post-processing. Extensive experiments on both 3D\noccupancy prediction and LiDAR segmentation benchmarks demonstrate that the\nproposed PointOcc achieves state-of-the-art performance with much faster speed.\nSpecifically, despite only using LiDAR, PointOcc significantly outperforms all\nother methods, including multi-modal methods, with a large margin on the\nOpenOccupancy benchmark. Code: https://github.com/wzzheng/PointOcc.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:57:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zuo","Sicheng",""],["Zheng","Wenzhao",""],["Huang","Yuanhui",""],["Zhou","Jie",""],["Lu","Jiwen",""]]}
{"id":"2308.16897","submitter":"Marco Ardu","authors":"Marco Ardu, Sacha Davidson, St\\'ephane Lavignac","title":"Distinguishing models with $\\mu \\to e $ observables","comments":"14 pages, 7 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Upcoming experiments will improve the reach for the lepton flavour violating\n(LFV) processes $\\mu \\to e \\gamma$, $\\mu \\to e \\bar{e} e$ and $\\mu A \\to e A$\nby orders of magnitude. We investigate whether this upcoming data could rule\nout some popular TeV-scale LFV models (the type II seesaw, the inverse seesaw\nand a scalar leptoquark) using a bottom-up EFT approach involving twelve Wilson\ncoefficients that can in principle all be determined by experimental\nmeasurements. In this 12-dimensional coefficient space, each model can only\npredict points in a specific subspace; for instance, flavour change involving\nsinglet electrons is suppressed in the seesaw models, and the leptoquark\ninduces negligible coefficients for 4-lepton scalar operators. Using the fact\nthat none of these models can populate the whole region accessible to upcoming\nexperiments, we show that $\\mu \\to e$ experiments have the ability to rule them\nout.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:57:43 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ardu","Marco",""],["Davidson","Sacha",""],["Lavignac","St\u00e9phane",""]]}
{"id":"2308.16898","submitter":"Yingcong Li","authors":"Davoud Ataee Tarzanagh, Yingcong Li, Christos Thrampoulidis, Samet\n  Oymak","title":"Transformers as Support Vector Machines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Since its inception in \"Attention Is All You Need\", transformer architecture\nhas led to revolutionary advancements in NLP. The attention layer within the\ntransformer admits a sequence of input tokens $X$ and makes them interact\nthrough pairwise similarities computed as softmax$(XQK^\\top X^\\top)$, where\n$(K,Q)$ are the trainable key-query parameters. In this work, we establish a\nformal equivalence between the optimization geometry of self-attention and a\nhard-margin SVM problem that separates optimal input tokens from non-optimal\ntokens using linear constraints on the outer-products of token pairs. This\nformalism allows us to characterize the implicit bias of 1-layer transformers\noptimized with gradient descent: (1) Optimizing the attention layer with\nvanishing regularization, parameterized by $(K,Q)$, converges in direction to\nan SVM solution minimizing the nuclear norm of the combined parameter\n$W=KQ^\\top$. Instead, directly parameterizing by $W$ minimizes a Frobenius norm\nobjective. We characterize this convergence, highlighting that it can occur\ntoward locally-optimal directions rather than global ones. (2) Complementing\nthis, we prove the local/global directional convergence of gradient descent\nunder suitable geometric conditions. Importantly, we show that\nover-parameterization catalyzes global convergence by ensuring the feasibility\nof the SVM problem and by guaranteeing a benign optimization landscape devoid\nof stationary points. (3) While our theory applies primarily to linear\nprediction heads, we propose a more general SVM equivalence that predicts the\nimplicit bias with nonlinear heads. Our findings are applicable to arbitrary\ndatasets and their validity is verified via experiments. We also introduce\nseveral open problems and research directions. We believe these findings\ninspire the interpretation of transformers as a hierarchy of SVMs that\nseparates and selects optimal tokens.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:57:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tarzanagh","Davoud Ataee",""],["Li","Yingcong",""],["Thrampoulidis","Christos",""],["Oymak","Samet",""]]}
{"id":"2308.16899","submitter":"Mehdi Behroozi","authors":"Reyhaneh Mohammadi and Mehdi Behroozi","title":"A Divide and Conquer Approximation Algorithm for Partitioning Rectangles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a rectangle $R$ with area $A$ and a set of areas $L=\\{A_1,...,A_n\\}$\nwith $\\sum_{i=1}^n A_i = A$, we consider the problem of partitioning $R$ into\n$n$ sub-regions $R_1,...,R_n$ with areas $A_1,...,A_n$ in a way that the total\nperimeter of all sub-regions is minimized. The goal is to create square-like\nsub-regions, which are often more desired. We propose a divide and conquer\nalgorithm for this problem that finds factor $1.2$--approximate solutions in\n$\\mathcal{O}(n\\log n)$ time.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:58:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Mohammadi","Reyhaneh",""],["Behroozi","Mehdi",""]]}
{"id":"2308.16900","submitter":"Thoranna Bender","authors":"Thoranna Bender, Simon M{\\o}e S{\\o}rensen, Alireza Kashani, K. Eldjarn\n  Hjorleifsson, Grethe Hyldig, S{\\o}ren Hauberg, Serge Belongie and Frederik\n  Warburg","title":"Learning to Taste: A Multimodal Wine Dataset","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 present WineSensed, a large multimodal wine dataset for studying the\nrelations between visual perception, language, and flavor. The dataset\nencompasses 897k images of wine labels and 824k reviews of wines curated from\nthe Vivino platform. It has over 350k unique vintages, annotated with year,\nregion, rating, alcohol percentage, price, and grape composition. We obtained\nfine-grained flavor annotations on a subset by conducting a wine-tasting\nexperiment with 256 participants who were asked to rank wines based on their\nsimilarity in flavor, resulting in more than 5k pairwise flavor distances. We\npropose a low-dimensional concept embedding algorithm that combines human\nexperience with automatic machine similarity kernels. We demonstrate that this\nshared concept embedding space improves upon separate embedding spaces for\ncoarse flavor classification (alcohol percentage, country, grape, price,\nrating) and aligns with the intricate human perception of flavor.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:58:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bender","Thoranna",""],["S\u00f8rensen","Simon M\u00f8e",""],["Kashani","Alireza",""],["Hjorleifsson","K. Eldjarn",""],["Hyldig","Grethe",""],["Hauberg","S\u00f8ren",""],["Belongie","Serge",""],["Warburg","Frederik",""]]}
{"id":"2308.16901","submitter":"CaiChang Li","authors":"Cai-Chang Li, Gui-Jun Ding","title":"Eclectic flavor group $\\Delta(27)\\rtimes S_3$ and lepton model building","comments":"33 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have performed a systematical study of the eclectic flavor group\n$\\Delta(27)\\rtimes S_3$ which is the extension of the traditional flavor\nsymmetry $\\Delta(27)$ by the modular symmetry group $S_3$. Consistency between\n$\\Delta(27)$ and $S_3$ requires that the eight nontrivial singlet\nrepresentations of $\\Delta(27)$ should be arranged into four reducible\ndoublets. The modular transformation matrices are determined for various\n$\\Delta(27)$ multiplets, and the generalized CP symmetry compatible with\n$\\Delta(27)\\rtimes S_3$ are discussed. We study the general form of the\nK\\\"ahler potential and superpotential invariant under $\\Delta(27)\\rtimes S_3$,\nand the corresponding fermion mass matrices are presented. We propose a\nbottom-up model for lepton masses and mixing based on $\\Delta(27)\\rtimes\nS_{3}$, a numerical analysis is performed and the experimental data can be\naccommodated.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:58:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Li","Cai-Chang",""],["Ding","Gui-Jun",""]]}
{"id":"2308.16902","submitter":"Joachim Neu","authors":"Joachim Neu, Ertem Nusret Tas, David Tse","title":"Accountable Safety Implies Finality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by proof-of-stake (PoS) blockchains such as Ethereum, two key\ndesiderata have recently been studied for Byzantine-fault tolerant (BFT)\nstate-machine replication (SMR) consensus protocols: Finality means that the\nprotocol retains consistency, as long as less than a certain fraction of\nvalidators are malicious, even in partially-synchronous environments that allow\nfor temporary violations of assumed network delay bounds. Accountable safety\nmeans that in any case of inconsistency, a certain fraction of validators can\nbe identified to have provably violated the protocol. Earlier works have\ndeveloped impossibility results and protocol constructions for these properties\nseparately. We show that accountable safety implies finality, thereby unifying\nearlier results.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:58:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Neu","Joachim",""],["Tas","Ertem Nusret",""],["Tse","David",""]]}
{"id":"2308.16903","submitter":"Claudia Cornella","authors":"Claudia Cornella, Anne Mareike Galda, Matthias Neubert, Daniel Wyler","title":"$K^-\\to\\pi^- a$ at Next-to-Leading Order in Chiral Perturbation Theory","comments":"35 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The weak decay $K^-\\to\\pi^- a$ is a powerful probe of axion-like particles\n(ALPs). In this work, we provide a comprehensive analysis of this process\nwithin chiral perturbation theory, extending existing calculations by including\ncomplete next-to-leading order (NLO) contributions and isospin-breaking\ncorrections at first order in $(m_u-m_d)$. We show that the consistent\nincorporation of ALPs in the QCD and weak chiral Lagrangians requires a\nnon-trivial extension of the corresponding operator bases, which we describe in\ndetail. Furthermore, we show that in the presence of an ALP the so-called weak\nmass term, which is unobservable in the Standard Model, is non-redundant\nalready at leading order. We find that NLO corrections associated with\nflavor-violating ALP couplings modify the leading-order result by a few\npercent, with only small uncertainties. On the contrary, the NLO corrections\nproportional to flavor-conserving ALP couplings lead to an $\\mathcal{O}(20\\%)$\nreduction relative to the leading-order predictions. These corrections are\naccompanied by a large uncertainties mainly originating from the QCD low-energy\nconstant $L_{4,r}$ as well as from the presence of various unknown weak\nlow-energy constants. We emphasize the importance of a precise determination of\nthese coupling parameters for the successful study of new physics in light\nmeson decays.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:58:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cornella","Claudia",""],["Galda","Anne Mareike",""],["Neubert","Matthias",""],["Wyler","Daniel",""]]}
{"id":"2308.16904","submitter":"Aritra Dutta","authors":"El Houcine Bergou, Soumia Boucherouite, Aritra Dutta, Xin Li, Anna Ma","title":"A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear\n  Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.LG cs.NA math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale linear systems, $Ax=b$, frequently arise in practice and demand\neffective iterative solvers. Often, these systems are noisy due to operational\nerrors or faulty data-collection processes. In the past decade, the randomized\nKaczmarz (RK) algorithm has been studied extensively as an efficient iterative\nsolver for such systems. However, the convergence study of RK in the noisy\nregime is limited and considers measurement noise in the right-hand side\nvector, $b$. Unfortunately, in practice, that is not always the case; the\ncoefficient matrix $A$ can also be noisy. In this paper, we analyze the\nconvergence of RK for noisy linear systems when the coefficient matrix, $A$, is\ncorrupted with both additive and multiplicative noise, along with the noisy\nvector, $b$. In our analyses, the quantity $\\tilde R=\\| \\tilde A^{\\dagger}\n\\|_2^2 \\|\\tilde A \\|_F^2$ influences the convergence of RK, where $\\tilde A$\nrepresents a noisy version of $A$. We claim that our analysis is robust and\nrealistically applicable, as we do not require information about the noiseless\ncoefficient matrix, $A$, and considering different conditions on noise, we can\ncontrol the convergence of RK. We substantiate our theoretical findings by\nperforming comprehensive numerical experiments.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:59:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bergou","El Houcine",""],["Boucherouite","Soumia",""],["Dutta","Aritra",""],["Li","Xin",""],["Ma","Anna",""]]}
{"id":"2308.16905","submitter":"Sirui Xu","authors":"Sirui Xu, Zhengyuan Li, Yu-Xiong Wang, Liang-Yan Gui","title":"InterDiff: Generating 3D Human-Object Interactions with Physics-Informed\n  Diffusion","comments":"ICCV 2023; Project Page: https://sirui-xu.github.io/InterDiff/","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 addresses a novel task of anticipating 3D human-object\ninteractions (HOIs). Most existing research on HOI synthesis lacks\ncomprehensive whole-body interactions with dynamic objects, e.g., often limited\nto manipulating small or static objects. Our task is significantly more\nchallenging, as it requires modeling dynamic objects with various shapes,\ncapturing whole-body motion, and ensuring physically valid interactions. To\nthis end, we propose InterDiff, a framework comprising two key steps: (i)\ninteraction diffusion, where we leverage a diffusion model to encode the\ndistribution of future human-object interactions; (ii) interaction correction,\nwhere we introduce a physics-informed predictor to correct denoised HOIs in a\ndiffusion step. Our key insight is to inject prior knowledge that the\ninteractions under reference with respect to contact points follow a simple\npattern and are easily predictable. Experiments on multiple human-object\ninteraction datasets demonstrate the effectiveness of our method for this task,\ncapable of producing realistic, vivid, and remarkably long-term 3D HOI\npredictions.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:59:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xu","Sirui",""],["Li","Zhengyuan",""],["Wang","Yu-Xiong",""],["Gui","Liang-Yan",""]]}
{"id":"2308.16906","submitter":"Xiaolong Wang","authors":"Xiaolong Wang, Runsen Xu, Zuofan Cui, Zeyu Wan, Yu Zhang","title":"Fine-Grained Cross-View Geo-Localization Using a Correlation-Aware\n  Homography Estimator","comments":"19 pages. Reducing the cross-view geo-localization problem to a 2D\n  image alignment problem by utilizing BEV transformation, and completing the\n  alignment process with a correlation-aware homography estimator. Code:\n  https://github.com/xlwangDev/HC-Net","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we introduce a novel approach to fine-grained cross-view\ngeo-localization. Our method aligns a warped ground image with a corresponding\nGPS-tagged satellite image covering the same area using homography estimation.\nWe first employ a differentiable spherical transform, adhering to geometric\nprinciples, to accurately align the perspective of the ground image with the\nsatellite map. This transformation effectively places ground and aerial images\nin the same view and on the same plane, reducing the task to an image alignment\nproblem. To address challenges such as occlusion, small overlapping range, and\nseasonal variations, we propose a robust correlation-aware homography estimator\nto align similar parts of the transformed ground image with the satellite\nimage. Our method achieves sub-pixel resolution and meter-level GPS accuracy by\nmapping the center point of the transformed ground image to the satellite image\nusing a homography matrix and determining the orientation of the ground camera\nusing a point above the central axis. Operating at a speed of 30 FPS, our\nmethod outperforms state-of-the-art techniques, reducing the mean metric\nlocalization error by 21.3% and 32.4% in same-area and cross-area\ngeneralization tasks on the VIGOR benchmark, respectively, and by 34.4% on the\nKITTI benchmark in same-area evaluation.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:59:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Xiaolong",""],["Xu","Runsen",""],["Cui","Zuofan",""],["Wan","Zeyu",""],["Zhang","Yu",""]]}
{"id":"2308.16907","submitter":"Bitan Roy","authors":"Vladimir Juricic, Bitan Roy","title":"Yukawa-Lorentz Symmetry in Non-Hermitian Dirac Materials","comments":"6 Pages, 3 Figures & 1 Table (Supplemental Material as Ancillary\n  File)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a general construction of symmetry protected Lorentz invariant\nnon-Hermitian (NH) Dirac semimetals (DSMs), realized by invoking masslike\nanti-Hermitian Dirac operators to its Hermitian counterpart. They feature\npurely real or imaginary isotropic linear band dispersion, yielding a vanishing\ndensity of states. Dynamic mass orderings in NH DSMs thus take place for strong\nHubbardlike local interactions through a quantum phase transition where nodal\nNH Dirac quasiparticles are strongly coupled with bosonic order-parameter\nfluctuations, hosting a non-Fermi liquid, beyond which the system becomes an\ninsulator. Depending on the internal Clifford algebra between the NH Dirac\noperator and candidate mass order-parameter, the resulting quantum critical\nfluid either remains coupled with the environment or recovers full Hermiticity\nby decoupling from the bath, while always enjoying an emergent Yukawa-Lorentz\nsymmetry in terms of a unique velocity. We showcase the competition between\nsuch mass orderings, their hallmarks on quasiparticle spectra in the ordered\nphases, and the relevance of our findings in correlated designer NH Dirac\nmaterials.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:59:27 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Juricic","Vladimir",""],["Roy","Bitan",""]]}
{"id":"2308.16908","submitter":"Sanjib Kumar Das","authors":"Sanjib Kumar Das and Bitan Roy","title":"Quantized thermal and spin transports of dirty planar topological\n  superconductors","comments":"11 pages, 4 figures, 1 Table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.dis-nn cond-mat.str-el cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nontrivial bulk topological invariants of quantum materials can leave their\nsignatures on charge, thermal and spin transports. In two dimensions, their\nimprints can be experimentally measured from well-developed multi-terminal Hall\nbar arrangements. Here, we numerically compute the low temperature ($T$)\nthermal ($\\kappa_{xy}$) and zero temperature spin ($\\sigma^{sp}_{xy}$) Hall\nconductivities, and longitudinal thermal conductance ($G^{th}_{xx}$) of various\nparadigmatic two-dimensional fully gapped topological superconductors,\nbelonging to distinct Altland-Zirnbauer symmetry classes, namely $p+ip$ (class\nD), $d+id$ (class C) and $p \\pm ip$ (class DIII) paired states, in mesoscopic\nsix-terminal Hall bar setups from the scattering matrix formalism using Kwant.\nIn both clean and weak disorder limits, the time-reversal symmetry breaking\n$p+ip$ and $d+id$ pairings show half-quantized and quantized $\\kappa_{xy}$ [in\nunits of $\\kappa_0=\\pi^2 k^2_B T/(3h)$], respectively, while the latter one in\naddition accommodates a quantized $\\sigma^{sp}_{xy}$ [in units of\n$\\sigma^{sp}_0=\\hbar/(8 \\pi)$]. By contrast, the time-reversal invariant $p \\pm\nip$ pairing only displays a quantized $G^{th}_{xx}$ at low $T$ up to a moderate\nstrength of disorder. In the strong disorder regime, all these topological\nresponses ($\\kappa_{xy}$, $\\sigma^{sp}_{xy}$ and $G^{th}_{xx}$) vanish.\nPossible material platforms hosting such paired states and manifesting these\nrobust topological thermal and spin responses are highlighted.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:59:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Das","Sanjib Kumar",""],["Roy","Bitan",""]]}
{"id":"2308.16909","submitter":"Yuhan Wang","authors":"Yuhan Wang, Liming Jiang, Chen Change Loy","title":"StyleInV: A Temporal Style Modulated Inversion Network for Unconditional\n  Video Generation","comments":"ICCV 2023. Code: https://github.com/johannwyh/StyleInV Project page:\n  https://www.mmlab-ntu.com/project/styleinv/index.html","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unconditional video generation is a challenging task that involves\nsynthesizing high-quality videos that are both coherent and of extended\nduration. To address this challenge, researchers have used pretrained StyleGAN\nimage generators for high-quality frame synthesis and focused on motion\ngenerator design. The motion generator is trained in an autoregressive manner\nusing heavy 3D convolutional discriminators to ensure motion coherence during\nvideo generation. In this paper, we introduce a novel motion generator design\nthat uses a learning-based inversion network for GAN. The encoder in our method\ncaptures rich and smooth priors from encoding images to latents, and given the\nlatent of an initially generated frame as guidance, our method can generate\nsmooth future latent by modulating the inversion encoder temporally. Our method\nenjoys the advantage of sparse training and naturally constrains the generation\nspace of our motion generator with the inversion network guided by the initial\nframe, eliminating the need for heavy discriminators. Moreover, our method\nsupports style transfer with simple fine-tuning when the encoder is paired with\na pretrained StyleGAN generator. Extensive experiments conducted on various\nbenchmarks demonstrate the superiority of our method in generating long and\nhigh-resolution videos with decent single-frame quality and temporal\nconsistency.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:59:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Yuhan",""],["Jiang","Liming",""],["Loy","Chen Change",""]]}
{"id":"2308.16910","submitter":"Sergio Rojas","authors":"Sergio Rojas, Pawe{\\l} Maczuga, Judit Mu\\~noz-Matute, David Pardo,\n  Maciej Paszynski","title":"Robust Variational Physics-Informed Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a Robust version of the Variational Physics-Informed Neural\nNetworks (RVPINNs) to approximate the Partial Differential Equations (PDEs)\nsolution. We start from a weak Petrov-Galerkin formulation of the problem,\nselect a discrete test space, and define a quadratic loss functional as in\nVPINNs. Whereas in VPINNs the loss depends upon the selected basis functions of\na given test space, herein we minimize a loss based on the residual in the\ndiscrete dual norm, which is independent of the test space's choice of test\nbasis functions. We demonstrate that this loss is a reliable and efficient\nestimator of the true error in the energy norm. The proposed loss function\nrequires computation of the Gram matrix inverse, similar to what occurs in\ntraditional residual minimization methods. To validate our theoretical\nfindings, we test the performance and robustness of our algorithm in several\nadvection-dominated-diffusion problems in one spatial dimension. We conclude\nthat RVPINNs is a robust method.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:59:44 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Rojas","Sergio",""],["Maczuga","Pawe\u0142",""],["Mu\u00f1oz-Matute","Judit",""],["Pardo","David",""],["Paszynski","Maciej",""]]}
{"id":"2308.16911","submitter":"Runsen Xu","authors":"Runsen Xu, Xiaolong Wang, Tai Wang, Yilun Chen, Jiangmiao Pang, Dahua\n  Lin","title":"PointLLM: Empowering Large Language Models to Understand Point Clouds","comments":"19 pages. Empowering large language models with 3D point cloud\n  understanding, accompanied by a novel dataset and carefully designed\n  benchmarks. Project page: https://runsenxu.com/projects/PointLLM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The unprecedented advancements in Large Language Models (LLMs) have created a\nprofound impact on natural language processing but are yet to fully embrace the\nrealm of 3D understanding. This paper introduces PointLLM, a preliminary effort\nto fill this gap, thereby enabling LLMs to understand point clouds and offering\na new avenue beyond 2D visual data. PointLLM processes colored object point\nclouds with human instructions and generates contextually appropriate\nresponses, illustrating its grasp of point clouds and common sense.\nSpecifically, it leverages a point cloud encoder with a powerful LLM to\neffectively fuse geometric, appearance, and linguistic information. We collect\na novel dataset comprising 660K simple and 70K complex point-text instruction\npairs to enable a two-stage training strategy: initially aligning latent spaces\nand subsequently instruction-tuning the unified model. To rigorously evaluate\nour model's perceptual abilities and its generalization capabilities, we\nestablish two benchmarks: Generative 3D Object Classification and 3D Object\nCaptioning, assessed through three different methods, including human\nevaluation, GPT-4/ChatGPT evaluation, and traditional metrics. Experiment\nresults show that PointLLM demonstrates superior performance over existing 2D\nbaselines. Remarkably, in human-evaluated object captioning tasks, PointLLM\noutperforms human annotators in over 50% of the samples. Codes, datasets, and\nbenchmarks are available at https://github.com/OpenRobotLab/PointLLM .\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:59:46 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xu","Runsen",""],["Wang","Xiaolong",""],["Wang","Tai",""],["Chen","Yilun",""],["Pang","Jiangmiao",""],["Lin","Dahua",""]]}
{"id":"2308.16912","submitter":"Bin Ren Dr.","authors":"Bin B. Ren","title":"Karhunen-Lo\\`eve Data Imputation in High Contrast Imaging","comments":"7 pages, 5 figures, A&A accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP astro-ph.GA astro-ph.SR stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Detection and characterization of extended structures is a crucial goal in\nhigh contrast imaging. However, these structures face challenges in data\nreduction, leading to over-subtraction from speckles and self-subtraction with\nmost existing methods. Iterative post-processing methods offer promising\nresults, but their integration into existing pipelines is hindered by selective\nalgorithms, high computational cost, and algorithmic regularization. To address\nthis for reference differential imaging (RDI), here we propose the data\nimputation concept to Karhunen-Lo\\`eve transform (DIKL) by modifying two steps\nin the standard Karhunen-Lo\\`eve image projection (KLIP) method. Specifically,\nwe partition an image to two matrices: an anchor matrix which focuses only on\nthe speckles to obtain the DIKL coefficients, and a boat matrix which focuses\non the regions of astrophysical interest for speckle removal using DIKL\ncomponents. As an analytical approach, DIKL achieves high-quality results with\nsignificantly reduced computational cost (~3 orders of magnitude less than\niterative methods). Being a derivative method of KLIP, DIKL is seamlessly\nintegrable into high contrast imaging pipelines for RDI observations.\n","versions":[{"version":"v1","created":"Thu, 31 Aug 2023 17:59:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ren","Bin B.",""]]}