Searcharxiv⌕ Search

arXiv subjects

Peng Wang

Publications and source records attributed to Peng Wang.

At least 775 records · Page 43Linked to original sources

Minimal Length Effect on Thermodynamics and Weak Cosmic Censorship Conjecture in anti-de Sitter Black Holes via Charged Particle Absorption

In this paper, we investigate minimal length effects on the thermodynamics and weak cosmic censorship conjecture in a RN-AdS black bole via charged particle absorption. We first use the generalized uncertainty principle (GUP) to investigate the minimal length effect on the Hamilton-Jacobi equation. After the deformed Hamilton-Jacobi equation is derived, we use it to study the variations of the thermodynamic quantities of a RN-Ads black hole via absorbing a charged practice. Furthermore, we check the second law of thermodynamics and the weak cosmic censorship conjecture in two phase spaces. In the normal phase space, the second law of thermodynamics and the weak cosmic censorship conjecture are satisfied in the usual and GUP deformed cases, and the minimal length effect makes the increase of entropy faster than the usual case. After the charge particle absorption, the extremal RN-AdS black hole becomes non-extremal. In the extended phase space, the black hole entropy can either increase or decrease. When $T>2Pr_{+}$, the second law is satisfied. When $T<2Pr_{+}$, the second law of thermodynamics is violated for the extremal or near-extremal black hole. Finally, we find that the weak cosmic censorship conjecture is legal for extremal and near-extremal RN-Ads black holes in the GUP deformed case.

gr-qc↗

Pluggable Weakly-Supervised Cross-View Learning for Accurate Vehicle Re-Identification

Learning cross-view consistent feature representation is the key for accurate vehicle Re-identification (ReID), since the visual appearance of vehicles changes significantly under different viewpoints. To this end, most existing approaches resort to the supervised cross-view learning using extensive extra viewpoints annotations, which however, is difficult to deploy in real applications due to the expensive labelling cost and the continous viewpoint variation that makes it hard to define discrete viewpoint labels. In this study, we present a pluggable Weakly-supervised Cross-View Learning (WCVL) module for vehicle ReID. Through hallucinating the cross-view samples as the hardest positive counterparts in feature domain, we can learn the consistent feature representation via minimizing the cross-view feature distance based on vehicle IDs only without using any viewpoint annotation. More importantly, the proposed method can be seamlessly plugged into most existing vehicle ReID baselines for cross-view learning without re-training the baselines. To demonstrate its efficacy, we plug the proposed method into a bunch of off-the-shelf baselines and obtain significant performance improvement on four public benchmark datasets, i.e., VeRi-776, VehicleID, VRIC and VRAI.

cs.CV↗

Validity of Thermodynamic Laws and Weak Cosmic Censorship for AdS Black Holes and Black Holes in a Cavity

By throwing a test charged particle into a Reissner-Nordstrom (RN) black hole, we test the validity of the first and second laws of thermodynamics and weak cosmic censorship conjecture (WCCC) with two types of boundary conditions, i.e., the asymptotically anti-de Sitter (AdS) space and a Dirichlet cavity wall placed in the asymptotically at space. For the RN-AdS black hole, the second law of thermodynamics is satisfied, and the WCCC is violated for both extremal and nearextremal black holes. For the RN black hole in a cavity, the entropy can either increase or decrease depending on the change in the charge, and WCCC is satisfied/violated for the extremal/nearextremal black hole. Our results indicate that there may be a connection between the black hole thermodynamics and the boundary condition imposed on the black hole.

gr-qc↗

Scalable Learning With a Structural Recurrent Neural Network for Short-Term Traffic Prediction

This paper presents a scalable deep learning approach for short-term traffic prediction based on historical traffic data in a vehicular road network. Capturing the spatio-temporal relationship of the big data often requires a significant amount of computational burden or an ad-hoc design aiming for a specific type of road network. To tackle the problem, we combine a road network graph with recurrent neural networks (RNNs) to construct a structural RNN (SRNN). The SRNN employs a spatio-temporal graph to infer the interaction between adjacent road segments as well as the temporal dynamics of the time series data. The model is scalable thanks to two key aspects. First, the proposed SRNN architecture is built by using the semantic similarity of the spatio-temporal dynamic interactions of all segments. Second, we design the architecture to deal with fixed-length tensors regardless of the graph topology. With the real traffic speed data measured in the city of Santander, we demonstrate the proposed SRNN outperforms the image-based approaches using the capsule network (CapsNet) by 14.1% and the convolutional neural network (CNN) by 5.87%, respectively, in terms of root mean squared error (RMSE). Moreover, we show that the proposed model is scalable. The SRNN model trained with data of a road network is able to predict traffic speed of different road networks, with the fixed number of parameters to train.

cs.LG↗

