Searcharxiv⌕ Search

arXiv subjects

Jun Xu

Publications and source records attributed to Jun Xu.

At least 325 records · Page 18Linked to original sources

Isospin effect on quark matter instabilities

We have studied the mechanical and chemical instabilities as well as the liquid-gas-like phase transition in isospin asymmetric quark matter based on the NJL and the pNJL model. Areas of the mechanical instability region and the liquid-gas coexistence region are seen to be enlarged with a larger quark matter symmetry energy or in the presence of strange quarks. Our study shows that the light cluster yield ratio observed in relativistic heavy-ion collisions may not be affected much by the uncertainties of the isospin effect, and favors a smooth hadron-quark phase transition in compact stars as well as their mergers.

nucl-th↗

Facilitating Parallel Fuzzing with mutually-exclusive Task Distribution

Fuzz testing, or fuzzing, has become one of the de facto standard techniques for bug finding in the software industry. In general, fuzzing provides various inputs to the target program to discover unhandled exceptions and crashes. In business sectors where the time budget is limited, software vendors often launch many fuzzing instances in parallel as common means of increasing code coverage. However, most of the popular fuzzing tools in their parallel mode-naively run multiple instances concurrently, without elaborate distribution of workload. This can lead different instances to explore overlapped code regions, eventually reducing the benefits of concurrency. In this paper, we propose a general model to describe parallel fuzzing. This model distributes mutually-exclusive but similarly-weighted tasks to different instances, facilitating concurrency and also fairness across instances. Following this model, we develop a solution, called AFL-EDGE, to improve the parallel mode of AFL, considering a round of mutations to a unique seed as a task and adopting edge coverage to define the uniqueness of a seed. We have implemented AFL-EDGE on top of AFL and evaluated the implementation with AFL on 9 widely used benchmark programs. It shows that AFL-EDGE can benefit the edge coverage of AFL. In a 24-hour test, the increase of edge coverage brought by AFL-EDGE to AFL ranges from 9.49% to 10.20%, depending on the number of instances. As a side benefit, we discovered 14 previously unknown bugs.

cs.SE↗

Elliptic flow splittings in the Polyakov-looped Nambu-Jona Lasinio transport model

To incorporate the effect of gluons on the evolution dynamics of the quark matter produced in relativistic heavy-ion collisions, we extend the 3-flavor Nambu-Jona-Lasinio (NJL) transport model to include the contribution from the Polyakov loops. Imbedding the resulting pNJL partonic transport model in an extended multiphase transport (extended AMPT) model, we then study the elliptic flow splittings between particles and their antiparticles in relativistic heavy-ion collisions at RHIC-BES energies. We find that a weak quark vector interaction in the partonic phase is able to describe the elliptic flow splitting between protons and antiprotons in heavy-ion collisions at $\sqrt{s_{NN}}=7.7$ to 39 GeV. Knowledge on the quark vector interaction is useful for understanding the equation of state of quark matter at large baryon chemical potentials and thus the location of the critical point in the QCD phase diagram.

nucl-th↗

3-dimensional QCD phase diagram with pion condensate in the NJL model

With the isovector coupling constants adjusted to reproduce the physical pion mass and lattice QCD results in baryon-free quark matter, we have carried out rigourous calculations for the pion condensate in the 3-flavor Nambu-Jona-Lasinio model, and studied the 3-dimensional QCD phase diagram. With the increasing isospin chemical potential $μ_I$, we have observed two nonzero solutions of the pion condensate at finite baryon chemical potentials $μ_B$, representing respectively the pion superfluid phase and the Sarma phase, and their appearance and disappearance correspond to a second-order (first-order) phase transition at higher (lower) temperatures $T$ and lower (higher) $μ_B$. Calculations by assuming equal constituent mass of $u$ and $d$ quarks would lead to large errors of the QCD phase diagram within $μ_B \in (500, 900)$ MeV, and affect the position of the critical end point.

hep-ph↗

Proving LTL Properties of Bitvector Programs and Decompiled Binaries (Extended)

