Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
39works
0followers
25topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

39 published item(s)

preprint2026arXiv

SARU: A Shadow-Aware and Removal Unified Framework for Remote Sensing Images with New Benchmarks

Shadows are a prevalent problem in remote sensing imagery (RSI), degrading visual quality and severely limiting the performance of downstream tasks like object detection and semantic segmentation. Most prior works treat shadow detection and removal as separate, cascaded tasks, which can lead to cumbersome process and error accumulation. Furthermore, many deep learning methods rely on paired shadow and non-shadow images for training, which are often unavailable in practice. To address these challenges, we propose Shadow-Aware and Removal Unified (SARU) Framework , a cohesive two-stage framework. First, its dual-branch detection module (DBCSF-Net) fuses multi-color space and semantic features to generate high-fidelity shadow masks, effectively distinguishing shadows from dark objects. Then, leveraging these masks, a novel, training-free physical algorithm (N$^2$SGSR) restores illumination by transferring properties from adjacent non-shadow regions within the single input image. To facilitate rigorous evaluation and foster future work, we also introduce two new benchmark datasets: the RSI Shadow Detection (RSISD) dataset and the Single-image Shadow Removal Benchmark (SiSRB). Extensive experiments on the AISD and RSISD datasets demonstrate that SARU achieves SOTA shadow detection performance. For shadow removal, our training-free N$^2$SGSR algorithm attains an average processing speed of approximately $1.3$s, which is over $10$ times faster than the SOTA MAOSD while maintains an SRI value close to 0.9 on both the AISD and SiSRB datasets, a level comparable to the advanced RS-GSSR method. By holistically integrating shadow detection and removal to mitigate error propagation and eliminating the dependency on paired training data, SARU establishes a robust, practical framework for real-world RSI analysis. The code and datasets are publicly available at: https://github.com/AeroVILab-AHU/SARU

preprint2022arXiv

A New Fault-Tolerant Synchronization Scheme with Anonymous Pulses

Robust pulse synchronization is fundamental in constructing reliable synchronous applications in wired and wireless distributed systems. In wired systems, self-stabilizing Byzantine pulse synchronization aims for synchronizing fault-prone distributed components with arbitrary initial states in bounded-delay message-passing systems. In wireless systems, fault-tolerant synchronization of pulse-coupled oscillators is also built for a similar goal but often works under specific system restrictions, such as low computation power, low message complexity, and anonymous physical pulses whose senders cannot be identified by the receivers. These restrictions often prevent us from constructing high-reliable wireless synchronous applications. This paper tries to break barriers between bounded-delay message-passing systems and classical pulse-coupled oscillators by introducing a new fault-tolerant synchronization scheme for the so-called anonymous bounded-delay pulsing systems in the presence of indeterministic communication delays and inconsistent faults. For low computation power and low message complexity, instead of involving in consensus-based primitives, the proposed synchronization scheme integrates the so-called discrete mean-fields, planar random walks, and some additional easy operations in utilizing only sparsely generated anonymous pulses. For fault-tolerance, we show that a square-root number of faulty oscillators can be tolerated by utilizing planar random walks in anonymous pulse synchronization. For self-stabilization, we show that the stabilization can be reached in an expected constant number of observing windows in anonymous bounded-delay pulsing systems with the pulsing-frequency restriction.

preprint2022arXiv

A No-Reference Deep Learning Quality Assessment Method for Super-resolution Images Based on Frequency Maps

To support the application scenarios where high-resolution (HR) images are urgently needed, various single image super-resolution (SISR) algorithms are developed. However, SISR is an ill-posed inverse problem, which may bring artifacts like texture shift, blur, etc. to the reconstructed images, thus it is necessary to evaluate the quality of super-resolution images (SRIs). Note that most existing image quality assessment (IQA) methods were developed for synthetically distorted images, which may not work for SRIs since their distortions are more diverse and complicated. Therefore, in this paper, we propose a no-reference deep-learning image quality assessment method based on frequency maps because the artifacts caused by SISR algorithms are quite sensitive to frequency information. Specifically, we first obtain the high-frequency map (HM) and low-frequency map (LM) of SRI by using Sobel operator and piecewise smooth image approximation. Then, a two-stream network is employed to extract the quality-aware features of both frequency maps. Finally, the features are regressed into a single quality value using fully connected layers. The experimental results show that our method outperforms all compared IQA models on the selected three super-resolution quality assessment (SRQA) databases.

preprint2022arXiv

ADT-SSL: Adaptive Dual-Threshold for Semi-Supervised Learning

Semi-Supervised Learning (SSL) has advanced classification tasks by inputting both labeled and unlabeled data to train a model jointly. However, existing SSL methods only consider the unlabeled data whose predictions are beyond a fixed threshold (e.g., 0.95), ignoring the valuable information from those less than 0.95. We argue that these discarded data have a large proportion and are usually of hard samples, thereby benefiting the model training. This paper proposes an Adaptive Dual-Threshold method for Semi-Supervised Learning (ADT-SSL). Except for the fixed threshold, ADT extracts another class-adaptive threshold from the labeled data to take full advantage of the unlabeled data whose predictions are less than 0.95 but more than the extracted one. Accordingly, we engage CE and $L_2$ loss functions to learn from these two types of unlabeled data, respectively. For highly similar unlabeled data, we further design a novel similar loss to make the prediction of the model consistency. Extensive experiments are conducted on benchmark datasets, including CIFAR-10, CIFAR-100, and SVHN. Experimental results show that the proposed ADT-SSL achieves state-of-the-art classification accuracy.

