Source author record

Ping Wang

Ping Wang appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

90works

48topics

4close collaborators

Actions

Connect this record

Open graph Browse works

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

Brightest GRB flare observed in GRB 221009A: bridge the last gap between flare and prompt emission in GRB

Flares are usually observed during the afterglow phase of Gamma-Ray Bursts (GRBs) in soft X-ray, optical and radio bands, but rarely in gamma-ray band. Despite the extraordinary brightness, GECAM-C has accurately measured both the bright prompt emission and flare emission of GRB 221009A without instrumental effects, offering a good opportunity to study the relation between them. In this work, we present a comprehensive analysis of flare emission of GRB 221009A, which is composed of a series of flares. Among them, we identify an exceptionally bright flare with a record-breaking isotropic energy $E_{\rm iso} = 1.82 \times 10^{53}$ erg of GRB flares. It exhibits the highest peak energy ever detected in GRB flares, $E_{\rm peak} \sim 300$ keV, making it a genuine gamma-ray flare. It also shows rapid rise and decay timescales, significantly shorter than those of typical X-ray flares observed in soft X-ray or optical band, but comparable to those observed in prompt emissions. Despite these exceptional properties, the flare shares several common properties with typical GRB flares. We note that this is the first observation of a GRB flare in the keV-MeV band with sufficiently high temporal resolution and high statistics, which bridges the last gap between prompt emission and flare.

preprint2026arXiv

Deep Probabilistic Unfolding for Quantized Compressive Sensing

We propose a deep probabilistic unfolding model to address the classical quantized compressive sensing problem that leverages an unfolding framework to enhance the reconstruction accuracy and efficiency. Unlike previous unfolding methods that apply L2 projection to measurements, we derive a closed-form, numerically stable likelihood gradient projection, which allows the model to respect the true quantization physics, turning the hard quantization constraint into a soft probabilistic guidance. Furthermore, an efficient, dual-domain Mamba module is specifically designed to dynamically capture and fuse the multi-scale local and global features, ensuring the interactions between the distant but correlated regions. Extensive experiments demonstrate the state-of-the-art performance of the proposed method over previous works, which is capable of promoting the application of quantized compressive sensing in real life.

preprint2026arXiv

Finite-Size Gradient Transport in Large Language Model Pretraining: From Cascade Size to Intensive Transport Efficiency

We introduce a finite-size gradient-transport framework for real language-model training, based on five observables $(D,z,β,δ,v_{\mathrm{rel}})$ that separate cascade size, duration, absolute transport, and intensive transport efficiency. We analyze direct raw-gradient measurements from Pico-LM across four scales and 125 aligned steps, together with a five-scale Pythia companion dataset built from 153 aligned checkpoint-difference update fields. The same algebraic closure holds in both families, and both share a near-unity cascade-size backbone, but they occupy distinct transport regimes: Pico-LM shows positive duration scaling and negative intensive-efficiency scaling, whereas Pythia remains near the $D=1$ baseline with only weak positive efficiency scale dependence. Randomized-field controls give nearly matched null floors in the intensive and duration channels, indicating that the contrast reflects different real departures from a shared null skeleton rather than different null calibrations. The families also differ in stepwise power-law compressibility: Pico-LM retains clean duration and efficiency power laws, whereas Pythia preserves the size backbone but shows weaker one-slope compressibility in those channels. External performance associations are correspondingly channel-level, carried mainly by $v_{\mathrm{rel}}$ and normalized cascade duration, while $D(t)$ acts as a shared size backbone without a significant exponent-level performance association. These results support a reusable transport measurement framework without claiming a universal fixed point or a first-principles derivation of neural scaling laws.

preprint2026arXiv

Hierarchical LLM-Driven Control for HAPS-Assisted UAV Networks: Joint Optimization of Flight and Connectivity

Uncrewed aerial vehicles (UAVs) are increasingly deployed in complex networked environments, yet the joint optimization of multi-UAV motion control and connectivity remains a fundamental challenge. In this paper, we study a multi-UAV system operating in an integrated terrestrial and non-terrestrial network (ITNTN) comprising terrestrial base stations and high-altitude platform stations (HAPS). We consider a three-dimensional (3D) aerial highway scenario where UAVs must adapt their motion to ensure collision avoidance, efficient traffic flow, and reliable communication under dynamic and partially observable conditions. We first model the problem as a hierarchical multi-objective partially observable Markov decision process (H-MO-POMDP), capturing the coupling between control and communication objectives. Based on this formulation, we propose a large language model (LLM)-driven hierarchical multi-rate control framework. At the global level, an LLM-based controller on the HAPS performs long-term planning for load balancing and handover decisions. At the local level, each UAV employs a hybrid controller that integrates a slow-timescale LLM for high-level spatial reasoning with a reinforcement learning agent for faster UAV-to-infrastructure (U2I) communication and motion control. We further develop a high-fidelity 3D simulation platform by integrating the gym-pybullet-drones environment with 3GPP-compliant RF/THz channel models. Numerical results demonstrate that the proposed framework significantly outperforms state-of-the-art baselines, achieving a 14% increase in transportation efficiency and a 25% improvement in telecommunication throughput. Additionally, it achieves a 23% reduction in physical collision rates, demonstrating strong handover stability and zero-shot generalization in dynamic scenarios.

preprint2026arXiv

PulseMind: A Multi-Modal Medical Model for Real-World Clinical Diagnosis

Recent advances in medical multi-modal models focus on specialized image analysis like dermatology, pathology, or radiology. However, they do not fully capture the complexity of real-world clinical diagnostics, which involve heterogeneous inputs and require ongoing contextual understanding during patient-physician interactions. To bridge this gap, we introduce PulseMind, a new family of multi-modal diagnostic models that integrates a systematically curated dataset, a comprehensive evaluation benchmark, and a tailored training framework. Specifically, we first construct a diagnostic dataset, MediScope, which comprises 98,000 real-world multi-turn consultations and 601,500 medical images, spanning over 10 major clinical departments and more than 200 sub-specialties. Then, to better reflect the requirements of real-world clinical diagnosis, we develop the PulseMind Benchmark, a multi-turn diagnostic consultation benchmark with a four-dimensional evaluation protocol comprising proactiveness, accuracy, usefulness, and language quality. Finally, we design a training framework tailored for multi-modal clinical diagnostics, centered around a core component named Comparison-based Reinforcement Policy Optimization (CRPO). Compared to absolute score rewards, CRPO uses relative preference signals from multi-dimensional com-parisons to provide stable and human-aligned training guidance. Extensive experiments demonstrate that PulseMind achieves competitive performance on both the diagnostic consultation benchmark and public medical benchmarks.

preprint2026arXiv

SongSage: A Large Musical Language Model with Lyric Generative Pre-training

Large language models have achieved significant success in various domains, yet their understanding of lyric-centric knowledge has not been fully explored. In this work, we first introduce PlaylistSense, a dataset to evaluate the playlist understanding capability of language models. PlaylistSense encompasses ten types of user queries derived from common real-world perspectives, challenging LLMs to accurately grasp playlist features and address diverse user intents. Comprehensive evaluations indicate that current general-purpose LLMs still have potential for improvement in playlist understanding. Inspired by this, we introduce SongSage, a large musical language model equipped with diverse lyric-centric intelligence through lyric generative pretraining. SongSage undergoes continual pretraining on LyricBank, a carefully curated corpus of 5.48 billion tokens focused on lyrical content, followed by fine-tuning with LyricBank-SFT, a meticulously crafted instruction set comprising 775k samples across nine core lyric-centric tasks. Experimental results demonstrate that SongSage exhibits a strong understanding of lyric-centric knowledge, excels in rewriting user queries for zero-shot playlist recommendations, generates and continues lyrics effectively, and performs proficiently across seven additional capabilities. Beyond its lyric-centric expertise, SongSage also retains general knowledge comprehension and achieves a competitive MMLU score. We will keep the datasets inaccessible due to copyright restrictions and release the SongSage and training script to ensure reproducibility and support music AI research and applications, the datasets release plan details are provided in the appendix.

preprint2023arXiv

On thermodynamically consistent quasiparticle model at finite chemical potential

We explore the quasiparticle model at finite chemical potential related to Ru-Keng Su's distinguished contributions to the topic. Besides, we discuss recent developments in the model, and in particular, one argues that the effective mass of the quasiparticle might attain a specific form as a function of momentum, in addition to its dependence on temperature and chemical potential. Unlike the approaches based on the properties of underlying symmetry or renormalization group, the momentum dependence emerges as a special solution to an integro-differential equation resulting from the underlying thermodynamic consistency. Moreover, this special solution to the problem is shown to be more general than previously explored in the literature. Instead of fitting to the lattice QCD data at vanishing chemical potential, in this work, we adopt a ``bottom-up'' approach by assuming some analytic ansatzes that are manifestly thermodynamically consistent. The remaining physical quantities are subsequently derived, and possible implications are also addressed.

preprint2022arXiv

A Bidirectional Tree Tagging Scheme for Joint Medical Relation Extraction

Joint medical relation extraction refers to extracting triples, composed of entities and relations, from the medical text with a single model. One of the solutions is to convert this task into a sequential tagging task. However, in the existing works, the methods of representing and tagging the triples in a linear way failed to the overlapping triples, and the methods of organizing the triples as a graph faced the challenge of large computational effort. In this paper, inspired by the tree-like relation structures in the medical text, we propose a novel scheme called Bidirectional Tree Tagging (BiTT) to form the medical relation triples into two two binary trees and convert the trees into a word-level tags sequence. Based on BiTT scheme, we develop a joint relation extraction model to predict the BiTT tags and further extract medical triples efficiently. Our model outperforms the best baselines by 2.0\% and 2.5\% in F1 score on two medical datasets. What's more, the models with our BiTT scheme also obtain promising results in three public datasets of other domains.

preprint2022arXiv

A Deep Reinforcement Learning-Based Caching Strategy for IoT Networks with Transient Data

The Internet of Things (IoT) has been continuously rising in the past few years, and its potentials are now more apparent. However, transient data generation and limited energy resources are the major bottlenecks of these networks. Besides, minimum delay and other conventional quality of service measurements are still valid requirements to meet. An efficient caching policy can help meet the standard quality of service requirements while bypassing IoT networks' specific limitations. Adopting deep reinforcement learning (DRL) algorithms enables us to develop an effective caching scheme without the need for any prior knowledge or contextual information. In this work, we propose a DRL-based caching scheme that improves the cache hit rate and reduces energy consumption of the IoT networks, in the meanwhile, taking data freshness and limited lifetime of IoT data into account. To better capture the regional-different popularity distribution, we propose a hierarchical architecture to deploy edge caching nodes in IoT networks. The results of comprehensive experiments show that our proposed method outperforms the well-known conventional caching policies and an existing DRL-based solution in terms of cache hit rate and energy consumption of the IoT networks by considerable margins.

preprint2022arXiv

A Sequence Tagging based Framework for Few-Shot Relation Extraction

Relation Extraction (RE) refers to extracting the relation triples in the input text. Existing neural work based systems for RE rely heavily on manually labeled training data, but there are still a lot of domains where sufficient labeled data does not exist. Inspired by the distance-based few-shot named entity recognition methods, we put forward the definition of the few-shot RE task based on the sequence tagging joint extraction approaches, and propose a few-shot RE framework for the task. Besides, we apply two actual sequence tagging models to our framework (called Few-shot TPLinker and Few-shot BiTT), and achieves solid results on two few-shot RE tasks constructed from a public dataset.

preprint2022arXiv

An Ultra-Reliable Low-Latency Non-Binary Polar Coded SCMA Scheme