There is increasing interest in applying verification tools to programs that have bitvector operations (eg., binaries). SMT solvers, which serve as a foundation for these tools, have thus increased support for bitvector reasoning through bit-blasting and linear arithmetic approximations. In this paper we show that similar linear arithmetic approximation of bitvector operations can be done at the source level through transformations. Specifically, we introduce new paths that over-approximate bitvector operations with linear conditions/constraints, increasing branching but allowing us to better exploit the well-developed integer reasoning and interpolation of verification tools. We show that, for reachability of bitvector programs, increased branching incurs negligible overhead yet, when combined with integer interpolation optimizations, enables more programs to be verified. We further show this exploitation of integer interpolation in the common case also enables competitive termination verification of bitvector programs and leads to the first effective technique for LTL verification of bitvector programs. Finally, we provide an in-depth case study of decompiled ("lifted") binary programs, which emulate X86 execution through frequent use of bitvector operations. We present a new tool DarkSea, the first tool capable of verifying reachability, termination, and LTL of lifted binaries.

cs.PL↗

Modeling Relevance Ranking under the Pre-training and Fine-tuning Paradigm

Recently, pre-trained language models such as BERT have been applied to document ranking for information retrieval, which first pre-train a general language model on an unlabeled large corpus and then conduct ranking-specific fine-tuning on expert-labeled relevance datasets. Ideally, an IR system would model relevance from a user-system dualism: the user's view and the system's view. User's view judges the relevance based on the activities of "real users" while the system's view focuses on the relevance signals from the system side, e.g., from the experts or algorithms, etc. Inspired by the user-system relevance views and the success of pre-trained language models, in this paper we propose a novel ranking framework called Pre-Rank that takes both user's view and system's view into consideration, under the pre-training and fine-tuning paradigm. Specifically, to model the user's view of relevance, Pre-Rank pre-trains the initial query-document representations based on large-scale user activities data such as the click log. To model the system's view of relevance, Pre-Rank further fine-tunes the model on expert-labeled relevance data. More importantly, the pre-trained representations, are fine-tuned together with handcrafted learning-to-rank features under a wide and deep network architecture. In this way, Pre-Rank can model the relevance by incorporating the relevant knowledge and signals from both real search users and the IR experts. To verify the effectiveness of Pre-Rank, we showed two implementations by using BERT and SetRank as the underlying ranking model, respectively. Experimental results base on three publicly available benchmarks showed that in both of the implementations, Pre-Rank can respectively outperform the underlying ranking models and achieved state-of-the-art performances.

cs.IR↗

JCS: An Explainable COVID-19 Diagnosis System by Joint Classification and Segmentation

Recently, the coronavirus disease 2019 (COVID-19) has caused a pandemic disease in over 200 countries, influencing billions of humans. To control the infection, identifying and separating the infected people is the most crucial step. The main diagnostic tool is the Reverse Transcription Polymerase Chain Reaction (RT-PCR) test. Still, the sensitivity of the RT-PCR test is not high enough to effectively prevent the pandemic. The chest CT scan test provides a valuable complementary tool to the RT-PCR test, and it can identify the patients in the early-stage with high sensitivity. However, the chest CT scan test is usually time-consuming, requiring about 21.5 minutes per case. This paper develops a novel Joint Classification and Segmentation (JCS) system to perform real-time and explainable COVID-19 chest CT diagnosis. To train our JCS system, we construct a large scale COVID-19 Classification and Segmentation (COVID-CS) dataset, with 144,167 chest CT images of 400 COVID-19 patients and 350 uninfected cases. 3,855 chest CT images of 200 patients are annotated with fine-grained pixel-level labels of opacifications, which are increased attenuation of the lung parenchyma. We also have annotated lesion counts, opacification areas, and locations and thus benefit various diagnosis aspects. Extensive experiments demonstrate that the proposed JCS diagnosis system is very efficient for COVID-19 classification and segmentation. It obtains an average sensitivity of 95.0% and a specificity of 93.0% on the classification test set, and 78.5% Dice score on the segmentation test set of our COVID-CS dataset. The COVID-CS dataset and code are available at https://github.com/yuhuan-wu/JCS.