preprint2022arXiv

Blind Surveillance Image Quality Assessment via Deep Neural Network Combined with the Visual Saliency

The intelligent video surveillance system (IVSS) can automatically analyze the content of the surveillance image (SI) and reduce the burden of the manual labour. However, the SIs may suffer quality degradations in the procedure of acquisition, compression, and transmission, which makes IVSS hard to understand the content of SIs. In this paper, we first conduct an example experiment (i.e. the face detection task) to demonstrate that the quality of the SIs has a crucial impact on the performance of the IVSS, and then propose a saliency-based deep neural network for the blind quality assessment of the SIs, which helps IVSS to filter the low-quality SIs and improve the detection and recognition performance. Specifically, we first compute the saliency map of the SI to select the most salient local region since the salient regions usually contain rich semantic information for machine vision and thus have a great impact on the overall quality of the SIs. Next, the convolutional neural network (CNN) is adopted to extract quality-aware features for the whole image and local region, which are then mapped into the global and local quality scores through the fully connected (FC) network respectively. Finally, the overall quality score is computed as the weighted sum of the global and local quality scores. Experimental results on the SI quality database (SIQD) show that the proposed method outperforms all compared state-of-the-art BIQA methods.

preprint2022arXiv

DAMO-NLP at SemEval-2022 Task 11: A Knowledge-based System for Multilingual Named Entity Recognition

The MultiCoNER shared task aims at detecting semantically ambiguous and complex named entities in short and low-context settings for multiple languages. The lack of contexts makes the recognition of ambiguous named entities challenging. To alleviate this issue, our team DAMO-NLP proposes a knowledge-based system, where we build a multilingual knowledge base based on Wikipedia to provide related context information to the named entity recognition (NER) model. Given an input sentence, our system effectively retrieves related contexts from the knowledge base. The original input sentences are then augmented with such context information, allowing significantly better contextualized token representations to be captured. Our system wins 10 out of 13 tracks in the MultiCoNER shared task.

preprint2022arXiv

Deep Neural Network for Blind Visual Quality Assessment of 4K Content

The 4K content can deliver a more immersive visual experience to consumers due to the huge improvement of spatial resolution. However, existing blind image quality assessment (BIQA) methods are not suitable for the original and upscaled 4K contents due to the expanded resolution and specific distortions. In this paper, we propose a deep learning-based BIQA model for 4K content, which on one hand can recognize true and pseudo 4K content and on the other hand can evaluate their perceptual visual quality. Considering the characteristic that high spatial resolution can represent more abundant high-frequency information, we first propose a Grey-level Co-occurrence Matrix (GLCM) based texture complexity measure to select three representative image patches from a 4K image, which can reduce the computational complexity and is proven to be very effective for the overall quality prediction through experiments. Then we extract different kinds of visual features from the intermediate layers of the convolutional neural network (CNN) and integrate them into the quality-aware feature representation. Finally, two multilayer perception (MLP) networks are utilized to map the quality-aware features into the class probability and the quality score for each patch respectively. The overall quality index is obtained through the average pooling of patch results. The proposed model is trained through the multi-task learning manner and we introduce an uncertainty principle to balance the losses of the classification and regression tasks. The experimental results show that the proposed model outperforms all compared BIQA metrics on four 4K content quality assessment databases.

preprint2022arXiv

Efficient Generation of Tunable Magnetic and Optical Vortices Using Plasmas

Plasma is an attractive medium for generating strong microscopic magnetic structures and tunable electromagnetic radiation with predictable topologies due to its extraordinary ability to sustain and manipulate high currents and strong fields. Here, using theory and simulations, we show efficient generation of multi-megagauss magnetic and tunable optical vortices when a sharp relativistic ionization front (IF) passes through a relatively long-wavelength Laguerre-Gaussian (LG) laser pulse with orbital angular momentum (OAM). The optical vortex is frequency upshifted within a wide spectral range simply by changing the plasma density and compressed in duration. The topological charges of both vortices can be manipulated by controlling the OAM mode of the incident LG laser and/or by controlling the topology and density of the IF. For relatively high (low) plasma densities, most energy of the incident LG laser pulse is converted to the magnetic (optical) vortex.

preprint2022arXiv

Electron Weibel instability induced magnetic fields in optical-field ionized plasmas

Generation and amplification of magnetic fields in plasmas is a long-standing topic that is of great interest to both plasma and space physics. The electron Weibel instability is a well-known mechanism responsible for self-generating magnetic fields in plasmas with temperature anisotropy and has been extensively investigated in both theory and simulations, yet experimental verification of this instability has been challenging. Recently, we demonstrated a new experimental platform that enables the controlled initialization of highly nonthermal and/or anisotropic plasma electron velocity distributions via optical-field ionization. Using an external electron probe bunch from a linear accelerator, the onset, saturation and decay of the self-generated magnetic fields due to electron Weibel instability were measured for the first time to our knowledge. In this paper, we will first present experimental results on time-resolved measurements of the Weibel magnetic fields in non-relativistic plasmas produced by Ti:Sapphire laser pulses (0.8 $μm$) and then discuss the feasibility of extending the study to quasi-relativistic regime by using intense $\rm CO_2$ (e.g., 9.2 $μm$) lasers to produce much hotter plasmas.