The joint transmission scheme of polar codes and sparse code multiple access (SCMA) has been regarded as a promising technology for future wireless communication systems. However, most of the existing polar-coded SCMA (PC-SCMA) systems suffer from high latency caused by the feedback iteration and list decoding. In addition, the error performance of PC-SCMA systems is unsatisfactory for ultra-reliable transmission. Inspired by the compelling benefits of non-binary polar codes, in this paper, we design a non-binary polar-coded SCMA (NB-PC-SCMA) system with a free order matching strategy to address the issues of delay and reliability. Specifically, we first formulate a joint factor graph for NB-PC-SCMA and propose a non-binary successive cancellation list (NB-SCL) and damping based joint iterative detection and decoding (NSD-JIDD) multiuser receiver to improve the BER and latency performance. Then, a lazy-search based NB-SCL (L-NB-SCL) decoding is proposed to reduce the computational complexity by simplifying the path search pattern of the list decoder. After that, we modify the update of user nodes for SCMA detection to improve the convergence error and finally propose the improved NSD-JIDD (ISD-JIDD) algorithm, which can avoid redundant operations by exploiting L-NB-SCL decoding. Simulation results show that the proposed NB-PC-SCMA system achieves better bit error rate (BER) performance and considerable latency gain when compared to its counterparts. In particular, the proposed ISD-JIDD can achieve similar BER performance of NSD-JIDD with less complexity.

preprint2022arXiv

Attention-based Aspect Reasoning for Knowledge Base Question Answering on Clinical Notes

Question Answering (QA) in clinical notes has gained a lot of attention in the past few years. Existing machine reading comprehension approaches in clinical domain can only handle questions about a single block of clinical texts and fail to retrieve information about multiple patients and their clinical notes. To handle more complex questions, we aim at creating knowledge base from clinical notes to link different patients and clinical notes, and performing knowledge base question answering (KBQA). Based on the expert annotations available in the n2c2 dataset, we first created the ClinicalKBQA dataset that includes around 9K QA pairs and covers questions about seven medical topics using more than 300 question templates. Then, we investigated an attention-based aspect reasoning (AAR) method for KBQA and analyzed the impact of different aspects of answers (e.g., entity, type, path, and context) for prediction. The AAR method achieves better performance due to the well-designed encoder and attention mechanism. From our experiments, we find that both aspects, type and path, enable the model to identify answers satisfying the general conditions and produce lower precision and higher recall. On the other hand, the aspects, entity and context, limit the answers by node-specific information and lead to higher precision and lower recall.

preprint2022arXiv

Boundary-aware Information Maximization for Self-supervised Medical Image Segmentation

Unsupervised pre-training has been proven as an effective approach to boost various downstream tasks given limited labeled data. Among various methods, contrastive learning learns a discriminative representation by constructing positive and negative pairs. However, it is not trivial to build reasonable pairs for a segmentation task in an unsupervised way. In this work, we propose a novel unsupervised pre-training framework that avoids the drawback of contrastive learning. Our framework consists of two principles: unsupervised over-segmentation as a pre-train task using mutual information maximization and boundary-aware preserving learning. Experimental results on two benchmark medical segmentation datasets reveal our method's effectiveness in improving segmentation performance when few annotated images are available.

preprint2022arXiv

Event Detection Explorer: An Interactive Tool for Event Detection Exploration

Event Detection (ED) is an important task in natural language processing. In the past few years, many datasets have been introduced for advancing ED machine learning models. However, most of these datasets are under-explored because not many tools are available for people to study events, trigger words, and event mention instances systematically and efficiently. In this paper, we present an interactive and easy-to-use tool, namely ED Explorer, for ED dataset and model exploration. ED Explorer consists of an interactive web application, an API, and an NLP toolkit, which can help both domain experts and non-experts to better understand the ED task. We use ED Explorer to analyze a recent proposed large-scale ED datasets (referred to as MAVEN), and discover several underlying problems, including sparsity, label bias, label imbalance, and debatable annotations, which provide us with directions to improve the MAVEN dataset. The ED Explorer can be publicly accessed through http://edx.leafnlp.org/. The demonstration video is available here https://www.youtube.com/watch?v=6QPnxPwxg50.

preprint2022arXiv

Insight-HXMT dedicated 33-day observation of SGR J1935+2154 I. Burst Catalog

Magnetars are neutron stars with extreme magnetic field and sometimes manifest as soft gamma-ray repeaters (SGRs). SGR J1935+2154 is one of the most prolific bursters and the first confirmed source of fast radio burst (i.e. FRB 200428). Encouraged by the discovery of the first X-ray counterpart of FRB, Insight-Hard X-ray Modulation Telescope (Insight-HXMT) implemented a dedicated 33-day long ToO observation of SGR J1935+2154 since April 28, 2020. With the HE, ME, and LE telescopes, Insight-HXMT provides a thorough monitoring of burst activity evolution of SGR J1935+2154, in a very broad energy range (1-250 keV) with high temporal resolution and high sensitivity, resulting in a unique valuable data set for detailed studies of SGR J1935+2154. In this work, we conduct a comprehensive analysis of this observation including detailed burst search, identification and temporal analyses. After carefully removing false triggers, we find a total of 75 bursts from SGR J1935+2154, out of which 70 are single-pulsed. The maximum burst rate is about 56 bursts/day. Both the burst duration and the waiting time between two successive bursts follow log-normal distributions, consistent with previous studies. We also find that bursts with longer duration (some are multi-pulsed) tend to occur during the period with relatively high burst rate. There is no correlation between the waiting time and the fluence or duration of either the former or latter burst. It also seems that there is no correlation between burst duration and hardness ratio, in contrast to some previous reports. In addition, we do not find any X-ray burst associated with any reported radio bursts except for FRB 200428.

preprint2022arXiv

Insight-HXMT dedicated 33-day observation of SGR J1935+2154 II. Burst Spectral Catalog

Since April 28, 2020, Insight-HXMT has implemented a dedicated observation on the magnetar SGR J1935+2154. Thanks to the wide energy band (1-250 keV) and high sensitivity of Insight-HXMT, we obtained 75 bursts from SGR J1935+2154 during a month-long activity episode after the emission of FRB 200428. Here, we report the detailed time-integrated spectral analysis of these bursts and the statistical distribution of the spectral parameters. We find that for 15%(11/75) of SGR J1935+2154 bursts, the CPL model is preferred, and most of them occurred in the latter part of this active epoch. In the cumulative fluence distribution, we find that the fluence of bursts in our sample is about an order of magnitude weaker than that of Fermi/GBM, but follows the same power law distribution. Finally, we find a burst with similar peak energy to the time-integrated spectrum of the X-ray burst associated with FRB 200428 (FRB 200428-Associated Burst), but the low energy index is harder.

preprint2022arXiv

Localization Distillation for Dense Object Detection

Knowledge distillation (KD) has witnessed its powerful capability in learning compact models in object detection. Previous KD methods for object detection mostly focus on imitating deep features within the imitation regions instead of mimicking classification logit due to its inefficiency in distilling localization information and trivial improvement. In this paper, by reformulating the knowledge distillation process on localization, we present a novel localization distillation (LD) method which can efficiently transfer the localization knowledge from the teacher to the student. Moreover, we also heuristically introduce the concept of valuable localization region that can aid to selectively distill the semantic and localization knowledge for a certain region. Combining these two new components, for the first time, we show that logit mimicking can outperform feature imitation and localization knowledge distillation is more important and efficient than semantic knowledge for distilling object detectors. Our distillation scheme is simple as well as effective and can be easily applied to different dense object detectors. Experiments show that our LD can boost the AP score of GFocal-ResNet-50 with a single-scale 1x training schedule from 40.1 to 42.1 on the COCO benchmark without any sacrifice on the inference speed. Our source code and trained models are publicly available at https://github.com/HikariTJU/LD

preprint2022arXiv

Node Selection Toward Faster Convergence for Federated Learning on Non-IID Data

Federated Learning (FL) is a distributed learning paradigm that enables a large number of resource-limited nodes to collaboratively train a model without data sharing. The non-independent-and-identically-distributed (non-i.i.d.) data samples invoke discrepancies between the global and local objectives, making the FL model slow to converge. In this paper, we proposed Optimal Aggregation algorithm for better aggregation, which finds out the optimal subset of local updates of participating nodes in each global round, by identifying and excluding the adverse local updates via checking the relationship between the local gradient and the global gradient. Then, we proposed a Probabilistic Node Selection framework (FedPNS) to dynamically change the probability for each node to be selected based on the output of Optimal Aggregation. FedPNS can preferentially select nodes that propel faster model convergence. The unbiasedness of the proposed FedPNS design is illustrated and the convergence rate improvement of FedPNS over the commonly adopted Federated Averaging (FedAvg) algorithm is analyzed theoretically. Experimental results demonstrate the effectiveness of FedPNS in accelerating the FL convergence rate, as compared to FedAvg with random node selection.

preprint2022arXiv

PINO-MBD: Physics-informed Neural Operator for Solving Coupled ODEs in Multi-body Dynamics

In multi-body dynamics, the motion of a complicated physical object is described as a coupled ordinary differential equation system with multiple unknown solutions. Engineers need to constantly adjust the object to meet requirements at the design stage, where a highly efficient solver is needed. The rise of machine learning-based partial differential equation solvers can meet this need. These solvers can be classified into two categories: approximating the solution function (Physics-informed neural network) and learning the solution operator (Neural operator). The recently proposed physics-informed neural operator (PINO) gains advantages from both categories by embedding physics equations into the loss function of a neural operator. Following this state-of-art concept, we propose the physics-informed neural operator for coupled ODEs in multi-body dynamics (PINO-MBD), which learns the mapping between parameter spaces and solution spaces. Once PINO-MBD is trained, only one forward pass of the network is required to obtain the solutions for a new instance with different parameters. To handle the difficulty that coupled ODEs contain multiple solutions (instead of only one in normal PDE problems), two new physics embedding methods are also proposed. The experimental results on classic vehicle-track coupled dynamics problem show state-of-art performance not only on solutions but also the first and second derivatives of solutions.

preprint2022arXiv

Transferable Deep Reinforcement Learning Framework for Autonomous Vehicles with Joint Radar-Data Communications

Autonomous Vehicles (AVs) are required to operate safely and efficiently in dynamic environments. For this, the AVs equipped with Joint Radar-Communications (JRC) functions can enhance the driving safety by utilizing both radar detection and data communication functions. However, optimizing the performance of the AV system with two different functions under uncertainty and dynamic of surrounding environments is very challenging. In this work, we first propose an intelligent optimization framework based on the Markov Decision Process (MDP) to help the AV make optimal decisions in selecting JRC operation functions under the dynamic and uncertainty of the surrounding environment. We then develop an effective learning algorithm leveraging recent advances of deep reinforcement learning techniques to find the optimal policy for the AV without requiring any prior information about surrounding environment. Furthermore, to make our proposed framework more scalable, we develop a Transfer Learning (TL) mechanism that enables the AV to leverage valuable experiences for accelerating the training process when it moves to a new environment. Extensive simulations show that the proposed transferable deep reinforcement learning framework reduces the obstacle miss detection probability by the AV up to 67% compared to other conventional deep reinforcement learning approaches.

preprint2021arXiv

Ambient Backscatter-Assisted Wireless-Powered Relaying