Scalarized Einstein-Maxwell-scalar Black Holes in Anti-de Sitter Spacetime

In this paper, we study spontaneous scalarization of asymptotically anti-de Sitter charged black holes in the Einstein-Maxwell-scalar model with a non-minimal coupling between the scalar and Maxwell fields. In this model, Reissner-Nordström-AdS (RNAdS) black holes are scalar-free black hole solutions, and may induce scalarized black holes due to the presence of a tachyonic instability of the scalar field near the event horizon. For RNAdS and scalarized black hole solutions, we investigate the domain of existence, perturbative stability against spherical perturbations and phase structure. In a micro-canonical ensemble, scalarized solutions are always thermodynamically preferred over RNAdS black holes. However, the system has much rich phase structure and phase transitions in a canonical ensemble. In particular, we report a RNAdS BH/scalarized BH/RNAdS BH reentrant phase transition, which is composed of a zeroth-order phase transition and a second-order one.

gr-qc↗

Scalarized Einstein-Born-Infeld-scalar Black Holes

The phenomenon of spontaneous scalarization of Reissner-Nordström (RN) black holes has recently been found in an Einstein-Maxwell-scalar (EMS) model due to a non-minimal coupling between the scalar and Maxwell fields. Non-linear electrodynamics, e.g., Born-Infeld (BI) electrodynamics, generalizes Maxwell's theory in the strong field regime. Non-minimally coupling the BI field to the scalar field, we study spontaneous scalarization of an Einstein-Born-Infeld-scalar (EBIS) model in this paper. It shows that there are two types of scalarized black hole solutions, i.e., scalarized RN-like and Schwarzschild-like solutions. Although the behavior of scalarized RN-like solutions in the EBIS model is quite similar to that of scalarize solutions in the EMS model, we find that there exist significant differences between scalarized Schwarzschild-like solutions in the EBIS model and scalarized solutions in the EMS model. In particular, the domain of existence of scalarized Schwarzschild-like solutions possesses a certain region, which is composed of two branches. The branch of larger horizon area is a family of disconnected scalarized solutions, which do not bifurcate from scalar-free black holes. However, the branch of smaller horizon area may or may not bifurcate from scalar-free black holes depending on the parameters. Additionally, these two branches of scalarized solutions can be both entropically disfavored over comparable scalar-free black holes in some parameter region.

gr-qc↗

Quantifying Bounds of Model Gap for Synchronous Generators

In practice, uncertainties in parameters and model structures always cause a gap between a model and the corresponding physical entity. Hence, to evaluate the performance of a model, the bounds of this gap must be assessed. In this paper, we propose a trajectory-sensitivity--based approach to quantify the bounds of the gap. The trajectory sensitivity is expressed as a linear time-varying system. We thus first derive several bounds for a general linear time-varying system in different scenarios. The derived bounds are then applied to obtain bounds of the model gap for generator plant models with different types of structural information, e.g., models of different orders. Case studies are carried out to show the efficacy of the bounds through synchronous generator models on different accuracy levels.

math.OC↗

Double band inversion in the topological phase transition of Ge1-xSnx alloys

We use first-principles simulation and virtual crystal approximation to reveal the unique double band inversion and topological phase transition in Ge1-xSnx alloys. Wavefunction parity, spatial charge distribution and surface state spectrum analyses suggest that the band inversion in Ge1-xSnx is relayed by its first valence band. As the system evolves from Ge to α-Sn, its conduction band moves down, and inverts with the first and the second valence bands consecutively. The first band inversion makes the system nontrivial, while the second one does not change the topological invariant of the system. Both the band inversions yield surface modes spanning the individual inverted gaps, but only the surface mode in the upper gap associates with the nontrivial nature of tensile-strained α-Sn.

cond-mat.mtrl-sci↗

Fine-Grained Vehicle Perception via 3D Part-Guided Visual Data Augmentation