preprint2022arXiv

Expected Constant Time Self-stabilizing Byzantine Pulse Resynchronization

In extending fast digital clock synchronization to the bounded-delay model, the expected constant time Byzantine pulse resynchronization problem is investigated. In this problem, the synchronized state of the system should not only be deterministically maintained but be reached from arbitrary states with expected constant time in the presence of Byzantine faults. An intuitive geometric representation of the problem is introduced, with which the classical approximate agreement, randomized Byzantine agreement, and random walk are integrated with some geometric operations. Efficient realizations are also provided for practical uses. Compared with the state-of-the-art solutions, the assumed common pulses need not be regularly generated, the message complexity can be lowered as approximate agreement, and the expected stabilization time is optimal. With this, the provided solution can efficiently convert irregularly generated common pulses to self-stabilizing Byzantine pulse synchronization.

preprint2022arXiv

Implicit N-grams Induced by Recurrence

Although self-attention based models such as Transformers have achieved remarkable successes on natural language processing (NLP) tasks, recent studies reveal that they have limitations on modeling sequential transformations (Hahn, 2020), which may prompt re-examinations of recurrent neural networks (RNNs) that demonstrated impressive results on handling sequential data. Despite many prior attempts to interpret RNNs, their internal mechanisms have not been fully understood, and the question on how exactly they capture sequential features remains largely unclear. In this work, we present a study that shows there actually exist some explainable components that reside within the hidden states, which are reminiscent of the classical n-grams features. We evaluated such extracted explainable features from trained RNNs on downstream sentiment analysis tasks and found they could be used to model interesting linguistic phenomena such as negation and intensification. Furthermore, we examined the efficacy of using such n-gram components alone as encoders on tasks such as sentiment analysis and language modeling, revealing they could be playing important roles in contributing to the overall performance of RNNs. We hope our findings could add interpretability to RNN architectures, and also provide inspirations for proposing new architectures for sequential data.

preprint2022arXiv

Injection induced by coaxial laser interference in laser wakefield accelerators

A new injection scheme using the interference of two coaxial laser pulses is proposed for generating high quality beams in laser wakefield accelerators. In this scheme, a relatively loosely focused laser pulse drives the plasma wakefield, and a tightly focused laser pulse with similar intensity triggers interference ring pattern which creates onion-like multi sheaths in the plasma wakefield. Due to the wavefront curvature change after the focal position of the tightly focused laser, the innermost sheath of the wakefield expands, which slows down the effective phase velocity of the wakefield and triggers injection of plasma electrons. Particle-in-cell simulations show that high quality electron beams with low energy spread (a few per mill), high charge (hundred picocoulomb) and small emittance (sub millimeter milliradian) at the same time can be generated using moderate laser parameters for properly chosen phase differences between the two lasers.

preprint2022arXiv

Intro-Stabilizing Byzantine Clock Synchronization in Heterogeneous IoT Networks

For reaching dependable high-precision clock synchronization (CS) upon IoT networks, the distributed CS paradigm adopted in ultra-high reliable systems and the master-slave CS paradigm adopted in high-performance but unreliable systems are integrated. Meanwhile, traditional internal clock synchronization is also integrated with external time references to achieve efficient stabilization. Low network connectivity, low complexity, high precision, and high reliability are all considered. To tolerate permanent failures, the Byzantine CS is integrated with the common CS protocols. To tolerate transient failures, the self-stabilizing Byzantine CS is also extended upon open-world IoT networks. With these, the proposed intro-stabilizing Byzantine CS solution can establish and maintain synchronization with arbitrary initial states in the presence of permanent Byzantine faults. With the formal analysis and numerical simulations, it is shown that the best of the CS solutions provided for the ultra-high reliable systems and the high-performance unreliable systems can be well integrated upon IoT networks to derive dependable high-precision CS even across the traditional closed safety-boundary.

preprint2022arXiv

LAGOS-AND: A Large Gold Standard Dataset for Scholarly Author Name Disambiguation

In this paper, we present a method to automatically build large labeled datasets for the author ambiguity problem in the academic world by leveraging the authoritative academic resources, ORCID and DOI. Using the method, we built LAGOS-AND, two large, gold-standard datasets for author name disambiguation (AND), of which LAGOS-AND-BLOCK is created for clustering-based AND research and LAGOS-AND-PAIRWISE is created for classification-based AND research. Our LAGOS-AND datasets are substantially different from the existing ones. The initial versions of the datasets (v1.0, released in February 2021) include 7.5M citations authored by 798K unique authors (LAGOS-AND-BLOCK) and close to 1M instances (LAGOS-AND-PAIRWISE). And both datasets show close similarities to the whole Microsoft Academic Graph (MAG) across validations of six facets. In building the datasets, we reveal the variation degrees of last names in three literature databases, PubMed, MAG, and Semantic Scholar, by comparing author names hosted to the authors' official last names shown on the ORCID pages. Furthermore, we evaluate several baseline disambiguation methods as well as the MAG's author IDs system on our datasets, and the evaluation helps identify several interesting findings. We hope the datasets and findings will bring new insights for future studies. The code and datasets are publicly available.

preprint2022arXiv

Learning to Reason Deductively: Math Word Problem Solving as Complex Relation Extraction