eess.IV↗

Comparison of Heavy-Ion Transport Simulations: Mean-field Dynamics in a Box

Within the transport model evaluation project (TMEP) of simulations for heavy-ion collisions, the mean-field response is examined here. Specifically, zero-sound propagation is considered for neutron-proton symmetric matter enclosed in a periodic box, at zero temperature and around normal density. The results of several transport codes belonging to two families (BUU-like and QMD-like) are compared among each other and to exact calculations. For BUU-like codes, employing the test particle method, the results depend on the combination of the number of test particles and the spread of the profile functions that weight integration over space. These parameters can be properly adapted to give a good reproduction of the analytical zero-sound features. QMD-like codes, using molecular dynamics methods, are characterized by large damping effects, attributable to the fluctuations inherent in their phase-space representation. Moreover, for a given nuclear effective interaction, they generally lead to slower density oscillations, as compared to BUU-like codes. The latter problem is mitigated in the more recent lattice formulation of some of the QMD codes. The significance of these results for the description of real heavy-ion collisions is discussed.

nucl-th↗

NLHD: A Pixel-Level Non-Local Retinex Model for Low-Light Image Enhancement

Retinex model has been applied to low-light image enhancement in many existing methods. More appropriate decomposition of a low-light image can help achieve better image enhancement. In this paper, we propose a new pixel-level non-local Haar transform based illumination and reflectance decomposition method (NLHD). The unique low-frequency coefficient of Haar transform on each similar pixel group is used to reconstruct the illumination component, and the rest of all high-frequency coefficients are employed to reconstruct the reflectance component. The complete similarity of pixels in a matched similar pixel group and the simple separable Haar transform help to obtain more appropriate image decomposition; thus, the image is hardly sharpened in the image brightness enhancement procedure. The exponential transform and logarithmic transform are respectively implemented on the illumination component. Then a minimum fusion strategy on the results of these two transforms is utilized to achieve more natural illumination component enhancement. It can alleviate the mosaic artifacts produced in the darker regions by the exponential transform with a gamma value less than 1 and reduce information loss caused by excessive enhancement of the brighter regions due to the logarithmic transform. Finally, the Retinex model is applied to the enhanced illumination and reflectance to achieve image enhancement. We also develop a local noise level estimation based noise suppression method and a non-local saturation reduction based color deviation correction method. These two methods can respectively attenuate noise or color deviation usually presented in the enhanced results of the extremely dark low-light images. Experiments on benchmark datasets show that the proposed method can achieve better low-light image enhancement results on subjective and objective evaluations than most existing methods.

eess.IV↗

A Joint Model for Dropped Pronoun Recovery and Conversational Discourse Parsing in Chinese Conversational Speech

In this paper, we present a neural model for joint dropped pronoun recovery (DPR) and conversational discourse parsing (CDP) in Chinese conversational speech. We show that DPR and CDP are closely related, and a joint model benefits both tasks. We refer to our model as DiscProReco, and it first encodes the tokens in each utterance in a conversation with a directed Graph Convolutional Network (GCN). The token states for an utterance are then aggregated to produce a single state for each utterance. The utterance states are then fed into a biaffine classifier to construct a conversational discourse graph. A second (multi-relational) GCN is then applied to the utterance states to produce a discourse relation-augmented representation for the utterances, which are then fused together with token states in each utterance as input to a dropped pronoun recovery layer. The joint model is trained and evaluated on a new Structure Parsing-enhanced Dropped Pronoun Recovery (SPDPR) dataset that we annotated with both two types of information. Experimental results on the SPDPR dataset and other benchmarks show that DiscProReco significantly outperforms the state-of-the-art baselines of both tasks.

cs.CL↗

The FAST Galactic Plane Pulsar Snapshot survey: I. Project design and pulsar discoveries