Internet-of-Things (IoT) is featured with low-power communications among a massive number of ubiquitously-deployed and energy-constrained electronics, e.g., sensors and actuators. To cope with the demand, wireless-powered cooperative relaying emerges as a promising communication paradigm to extend data transmission coverage and solve energy scarcity for the IoT devices. In this paper, we propose a novel hybrid relaying strategy by combining wireless-powered communication and ambient backscattering functions to improve applicability and performance of data transfer. In particular, the hybrid relay can harvest energy from radio frequency (RF) signals and use the energy for active transmission. Alternatively, the hybrid relay can choose to perform ambient backscattering of incident RF signals for passive transmission. To efficiently utilize the ambient RF resource, we design mode selection protocols to coordinate between the active and passive relaying in circumstances with and without instantaneous channel gain. With different mode selection protocols, we characterize the success probability and ergodic capacity of a dual-hop relaying system with the hybrid relay in the field of randomly located ambient transmitters. The analytical and the numerical results demonstrate the effectiveness of the mode selection protocols in adapting the hybrid relaying into the network environment and reveal the impacts of system parameters on the performance gain of the hybrid relaying. As applications of our analytical framework which is computationally tractable, we formulate optimization problems based on the derived expressions to optimize the system parameters with different objectives. The optimal solutions exhibit a tradeoff between the maximum energy efficiency and target success probability.

preprint2021arXiv

Few-shot Image Classification with Multi-Facet Prototypes

The aim of few-shot learning (FSL) is to learn how to recognize image categories from a small number of training examples. A central challenge is that the available training examples are normally insufficient to determine which visual features are most characteristic of the considered categories. To address this challenge, we organize these visual features into facets, which intuitively group features of the same kind (e.g. features that are relevant to shape, color, or texture). This is motivated from the assumption that (i) the importance of each facet differs from category to category and (ii) it is possible to predict facet importance from a pre-trained embedding of the category names. In particular, we propose an adaptive similarity measure, relying on predicted facet importance weights for a given set of categories. This measure can be used in combination with a wide array of existing metric-based methods. Experiments on miniImageNet and CUB show that our approach improves the state-of-the-art in metric-based FSL.

preprint2021arXiv

Millimeter Wave MIMO based Depth Maps for Wireless Virtual and Augmented Reality

Augmented and virtual reality systems (AR/VR) are rapidly becoming key components of the wireless landscape. For immersive AR/VR experience, these devices should be able to construct accurate depth perception of the surrounding environment. Current AR/VR devices rely heavily on using RGB-D depth cameras to achieve this goal. The performance of these depth cameras, however, has clear limitations in several scenarios, such as the cases with shiny objects, dark surfaces, and abrupt color transition among other limitations. In this paper, we propose a novel solution for AR/VR depth map construction using mmWave MIMO communication transceivers. This is motivated by the deployment of advanced mmWave communication systems in future AR/VR devices for meeting the high data rate demands and by the interesting propagation characteristics of mmWave signals. Accounting for the constraints on these systems, we develop a comprehensive framework for constructing accurate and high-resolution depth maps using mmWave systems. In this framework, we developed new sensing beamforming codebook approaches that are specific for the depth map construction objective. Using these codebooks, and leveraging tools from successive interference cancellation, we develop a joint beam processing approach that can construct high-resolution depth maps using practical mmWave antenna arrays. Extensive simulation results highlight the potential of the proposed solution in building accurate depth maps. Further, these simulations show the promising gains of mmWave based depth perception compared to RGB-based approaches in several important use cases.

preprint2021arXiv

Quantum nonlinear spectroscopy of single nuclear spins

Nonlinear spectroscopy is widely used for studying physical systems. Conventional nonlinear optical spectroscopy and magnetic resonance spectroscopy, which use classical probes such as electromagnetic waves, can only access certain types of correlations in a quantum system. The idea of quantum nonlinear spectroscopy was recently proposed to use quantum probes such as entangled photons to achieve sensitivities and resolutions beyond the classical limits. It is shown that quantum sensing can extract arbitrary types and orders of correlations in a quantum system by first quantum-entangling a sensor and the object and then measuring the sensor. Quantum sensing has been applied to achieve nuclear magnetic resonance (NMR) of single atoms and the second-order correlation spectroscopy has been adopted to enhance the spectral resolution. However, quantum nonlinear spectroscopy (i.e., the measurement of higher-order correlations) of single nuclear spins is still elusive. Here we demonstrate the extraction of fourth-order correlations of single nuclear spins that cannot be measured in conventional nonlinear spectroscopy, using sequential weak measurement via an atomic quantum sensor, namely, a nitrogen-vacancy center in diamond. We show that the quantum nonlinear spectroscopy provides fingerprint features to identify different types of objects, such as Gaussian noises, random-phased AC fields, and quantum spins, which would be indistinguishable in second-order correlations. The measured fourth-order correlation unambiguously differentiates a single nuclear spin and a random-phased AC field. This work constitutes an initial step toward the application of higher-order correlations to quantum sensing, to examining the quantum foundation (by, e.g., higher-order Leggett-Garg inequality), and to studying quantum many-body physics.

preprint2021arXiv

RAGA: Relation-aware Graph Attention Networks for Global Entity Alignment

Entity alignment (EA) is the task to discover entities referring to the same real-world object from different knowledge graphs (KGs), which is the most crucial step in integrating multi-source KGs. The majority of the existing embeddings-based entity alignment methods embed entities and relations into a vector space based on relation triples of KGs for local alignment. As these methods insufficiently consider the multiple relations between entities, the structure information of KGs has not been fully leveraged. In this paper, we propose a novel framework based on Relation-aware Graph Attention Networks to capture the interactions between entities and relations. Our framework adopts the self-attention mechanism to spread entity information to the relations and then aggregate relation information back to entities. Furthermore, we propose a global alignment algorithm to make one-to-one entity alignments with a fine-grained similarity matrix. Experiments on three real-world cross-lingual datasets show that our framework outperforms the state-of-the-art methods.

preprint2021arXiv

Restoring the top-of-atmosphere reflectance during solar eclipses: a proof of concept with the UV Absorbing Aerosol Index measured by TROPOMI

During a solar eclipse the solar irradiance reaching the top-of-atmosphere (TOA) is reduced in the Moon shadow. The solar irradiance is commonly measured by Earth observation satellites before the start of the solar eclipse and is not corrected for this reduction, which results in a decrease of the computed TOA reflectances. Consequently, air quality products that are derived from TOA reflectance spectra, such as the ultraviolet (UV) Absorbing Aerosol Index (AAI), are distorted or undefined in the shadow of the Moon. The availability of air quality satellite data in the penumbral and antumbral shadow during solar eclipses, however, is of particular interest to users studying the atmospheric response to solar eclipses. Given the time and location of a point on the Earth's surface, we explain how to compute the obscuration during a solar eclipse taking into account wavelength-dependent solar limb darkening. With the calculated obscuration fractions, we restore the TOA reflectances and the AAI in the penumbral shadow during the annular solar eclipses on 26 December 2019 and 21 June 2020 measured by the TROPOMI/S5P instrument. In the corrected products, the signature of the Moon shadow disappeared, but only if wavelength-dependent solar limb darkening is taken into account. We conclude that the correction method of this paper can be used to detect real AAI rising phenomena during a solar eclipse and has the potential to restore any other product that is derived from TOA reflectance spectra. This would resolve the solar eclipse anomalies in satellite air quality measurements and would allow for studying the effect of the eclipse obscuration on the composition of the Earth's atmosphere from space.

preprint2021arXiv

Sea quark contributions to the electromagnetic form factors of $Σ$ hyperons

We study the sea quark contributions to the electromagnetic form factors of $Σ$ baryons with nonlocal chiral effective theory. Both octet and decuplet intermediate states are included in the one loop calculation. $G_{Σ^{-}}^{u}$ and $G_{Σ^{+}}^{d}$ could be priority observables for the examination of sea quark contributions to baryon structure because these quantities are much larger than the strange form factors of nucleon. It will be less difficult for lattice simulation to determine the sign of these pure sea quark contributions unambiguously. In $Σ^0$, the light sea quark form factors $G_{Σ^{0}}^{u}$ and $G_{Σ^{0}}^{d}$ are identical. Since the light sea quark form factors in proton are different, it will be more meaningful to compare lattice result of the light sea quark form factors in $Σ^0$ with that obtained from effective field theory.

preprint2020arXiv

A Simple and Effective Self-Supervised Contrastive Learning Framework for Aspect Detection

Unsupervised aspect detection (UAD) aims at automatically extracting interpretable aspects and identifying aspect-specific segments (such as sentences) from online reviews. However, recent deep learning-based topic models, specifically aspect-based autoencoder, suffer from several problems, such as extracting noisy aspects and poorly mapping aspects discovered by models to the aspects of interest. To tackle these challenges, in this paper, we first propose a self-supervised contrastive learning framework and an attention-based model equipped with a novel smooth self-attention (SSA) module for the UAD task in order to learn better representations for aspects and review segments. Secondly, we introduce a high-resolution selective mapping (HRSMap) method to efficiently assign aspects discovered by the model to aspects of interest. We also propose using a knowledge distilling technique to further improve the aspect detection performance. Our methods outperform several recent unsupervised and weakly supervised approaches on publicly available benchmark user review datasets. Aspect interpretation results show that extracted aspects are meaningful, have good coverage, and can be easily mapped to aspects of interest. Ablation studies and attention weight visualization also demonstrate the effectiveness of SSA and the knowledge distilling method.

preprint2020arXiv

Auction Mechanisms in Cloud/Fog Computing Resource Allocation for Public Blockchain Networks

As an emerging decentralized secure data management platform, blockchain has gained much popularity recently. To maintain a canonical state of blockchain data record, proof-of-work based consensus protocols provide the nodes, referred to as miners, in the network with incentives for confirming new block of transactions through a process of "block mining" by solving a cryptographic puzzle. Under the circumstance of limited local computing resources, e.g., mobile devices, it is natural for rational miners, i.e., consensus nodes, to offload computational tasks for proof of work to the cloud/fog computing servers. Therefore, we focus on the trading between the cloud/fog computing service provider and miners, and propose an auction-based market model for efficient computing resource allocation. In particular, we consider a proof-of-work based blockchain network. Due to the competition among miners in the blockchain network, the allocative externalities are particularly taken into account when designing the auction mechanisms. Specifically, we consider two bidding schemes: the constant-demand scheme where each miner bids for a fixed quantity of resources, and the multi-demand scheme where the miners can submit their preferable demands and bids. For the constant-demand bidding scheme, we propose an auction mechanism that achieves optimal social welfare. In the multi-demand bidding scheme, the social welfare maximization problem is NP-hard. Therefore, we design an approximate algorithm which guarantees the truthfulness, individual rationality and computational efficiency. Through extensive simulations, we show that our proposed auction mechanisms with the two bidding schemes can efficiently maximize the social welfare of the blockchain network and provide effective strategies for the cloud/fog computing service provider.

preprint2020arXiv

Enhancing the Performance of Practical Profiling Side-Channel Attacks Using Conditional Generative Adversarial Networks

Recently, many profiling side-channel attacks based on Machine Learning and Deep Learning have been proposed. Most of them focus on reducing the number of traces required for successful attacks by optimizing the modeling algorithms. In previous work, relatively sufficient traces need to be used for training a model. However, in the practical profiling phase, it is difficult or impossible to collect sufficient traces due to the constraint of various resources. In this case, the performance of profiling attacks is inefficient even if proper modeling algorithms are used. In this paper, the main problem we consider is how to conduct more efficient profiling attacks when sufficient profiling traces cannot be obtained. To deal with this problem, we first introduce the Conditional Generative Adversarial Network (CGAN) in the context of side-channel attacks. We show that CGAN can generate new traces to enlarge the size of the profiling set, which improves the performance of profiling attacks. For both unprotected and protected cryptographic algorithms, we find that CGAN can effectively learn the leakage of traces collected in their implementations. We also apply it to different modeling algorithms. In our experiments, the model constructed with the augmented profiling set can reduce the required attack traces by more than half, which means the generated traces can provide useful information as the real traces.

preprint2020arXiv

GPView: a program for wave function analysis and visualization