Solving math word problems requires deductive reasoning over the quantities in the text. Various recent research efforts mostly relied on sequence-to-sequence or sequence-to-tree models to generate mathematical expressions without explicitly performing relational reasoning between quantities in the given context. While empirically effective, such approaches typically do not provide explanations for the generated expressions. In this work, we view the task as a complex relation extraction problem, proposing a novel approach that presents explainable deductive reasoning steps to iteratively construct target expressions, where each step involves a primitive operation over two quantities defining their relation. Through extensive experiments on four benchmark datasets, we show that the proposed model significantly outperforms existing strong baselines. We further demonstrate that the deductive procedure not only presents more explainable steps but also enables us to make more accurate predictions on questions that require more complex reasoning.

preprint2022arXiv

Modeling Needs for High Power Target

The next generation of high power targets will use more complex geometries, novel materials, and new concepts (like flowing granular materials); however, the current numerical approaches will not be sufficient to converge towards a reliable target design that satisfies the physical requirements. We will discuss what can be improved in the next 10 years in target modeling to support high power (MW class) targets.

preprint2022arXiv

No-Reference Quality Assessment for 3D Colored Point Cloud and Mesh Models

To improve the viewer's Quality of Experience (QoE) and optimize computer graphics applications, 3D model quality assessment (3D-QA) has become an important task in the multimedia area. Point cloud and mesh are the two most widely used digital representation formats of 3D models, the visual quality of which is quite sensitive to lossy operations like simplification and compression. Therefore, many related studies such as point cloud quality assessment (PCQA) and mesh quality assessment (MQA) have been carried out to measure the visual quality degradations of 3D models. However, a large part of previous studies utilize full-reference (FR) metrics, which indicates they can not predict the quality level with the absence of the reference 3D model. Furthermore, few 3D-QA metrics consider color information, which significantly restricts their effectiveness and scope of application. In this paper, we propose a no-reference (NR) quality assessment metric for colored 3D models represented by both point cloud and mesh. First, we project the 3D models from 3D space into quality-related geometry and color feature domains. Then, the 3D natural scene statistics (3D-NSS) and entropy are utilized to extract quality-aware features. Finally, machine learning is employed to regress the quality-aware features into visual quality scores. Our method is validated on the colored point cloud quality assessment database (SJTU-PCQA), the Waterloo point cloud assessment database (WPC), and the colored mesh quality assessment database (CMDM). The experimental results show that the proposed method outperforms most compared NR 3D-QA metrics with competitive computational resources and greatly reduces the performance gap with the state-of-the-art FR 3D-QA metrics. The code of the proposed model is publicly available now to facilitate further research.

preprint2022arXiv

Reaching Efficient Byzantine Agreements in Bipartite Networks

For reaching efficient deterministic synchronous Byzantine agreement upon partially connected networks, the traditional broadcast primitive is extended and integrated with a general framework. With this, the Byzantine agreement is extended to fully connected bipartite networks and some bipartite bounded-degree networks. The complexity of the Byzantine agreement is lowered and optimized with the so-called Byzantine-levers under a general system structure. Some bipartite simulation of the butterfly networks and some finer properties of bipartite bounded-degree networks are also provided for building efficient incomplete Byzantine agreement under the same system structure. It shows that efficient real-world Byzantine agreement systems can be built with the provided algorithms with sufficiently high system assumption coverage. Meanwhile, the proposed bipartite solutions can improve the dependability of the systems in some open, heterogeneous, and even antagonistic environments.

preprint2022arXiv

Self-Directed Online Machine Learning for Topology Optimization

Topology optimization by optimally distributing materials in a given domain requires non-gradient optimizers to solve highly complicated problems. However, with hundreds of design variables or more involved, solving such problems would require millions of Finite Element Method (FEM) calculations whose computational cost is huge and impractical. Here we report Self-directed Online Learning Optimization (SOLO) which integrates Deep Neural Network (DNN) with FEM calculations. A DNN learns and substitutes the objective as a function of design variables. A small number of training data is generated dynamically based on the DNN's prediction of the optimum. The DNN adapts to the new training data and gives better prediction in the region of interest until convergence. The optimum predicted by the DNN is proved to converge to the true global optimum through iterations. Our algorithm was tested by four types of problems including compliance minimization, fluid-structure optimization, heat transfer enhancement and truss optimization. It reduced the computational time by 2 ~ 5 orders of magnitude compared with directly using heuristic methods, and outperformed all state-of-the-art algorithms tested in our experiments. This approach enables solving large multi-dimensional optimization problems.

preprint2022arXiv

Subjective Quality Assessment for Images Generated by Computer Graphics

With the development of rendering techniques, computer graphics generated images (CGIs) have been widely used in practical application scenarios such as architecture design, video games, simulators, movies, etc. Different from natural scene images (NSIs), the distortions of CGIs are usually caused by poor rending settings and limited computation resources. What's more, some CGIs may also suffer from compression distortions in transmission systems like cloud gaming and stream media. However, limited work has been put forward to tackle the problem of computer graphics generated images' quality assessment (CG-IQA). Therefore, in this paper, we establish a large-scale subjective CG-IQA database to deal with the challenge of CG-IQA tasks. We collect 25,454 in-the-wild CGIs through previous databases and personal collection. After data cleaning, we carefully select 1,200 CGIs to conduct the subjective experiment. Several popular no-reference image quality assessment (NR-IQA) methods are tested on our database. The experimental results show that the handcrafted-based methods achieve low correlation with subjective judgment and deep learning based methods obtain relatively better performance, which demonstrates that the current NR-IQA models are not suitable for CG-IQA tasks and more effective models are urgently needed.