Discovery of pulsars is one of the main goals for large radio telescopes. The Five-hundred-meter Aperture Spherical radio Telescope (FAST), that incorporates an L-band 19-beam receiver with a system temperature of about 20~K, is the most sensitive radio telescope utilized for discovering pulsars. We designed the {\it snapshot} observation mode for a FAST key science project, the Galactic Plane Pulsar Snapshot (GPPS) survey, in which every four nearby pointings can observe {\it a cover} of a sky patch of 0.1575 square degrees through beam-switching of the L-band 19-beam receiver. The integration time for each pointing is 300 seconds so that the GPPS observations for a cover can be made in 21 minutes. The goal of the GPPS survey is to discover pulsars within the Galactic latitude of $\pm10^{\circ}$ from the Galactic plane, and the highest priority is given to the inner Galaxy within $\pm5^{\circ}$. Up to now, the GPPS survey has discovered 201 pulsars, including currently the faintest pulsars which cannot be detected by other telescopes, pulsars with extremely high dispersion measures (DMs) which challenge the currently widely used models for the Galactic electron density distribution, pulsars coincident with supernova remnants, 40 millisecond pulsars, 16 binary pulsars, some nulling and mode-changing pulsars and rotating radio transients (RRATs). The follow-up observations for confirmation of new pulsars have polarization-signals recorded for polarization profiles of the pulsars. Re-detection of previously known pulsars in the survey data also leads to significant improvements in parameters for 64 pulsars. The GPPS survey discoveries are published and will be updated at http://zmtt.bao.ac.cn/GPPS/ .

astro-ph.HE↗

MetaKernel: Learning Variational Random Features with Limited Labels

Few-shot learning deals with the fundamental and challenging problem of learning from a few annotated samples, while being able to generalize well on new tasks. The crux of few-shot learning is to extract prior knowledge from related tasks to enable fast adaptation to a new task with a limited amount of data. In this paper, we propose meta-learning kernels with random Fourier features for few-shot learning, we call MetaKernel. Specifically, we propose learning variational random features in a data-driven manner to obtain task-specific kernels by leveraging the shared knowledge provided by related tasks in a meta-learning setting. We treat the random feature basis as the latent variable, which is estimated by variational inference. The shared knowledge from related tasks is incorporated into a context inference of the posterior, which we achieve via a long-short term memory module. To establish more expressive kernels, we deploy conditional normalizing flows based on coupling layers to achieve a richer posterior distribution over random Fourier bases. The resultant kernels are more informative and discriminative, which further improves the few-shot learning. To evaluate our method, we conduct extensive experiments on both few-shot image classification and regression tasks. A thorough ablation study demonstrates that the effectiveness of each introduced component in our method. The benchmark results on fourteen datasets demonstrate MetaKernel consistently delivers at least comparable and often better performance than state-of-the-art alternatives.

cs.LG↗

Deep Hough Transform for Semantic Line Detection

We focus on a fundamental task of detecting meaningful line structures, a.k.a. semantic line, in natural scenes. Many previous methods regard this problem as a special case of object detection and adjust existing object detectors for semantic line detection. However, these methods neglect the inherent characteristics of lines, leading to sub-optimal performance. Lines enjoy much simpler geometric property than complex objects and thus can be compactly parameterized by a few arguments. To better exploit the property of lines, in this paper, we incorporate the classical Hough transform technique into deeply learned representations and propose a one-shot end-to-end learning framework for line detection. By parameterizing lines with slopes and biases, we perform Hough transform to translate deep representations into the parametric domain, in which we perform line detection. Specifically, we aggregate features along candidate lines on the feature map plane and then assign the aggregated features to corresponding locations in the parametric domain. Consequently, the problem of detecting semantic lines in the spatial domain is transformed into spotting individual points in the parametric domain, making the post-processing steps, i.e. non-maximal suppression, more efficient. Furthermore, our method makes it easy to extract contextual line features eg features along lines close to a specific line, that are critical for accurate line detection. In addition to the proposed method, we design an evaluation metric to assess the quality of line detection and construct a large scale dataset for the line detection task. Experimental results on our proposed dataset and another public dataset demonstrate the advantages of our method over previous state-of-the-art alternatives.

