Exploring the dark matter inelastic frontier with 79.6 days of PandaX-II data

We report here the results of searching for inelastic scattering of dark matter (initial and final state dark matter particles differ by a small mass splitting) with nucleon with the first 79.6-day of PandaX-II data (Run 9). We set the upper limits for the spin independent WIMP-nucleon scattering cross section up to a mass splitting of 300 keV/c$^2$ at two benchmark dark matter masses of 1 and 10 TeV/c$^2$.Comment: 5 pages, 6 figure

A Review of Panoptic Segmentation for Mobile Mapping Point Clouds

3D point cloud panoptic segmentation is the combined task to (i) assign each point to a semantic class and (ii) separate the points in each class into object instances. Recently there has been an increased interest in such comprehensive 3D scene understanding, building on the rapid advances of semantic segmentation due to the advent of deep 3D neural networks. Yet, to date there is very little work about panoptic segmentation of outdoor mobile-mapping data, and no systematic comparisons. The present paper tries to close that gap. It reviews the building blocks needed to assemble a panoptic segmentation pipeline and the related literature. Moreover, a modular pipeline is set up to perform comprehensive, systematic experiments to assess the state of panoptic segmentation in the context of street mapping. As a byproduct, we also provide the first public dataset for that task, by extending the NPM3D dataset to include instance labels. That dataset and our source code are publicly available. We discuss which adaptations are need to adapt current panoptic segmentation methods to outdoor scenes and large objects. Our study finds that for mobile mapping data, KPConv performs best but is slower, while PointNet++ is fastest but performs significantly worse. Sparse CNNs are in between. Regardless of the backbone, Instance segmentation by clustering embedding features is better than using shifted coordinates

Dark Matter Results From 54-Ton-Day Exposure of PandaX-II Experiment

We report a new search of weakly interacting massive particles (WIMPs) using the combined low background data sets in 2016 and 2017 from the PandaX-II experiment in China. The latest data set contains a new exposure of 77.1 live day, with the background reduced to a level of 0.8$\times10^{-3}$ evt/kg/day, improved by a factor of 2.5 in comparison to the previous run in 2016. No excess events were found above the expected background. With a total exposure of 5.4$\times10^4$ kg day, the most stringent upper limit on spin-independent WIMP-nucleon cross section was set for a WIMP with mass larger than 100 GeV/c$^2$, with the lowest exclusion at 8.6$\times10^{-47}$ cm$^2$ at 40 GeV/c$^2$.Comment: Supplementary materials at https://pandax.sjtu.edu.cn/articles/2nd/supplemental.pdf version 2 as accepted by PR

Estimation of horizontal-to-vertical spectral ratios (ellipticity) of Rayleigh waves from multistation active-seismic records

The horizontal-to-vertical spectral-ratio (HVSR) analysis of ambient noise recordings is a popular reconnaissance tool used worldwide for seismic microzonation and earthquake site characterization. We have expanded this single-station passive HVSR technique to active multicomponent data. We focus on the calculation of the HVSR of Rayleigh waves from active-seismic records. We separate different modes of Rayleigh waves in seismic dispersion spectra and then estimate the HVSR for the fundamental mode. The mode separation is implemented in the frequency-phase velocity (f-v) domain through the high-resolution linear Radon transformation. The estimated Rayleigh-wave HVSR curve after mode separation is consistent with the theoretical HVSR curve, which is computed by solving the Rayleigh-wave eigenproblem in the laterally homogeneous layered medium. We find that the HVSR peak and trough frequencies are very sensitive to velocity contrast and interface depth and that HVSR curves contain information on lateral velocity variations. Using synthetic and field data, we determine the validity of estimating active Rayleigh-wave HVSR after mode separation. Our approach can be a viable and more accurate alternative to the empirical HVSR analysis method and brings a novel approach for the analysis of active multicomponent seismic data

Positive and unlabeled learning for user behavior analysis based on mobile internet traffic data

With the rapid development of wireless communication and mobile Internet, mobile phone becomes ubiquitous and functions as a versatile and smart system, on which people frequently interact with various mobile applications (Apps). Understanding human behaviors using mobile phone is significant for mobile system developers, for human-centered system optimization and better service provisioning. In this paper, we focus on mobile user behavior analysis and prediction based on mobile Internet traffic data. Real traffic flow data is collected from the public network of Internet Service Providers (ISPs), by high-performance network traffic monitors.We construct User-App bipartite network to represent the traffic interaction pattern between users and App servers. After mining the explicit and implicit features from User-App bipartite network, we propose two positive and unlabeled learning (PU learning) methods, including Spy-based PU learning and K-means-based PU learning, for App usage prediction and mobile video traffic identification. We firstly use the traffic flow data of QQ, a very famous messaging and social media application possessing high market share in China, as the experimental dataset for App usage prediction task. Then we use the traffic flow data from six popular Apps, including video intensive Apps (Youku, Baofeng, LeTV, Tudou) and other Apps (Meituan, Apple), as the experimental dataset for mobile video traffic identification task. Experimental results show that our proposed PU learning methods perform well in both tasks

Know Your Needs Better: Towards Structured Understanding of Marketer Demands with Analogical Reasoning Augmented LLMs

In this paper, we explore a new way for user targeting, where non-expert marketers could select their target users solely given demands in natural language form. The key to this issue is how to transform natural languages into practical structured logical languages, i.e., the structured understanding of marketer demands. In practical scenarios, the demands of non-expert marketers are often abstract and diverse. Considering the impressive natural language processing ability of large language models (LLMs), we try to leverage LLMs to solve this issue. To stimulate the LLMs' reasoning ability, the chain-of-thought (CoT) prompting method is widely used, but existing methods still have some limitations in our scenario: (1) Previous methods either use simple "Let's think step by step" spells or provide fixed examples in demonstrations without considering compatibility between prompts and concrete questions, making LLMs ineffective when the marketers' demands are abstract and diverse. (2) Previous methods are often implemented in closed-source models or excessively large models, which is not suitable in industrial practical scenarios. Based on these, we propose ARALLM (i.e., Analogical Reasoning Augmented Large Language Models) consisting of two modules: Analogical Reasoning based Prompting and Reasoning-Augmented Multi-Task Model Distillation. Part of our data and code can be found at https://github.com/alipay/Analogic-Reasoning-Augmented-Large-Language-Model.Comment: Accepted by KDD 202

Who Would be Interested in Services? An Entity Graph Learning System for User Targeting

With the growing popularity of various mobile devices, user targeting has received a growing amount of attention, which aims at effectively and efficiently locating target users that are interested in specific services. Most pioneering works for user targeting tasks commonly perform similarity-based expansion with a few active users as seeds, suffering from the following major issues: the unavailability of seed users for newcoming services and the unfriendliness of black-box procedures towards marketers. In this paper, we design an Entity Graph Learning (EGL) system to provide explainable user targeting ability meanwhile applicable to addressing the cold-start issue. EGL System follows the hybrid online-offline architecture to satisfy the requirements of scalability and timeliness. Specifically, in the offline stage, the system focuses on the heavyweight entity graph construction and user entity preference learning, in which we propose a Three-stage Relation Mining Procedure (TRMP), breaking loose from the expensive seed users. At the online stage, the system offers the ability of user targeting in real-time based on the entity graph from the offline stage. Since the user targeting process is based on graph reasoning, the whole process is transparent and operation-friendly to marketers. Finally, extensive offline experiments and online A/B testing demonstrate the superior performance of the proposed EGL System.Comment: Accepted by ICDE 202