Holistically understanding an object and its 3D movable parts through visual perception models is essential for enabling an autonomous agent to interact with the world. For autonomous driving, the dynamics and states of vehicle parts such as doors, the trunk, and the bonnet can provide meaningful semantic information and interaction states, which are essential to ensuring the safety of the self-driving vehicle. Existing visual perception models mainly focus on coarse parsing such as object bounding box detection or pose estimation and rarely tackle these situations. In this paper, we address this important autonomous driving problem by solving three critical issues. First, to deal with data scarcity, we propose an effective training data generation process by fitting a 3D car model with dynamic parts to vehicles in real images before reconstructing human-vehicle interaction (VHI) scenarios. Our approach is fully automatic without any human interaction, which can generate a large number of vehicles in uncommon states (VUS) for training deep neural networks (DNNs). Second, to perform fine-grained vehicle perception, we present a multi-task network for VUS parsing and a multi-stream network for VHI parsing. Third, to quantitatively evaluate the effectiveness of our data augmentation approach, we build the first VUS dataset in real traffic scenarios (e.g., getting on/out or placing/removing luggage). Experimental results show that our approach advances other baseline methods in 2D detection and instance segmentation by a big margin (over 8%). In addition, our network yields large improvements in discovering and understanding these uncommon cases. Moreover, we have released the source code, the dataset, and the trained model on Github (https://github.com/zongdai/EditingForDNN).

cs.CV↗

MeisterMorxrc at SemEval-2020 Task 9: Fine-Tune Bert and Multitask Learning for Sentiment Analysis of Code-Mixed Tweets

Natural language processing (NLP) has been applied to various fields including text classification and sentiment analysis. In the shared task of sentiment analysis of code-mixed tweets, which is a part of the SemEval-2020 competition~\cite{patwa2020sentimix}, we preprocess datasets by replacing emoji and deleting uncommon characters and so on, and then fine-tune the Bidirectional Encoder Representation from Transformers(BERT) to perform the best. After exhausting top3 submissions, Our team MeisterMorxrc achieves an averaged F1 score of 0.730 in this task, and and our codalab username is MeisterMorxrc.

cs.CL↗

Simple is not Easy: A Simple Strong Baseline for TextVQA and TextCaps

Texts appearing in daily scenes that can be recognized by OCR (Optical Character Recognition) tools contain significant information, such as street name, product brand and prices. Two tasks -- text-based visual question answering and text-based image captioning, with a text extension from existing vision-language applications, are catching on rapidly. To address these problems, many sophisticated multi-modality encoding frameworks (such as heterogeneous graph structure) are being used. In this paper, we argue that a simple attention mechanism can do the same or even better job without any bells and whistles. Under this mechanism, we simply split OCR token features into separate visual- and linguistic-attention branches, and send them to a popular Transformer decoder to generate answers or captions. Surprisingly, we find this simple baseline model is rather strong -- it consistently outperforms state-of-the-art (SOTA) models on two popular benchmarks, TextVQA and all three tasks of ST-VQA, although these SOTA models use far more complex encoding mechanisms. Transferring it to text-based image captioning, we also surpass the TextCaps Challenge 2020 winner. We wish this work to set the new baseline for this two OCR text related applications and to inspire new thinking of multi-modality encoder design. Code is available at https://github.com/ZephyrZhuQi/ssbaseline

cs.CV↗

TP-TIO: A Robust Thermal-Inertial Odometry with Deep ThermalPoint

To achieve robust motion estimation in visually degraded environments, thermal odometry has been an attraction in the robotics community. However, most thermal odometry methods are purely based on classical feature extractors, which is difficult to establish robust correspondences in successive frames due to sudden photometric changes and large thermal noise. To solve this problem, we propose ThermalPoint, a lightweight feature detection network specifically tailored for producing keypoints on thermal images, providing notable anti-noise improvements compared with other state-of-the-art methods. After that, we combine ThermalPoint with a novel radiometric feature tracking method, which directly makes use of full radiometric data and establishes reliable correspondences between sequential frames. Finally, taking advantage of an optimization-based visual-inertial framework, a deep feature-based thermal-inertial odometry (TP-TIO) framework is proposed and evaluated thoroughly in various visually degraded environments. Experiments show that our method outperforms state-of-the-art visual and laser odometry methods in smoke-filled environments and achieves competitive accuracy in normal environments.

cs.RO↗

Hyperspectral Classification Based on Lightweight 3-D-CNN With Transfer Learning

Recently, hyperspectral image (HSI) classification approaches based on deep learning (DL) models have been proposed and shown promising performance. However, because of very limited available training samples and massive model parameters, DL methods may suffer from overfitting. In this paper, we propose an end-to-end 3-D lightweight convolutional neural network (CNN) (abbreviated as 3-D-LWNet) for limited samples-based HSI classification. Compared with conventional 3-D-CNN models, the proposed 3-D-LWNet has a deeper network structure, less parameters, and lower computation cost, resulting in better classification performance. To further alleviate the small sample problem, we also propose two transfer learning strategies: 1) cross-sensor strategy, in which we pretrain a 3-D model in the source HSI data sets containing a greater number of labeled samples and then transfer it to the target HSI data sets and 2) cross-modal strategy, in which we pretrain a 3-D model in the 2-D RGB image data sets containing a large number of samples and then transfer it to the target HSI data sets. In contrast to previous approaches, we do not impose restrictions over the source data sets, in which they do not have to be collected by the same sensors as the target data sets. Experiments on three public HSI data sets captured by different sensors demonstrate that our model achieves competitive performance for HSI classification compared to several state-of-the-art methods

cs.CV↗