preprint2022arXiv

The Optimal Beam-loading in Two-bunch Nonlinear Plasma Wakefield Accelerators

Due to the highly nonlinear nature of the beam-loading, it is at present not possible to analytically determine the beam parameters needed in a two-bunch plasma wakefield accelerator for maintaining a low energy spread. Therefore in this paper, by using the Broyden-Fletcher-Goldfarb-Shanno algorithm for the parameter scanning with the code QuickPIC and the polynomial regression together with k-fold cross-validation method, we obtain two fitting formulas for calculating the parameters of tri-Gaussian electron beams when minimizing the energy spread based on the beam-loading effect in a nonlinear plasma wakefield accelerator. One formula allows the optimization of the normalized charge per unit length of a trailing beam to achieve the minimal energy spread, i.e. the optimal beam-loading. The other one directly gives the transformer ratio when the trailing beam achieves the optimal beam-loading. A simple scaling law for charges of drive beams and trailing beams is obtained from the fitting formula, which indicates that the optimal beam-loading is always achieved for a given charge ratio of the two beams when the length and separation of two beams and the plasma density are fixed. The formulas can also help obtain the optimal plasma densities for the maximum accelerated charge and the maximum acceleration efficiency under the optimal beam-loading respectively. These two fitting formulas will significantly enhance the efficiency for designing and optimizing a two-bunch plasma wakefield acceleration stage.

preprint2022arXiv

Ultra-Bright Electron Bunch Injection in a Plasma Wakefield Driven by a Superluminal Flying Focus Electron Beam

We propose a new method for self-injection of high-quality electron bunches in the plasma wakefield structure in the blowout regime utilizing a &#34;flying focus&#34; produced by a drive beam with an energy chirp. In a flying focus the speed of the density centroid of the drive bunch can be superluminal or subluminal by utilizing the chromatic dependence of the focusing optics. We first derive the focal velocity and the characteristic length of the focal spot in terms of the focal length and an energy chirp. We then demonstrate using multidimensional particle-in-cell simulations that a wake driven by a superluminally propagating flying focus of an electron beam can generate GeV-level electron bunches with ultralow normalized slice emittance ($\sim$30 nm rad), high current ($\sim$ 17 kA), low slice energy-spread ($\sim$0.1%) and therefore high normalized brightness ($>10^{19}$ A/rad$^2$/m$^2$) in a plasma of density $\sim10^{19}$ cm$^{-3}$. The injection process is highly controllable and tunable by changing the focal velocity and shaping the drive beam current. Near-term experiments at FACET II where the capabilities to generate tens of kA, <10 fs drivers are planned, could potentially produce beams with brightness near $10^{20}$ A/rad$^2$/m$^2$.

preprint2022arXiv

Ultrafast photothermoelectric effect in Dirac semimetallic Cd3As2 revealed by terahertz emission

The thermoelectric effects of topological semimetals have attracted tremendous research interest because many topological semimetals are excellent thermoelectric materials and thermoelectricity serves as one of their most important potential applications. In this work, we reveal the transient photothermoelectric response of Dirac semimetallic Cd3As2, namely the photo-Seebeck effect and photo-Nernst effect, by studying the terahertz (THz) emission from the transient photocurrent induced by these effects. Our excitation polarization and power dependence confirm that the observed THz emission is due to photothermoelectric effect instead of other nonlinear optical effect. Furthermore, when a weak magnetic field (~0.4 T) is applied, the response clearly indicates an order of magnitude enhancement on transient photothermoelectric current generation compared to the photo-Seebeck effect. Such enhancement supports an ambipolar transport nature of the photo-Nernst current generation in Cd3As2. These results highlight the enhancement of thermoelectric performance can be achieved in topological Dirac semimetals based on the Nernst effect, and our transient studies pave the way for thermoelectric devices applicable for high field circumstance when nonequilibrium state matters. The large THz emission due to highly efficient photothermoelectric conversion is comparable to conventional semiconductors through optical rectification and photo-Dember effect.

preprint2021arXiv

On 2-digit and 3-digit Kaprekar&#39;s Routine

Kaprekar&#39;s Routine is an iteration process that, with each iteration, sorts the digits of a number in descending and ascending orders and uses their difference for the next iteration. In this paper, we successfully address the structure of the fixed periodic sets and the maximum step of iteration to enter a fixed set in the three-digit case and two-digit case, with a focus on the latter. With three-digit, there exists a unique fixed set of the cardinality of 1 or 2, depending on the parity of m, and the maximum step is determined by m. With two-digit, we offer some powerful properties of the fixed sets and a mechanical method to calculate the fixed sets. We also prove that the number of 2-factors in m+1 determines the maximum step (but has completely no influence on the structure of the fixed sets). This continues Atsushi Yamagami&#39;s previous studies in 2018 (published in Journal of Number Theory) and completes it with a general solution.

preprint2021arXiv

Position-Aware Tagging for Aspect Sentiment Triplet Extraction