cs.CV↗

Temporal Modulation Network for Controllable Space-Time Video Super-Resolution

Space-time video super-resolution (STVSR) aims to increase the spatial and temporal resolutions of low-resolution and low-frame-rate videos. Recently, deformable convolution based methods have achieved promising STVSR performance, but they could only infer the intermediate frame pre-defined in the training stage. Besides, these methods undervalued the short-term motion cues among adjacent frames. In this paper, we propose a Temporal Modulation Network (TMNet) to interpolate arbitrary intermediate frame(s) with accurate high-resolution reconstruction. Specifically, we propose a Temporal Modulation Block (TMB) to modulate deformable convolution kernels for controllable feature interpolation. To well exploit the temporal information, we propose a Locally-temporal Feature Comparison (LFC) module, along with the Bi-directional Deformable ConvLSTM, to extract short-term and long-term motion cues in videos. Experiments on three benchmark datasets demonstrate that our TMNet outperforms previous STVSR methods. The code is available at https://github.com/CS-GangXu/TMNet.

cs.CV↗

Constraining isovector nuclear interactions with giant dipole resonance and neutron skin in $^{208}$Pb from a Bayesian approach

The remaining uncertainties of isovector nuclear interactions call for reliable experimental measurements of isovector probes in finite nuclei. Based on the Bayesian analysis, although the neutron-skin thickness data or the isovector giant dipole resonance data in $^{208}$Pb can constrain only one isovector interaction parameter, correlations between other parameters are built. Using combined data of both the neutron-skin thickness and the isovector giant dipole resonance helps to constrain significantly all isovector interaction parameters, thus serves as a useful way in the future analysis.

nucl-th↗

Cryogenic Modeling of MOSFET Device Based on BSIM and EKV Models

Kink effect is a large obstacle for the cryogenic model of inversion-type bulk silicon MOSFET devices. This letter used two methods to correct the kink effect: the modified evolutionary strategy (MES) and dual-model modeling (BSIM3v3 and EKV2.6). Both methods are based on the principle of kink effect. The first method considers impact ionization and substrate current induced body effect (SCBE), and the other considers the change of the freeze-out substrate potential. By applying the above two methods, kink can be corrected to improve the agreement between simulation data and measurement data, and obtain more accurate model parameters. These two methods can be used in further work for cryogenic device modeling and circuit design.

physics.app-ph↗

Interactive Knowledge Distillation

Knowledge distillation is a standard teacher-student learning framework to train a light-weight student network under the guidance of a well-trained large teacher network. As an effective teaching strategy, interactive teaching has been widely employed at school to motivate students, in which teachers not only provide knowledge but also give constructive feedback to students upon their responses, to improve their learning performance. In this work, we propose an InterActive Knowledge Distillation (IAKD) scheme to leverage the interactive teaching strategy for efficient knowledge distillation. In the distillation process, the interaction between teacher and student networks is implemented by a swapping-in operation: randomly replacing the blocks in the student network with the corresponding blocks in the teacher network. In the way, we directly involve the teacher's powerful feature transformation ability to largely boost the student's performance. Experiments with typical settings of teacher-student networks demonstrate that the student networks trained by our IAKD achieve better performance than those trained by conventional knowledge distillation methods on diverse image classification datasets.

cs.CV↗

Towards Optimal Use of Exception Handling Information for Function Detection

Function entry detection is critical for security of binary code. Conventional methods heavily rely on patterns, inevitably missing true functions and introducing errors. Recently, call frames have been used in exception-handling for function start detection. However, existing methods have two problems. First, they combine call frames with heuristic-based approaches, which often brings error and uncertain benefits. Second, they trust the fidelity of call frames, without handling the errors that are introduced by call frames. In this paper, we first study the coverage and accuracy of existing approaches in detecting function starts using call frames. We found that recursive disassembly with call frames can maximize coverage, and using extra heuristic-based approaches does not improve coverage and actually hurts accuracy. Second, we unveil call-frame errors and develop the first approach to fix them, making their use more reliable.

cs.CR↗