Fix the dual geometries of $T\bar{T}$ deformed CFT$_2$ and highly excited states of CFT$_2$

In previous works, we have developed an approach to fix the leading behaviors of the pure AdS$_3$ and BTZ black hole from the entanglement entropies of the free CFT$_2$ and finite temperature CFT$_2$, respectively. We exclusively use holographic principle only and make no restriction about the bulk geometry, not only the kinematics but also the dynamics. In order to verify the universality and correctness of our method, in this paper, we apply it to the $T\bar{T}$ deformed CFT$_2$, which breaks the conformal symmetry. In terms of the physical arguments of the $T\bar{T}$ deformed CFT$_2$, the derived metric is a deformed BTZ black hole. The requirement that the CFT$_2$ lives on a conformally flat boundary leads to $r_{c}^{2}=\ 6R_{AdS}^{4}/(πcμ)$ naturally, in perfect agreement with previous conjectures in literature. The energy spectum and propagation speed calculated with this deformed BTZ metric are the same as these derived from $T\bar{T}$ deformed CFT$_2$. We furthermore fix the dual geometry of highly excited states with our approach. The result contains the descriptions for the conical defect and BTZ black hole.

hep-th↗

WikiAsp: A Dataset for Multi-domain Aspect-based Summarization

Aspect-based summarization is the task of generating focused summaries based on specific points of interest. Such summaries aid efficient analysis of text, such as quickly understanding reviews or opinions from different angles. However, due to large differences in the type of aspects for different domains (e.g., sentiment, product features), the development of previous models has tended to be domain-specific. In this paper, we propose WikiAsp, a large-scale dataset for multi-domain aspect-based summarization that attempts to spur research in the direction of open-domain aspect-based summarization. Specifically, we build the dataset using Wikipedia articles from 20 different domains, using the section titles and boundaries of each article as a proxy for aspect annotation. We propose several straightforward baseline models for this task and conduct experiments on the dataset. Results highlight key challenges that existing summarization models face in this setting, such as proper pronoun handling of quoted sources and consistent explanation of time-sensitive events.

cs.CL↗

Automatic test system of the back-end card for the JUNO experiment

The Jiangmen Underground Neutrino Observatory (JUNO) is a medium-baseline neutrino experiment under construction in China, with the goal to determine the neutrino mass hierarchy. The JUNO electronics readout system consists of an underwater front-end electronics system and an outside-water back-end electronics system. These two parts are connected by 100-meter Ethernet cables and power cables. The back-end card (BEC) is the part of the JUNO electronics readout system used to link the underwater boxes to the trigger system is connected to transmit the system clock and triggered signals. Each BEC is connected to 48 underwater boxes, and in total around 150 BECs are needed. It is essential to verify the physical layer links before applying real connection with the underwater system. Therefore, our goal is to build an automatic test system to check the physical link performance. The test system is based on a custom designed FPGA board, in order to make the design general, only JTAG is used as the interface to the PC. The system can generate and check different data pattern at different speeds for 96 channels simultaneously. The test results of 1024 continuously clock cycles are automatically uploaded to PC periodically. We describe the setup of the automatic test system of the BEC and present the latest test results.

physics.ins-det↗

Deep Domain Adaptive Object Detection: a Survey

Deep learning (DL) based object detection has achieved great progress. These methods typically assume that large amount of labeled training data is available, and training and test data are drawn from an identical distribution. However, the two assumptions are not always hold in practice. Deep domain adaptive object detection (DDAOD) has emerged as a new learning paradigm to address the above mentioned challenges. This paper aims to review the state-of-the-art progress on deep domain adaptive object detection approaches. Firstly, we introduce briefly the basic concepts of deep domain adaptation. Secondly, the deep domain adaptive detectors are classified into five categories and detailed descriptions of representative methods in each category are provided. Finally, insights for future research trend are presented.

cs.CV↗

A Method to Learn Embedding of a Probabilistic Medical Knowledge Graph: Algorithm Development

This paper proposes an algorithm named as PrTransH to learn embedding vectors from real world EMR data based medical knowledge. The unique challenge in embedding medical knowledge graph from real world EMR data is that the uncertainty of knowledge triplets blurs the border between "correct triplet" and "wrong triplet", changing the fundamental assumption of many existing algorithms. To address the challenge, some enhancements are made to existing TransH algorithm, including: 1) involve probability of medical knowledge triplet into training objective; 2) replace the margin-based ranking loss with unified loss calculation considering both valid and corrupted triplets; 3) augment training data set with medical background knowledge. Verifications on real world EMR data based medical knowledge graph prove that PrTransH outperforms TransH in link prediction task. To the best of our survey, this paper is the first one to learn and verify knowledge embedding on probabilistic knowledge graphs.

cs.AI↗