Aspect Sentiment Triplet Extraction (ASTE) is the task of extracting the triplets of target entities, their associated sentiment, and opinion spans explaining the reason for the sentiment. Existing research efforts mostly solve this problem using pipeline approaches, which break the triplet extraction process into several stages. Our observation is that the three elements within a triplet are highly related to each other, and this motivates us to build a joint model to extract such triplets using a sequence tagging approach. However, how to effectively design a tagging approach to extract the triplets that can capture the rich interactions among the elements is a challenging research question. In this work, we propose the first end-to-end model with a novel position-aware tagging scheme that is capable of jointly extracting the triplets. Our experimental results on several existing datasets show that jointly capturing elements in the triplet using our approach leads to improved performance over the existing approaches. We also conducted extensive experiments to investigate the model effectiveness and robustness.

preprint2021arXiv

Simulation of an imaging system for internal contamination of lungs using MPA-MURA coded aperture collimator

The nuclides inhaled during nuclear accidents usually cause internal contamination of the lungs with low activity. Although a parallel-hole imaging system, which is widely used in medical gamma cameras, has a high resolution and good image quality, owing to its extremely low detection efficiency, it remains difficult to obtain images of inhaled lung contamination. In this study, the Monte Carlo method was used to study the internal lung contamination imaging using the MPA-MURA coded-aperture collimator. The imaging system consisted of an adult male lung model, with a mosaicked, pattern-centered, and anti-symmetric MURA coded-aperture collimator model and a CsI(Tl) detector model. The MLEM decoding algorithm was used to reconstruct the internal contamination image, and the complementary imaging method was used to reduce the number of artifacts. The full width at half maximum of the I-131 point source image reconstructed by the mosaicked, pattern-centered, and anti-symmetric Modified uniformly redundant array (MPA-MURA) coded-aperture imaging reached 2.51 mm, and the signal-to-noise ratio of the simplified respiratory tract source (I-131) image reconstructed through MPA-MURA coded-aperture imaging was 3.98 dB. Although the spatial resolution of MPA-MURA coded aperture imaging is not as good as that of parallel-hole imaging, the detection efficiency of PMA-MURA coded-aperture imaging is two orders of magnitude higher than that of parallel hole collimator imaging. Considering the low activity level of internal lung contamination caused by nuclear accidents, PMA-MURA coded-aperture imaging has significant potential for the development of lung contamination imaging.

preprint2020arXiv

Adversarial Deep Network Embedding for Cross-network Node Classification

In this paper, the task of cross-network node classification, which leverages the abundant labeled nodes from a source network to help classify unlabeled nodes in a target network, is studied. The existing domain adaptation algorithms generally fail to model the network structural information, and the current network embedding models mainly focus on single-network applications. Thus, both of them cannot be directly applied to solve the cross-network node classification problem. This motivates us to propose an adversarial cross-network deep network embedding (ACDNE) model to integrate adversarial domain adaptation with deep network embedding so as to learn network-invariant node representations that can also well preserve the network structural information. In ACDNE, the deep network embedding module utilizes two feature extractors to jointly preserve attributed affinity and topological proximities between nodes. In addition, a node classifier is incorporated to make node representations label-discriminative. Moreover, an adversarial domain adaptation technique is employed to make node representations network-invariant. Extensive experimental results demonstrate that the proposed ACDNE model achieves the state-of-the-art performance in cross-network node classification.

preprint2020arXiv

Attention Guided Graph Convolutional Networks for Relation Extraction

Dependency trees convey rich structural information that is proven useful for extracting relations among entities in text. However, how to effectively make use of relevant information while ignoring irrelevant information from the dependency trees remains a challenging research question. Existing approaches employing rule based hard-pruning strategies for selecting relevant partial dependency structures may not always yield optimal results. In this work, we propose Attention Guided Graph Convolutional Networks (AGGCNs), a novel model which directly takes full dependency trees as inputs. Our model can be understood as a soft-pruning approach that automatically learns how to selectively attend to the relevant sub-structures useful for the relation extraction task. Extensive results on various tasks including cross-sentence n-ary relation extraction and large-scale sentence-level relation extraction show that our model is able to better leverage the structural information of the full dependency trees, giving significantly better results than previous approaches.

preprint2020arXiv

Learning to Recognize Discontiguous Entities

This paper focuses on the study of recognizing discontiguous entities. Motivated by a previous work, we propose to use a novel hypergraph representation to jointly encode discontiguous entities of unbounded length, which can overlap with one another. To compare with existing approaches, we first formally introduce the notion of model ambiguity, which defines the difficulty level of interpreting the outputs of a model, and then formally analyze the theoretical advantages of our model over previous existing approaches based on linear-chain CRFs. Our empirical results also show that our model is able to achieve significantly better results when evaluated on standard data with many discontiguous entities.

preprint2020arXiv

Measurements of the growth and saturation of electron Weibel instability in optical-field ionized plasmas

The temporal evolution of the magnetic field associated with electron thermal Weibel instability in optical-field ionized plasmas is measured using ultrashort (1.8 ps), relativistic (45 MeV) electron bunches from a linear accelerator. The self-generated magnetic fields are found to self-organize into a quasi-static structure consistent with a helicoid topology within a few ps and such a structure lasts for tens of ps in underdense plasmas. The measured growth rate agrees well with that predicted by the kinetic theory of plasmas taking into account collisions. Magnetic trapping is identified as the dominant saturation mechanism.

preprint2020arXiv