In this manuscript, we will introduce a recently developed program GPView, which can be used for wave function analysis and visualization. The wave function analysis module can calculate and generate 3D cubes for various types of molecular orbitals and electron density of electronic excited states, such as natural orbitals, natural transition orbitals, natural difference orbitals, hole-particle density, detachment-attachment density and transition density. The visualization module of GPView can display molecular and electronic (iso-surfaces) structures. It is also able to animate single trajectories of molecular dynamics and non-adiabatic excited state molecular dynamics using the data stored in existing files. There are also other utilities to extract and process the output of quantum chemistry calculations. The GPView provides full graphic user interface (GUI), so it very easy to use. It is available from website \href{http://life-tp.com/gpview}{http://life-tp.com/gpview}.

preprint2020arXiv

Hadronic cross section of $e^+e^-$ annihilation at bottomonium energy region

The Born cross section and dressed cross section of $e^+e^-$ to $b\bar{b}$ and the total hadronic cross section in $e^+e^-$ annihilation in the bottomonium energy region are calculated based on the Rb values measured by the BaBar and Belle experiments. The data are used to calculate the vacuum polarization factors in the bottomonium energy region, and to determine the resonant parameters of the vector bottomonium(-like) states, the Y(10750), Upsilon(5S), and Upsilon(6S).

preprint2020arXiv

Mechanism Design for Wireless Powered Spatial Crowdsourcing Networks

Wireless power transfer (WPT) is a promising technology to prolong the lifetime of the sensors and communication devices, i.e., workers, in completing crowdsourcing tasks by providing continuous and cost-effective energy supplies. In this paper, we propose a wireless powered spatial crowdsourcing framework which consists of two mutually dependent phases: task allocation phase and data crowdsourcing phase. In the task allocation phase, we propose a Stackelberg game based mechanism for the spatial crowdsourcing platform to efficiently allocate spatial tasks and wireless charging power to each worker. In the data crowdsourcing phase, the workers may have an incentive to misreport its real working location to improve its utility, which causes adverse effects to the spatial crowdsourcing platform. To address this issue, we present three strategyproof deployment mechanisms for the spatial crowdsourcing platform to place a mobile base station, e.g., vehicle or robot, which is responsible for transferring the wireless power and collecting the crowdsourced data. As the benchmark, we first apply the classical median mechanism and evaluate its worst-case performance. Then, we design a conventional strategyproof deployment mechanism to improve the expected utility of the spatial crowdsourcing platform under the condition that the workers' locations follow a known geographical distribution. For a more general case with only the historical location data available, we propose a deep learning based strategyproof deployment mechanism to maximize the spatial crowdsourcing platform's utility. Extensive experimental results based on synthetic and real-world datasets reveal the effectiveness of the proposed framework in allocating tasks and charging power to workers while avoiding the dishonest worker's manipulation.

preprint2020arXiv

Optimal Pricing of Internet of Things: A Machine Learning Approach

Internet of things (IoT) produces massive data from devices embedded with sensors. The IoT data allows creating profitable services using machine learning. However, previous research does not address the problem of optimal pricing and bundling of machine learning-based IoT services. In this paper, we define the data value and service quality from a machine learning perspective. We present an IoT market model which consists of data vendors selling data to service providers, and service providers offering IoT services to customers. Then, we introduce optimal pricing schemes for the standalone and bundled selling of IoT services. In standalone service sales, the service provider optimizes the size of bought data and service subscription fee to maximize its profit. For service bundles, the subscription fee and data sizes of the grouped IoT services are optimized to maximize the total profit of cooperative service providers. We show that bundling IoT services maximizes the profit of service providers compared to the standalone selling. For profit sharing of bundled services, we apply the concepts of core and Shapley solutions from cooperative game theory as efficient and fair allocations of payoffs among the cooperative service providers in the bundling coalition.

preprint2020arXiv

Performance Limits of Differential Power Processing

This paper investigates the performance limits of differential power processing (DPP) and presents quantitative and systematic design guidelines for the selection and comparison of DPP topologies. A stochastic model is developed to evaluate the expected power losses of a variety of DPP topologies with probabilistic load distribution. The expected losses of several DPP topologies are derived and compared against traditional dc-dc converters to reveal their performance limits. The impacts of the load distribution and load scale on the expected losses are investigated. The theoretical models are verified with SPICE simulations and experimental results.

preprint2020arXiv

Sea quark contributions to nucleon electromagnetic form factors with the nonlocal chiral effective Lagrangian

The sea quark contributions to the nucleon electromagnetic form factors from up, down and strange quarks are studied with the nonlocal chiral effective Lagrangian. Both octet and decuplet intermediate states are included in the one loop calculation. Compared with the strange form factors, though their signs are the same, the absolute value of the light quark form factors are much larger. For both electric and magnetic form factors, the contribution from $d$ quark is larger than that from $u$ quark. The current lattice data for the light-sea quark form factors are between our sea quark results for $u$ and $d$.

preprint2020arXiv

Shipper Cooperation in Stochastic Drone Delivery: A Dynamic Bayesian Game Approach

With the recent technological innovation, unmanned aerial vehicles, known as drones, have found numerous applications including package and parcel delivery for shippers. Drone delivery offers benefits over conventional ground-based vehicle delivery in terms of faster speed, lower cost, more environment-friendly, and less manpower needed. However, most of existing studies on drone delivery planning and scheduling focus on a single shipper and ignore uncertainty factors. As such, in this paper, we consider a scenario that multiple shippers can cooperate to minimize their drone delivery cost. We propose the Bayesian Shipper Cooperation in Stochastic Drone Delivery (BCoSDD) framework. The framework is composed of three functions, i.e., package assignment, shipper cooperation formation and cost management. The uncertainties of drone breakdown and misbehavior of cooperative shippers are taken into account by using multistage stochastic programming optimization and dynamic Bayesian coalition formation game. We conduct extensive performance evaluation of the BCoSDD framework by using customer locations from Solomon benchmark suite and a real Singapore logistics industry. As a result, the framework can help the shippers plan and schedule their drone delivery effectively.

preprint2020arXiv

Structural properties and average tapping time on scale-free graphs with smallest diameter

In this paper, we propose a class of graphs $G^{\star}(m,t)$ and first study some structural properties, such as, average degree, on them. The results show that (1) graphs $G^{\star}(m,t)$ have density feature because of their average degrees proportional to time step $t$ not to a constant in the large graph size limit, (2) graphs $G^{\star}(m,t)$ obey the power-law distribution with exponent equal to $2$, which is rarely found in most previous scale-free models, (3) graphs $G^{\star}(m,t)$ display small-world property in terms of ultra-small diameter and higher clustering coefficient, and (4) graphs $G^{\star}(m,t)$ possess disassortative structure with respect to Pearson correlation coefficient smaller than zero. In addition, we consider the trapping problem on the proposed graphs $G^{\star}(m,t)$ and then find that they all have more optimal trapping efficiency by means of their own average trapping time achieving the theoretical lower bound, a phenomenon that is seldom observed in existing scale-free models. We conduct extensive simulations that are consistent with our theoretical analysis.

preprint2020arXiv

Text-to-SQL Generation for Question Answering on Electronic Medical Records

Electronic medical records (EMR) contain comprehensive patient information and are typically stored in a relational database with multiple tables. Effective and efficient patient information retrieval from EMR data is a challenging task for medical experts. Question-to-SQL generation methods tackle this problem by first predicting the SQL query for a given question about a database, and then, executing the query on the database. However, most of the existing approaches have not been adapted to the healthcare domain due to a lack of healthcare Question-to-SQL dataset for learning models specific to this domain. In addition, wide use of the abbreviation of terminologies and possible typos in questions introduce additional challenges for accurately generating the corresponding SQL queries. In this paper, we tackle these challenges by developing a deep learning based TRanslate-Edit Model for Question-to-SQL (TREQS) generation, which adapts the widely used sequence-to-sequence model to directly generate the SQL query for a given question, and further performs the required edits using an attentive-copying mechanism and task-specific look-up tables. Based on the widely used publicly available electronic medical database, we create a new large-scale Question-SQL pair dataset, named MIMICSQL, in order to perform the Question-to-SQL generation task in healthcare domain. An extensive set of experiments are conducted to evaluate the performance of our proposed model on MIMICSQL. Both quantitative and qualitative experimental results indicate the flexibility and efficiency of our proposed method in predicting condition values and its robustness to random questions with abbreviations and typos.

preprint2020arXiv

Toward an Automated Auction Framework for Wireless Federated Learning Services Market

In traditional machine learning, the central server first collects the data owners' private data together and then trains the model. However, people's concerns about data privacy protection are dramatically increasing. The emerging paradigm of federated learning efficiently builds machine learning models while allowing the private data to be kept at local devices. The success of federated learning requires sufficient data owners to jointly utilize their data, computing and communication resources for model training. In this paper, we propose an auction based market model for incentivizing data owners to participate in federated learning. We design two auction mechanisms for the federated learning platform to maximize the social welfare of the federated learning services market. Specifically, we first design an approximate strategy-proof mechanism which guarantees the truthfulness, individual rationality, and computational efficiency. To improve the social welfare, we develop an automated strategy-proof mechanism based on deep reinforcement learning and graph neural networks. The communication traffic congestion and the unique characteristics of federated learning are particularly considered in the proposed model. Extensive experimental results demonstrate that our proposed auction mechanisms can efficiently maximize the social welfare and provide effective insights and strategies for the platform to organize the federated training.

preprint2020arXiv

Trapping problem on star-type graphs with applications

The trapping problem on graph (or network) as a typical focus of great interest has attracted more attention from various science fields, including applied mathematics and theoretical computer science, in the past. Here, we first study this problem on an arbitrary graph and obtain the closed-form formula for calculating the theoretical lower bound of average trapping time ($ATT$), a quantity that evaluates trapping efficiency of graph in question, using methods from spectral graph theory. The results show that the choice of the trap's location has a significant influence on determining parameter $ATT$. As a result, we consider the problem on star-type graphs, a special graph family which will be introduced shortly, with a single trap $θ$ and then derive using probability generating functions the exact solution to quantity $ATT$. Our results suggest that all star-type graphs have most optimal trapping efficiency by achieving the corresponding theoretical lower bounds of $ATT$. More importantly, we further find that a given graph is most optimal only if its underlying structure is star-type when considering the trapping problem. At meantime, we also provide the upper bounds for $ATT$ of several graphs in terms of well-known Holder inequality, some of which are sharp. By using all the consequences obtained, one may be able to design better control scheme for complex networks from respect of trapping efficiency, to some extent, which are in well agreement with many other previous thoughts.

preprint2019arXiv

An ensemble of random graphs with identical degree distribution

Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast, in this paper, we report a fact that two arbitrarily chosen networks with identical degree distribution can have completely different other topological structure, such as diameter, spanning trees number, pearson correlation coefficient, and so forth. Besides that, for a given degree distribution (as power-law distribution with exponent $γ=3$ discussed here), it is reasonable to ask how many network models with such a constraint we can have. To this end, we generate an ensemble of this kind of random graphs with $P(k)\sim k^{-γ}$ ($γ=3$), denoted as graph space $\mathcal{N}(p,q,t)$ where probability parameters $p$ and $q$ hold on $p+q=1$, and indirectly show the cardinality of $\mathcal{N}(p,q,t)$ seems to be large enough in the thermodynamics limit, i.e., $N\rightarrow\infty$, by varying values of $p$ and $q$. From the theoretical point of view, given an ultrasmall constant $p_{c}$, perhaps only graph model $N(1,0,t)$ is small-world and other are not in terms of diameter. And then, we study spanning trees number on two deterministic graph models and obtain both upper bound and lower bound for other members. Meanwhile, for arbitrary $p(\neq1)$, we prove that graph model $N(p,q,t)$ does go through two phase transitions over time, i.e., starting by non-assortative pattern and then suddenly going into disassortative region, and gradually converging to initial place (non-assortative point). Among of them, one "null" graph model is built.

preprint2016arXiv

Angoricity and compactivity describe the jamming transition in soft particulate matter

The application of concepts from equilibrium statistical mechanics to out-of-equilibrium systems has a long history of describing diverse systems ranging from glasses to granular materials. For dissipative jammed systems-- particulate grains or droplets-- a key concept is to replace the energy ensemble describing conservative systems by the volume-stress ensemble. Here, we test the applicability of the volume-stress ensemble to describe the jamming transition by comparing the jammed configurations obtained by dynamics with those averaged over the ensemble as a probe of ergodicity. Agreement between both methods suggests the idea of "thermalization" at a given angoricity and compactivity. We elucidate the thermodynamic order of the jamming transition by showing the absence of critical fluctuations in static observables like pressure and volume. The approach allows to calculate observables such as the entropy, volume, pressure, coordination number and distribution of forces to characterize the scaling laws near the jamming transition from a statistical mechanics viewpoint.

preprint2016arXiv

Chiral extrapolation of nucleon axial charge $g_A$ in effective field theory

The extrapolation of nucleon axial charge $g_A$ is investigated within the framework of heavy baryon chiral effective field theory. The intermediate octet and decuplet baryons are included in the one loop calculation. Finite range regularization is applied to improve the convergence in the quark-mass expansion. The lattice data from three different groups are used for the extrapolation. At physical pion mass, the extrapolated $g_A$ are all smaller than the experimental value.

preprint2016arXiv

Data Collection and Wireless Communication in Internet of Things (IoT) Using Economic Analysis and Pricing Models: A Survey

This paper provides a state-of-the-art literature review on economic analysis and pricing models for data collection and wireless communication in Internet of Things (IoT). Wireless Sensor Networks (WSNs) are the main component of IoT which collect data from the environment and transmit the data to the sink nodes. For long service time and low maintenance cost, WSNs require adaptive and robust designs to address many issues, e.g., data collection, topology formation, packet forwarding, resource and power optimization, coverage optimization, efficient task allocation, and security. For these issues, sensors have to make optimal decisions from current capabilities and available strategies to achieve desirable goals. This paper reviews numerous applications of the economic and pricing models, known as intelligent rational decision-making methods, to develop adaptive algorithms and protocols for WSNs. Besides, we survey a variety of pricing strategies in providing incentives for phone users in crowdsensing applications to contribute their sensing data. Furthermore, we consider the use of some pricing models in Machine-to-Machine (M2M) communication. Finally, we highlight some important open research issues as well as future research directions of applying economic and pricing models to IoT.

preprint2016arXiv

Efficient Background Modeling Based on Sparse Representation and Outlier Iterative Removal

Background modeling is a critical component for various vision-based applications. Most traditional methods tend to be inefficient when solving large-scale problems. In this paper, we introduce sparse representation into the task of large scale stable background modeling, and reduce the video size by exploring its 'discriminative' frames. A cyclic iteration process is then proposed to extract the background from the discriminative frame set. The two parts combine to form our Sparse Outlier Iterative Removal (SOIR) algorithm. The algorithm operates in tensor space to obey the natural data structure of videos. Experimental results show that a few discriminative frames determine the performance of the background extraction. Further, SOIR can achieve high accuracy and high speed simultaneously when dealing with real video sequences. Thus, SOIR has an advantage in solving large-scale tasks.

preprint2016arXiv

High fidelity transfer and storage of photon states in a single nuclear spin

Building a quantum repeater network for long distance quantum communication requires photons and quantum registers that comprise qubits for interaction with light, good memory capabilities and processing qubits for storage and manipulation of photons. Here we demonstrate a key step, the coherent transfer of a photon in a single solid-state nuclear spin qubit with an average fidelity of 98% and storage over 10 seconds. The storage process is achieved by coherently transferring a photon to an entangled electron-nuclear spin state of a nitrogen vacancy centre in diamond, confirmed by heralding through high fidelity single-shot readout of the electronic spin states. Stored photon states are robust against repetitive optical writing operations, required for repeater nodes. The photon-electron spin interface and the nuclear spin memory demonstrated here constitutes a major step towards practical quantum networks, and surprisingly also paves the way towards a novel entangled photon source for photonic quantum computing.

preprint2016arXiv

Market Model and Optimal Pricing Scheme of Big Data and Internet of Things (IoT)

Big data has been emerging as a new approach in utilizing large datasets to optimize complex system operations. Big data is fueled with Internet-of-Things (IoT) services that generate immense sensory data from numerous sensors and devices. While most current research focus of big data is on machine learning and resource management design, the economic modeling and analysis have been largely overlooked. This paper thus investigates the big data market model and optimal pricing scheme. We first study the utility of data from the data science perspective, i.e., using the machine learning methods. We then introduce the market model and develop an optimal pricing scheme afterward. The case study shows clearly the suitability of the proposed data utility functions. The numerical examples demonstrate that big data and IoT service provider can achieve the maximum profit through the proposed market model.

preprint2016arXiv

Multiparty quantum key agreement protocol secure against collusion attacks

The fairness of a secure multi-party quantum key agreement (MQKA) protocol requires that all involved parties are entirely peer entities and can equally influence the outcome of the protocol to establish a shared key wherein no one can decide the shared key alone. However, it is found that parts of the existing MQKA protocols are sensitive to collusion attacks, i.e., some of the dishonest participants can collaborate to predetermine the final key without being detected. In this paper, a multi-party QKA protocol resisting collusion attacks is proposed. Different from previous QKA protocol resisting $N-1$ coconspirators or resisting $1$ coconspirators, we investigate the general circle-type MQKA protocol which can be secure against $t$ dishonest participants' cooperation. Here, $t < N$. We hope the results of the presented paper will be helpful for further research on fair MQKA protocols.

preprint2016arXiv

The Tradeoff Analysis in RF-Powered Backscatter Cognitive Radio Networks

In this paper, we introduce a new model for RF-powered cognitive radio networks with the aim to improve the performance for secondary systems. In our proposed model, when the primary channel is busy, the secondary transmitter is able either to backscatter the primary signals to transmit data to the secondary receiver or to harvest RF energy from the channel. The harvested energy then will be used to transmit data to the receiver when the channel becomes idle. We first analyze the tradeoff between backscatter communication and harvest-then-transmit protocol in the network. To maximize the overall transmission rate of the secondary network, we formulate an optimization problem to find time ratio between taking backscatter and harvest-then-transmit modes. Through numerical results, we show that under the proposed model can achieve the overall transmission rate higher than using either the backscatter communication or the harvest-then-transmit protocol.

preprint2016arXiv

Theory of random packings

We review a recently proposed theory of random packings. We describe the volume fluctuations in jammed matter through a volume function, amenable to analytical and numerical calculations. We combine an extended statistical mechanics approach 'a la Edwards' (where the role traditionally played by the energy and temperature in thermal systems is substituted by the volume and compactivity) with a constraint on mechanical stability imposed by the isostatic condition. We show how such approaches can bring results that can be compared to experiments and allow for an exploitation of the statistical mechanics framework. The key result is the use of a relation between the local Voronoi volume of the constituent grains and the number of neighbors in contact that permits a simple combination of the two approaches to develop a theory of random packings. We predict the density of random loose packing (RLP) and random close packing (RCP) in close agreement with experiments and develop a phase diagram of jammed matter that provides a unifying view of the disordered hard sphere packing problem and further shedding light on a diverse spectrum of data, including the RLP state. Theoretical results are well reproduced by numerical simulations that confirm the essential role played by friction in determining both the RLP and RCP limits. Finally we present an extended discussion on the existence of geometrical and mechanical coordination numbers and how to measure both quantities in experiments and computer simulations.

preprint2016arXiv

Towards Optimal Energy Management of Microgrids with a Realistic Model

This work considers energy management in a grid-connected microgrid which consists of multiple conventional generators (CGs), renewable generators (RGs) and energy storage systems (ESSs). A two-stage optimization approach is presented to schedule the power generation, aimed at minimizing the long-term average operating cost subject to operational and service constraints. The first stage of optimization determines hourly unit commitment of the CGs via a day-ahead scheduling, and the second stage performs economic dispatch of the CGs, ESSs and energy trading via an hour-ahead scheduling. The combined solution meets the need of handling large uncertainties in the load demand and renewable generation, and provides an efficient solution under limited computational resource which meets both short-term and long-term quality-of-service requirements. The performance of the proposed strategy is evaluated by simulations based on real load demand and renewable generation data.

preprint2015arXiv

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.

preprint2015arXiv

Constraining the Lorentz invariance violation from the continuous spectra of short gamma-ray bursts

In quantum gravity, a foamy structure of space-time leads to Lorentz invariance violation (LIV). As the most energetic astrophysical processes in the Universe, gamma-ray bursts (GRBs) provide an effective way to probe quantum gravity effects. We use continuous spectra of 20 short GRBs detected by the Swift satellite to give a conservative lower limit of quantum gravity energy scale $M_\textrm{QG} $. Due to the LIV effect, photons with different energy have different velocities. This will lead to the delayed arrival of high energy photons relative to the low energy ones. Based on the fact that the LIV-induced time delay can't be longer than the duration of a GRB, we present the most conservative estimation of the quantum gravity energy scales from 20 short GRBs. The most strict constraint, $M_\textrm{QG}>5.05\times10^{14}$ GeV, is from GRB 140622A.

preprint2015arXiv

Hierarchical Cooperation for Operator-Controlled Device-to-Device Communications: A Layered Coalitional Game Approach

Device-to-Device (D2D) communications, which allow direct communication among mobile devices, have been proposed as an enabler of local services in 3GPP LTE-Advanced (LTE-A) cellular networks. This work investigates a hierarchical LTE-A network framework consisting of multiple D2D operators at the upper layer and a group of devices at the lower layer. We propose a cooperative model that allows the operators to improve their utility in terms of revenue by sharing their devices, and the devices to improve their payoff in terms of end-to-end throughput by collaboratively performing multi-path routing. To help understanding the interaction among operators and devices, we present a game-theoretic framework to model the cooperation behavior, and further, we propose a layered coalitional game (LCG) to address the decision making problems among them. Specifically, the cooperation of operators is modeled as an overlapping coalition formation game (CFG) in a partition form, in which operators should form a stable coalitional structure. Moreover, the cooperation of devices is modeled as a coalitional graphical game (CGG), in which devices establish links among each other to form a stable network structure for multi-path routing.We adopt the extended recursive core, and Nash network, as the stability concept for the proposed CFG and CGG, respectively. Numerical results demonstrate that the proposed LCG yields notable gains compared to both the non-cooperative case and a LCG variant and achieves good convergence speed.

preprint2015arXiv

Performance Analysis of Ambient RF Energy Harvesting with Repulsive Point Process Modeling

Ambient RF (Radio Frequency) energy harvesting technique has recently been proposed as a potential solution to provide proactive energy replenishment for wireless devices. This paper aims to analyze the performance of a battery-free wireless sensor powered by ambient RF energy harvesting using a stochastic geometry approach. Specifically, we consider the point-to-point uplink transmission of a wireless sensor in a stochastic geometry network, where ambient RF sources, such as mobile transmit devices, access points and base stations, are distributed as a Ginibre alpha-determinantal point process (DPP). The DPP is able to capture repulsion among points, and hence, it is more general than the Poisson point process (PPP). We analyze two common receiver architectures: separated receiver and time-switching architectures. For each architecture, we consider the scenarios with and without co-channel interference for information transmission. We derive the expectation of the RF energy harvesting rate in closed form and also compute its variance. Moreover, we perform a worst-case study which derives the upper bound of both power and transmission outage probabilities. Additionally, we provide guidelines on the setting of optimal time-switching coefficient in the case of the time-switching architecture. Numerical results verify the correctness of the analysis and show various tradeoffs between parameter setting. Lastly, we prove that the sensor is more efficient when the distribution of the ambient sources exhibits stronger repulsion.

preprint2015arXiv

Performance Analysis of Simultaneous Wireless Information and Power Transfer with Ambient RF Energy Harvesting

The advance in RF energy transfer and harvesting technique over the past decade has enabled wireless energy replenishment for electronic devices, which is deemed as a promising alternative to address the energy bottleneck of conventional battery-powered devices. In this paper, by using a stochastic geometry approach, we aim to analyze the performance of an RF-powered wireless sensor in a downlink simultaneous wireless information and power transfer (SWIPT) system with ambient RF transmitters. Specifically, we consider the point-to-point downlink SWIPT transmission from an access point to a wireless sensor in a network, where ambient RF transmitters are distributed as a Ginibre ?$α$-determinantal point process (DPP), which becomes the Poisson point process when $α$? approaches zero. In the considered network, we focus on analyzing the performance of a sensor equipped with the power-splitting architecture. Under this architecture, we characterize the expected RF energy harvesting rate of the sensor. Moreover, we derive the upper bound of both power and transmission outage probabilities. Numerical results show that our upper bounds are accurate for different value of ?$α$.

preprint2015arXiv

Smart Data Pricing Models for Internet-of-Things (IoT): A Bundling Strategy Approach

Internet of things (IoT) has emerged as a new paradigm for the future Internet. In IoT, enormous devices are connected to the Internet and thereby being a huge data source for numerous applications. In this article, we focus on addressing data management in IoT through using a smart data pricing (SDP) approach. With SDP, data can be managed flexibly and efficiently through intelligent and adaptive incentive mechanisms. Moreover, it is a major source of revenue for providers and partners. We propose a new pricing scheme for IoT service providers to determine the sensing data buying price and IoT service subscription fee offered to sensor owners and service users, respectively. Additionally, we adopt the bundling strategy that allows multiple providers to form a coalition and bid their services as a bundle, attracting more users and achieving higher revenue. Finally, we outline some important open research issues for SDP and IoT.

preprint2015arXiv

Strongly polarizing weakly coupled $^{13}$C nuclear spins with optically pumped nitrogen-vacancy center

Enhancing the polarization of nuclear spins surrounding the nitrogen-vacancy (NV) center in diamond has attracted widespread attention recently due to its various applications. Here we present an analytical theory and comprehensive understanding on how to optimize the dynamic nuclear polarization by an optically pumped NV center near the ground state level anticrossing. Our results not only provide a parameter-free explanation and a clearly physics picture for the recently observed polarization dependence on the magnetic field for strongly coupled $^{13}$C nuclei [H. J. Wang \textit{et al}., Nat. Commun. 4, 1 (2013)], but also demonstrate the possibility to strongly polarize weakly coupled $^{13}$C nuclei under weak optical pumping and suitably chosen magnetic field. This allows sensitive magnetic control of the $^{13}$C nuclear spin polarization for NMR applications and significant suppression of the $^{13}$C nuclear spin noise to prolong the NV spin coherence time.

preprint2015arXiv

Theory of nuclear spin dephasing and relaxation by optically illuminated nitrogen-vancy center

Dephasing and relaxation of the nuclear spins coupled to the nitrogen-vacancy (NV) center during optical initialization and readout is an important issue for various applications of this hybrid quantum register. Here we present both an analytical description and a numerical simulation for this process, which agree reasonably with the experimental measurements. For the NV center under cyclic optical transition, our analytical formula not only provide a clear physics picture, but also allows controlling the nuclear spin dissipation by tuning an external magnetic field. For more general optical pumping, our analytical formula reveals significant contribution to the nuclear spin dissipation due to electron random hopping into/out of the $m=0$ (or $m=\pm1$) subspace. This contribution is not suppressed even under saturated optical pumping and/or vanishing magnetic field, thus providing a possible solution to the puzzling observation of nuclear spin dephasing in zero perpendicular magnetic field [M. V. G. Dutt \textit{et al}., Science \textbf{316}, 1312 (2007)]. It also implies that enhancing the degree of spin polarization of the nitrogen-vacancy center can reduce the effect of optical induced nuclear spin dissipation.

preprint2015arXiv

Wireless Charging Technologies: Fundamentals, Standards, and Network Applications

Wireless charging is a technology of transmitting power through an air gap to electrical devices for the purpose of energy replenishment. The recent progress in wireless charging techniques and development of commercial products have provided a promising alternative way to address the energy bottleneck of conventionally portable battery-powered devices. However, the incorporation of wireless charging into the existing wireless communication systems also brings along a series of challenging issues with regard to implementation, scheduling, and power management. In this article, we present a comprehensive overview of wireless charging techniques, the developments in technical standards, and their recent advances in network applications. In particular, with regard to network applications, we review the mobile charger dispatch strategies, static charger scheduling strategies and wireless charger deployment strategies. Additionally, we discuss open issues and challenges in implementing wireless charging technologies. Finally, we envision some practical future network applications of wireless charging.

preprint2014arXiv

A Layered Coalitional Game Framework of Wireless Relay Network

A wireless relay network (WRN) has recently emerged as an effective way to increase communication capacity and extend a coverage area with a low cost. In the WRN, multiple service providers (SPs) can cooperate to share their resources (e.g., relay nodes and spectrum), to achieve higher utility in terms of revenue. Such cooperation can improve the capacity of the WRN, and thus throughput for terminal devices (TDs). However, this cooperation can be realized only if fair allocation of aggregated utility, which is the sum of the utility of all the cooperative SPs, can be achieved. In this paper, we investigate the WRN consisting of SPs at the upper layer and TDs at the lower layer and present a game theoretic framework to address the cooperation decision making problem in the WRN. Specifically, the cooperation of SPs is modeled as an overlapping coalition formation game, in which SPs should form a stable coalitional structure and obtain a fair share of the aggregated utility. We also study the problem of allocating aggregated utility based on the concept of Shapley value, which stabilizes the cooperation of SPs in the WRN. The cooperation of TDs is modeled as a network formation game, in which TDs establish links among each other to form a stable network structure. Numerical results demonstrate that the proposed distributed algorithm obtains the aggregated utility approximating the optimal solutions and achieves good convergence speed.

preprint2014arXiv

Adaptive Power Management for Wireless Base Station in Smart Grid Environment

The growing concerns of a global environmental change raises a revolution on the way of utilizing energy. In wireless industry, green wireless communications has recently gained increasing attention and is expected to play a major role in reduction of electrical power consumption. In particular, actions to promote energy saving of wireless communications with regard to environmental protection are becoming imperative. To this purpose, we study a green communication system model where wireless base station is provisioned with a combination of renewable power source and electrical grid to minimize power consumption as well as meeting the users' demand. More specifically, we focus on an adaptive power management for wireless base station to minimize power consumption under various uncertainties including renewable power generation, power price, and wireless traffic load. We believe that demand side power management solution based on the studied communication architecture is a major step towards green wireless communications.

preprint2014arXiv

CosmoMC Installation and Running Guidelines

CosmoMC is a Fortran 95 Markov-Chain Monte-Carlo (MCMC) engine to explore the cosmological parameter space, plus a Python suite for plotting and presenting results (see http://cosmologist.info/cosmomc/). This document describes the installation of the CosmoMC on a Linux system (Ubuntu 14.04.1 LTS 64-bit version). It is written for those who want to use it in their scientific research but without much training on Linux and the program. Besides a step-by-step installation guide, we also give a brief introduction of how to run the program on both a desktop and a cluster. We share our way to generate the plots that are commonly used in the references of cosmology. For more information, one can refer to the CosmoCoffee forum (http://cosmocoffee.info/viewforum.php?f=11) or contact the authors of this document. Questions and comments would be much appreciated.

preprint2014arXiv

Dynamic Spectrum Access in Cognitive Radio Networks with RF Energy Harvesting

Spectrum efficiency and energy efficiency are two critical issues in designing wireless networks. Through dynamic spectrum access, cognitive radios can improve the spectrum efficiency and capacity of wireless networks. On the other hand, radio frequency (RF) energy harvesting has emerged as a promising technique to supply energy to wireless networks and thereby increase their energy efficiency. Therefore, to achieve both spectrum and energy efficiencies, the secondary users in a cognitive radio network (CRN) can be equipped with the RF energy harvesting capability and such a network can be referred to as an RF-powered cognitive radio network. In this article, we provide an overview of the RF-powered CRNs and discuss the challenges that arise for dynamic spectrum access in these networks. Focusing on the tradeoff among spectrum sensing, data transmission, and RF energy harvesting, then we discuss the dynamic channel selection problem in a multi-channel RF-powered CRN. In the RF-powered CRN, a secondary user can adaptively select a channel to transmit data when the channel is not occupied by any primary user. Alternatively, the secondary user can harvest RF energy for data transmission if the channel is occupied. The optimal channel selection policy of the secondary user can be obtained by formulating a Markov decision process (MDP) problem. We present some numerical results obtained by solving this MDP problem.

preprint2014arXiv

Inflation in de Sitter spacetime and CMB large scales anomaly

The influence of cosmological constant type dark energy in the early universe is investigated. This is accommodated by a new dispersion relation in de Sitter spacetime. We perform a global fitting to explore the cosmological parameters space by using the CosmoMC package with the recently released Planck TT and WMAP Polarization datasets. Using the results from global fitting, we compute a new CMB temperature-temperature spectrum. The obtained TT spectrum has lower power compared with the one based on $Λ$CDM model at large scales.

preprint2014arXiv

Payoff Allocation of Service Coalition in Wireless Mesh Network: A Cooperative Game Perspective

In wireless mesh network (WMN), multiple service providers (SPs) can cooperate to share resources (e.g., relay nodes and spectrum), to serve their collective subscribed customers for better service. As a reward, SPs are able to achieve more individual benefits, i.e., increased revenue or decreased cost, through efficient utilization of shared network resources. However, this cooperation can be realized only if fair allocation of aggregated payoff, which is the sum of the payoff of all the cooperative SPs, can be achieved. We first formulate such cooperation as a coalitional game with transferable utility, specifically, a linear programming game, in which, each SP should obtain the fair share of the aggregated payoff. Then we study the problem of allocating aggregated payoff which leads to stable service coalition of SPs in WMN based on the concepts of dual payoff and Shapley value.

preprint2014arXiv

Performance Analysis of Ambient RF Energy Harvesting: A Stochastic Geometry Approach

preprint2014arXiv

Quantum theory of nuclear spin dynamics in diamond nitrogen-vacancy center

We develop a quantum theory for a variety of nuclear spin dynamics such as dephasing, relaxation, squeezing, and narrowing due to the hyperfine interaction with a generic, dissipative electronic system. The first-order result of our theory reproduces and generalizes the nonlinear Hamiltonian for nuclear spin squeezing [M. S. Rudner, Phys. Rev. Lett. 107, 206806 (2011)]. The second-order result of our theory provides a good explanation to the experimentally observed $^{13}$C nuclear spin bath narrowing in diamond nitrogen-vacancy center [E. Togan, Nature 478, 497 (2011)

preprint2014arXiv

Resource Allocation in Wireless Networks with RF Energy Harvesting and Transfer

Radio frequency (RF) energy harvesting and transfer techniques have recently become alternative methods to power the next generation of wireless networks. As this emerging technology enables proactive replenishment of wireless devices, it is advantageous in supporting applications with quality-of-service (QoS) requirement. This article focuses on the resource allocation issues in wireless networks with RF energy harvesting capability, referred to as RF energy harvesting networks (RF-EHNs). First, we present an overview of the RF-EHNs, followed by a review of a variety of issues regarding resource allocation. Then, we present a case study of designing in the receiver operation policy, which is of paramount importance in the RF-EHNs. We focus on QoS support and service differentiation, which have not been addressed by previous literatures. Furthermore, we outline some open research directions.

preprint2014arXiv

Wireless Charger Networking for Mobile Devices: Fundamentals, Standards, and Applications

Wireless charging is a technique of transmitting power through an air gap to an electrical device for the purpose of energy replenishment. Recently, the wireless charging technology has been significantly advanced in terms of efficiency and functionality. This article first presents an overview and fundamentals of wireless charging. We then provide the review of standards, i.e., Qi and Alliance for Wireless Power (A4WP), and highlight on their communication protocols. Next, we propose a novel concept of wireless charger networking which allows chargers to be connected to facilitate information collection and control. We demonstrate the application of the wireless charger network in user-charger assignment, which clearly shows the benefit in terms of reduced cost for users to identify the best chargers to replenish energy for their mobile devices.

preprint2014arXiv

Wireless Networks with RF Energy Harvesting: A Contemporary Survey

Radio frequency (RF) energy transfer and harvesting techniques have recently become alternative methods to power the next generation wireless networks. As this emerging technology enables proactive energy replenishment of wireless devices, it is advantageous in supporting applications with quality of service (QoS) requirement. In this paper, we present an extensive literature review on the research progresses in wireless networks with RF energy harvesting capability, referred to as RF energy harvesting networks (RF-EHNs). First, we present an overview of the RF-EHNs including system architecture, RF energy harvesting techniques and existing applications. Then, we present the background in circuit design as well as the state-of-the-art circuitry implementations, and review the communication protocols specially designed for RF-EHNs. We also explore various key design issues in the development of RF-EHNs according to the network types, i.e., single-hop network, multi-antenna network, relay network and cognitive radio network. Finally, we envision some open research directions.

preprint2013arXiv

An Auction Mechanism for Resource Allocation in Mobile Cloud Computing Systems

A mobile cloud computing system is composed of heterogeneous services and resources to be allocated by the cloud service provider to mobile cloud users. On one hand, some of these resources are substitutable (e.g., users can use storage from different places) that they have similar functions to the users. On the other hand, some resources are complementary that the user will need them as a bundle (e.g., users need both wireless connection and storage for online photo posting). In this paper, we first model the resource allocation process of a mobile cloud computing system as an auction mechanism with premium and discount factors. The premium and discount factors indicate complementary and substitutable relations among cloud resources provided by the service provider. Then, we analyze the individual rationality and incentive compatibility (truthfulness) properties of the users in the proposed auction mechanism. The optimal solutions of the resource allocation and cost charging schemes in the auction mechanism is discussed afterwards.

preprint2013arXiv

On Murty-Simon Conjecture II

A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on $n$ vertices is at most $\lfloor \frac{n^{2}}{4} \rfloor$ and the extremal graph is the complete bipartite graph $K_{\lfloor \frac{n}{2} \rfloor, \lceil \frac{n}{2} \rceil}$. In the series papers [7-9], the Murty-Simon Conjecture stated by Haynes et al. is not the original conjecture, indeed, it is only for the diameter two edge-critical graphs of even order. In this paper, we completely prove the Murty-Simon Conjecture for the graphs whose complements have vertex connectivity $\ell$, where $\ell = 1, 2, 3$; and for the graphs whose complements have an independent vertex cut of cardinality at least three.

preprint2013arXiv

Tetraquarks, hadronic molecules, meson-meson scattering and disconnected contributions in lattice QCD

There are generally two types of Wick contractions in lattice QCD calculations of a correlation function --- connected and disconnected ones. The disconnected contribution is difficult to calculate and noisy, thus it is often neglected. In the context of studying tetraquarks, hadronic molecules and meson-meson scattering, we show that whenever there are both connected and singly disconnected contractions, the singly disconnected part gives the leading order contribution, and thus should never be neglected. As an explicit example, we show that information about the scalar mesons sigma, f0(980), a0(980) and kappa will be lost when neglecting the disconnected contributions.

preprint2012arXiv

Common dependence on earthquake magnitudes for the trapped particles bursts approaching the earthquake

Trapped particles bursts have long been observed to be frequently occurred several hours before earthquakes, especially for strong earthquakes, from several space experiments during past decades. However, the validity of earthquake origin of particles bursts events is still unsolved. In this paper, we firstly reported the frequency distribution and time evolution of particles bursts within different time windows centered around earthquakes for various magnitudes. The results showed nearly the same systematic dependence of particle bursts frequency on earthquake magnitude and characteristic time decay behavior of average number of particles bursts for various magnitudes. These findings should strengthen the validity of earthquake origin of particles bursts and further understanding of particles bursts as possible precursor of earthquake.

preprint2012arXiv

Global Epigenetic State Network Governs Cellular Pluripotent Reprogramming and Transdifferentiation

How do mammalian cells that share the same genome exist in notably distinct phenotypes, exhibiting differences in morphology, gene expression patterns, and epigenetic chromatin statuses? Furthermore how do cells of different phenotypes differentiate reproducibly from a single fertilized egg? These fundamental questions are closely related to a deeply rooted paradigm in developmental biology that cell differentiation is irreversible. Yet, recently a growing body of research suggests the possibility of cell reprogramming, which offers the potential for us to convert one type of cell into another. Despite the significance of quantitative understandings of cell reprogramming, theoretical efforts often suffer from the complexity of large circuits maintaining cell phenotypes coupled at many different epigenetic and gene regulation levels. To capture the global architecture of cell phenotypes, we propose an "epigenetic state network" approach that translates the classical concept of an epigenetic landscape into a simple-yet-predictive mathematical model. As a testing case, we apply the approach to the reprogramming of fibroblasts (FB) to cardiomyocytes (CM). The epigenetic state network for this case predicts three major pathways of reprogramming. One pathway goes by way of induced pluripotent stem cells (iPSC) and continues on to the normal pathway of cardiomyocyte differentiation. The other two pathways involve transdifferentiation (TD) either indirectly through cardiac progenitor (CP) cells or directly from fibroblast to cardiomyocyte. Numerous experimental observations support the predicted states and pathways.

preprint2011arXiv

Edwards thermodynamics of the jamming transition for frictionless packings: ergodicity test and role of angoricity and compactivity

This paper illustrates how the tools of equilibrium statistical mechanics can help to explain a far-from-equilibrium problem: the jamming transition in frictionless granular materials. Edwards ideas consist of proposing a statistical ensemble of volume and stress fluctuations through the thermodynamic notion of entropy, compactivity, X, and angoricity, A (two temperature-like variables). We find that Edwards thermodynamics is able to describe the jamming transition (J-point). Using the ensemble formalism we elucidate the following: (i)We test the combined volume-stress ensemble by comparing the statistical properties of jammed configurations obtained by dynamics with those averaged over the ensemble of minima in the potential energy landscape as a test of ergodicity. Agreement between both methods supports the idea of "thermalization" at a given angoricity and compactivity. (ii) A microcanonical ensemble analysis supports the idea of maximum entropy principle for grains. (iii) The intensive variables describe the approach to jamming through a series of scaling relations as A {\to} 0+ and X {\to} 0-. Due to the force-volume coupling, the jamming transition can be probed thermodynamically by a "jamming temperature" TJ comprised of contributions from A and X. (iv) The thermodynamic framework reveals the order of the jamming phase transition by showing the absence of critical fluctuations at jamming in observables like pressure and volume. (v) Finally, we elaborate on a comparison with relevant studies showing a breakdown of equiprobability of microstates.

preprint2011arXiv

Study of the NWC electrons belt observed on DEMETER Satellite

We analyzed observation data collected by the Instrument for the Detection of Particles (IDP) on board of DEMETER satellite during the period of total seventeen months in 2007 and 2008. In the meantime, the VLF transmitter located at NWC ground station was shutdown for seven months and working for total ten months. Our analysis, for the first time, revealed in details the transient properties of the space electrons induced by the man-made VLF wave emitted by the transmitter at NWC. First, we mapped the electron flux distribution and figured out the special range what the NWC belt covered. Then we investigated the NWC electron spectrograms in a wide range of McIlwain parameter (up to L=3.0). Finally, we obtained the averaged energy spectrum of the NWC electrons within the drift loss-cone, and compared the difference during the observations between daytime and nighttime. Our results proved the fact that the VLF emissions from NWC transmitter created momentary electron enhancement with fluxes up to 3 orders of magnitude. These electrons are distributed in the region of 180 degree in longitude and 1.6 ~ 1.9 of L shell. In addition, the VLF emission induced either enhancement or loss of electrons in higher magnetic shells up to L=3, and the maximum loss was up to 60% of the original value. The energy spectra of these electrons revealed that the enhancement during the NWC daytime are more attenuated than those in the NWC nighttime, and that the shape and the cutoff energy of the spectra are also quite different. We will present the results of our analysis, compare it with previous studies, and discuss the agreement of our results with the theory of wave-particle interaction.

preprint2010arXiv

Distribution of volumes and coordination number in jammed matter: mesoscopic ensemble

We investigate the distribution of the volume and coordination number associated to each particle in a jammed packing of monodisperse hard sphere using the mesoscopic ensemble developed in Nature 453, 606 (2008). Theory predicts an exponential distribution of the orientational volumes for random close packings and random loose packings. A comparison with computer generated packings reveals deviations from the theoretical prediction in the volume distribution, which can be better modeled by a compressed exponential function. On the other hand, the average of the volumes is well reproduced by the theory leading to good predictions of the limiting densities of RCP and RLP. We discuss a more exact theory to capture the volume distribution in its entire range. The available data suggests a plausible order/disorder transition defining random close packings. Finally, we consider an extended ensemble to calculate the coordination number distribution which is shown to be of an exponential and inverse exponential form for coordinations larger and smaller than the average, respectively, in reasonable agreement with the simulated data.

preprint2010arXiv

Jamming I: A volume function for jammed matter

We introduce a "Hamiltonian"-like function, called the volume function, indispensable to describe the ensemble of jammed matter such as granular materials and emulsions from a geometrical point of view. The volume function represents the available volume of each particle in the jammed systems. At the microscopic level, we show that the volume function is the Voronoi volume associated to each particle and in turn we provide an analytical formula for the Voronoi volume in terms of the contact network, valid for any dimension. We then develop a statistical theory for the probability distribution of the volumes in 3d to calculate an average volume function coarse-grained at a mesoscopic level. The salient result is the discovery of a mesoscopic volume function inversely proportional to the coordination number. Our analysis is the first step toward the calculation of macroscopic observables and equations of state using the statistical mechanics of jammed matter, when supplemented by the condition of mechanical equilibrium of jamming that properly defines jammed matter at the ensemble level.

preprint2010arXiv

Jamming II: Edwards' statistical mechanics of random packings of hard spheres

The problem of finding the most efficient way to pack spheres has an illustrious history, dating back to the crystalline arrays conjectured by Kepler and the random geometries explored by Bernal in the 60's. This problem finds applications spanning from the mathematician's pencil, the processing of granular materials, the jamming and glass transitions, all the way to fruit packing in every grocery. There are presently numerous experiments showing that the loosest way to pack spheres gives a density of ~55% (RLP) while filling all the loose voids results in a maximum density of ~63-64% (RCP). While those values seem robustly true, to this date there is no physical explanation or theoretical prediction for them. Here we show that random packings of monodisperse hard spheres in 3d can pack between the densities 4/(4 + 2 \sqrt 3) or 53.6% and 6/(6 + 2 \sqrt 3) or 63.4%, defining RLP and RCP, respectively. The reason for these limits arises from a statistical picture of jammed states in which the RCP can be interpreted as the ground state of the ensemble of jammed matter with zero compactivity, while the RLP arises in the infinite compactivity limit. We combine an extended statistical mechanics approach 'a la Edwards' (where the role traditionally played by the energy and temperature in thermal systems is substituted by the volume and compactivity) with a constraint on mechanical stability imposed by the isostatic condition. Ultimately, our results lead to a phase diagram that provides a unifying view of the disordered hard sphere packing problem.

preprint2010arXiv

Semiclassical Approach to Survival Probability at Quantum Phase Transitions

We study the decay of survival probability at quantum phase transitions (QPT). The semiclassical theory is found applicable in the vicinities of critical points with infinite degeneracy. The theory predicts a power law decay of the survival probability for relatively long times in systems with d=1 and an exponential decay in systems with sufficiently large d, where d is the degrees of freedom of the underlying classical dynamics. The semiclassical predictions are checked numerically in four models.

preprint2009arXiv

Entropy of jammed matter

We investigate the nature of randomness in disordered packings of frictional spheres. We calculate the entropy of 3D packings through the force and volume ensemble of jammed matter, a mesoscopic ensemble and numerical simulations using volume fluctuation analysis and graph theoretical methods. Equations of state are obtained relating entropy, volume fraction and compactivity characterizing the different states of jammed matter. At the mesoscopic level the entropy vanishes at random close packing. The entropy of the jammed system reveals that the random loose packings are more disordered than random close packings, allowing for an unambiguous interpretation of both limits.

preprint2009arXiv

Jamming III: Characterizing Randomness via the Entropy of Jammed Matter

The nature of randomness in disordered packings of frictional and frictionless spheres is investigated using theory and simulations of identical spherical grains. The entropy of the packings is defined through the force and volume ensemble of jammed matter and shown difficult to calculate analytically. A mesoscopic ensemble of isostatic states is then utilized in an effort to predict the entropy through the defnition of a volume function dependent on the coordination number. Equations of state are obtained relating entropy, volume fraction and compactivity characterizing the different states of jammed matter, and elucidating the phase diagram for jammed granular matter. Analytical calculations are compared to numerical simulations using volume fluctuation analysis and graph theoretical methods, with reasonable agreement. The entropy of the jammed system reveals that the random loose packings are more disordered than random close packings, allowing for an unambiguous interpretation of both limits. Ensemble calculations show that the entropy vanishes at random close packing (RCP), while numerical simulations show that a finite entropy remains in the microscopic states at RCP. The notion of a negative compactivity, that explores states with volume fractions below those achievable by existing simulation protocols, is also explored, expanding the equations of state. We discuss possible extensions to the present mesoscopic approach describing packings from RLP to RCP to the ordered branch of the equation of state in an effort to understand the entropy of jammed matter in the full range of densities from RLP to FCC.

preprint2008arXiv

Ashkin-Teller formalism for elastic response of DNA molecule to external force and torque

We propose an Ashkin-Teller like model for elastic response of DNA molecule to external force and torque. The base-stacking interaction is described in a simple and uniform way. We obtain the phase diagram of dsDNA, and in particular, the transition from B form to the S state induced by stretching and twisting. The elastic response of the ssDNA is presented also in a unified formalism. The close relation of dsDNA molecule structure with elastic response is shown clearly. The calculated folding angle of the dsDNA molecule is $59.2^o$.

preprint2008arXiv

Franck-Condon principle for heavy-quark hadron decays

The Franck-Condon principle governing molecular electronic transitions is utilized to study heavy-quark hadron decays. This provides a direct assessment of the wavefunction of the parent hadron if the momentum distribution of the open-flavor decay products is measured. Model-independent results include an experimental distinction between quarkonium and exotica (hybrids, tetraquarks...), an off-plane correlator signature for tetraquarks and a direct probe of the sea quark orbital wavefunction relevant in the discussion of 3S_1 or 3P_0 decay mechanisms.

preprint2008arXiv

From force distribution to average coordination number in frictional granular matter

We study the joint probability distribution of normal and tangential frictional forces in jammed granular media, $P_μ(f_t, f_n)$, for various friction coefficient $μ$, especially when $μ= \infty$. A universal scaling law is found to collapse the data for $μ=0$ to $\infty$ demonstrating a link between force distribution $P_μ(f_t, f_n)$ and average coordination number, $z^μ_c$. The results determine $z_c^μ$ for a finite friction coefficient, extending the constraints counting argument of isostatic granular packing to finite frictional packings.

preprint2007arXiv

Voice Service Support in Mobile Ad Hoc Networks

Mobile ad hoc networks are expected to support voice traffic. The requirement for small delay and jitter of voice traffic poses a significant challenge for medium access control (MAC) in such networks. User mobility makes it more complex due to the associated dynamic path attenuation. In this paper, a MAC scheme for mobile ad hoc networks supporting voice traffic is proposed. With the aid of a low-power probe prior to DATA transmissions, resource reservation is achieved in a distributed manner, thus leading to small delay and jitter. The proposed scheme can automatically adapt to dynamic path attenuation in a mobile environment. Simulation results demonstrate the effectiveness of the proposed scheme.

preprint2006arXiv

Dynamic particle tracking reveals the aging temperature of a colloidal glass

Understanding glasses is considered to be one of the most fundamental problems in statistical physics. A theoretical approach to unravel their universal properties is to consider the validity of equilibrium concepts such as temperature and thermalization in these out-of-equilibrium systems. Here we investigate the autocorrelation and response function to monitor the aging of a colloidal glass. At equilibrium, all the observables are stationary while in the out-of-equilibrium glassy state they have an explicit dependence on the age of the system. We find that the transport coefficients scale with the aging-time as a power-law, a signature of the slow relaxation. Nevertheless, our analysis reveals that the glassy system has thermalized at a constant temperature independent of the age and larger than the bath, reflecting the structural rearrangements of cage-dynamics. Furthermore, a universal scaling law is found to describe the global and local fluctuations of the observables.

Ping Wang

What is connected

Connect this record

See the researcher in context

Building this map preview

90 published item(s)

Brightest GRB flare observed in GRB 221009A: bridge the last gap between flare and prompt emission in GRB

Deep Probabilistic Unfolding for Quantized Compressive Sensing

Finite-Size Gradient Transport in Large Language Model Pretraining: From Cascade Size to Intensive Transport Efficiency

Hierarchical LLM-Driven Control for HAPS-Assisted UAV Networks: Joint Optimization of Flight and Connectivity

PulseMind: A Multi-Modal Medical Model for Real-World Clinical Diagnosis

SongSage: A Large Musical Language Model with Lyric Generative Pre-training

On thermodynamically consistent quasiparticle model at finite chemical potential

A Bidirectional Tree Tagging Scheme for Joint Medical Relation Extraction

A Deep Reinforcement Learning-Based Caching Strategy for IoT Networks with Transient Data

A Sequence Tagging based Framework for Few-Shot Relation Extraction

An Ultra-Reliable Low-Latency Non-Binary Polar Coded SCMA Scheme

Attention-based Aspect Reasoning for Knowledge Base Question Answering on Clinical Notes

Boundary-aware Information Maximization for Self-supervised Medical Image Segmentation

Event Detection Explorer: An Interactive Tool for Event Detection Exploration

Insight-HXMT dedicated 33-day observation of SGR J1935+2154 I. Burst Catalog

Insight-HXMT dedicated 33-day observation of SGR J1935+2154 II. Burst Spectral Catalog

Localization Distillation for Dense Object Detection

Node Selection Toward Faster Convergence for Federated Learning on Non-IID Data

PINO-MBD: Physics-informed Neural Operator for Solving Coupled ODEs in Multi-body Dynamics

Transferable Deep Reinforcement Learning Framework for Autonomous Vehicles with Joint Radar-Data Communications

Ambient Backscatter-Assisted Wireless-Powered Relaying

Few-shot Image Classification with Multi-Facet Prototypes

Millimeter Wave MIMO based Depth Maps for Wireless Virtual and Augmented Reality

Quantum nonlinear spectroscopy of single nuclear spins

RAGA: Relation-aware Graph Attention Networks for Global Entity Alignment

Restoring the top-of-atmosphere reflectance during solar eclipses: a proof of concept with the UV Absorbing Aerosol Index measured by TROPOMI

Sea quark contributions to the electromagnetic form factors of $Σ$ hyperons

A Simple and Effective Self-Supervised Contrastive Learning Framework for Aspect Detection

Auction Mechanisms in Cloud/Fog Computing Resource Allocation for Public Blockchain Networks

Enhancing the Performance of Practical Profiling Side-Channel Attacks Using Conditional Generative Adversarial Networks

GPView: a program for wave function analysis and visualization

Hadronic cross section of $e^+e^-$ annihilation at bottomonium energy region

Mechanism Design for Wireless Powered Spatial Crowdsourcing Networks

Optimal Pricing of Internet of Things: A Machine Learning Approach

Performance Limits of Differential Power Processing

Sea quark contributions to nucleon electromagnetic form factors with the nonlocal chiral effective Lagrangian

Shipper Cooperation in Stochastic Drone Delivery: A Dynamic Bayesian Game Approach

Structural properties and average tapping time on scale-free graphs with smallest diameter

Text-to-SQL Generation for Question Answering on Electronic Medical Records

Toward an Automated Auction Framework for Wireless Federated Learning Services Market

Trapping problem on star-type graphs with applications

An ensemble of random graphs with identical degree distribution

Angoricity and compactivity describe the jamming transition in soft particulate matter

Chiral extrapolation of nucleon axial charge $g_A$ in effective field theory

Data Collection and Wireless Communication in Internet of Things (IoT) Using Economic Analysis and Pricing Models: A Survey

Efficient Background Modeling Based on Sparse Representation and Outlier Iterative Removal

High fidelity transfer and storage of photon states in a single nuclear spin

Market Model and Optimal Pricing Scheme of Big Data and Internet of Things (IoT)

Multiparty quantum key agreement protocol secure against collusion attacks

The Tradeoff Analysis in RF-Powered Backscatter Cognitive Radio Networks

Theory of random packings

Towards Optimal Energy Management of Microgrids with a Realistic Model

Applications of Repeated Games in Wireless Networks: A Survey

Constraining the Lorentz invariance violation from the continuous spectra of short gamma-ray bursts

Hierarchical Cooperation for Operator-Controlled Device-to-Device Communications: A Layered Coalitional Game Approach

Performance Analysis of Ambient RF Energy Harvesting with Repulsive Point Process Modeling

Performance Analysis of Simultaneous Wireless Information and Power Transfer with Ambient RF Energy Harvesting

Smart Data Pricing Models for Internet-of-Things (IoT): A Bundling Strategy Approach

Strongly polarizing weakly coupled $^{13}$C nuclear spins with optically pumped nitrogen-vacancy center

Theory of nuclear spin dephasing and relaxation by optically illuminated nitrogen-vancy center

Wireless Charging Technologies: Fundamentals, Standards, and Network Applications

A Layered Coalitional Game Framework of Wireless Relay Network

Adaptive Power Management for Wireless Base Station in Smart Grid Environment

CosmoMC Installation and Running Guidelines

Dynamic Spectrum Access in Cognitive Radio Networks with RF Energy Harvesting

Inflation in de Sitter spacetime and CMB large scales anomaly

Payoff Allocation of Service Coalition in Wireless Mesh Network: A Cooperative Game Perspective

Performance Analysis of Ambient RF Energy Harvesting: A Stochastic Geometry Approach

Quantum theory of nuclear spin dynamics in diamond nitrogen-vacancy center

Resource Allocation in Wireless Networks with RF Energy Harvesting and Transfer

Wireless Charger Networking for Mobile Devices: Fundamentals, Standards, and Applications

Wireless Networks with RF Energy Harvesting: A Contemporary Survey

An Auction Mechanism for Resource Allocation in Mobile Cloud Computing Systems

On Murty-Simon Conjecture II