Mining Commonsense Facts from the Physical World

Textual descriptions of the physical world implicitly mention commonsense facts, while the commonsense knowledge bases explicitly represent such facts as triples. Compared to dramatically increased text data, the coverage of existing knowledge bases is far away from completion. Most of the prior studies on populating knowledge bases mainly focus on Freebase. To automatically complete commonsense knowledge bases to improve their coverage is under-explored. In this paper, we propose a new task of mining commonsense facts from the raw text that describes the physical world. We build an effective new model that fuses information from both sequence text and existing knowledge base resource. Then we create two large annotated datasets each with approximate 200k instances for commonsense knowledge base completion. Empirical results demonstrate that our model significantly outperforms baselines.

preprint2020arXiv

Read Beyond the Lines: Understanding the Implied Textual Meaning via a Skim and Intensive Reading Model

The nonliteral interpretation of a text is hard to be understood by machine models due to its high context-sensitivity and heavy usage of figurative language. In this study, inspired by human reading comprehension, we propose a novel, simple, and effective deep neural framework, called Skim and Intensive Reading Model (SIRM), for figuring out implied textual meaning. The proposed SIRM consists of two main components, namely the skim reading component and intensive reading component. N-gram features are quickly extracted from the skim reading component, which is a combination of several convolutional neural networks, as skim (entire) information. An intensive reading component enables a hierarchical investigation for both local (sentence) and global (paragraph) representation, which encapsulates the current embedding and the contextual information with a dense connection. More specifically, the contextual information includes the near-neighbor information and the skim information mentioned above. Finally, besides the normal training loss function, we employ an adversarial loss function as a penalty over the skim reading component to eliminate noisy information arisen from special figurative words in the training data. To verify the effectiveness, robustness, and efficiency of the proposed architecture, we conduct extensive comparative experiments on several sarcasm benchmarks and an industrial spam dataset with metaphors. Experimental results indicate that (1) the proposed model, which benefits from context modeling and consideration of figurative language, outperforms existing state-of-the-art solutions, with comparable parameter scale and training speed; (2) the SIRM yields superior robustness in terms of parameter size sensitivity; (3) compared with ablation and addition variants of the SIRM, the final framework is efficient enough.

preprint2020arXiv

Reasoning with Latent Structure Refinement for Document-Level Relation Extraction

Document-level relation extraction requires integrating information within and across multiple sentences of a document and capturing complex interactions between inter-sentence entities. However, effective aggregation of relevant information in the document remains a challenging research question. Existing approaches construct static document-level graphs based on syntactic trees, co-references or heuristics from the unstructured text to model the dependencies. Unlike previous methods that may not be able to capture rich non-local interactions for inference, we propose a novel model that empowers the relational reasoning across sentences by automatically inducing the latent document-level graph. We further develop a refinement strategy, which enables the model to incrementally aggregate relevant information for multi-hop reasoning. Specifically, our model achieves an F1 score of 59.05 on a large-scale document-level dataset (DocRED), significantly improving over the previous results, and also yields new state-of-the-art results on the CDR and GDA dataset. Furthermore, extensive analyses show that the model is able to discover more accurate inter-sentence relations.

preprint2020arXiv

Region-of-interest micro-focus CT based on an all-optical inverse Compton scattering source

Micro-focus computed tomography (CT), enabling the reconstruction of hyperfine structure within objects, is a powerful nondestructive testing tool in many fields. Current X-ray sources for micro-focus CT are typically limited by their relatively low photon energy and low flux. An all-optical inverse Compton scattering source (AOCS) based on laser wakefield accelerator (LWFA) can generate intense quasi-monoenergetic X/gamma-ray pulses in the keV-MeV range with micron-level source size, and its potential application for micro-focus CT has become very attractive in recent years due to the fast pace progress made in LWFA. Here we report the first experimental demonstration of high-fidelity micro-focus CT using AOCS (~70 keV) by imaging and reconstructing a test object with complex inner structures. A region-of-interest (ROI) CT method is adopted to utilize the relatively small field-of-view (FOV) of AOCS to obtain high-resolution reconstruction. This demonstration of the ROI micro-focus CT based on AOCS is a key step for its application in the field of hyperfine nondestructive testing.

preprint2020arXiv

RPT: Learning Point Set Representation for Siamese Visual Tracking

While remarkable progress has been made in robust visual tracking, accurate target state estimation still remains a highly challenging problem. In this paper, we argue that this issue is closely related to the prevalent bounding box representation, which provides only a coarse spatial extent of object. Thus an effcient visual tracking framework is proposed to accurately estimate the target state with a finer representation as a set of representative points. The point set is trained to indicate the semantically and geometrically significant positions of target region, enabling more fine-grained localization and modeling of object appearance. We further propose a multi-level aggregation strategy to obtain detailed structure information by fusing hierarchical convolution layers. Extensive experiments on several challenging benchmarks including OTB2015, VOT2018, VOT2019 and GOT-10k demonstrate that our method achieves new state-of-the-art performance while running at over 20 FPS.

preprint2020arXiv

Ultra-short pulse generation from mid-IR to THz range using plasma wakes and relativistic ionization fronts

This paper discusses numerical and experimental results on frequency downshifting and upshifting of a 10 $μ$m infrared laser to cover the entire wavelength (frequency) range from $λ$=1-150 $μ$m ($ν$=300-2 THz) using two different plasma techniques. The first plasma technique utilizes frequency downshifting of the drive laser pulse in a nonlinear plasma wake. Based on this technique, we have proposed and demonstrated that in a tailored plasma structure multi-millijoule energy, single-cycle, long-wavelength IR (3-20 $μ$m) pulses can be generated by using an 810 nm Ti:sapphire drive laser. Here we extend this idea to the THz frequency regime. We show that sub-joule, terawatts, single-cycle terahertz (2-12 THz, or 150-25 $μ$m) pulses can be generated by replacing the drive laser with a picosecond 10 $μ$m CO$_2$ laser and a different shaped plasma structure. The second plasma technique employs frequency upshifting by colliding a CO$_2$ laser with a rather sharp relativistic ionization front created by ionization of a gas in less than half cycle (17 fs) of the CO$_2$ laser. Even though the electrons in the ionization front carry no energy, the frequency of the CO$_2$ laser can be upshifted due to the relativistic Doppler effect as the CO$_2$ laser pulse enters the front. The wavelength can be tuned from 1-10 $μ$m by simply changing the electron density of the front. While the upshifted light with $5 <λ(μ$m$)< 10$ propagates in the forward direction, that with $1 <λ(μ$m$)< 5$ is back-reflected. These two plasma techniques seem extremely promising for covering the entire molecular fingerprint region.

preprint2019arXiv

Dynamical Symmetry Breaking and Negative Cosmological Constant

In the context of Clifford functional integral formalism, we revisit the Nambu-Jona-Lasinio-type dynamical symmetry breaking model and examine the properties of the dynamically generated composite bosons. Given that the model with 4-fermion interactions is nonrenormalizable in the traditional sense, the aim is to gain insight into the divergent integrals without resorting to explicit regularization. We impose a restriction on the linearly divergent primitive integrals, thus resolving the long-standing issue of momentum routing ambiguity associated with fermion-antifermion condensations. The removal of the ambiguity paves the way for the possible calculation of the true ratio of Higgs boson mass to top quark mass in the top condensation model. In this paper, we also investigate the negative vacuum energy resulted from dynamical symmetry breaking and its cosmological implications. In the framework of modified Einstein-Cartan gravity, it is demonstrated that the late-time acceleration is driven by a novel way of embedding the Hubble parameter into the Friedmann equation via an interpolation function, whereas the dynamically generated negative cosmological constant only plays a minor role for the current epoch. Two cosmic scenarios are proposed, with one of which suggesting that the universe may have been evolving from an everlasting coasting state towards the accelerating era characterized by the deceleration parameter approaching -0.5 at low redshift. One inevitable outcome of the modified Friedmannian cosmology is that the directly measured local Hubble parameter should in general be larger than the Hubble parameter calibrated from the conventional Friedmann equation. This Hubble tension becomes more pronounced when the Hubble parameter is comparable or less than a characteristic Hubble scale.

preprint2019arXiv

Microscopic mechanism of level attraction

The emerging level attraction from dissipative light-matter coupling converges the typical Rabi-splitting feature from coherent coupling and exhibits potentials in topological information processing. However, the underlying microscopic quantum mechanism of dissipative coupling still remains unclear, which brings difficulties in quantifying and manipulating coherence-dissipation competition and thereby the flexible control of level attraction. Here, by coupling magnon to a cavity supporting both standing and travelling waves, we identify the travelling-wave state to be responsible for magnon-photon dissipative coupling. By characterizing radiative broadening of magnon linewidth, we quantify the coherent and dissipative coupling strengths and their competition. The effective magnon-photon coupling strength, as a net result of competition, is analytically presented in quantum theory to show good agreement with measurements. In this manner, we extend the control dimension of level attraction by tuning field torque on magnetization or global cavity geometry. Our finding opens new routines to engineer coupled harmonic oscillator system.

preprint2019arXiv

Simulation of temperature profile for the electron- and the lattice-systems in laterally structured layered conductors

Electrons in operating microelectronic semiconductor devices are accelerated by locally varying strong electric field to acquire effective electron temperatures nonuniformly distributing in nanoscales and largely exceeding the temperature of host crystal lattice. The thermal dynamics of electrons and the lattice are hence nontrivial and its understanding at nanoscales is decisively important for gaining higher device performance. Here, we propose and demonstrate that in layered conductors nonequilibrium nature between the electrons and the lattice can be explicitly pursued by simulating the conducting layer by separating it into two physical sheets representing, respectively, the electron- and the lattice-subsystems. We take, as an example of simulating GaAs devices, a 35nm thick 1um wide U-shaped conducting channel with 15nm radius of curvature at the inner corner of the U-shaped bend, and find a remarkable hot spot to develop due to hot electron generation at the inner corner. The hot spot in terms of the electron temperature achieves a significantly higher temperature and is of far sharper spatial distribution when compared to the hot spot in terms of the lattice temperature. Similar simulation calculation made on a metal (NiCr) narrow lead of the similar geometry shows that a hot spot shows up as well at the inner corner, but its strength and the spatial profiles are largely different from those in semiconductor devices. The remarkable difference between the semiconductor and the metal is interpreted to be due to the large difference in the electron specific heat, rather than the difference in the electron phonon interaction. This work will provide useful hints to deeper understanding of the nonequilibrium properties of electrical conductors, through a simple and convenient method for modeling nonequilibrium layered conductors.