Searcharxiv⌕ Search

arXiv subjects

Jun Xu

Publications and source records attributed to Jun Xu.

At least 271 records · Page 15Linked to original sources
arXiv2023

4D Feet: Registering Walking Foot Shapes Using Attention Enhanced Dynamic-Synchronized Graph Convolutional LSTM Network

4D scans of dynamic deformable human body parts help researchers have a better understanding of spatiotemporal features. However, reconstructing 4D scans based on multiple asynchronous cameras encounters two main challenges: 1) finding the dynamic correspondences among different frames captured by each camera at the timestamps of the camera in terms of dynamic feature recognition, and 2) reconstructing 3D shapes from the combined point clouds captured by different cameras at asynchronous timestamps in terms of multi-view fusion. In this paper, we introduce a generic framework that is able to 1) find and align dynamic features in the 3D scans captured by each camera using the nonrigid iterative closest-farthest points algorithm; 2) synchronize scans captured by asynchronous cameras through a novel ADGC-LSTM-based network, which is capable of aligning 3D scans captured by different cameras to the timeline of a specific camera; and 3) register a high-quality template to synchronized scans at each timestamp to form a high-quality 3D mesh model using a non-rigid registration method. With a newly developed 4D foot scanner, we validate the framework and create the first open-access data-set, namely the 4D feet. It includes 4D shapes (15 fps) of the right and left feet of 58 participants (116 feet in total, including 5147 3D frames), covering significant phases of the gait cycle. The results demonstrate the effectiveness of the proposed framework, especially in synchronizing asynchronous 4D scans using the proposed ADGC-LSTM network.

eess.IV↗
arXiv2023

Controllable Multi-Objective Re-ranking with Policy Hypernetworks

Multi-stage ranking pipelines have become widely used strategies in modern recommender systems, where the final stage aims to return a ranked list of items that balances a number of requirements such as user preference, diversity, novelty etc. Linear scalarization is arguably the most widely used technique to merge multiple requirements into one optimization objective, by summing up the requirements with certain preference weights. Existing final-stage ranking methods often adopt a static model where the preference weights are determined during offline training and kept unchanged during online serving. Whenever a modification of the preference weights is needed, the model has to be re-trained, which is time and resources inefficient. Meanwhile, the most appropriate weights may vary greatly for different groups of targeting users or at different time periods (e.g., during holiday promotions). In this paper, we propose a framework called controllable multi-objective re-ranking (CMR) which incorporates a hypernetwork to generate parameters for a re-ranking model according to different preference weights. In this way, CMR is enabled to adapt the preference weights according to the environment changes in an online manner, without retraining the models. Moreover, we classify practical business-oriented tasks into four main categories and seamlessly incorporate them in a new proposed re-ranking model based on an Actor-Evaluator framework, which serves as a reliable real-world testbed for CMR. Offline experiments based on the dataset collected from Taobao App showed that CMR improved several popular re-ranking models by using them as underlying models. Online A/B tests also demonstrated the effectiveness and trustworthiness of CMR.

cs.IR↗
arXiv2023

The Classification of Galaxy Morphology in H-band of COSMOS-DASH Field: a combination-based machine learning clustering model

By applying our previously developed two-step scheme for galaxy morphology classification, we present a catalog of galaxy morphology for H-band selected massive galaxies in the COSMOS-DASH field, which includes 17292 galaxies with stellar mass $M_{\star}>10^{10}~M_{\odot}$ at $0.5<z<2.5$. The classification scheme is designed to provide a complete morphology classification for galaxies via a combination of two machine-learning steps. We first use an unsupervised machine learning method (i.e., bagging-based multi-clustering) to cluster galaxies into five categories: spherical (SPH), early-type disk (ETD), late-type disk (LTD), irregular (IRR), and unclassified (UNC). About 48\% of galaxies (8258/17292) are successfully clustered during this step. For the remaining sample, we adopt a supervised machine learning method (i.e., GoogLeNet) to classify them, during which galaxies that are well-classified in the previous step are taken as our training set. Consequently, we obtain a morphology classification result for the full sample. The t-SNE test shows that galaxies in our sample can be well aggregated. We also measure the parametric and nonparametric morphologies of these galaxies. We find that the Sérsic index increases from IRR to SPH and the effective radius decreases from IRR to SPH, consistent with the corresponding definitions. Galaxies from different categories are separately distributed in the $G$--$M_{20}$ space. Such consistencies with other characteristic descriptions of galaxy morphology demonstrate the reliability of our classification result, ensuring that it can be used as a basic catalog for further galaxy studies.

astro-ph.GA↗
arXiv2023

Observational signatures of electron-driven chromospheric evaporation in a white-light flare

We investigate observational signatures of explosive chromospheric evaporation during a white-light flare (WLF) that occurred on 2022 August 27. Using the moment analysis, bisector techniques, and the Gaussian fitting method, red-shifted velocities of less than 20 km/s are detected in low-temperature spectral lines of Ha, C I and Si IV at the conjugated flare kernels, which could be regarded as downflows caused by chromospheric condensation. Blue-shifted velocities of about 30-40 km/s are found in the high-temperature line of Fe XXI, which can be interpreted as upflows driven by chromospheric evaporation. A nonthermal hard X-ray (HXR) source is co-spatial with one of the flare kernels, and the Doppler velocities are temporally correlated with the HXR fluxes. The nonthermal energy flux is estimated to be at least (1.3+-0.2)*10^10 erg/s/cm^2. The radiation enhancement at Fe I 6569.2 A and 6173 A suggests that the flare is a WLF. Moreover, the while-light emission at Fe I 6569.2 A is temporally and spatially correlated with the blue shift of Fe XXI line, suggesting that both the white-light enhancement and the chromospheric evaporation are triggered and driven by nonthermal electrons. All our observations support the scenario of an electron-driven explosive chromospheric evaporation in the WLF.

astro-ph.SR↗
arXiv2023

When Search Meets Recommendation: Learning Disentangled Search Representation for Recommendation

Modern online service providers such as online shopping platforms often provide both search and recommendation (S&R) services to meet different user needs. Rarely has there been any effective means of incorporating user behavior data from both S&R services. Most existing approaches either simply treat S&R behaviors separately, or jointly optimize them by aggregating data from both services, ignoring the fact that user intents in S&R can be distinctively different. In our paper, we propose a Search-Enhanced framework for the Sequential Recommendation (SESRec) that leverages users' search interests for recommendation, by disentangling similar and dissimilar representations within S&R behaviors. Specifically, SESRec first aligns query and item embeddings based on users' query-item interactions for the computations of their similarities. Two transformer encoders are used to learn the contextual representations of S&R behaviors independently. Then a contrastive learning task is designed to supervise the disentanglement of similar and dissimilar representations from behavior sequences of S&R. Finally, we extract user interests by the attention mechanism from three perspectives, i.e., the contextual representations, the two separated behaviors containing similar and dissimilar interests. Extensive experiments on both industrial and public datasets demonstrate that SESRec consistently outperforms state-of-the-art models. Empirical studies further validate that SESRec successfully disentangle similar and dissimilar user interests from their S&R behaviors.

cs.IR↗
arXiv2023

RECIPE: Rateless Erasure Codes Induced by Protocol-Based Encoding

LT (Luby transform) codes are a celebrated family of rateless erasure codes (RECs). Most of existing LT codes were designed for applications in which a centralized encoder possesses all message blocks and is solely responsible for encoding them into codewords. Distributed LT codes, in which message blocks are physically scattered across multiple different locations (encoders) that need to collaboratively perform the encoding, has never been systemically studied before despite its growing importance in applications. In this work, we present the first systemic study of LT codes in the distributed setting, and make the following three major contributions. First, we show that only a proper subset of LT codes are feasible in the distributed setting, and give the sufficient and necessary condition for such feasibility. Second, we propose a distributed encoding protocol that can efficiently implement any feasible code. The protocol is parameterized by a so-called action probability array (APA) that is only a few KBs in size, and any feasible code corresponds to a valid APA setting and vice versa. Third, we propose two heuristic search algorithms that have led to the discovery of feasible codes that are much more efficient than the state of the art.

cs.IT↗
arXiv2023

Bayesian inference of neutron-star observables based on effective nuclear interactions

Based on the Skyrme-Hartree-Fock model (SHF) as well as its extension (the Korea-IBS-Daegu-SKKU (KIDS) model) and the relativistic mean-field (RMF) model, we have studied the constraints on the parameters of the nuclear matter equation of state (EOS) from adopted astrophysical observables using a Bayesian approach. While the masses and radii of neutron stars generally favors a stiff isoscalar EOS and a moderately soft nuclear symmetry energy, model dependence on the constraints is observed and mostly originates from the incorporation of higher-order EOS parameters and difference between relativistic and non-relativistic models. At twice saturation density, the value of the symmetry energy is constrained to be $48^{+15}_{-11}$ MeV in the standard SHF model, $48^{+8}_{-15}$ MeV in the KIDS model, and $48^{+5}_{-6}$ MeV in the RMF model, around their maximum {\it a posteriori} values within $68\%$ confidence intervals. Our study helps to obtain a robust constraint on nuclear matter EOS, and meanwhile, to understand the model dependence of the results.

nucl-th↗
arXiv2023

Law Article-Enhanced Legal Case Matching: a Causal Learning Approach

Legal case matching, which automatically constructs a model to estimate the similarities between the source and target cases, has played an essential role in intelligent legal systems. Semantic text matching models have been applied to the task where the source and target legal cases are considered as long-form text documents. These general-purpose matching models make the predictions solely based on the texts in the legal cases, overlooking the essential role of the law articles in legal case matching. In the real world, the matching results (e.g., relevance labels) are dramatically affected by the law articles because the contents and the judgments of a legal case are radically formed on the basis of law. From the causal sense, a matching decision is affected by the mediation effect from the cited law articles by the legal cases, and the direct effect of the key circumstances (e.g., detailed fact descriptions) in the legal cases. In light of the observation, this paper proposes a model-agnostic causal learning framework called Law-Match, under which the legal case matching models are learned by respecting the corresponding law articles. Given a pair of legal cases and the related law articles, Law-Match considers the embeddings of the law articles as instrumental variables (IVs), and the embeddings of legal cases as treatments. Using IV regression, the treatments can be decomposed into law-related and law-unrelated parts, respectively reflecting the mediation and direct effects. These two parts are then combined with different weights to collectively support the final matching prediction. We show that the framework is model-agnostic, and a number of legal case matching models can be applied as the underlying models. Comprehensive experiments show that Law-Match can outperform state-of-the-art baselines on three public datasets.

cs.IR↗
arXiv2023

A Dynamic Multi-Scale Voxel Flow Network for Video Prediction

The performance of video prediction has been greatly boosted by advanced deep neural networks. However, most of the current methods suffer from large model sizes and require extra inputs, e.g., semantic/depth maps, for promising performance. For efficiency consideration, in this paper, we propose a Dynamic Multi-scale Voxel Flow Network (DMVFN) to achieve better video prediction performance at lower computational costs with only RGB images, than previous methods. The core of our DMVFN is a differentiable routing module that can effectively perceive the motion scales of video frames. Once trained, our DMVFN selects adaptive sub-networks for different inputs at the inference stage. Experiments on several benchmarks demonstrate that our DMVFN is an order of magnitude faster than Deep Voxel Flow and surpasses the state-of-the-art iterative-based OPT on generated image quality. Our code and demo are available at https://huxiaotaostasy.github.io/DMVFN/.

cs.CV↗
arXiv2023

Dually Enhanced Propensity Score Estimation in Sequential Recommendation

Sequential recommender systems train their models based on a large amount of implicit user feedback data and may be subject to biases when users are systematically under/over-exposed to certain items. Unbiased learning based on inverse propensity scores (IPS), which estimate the probability of observing a user-item pair given the historical information, has been proposed to address the issue. In these methods, propensity score estimation is usually limited to the view of item, that is, treating the feedback data as sequences of items that interacted with the users. However, the feedback data can also be treated from the view of user, as the sequences of users that interact with the items. Moreover, the two views can jointly enhance the propensity score estimation. Inspired by the observation, we propose to estimate the propensity scores from the views of user and item, called Dually Enhanced Propensity Score Estimation (DEPS). Specifically, given a target user-item pair and the corresponding item and user interaction sequences, DEPS firstly constructs a time-aware causal graph to represent the user-item observational probability. According to the graph, two complementary propensity scores are estimated from the views of item and user, respectively, based on the same set of user feedback data. Finally, two transformers are designed to make the final preference prediction. Theoretical analysis showed the unbiasedness and variance of DEPS. Experimental results on three publicly available and an industrial datasets demonstrated that DEPS can significantly outperform the state-of-the-art baselines.

cs.IR↗
arXiv2023

P-MMF: Provider Max-min Fairness Re-ranking in Recommender System

In this paper, we address the issue of recommending fairly from the aspect of providers, which has become increasingly essential in multistakeholder recommender systems. Existing studies on provider fairness usually focused on designing proportion fairness (PF) metrics that first consider systematic fairness. However, sociological researches show that to make the market more stable, max-min fairness (MMF) is a better metric. The main reason is that MMF aims to improve the utility of the worst ones preferentially, guiding the system to support the providers in weak market positions. When applying MMF to recommender systems, how to balance user preferences and provider fairness in an online recommendation scenario is still a challenging problem. In this paper, we proposed an online re-ranking model named Provider Max-min Fairness Re-ranking (P-MMF) to tackle the problem. Specifically, P-MMF formulates provider fair recommendation as a resource allocation problem, where the exposure slots are considered the resources to be allocated to providers and the max-min fairness is used as the regularizer during the process. We show that the problem can be further represented as a regularized online optimizing problem and solved efficiently in its dual space. During the online re-ranking phase, a momentum gradient descent method is designed to conduct the dynamic re-ranking. Theoretical analysis showed that the regret of P-MMF can be bounded. Experimental results on four public recommender datasets demonstrated that P-MMF can outperformed the state-of-the-art baselines. Experimental results also show that P-MMF can retain small computationally costs on a corpus with the large number of items.

cs.IR↗
arXiv2023

Shear viscosity of nuclear matter in the spinodal region

Based on IBUU simulations calibrated by previous efforts of the transport model evaluation project, we have studied the specific shear viscosity $η/s$ of nuclear matter in the spinodal region using the Green-Kubo method. With the momentum-independent mean-field potential which reproduces reasonably well empirical nuclear matter properties and nuclear phase diagram, we have generated dynamically stable and thermalized nuclear cluster systems in a box with the periodic boundary condition. Extensive results of the $η/s$ at different average densities and temperatures in uniform and non-uniform systems are compared, and we found that the shear viscosity is smaller with nuclear clusters due to the enhanced correlation of the energy-momentum tensor and the stronger collision effect. The temperature dependence of the $η/s$ has a minimum only at low average densities of $ρ<0.3ρ_0$. The present study serves as a rigorous baseline calculation of the $η/s$ in nuclear systems with clusters, and helps to understand the relation between the shear viscosity and the nuclear phase diagram.

nucl-th↗
arXiv2023

Lattice piecewise affine approximation of explicit nonlinear model predictive control with application to trajectory tracking of mobile robot

To promote the widespread use of mobile robots in diverse fields, the performance of trajectory tracking must be ensured. To address the constraints and nonlinear features associated with mobile robot systems, we apply nonlinear model predictive control (MPC) to realize the trajectory tracking of mobile robots. Specifically, to alleviate the online computational complexity of nonlinear MPC, this paper devises a lattice piecewise affine (PWA) approximation method that can approximate both the nonlinear system and control law of explicit nonlinear MPC. The kinematic model of the mobile robot is successively linearized along the trajectory to obtain a linear time-varying description of the system, which is then expressed using a lattice PWA model. Subsequently, the nonlinear MPC problem can be transformed into a series of linear MPC problems. Furthermore, to reduce the complexity of online calculation of multiple linear MPC problems, we approximate the optimal solution of the linear MPC by using the lattice PWA model. That is, for different sampling states, the optimal control inputs are obtained, and lattice PWA approximations are constructed for the state control pairs. Simulations are performed to evaluate the performance of our method in comparison with the linear MPC and explicit linear MPC frameworks. The results show that compared with the explicit linear MPC, our method has a higher online computing speed and can decrease the offline computing time without significantly increasing the tracking error.

eess.SY↗
arXiv2023

Semi-Cycled Generative Adversarial Networks for Real-World Face Super-Resolution

Real-world face super-resolution (SR) is a highly ill-posed image restoration task. The fully-cycled Cycle-GAN architecture is widely employed to achieve promising performance on face SR, but prone to produce artifacts upon challenging cases in real-world scenarios, since joint participation in the same degradation branch will impact final performance due to huge domain gap between real-world and synthetic LR ones obtained by generators. To better exploit the powerful generative capability of GAN for real-world face SR, in this paper, we establish two independent degradation branches in the forward and backward cycle-consistent reconstruction processes, respectively, while the two processes share the same restoration branch. Our Semi-Cycled Generative Adversarial Networks (SCGAN) is able to alleviate the adverse effects of the domain gap between the real-world LR face images and the synthetic LR ones, and to achieve accurate and robust face SR performance by the shared restoration branch regularized by both the forward and backward cycle-consistent learning processes. Experiments on two synthetic and two real-world datasets demonstrate that, our SCGAN outperforms the state-of-the-art methods on recovering the face structures/details and quantitative metrics for real-world face SR. The code will be publicly released at https://github.com/HaoHou-98/SCGAN.

cs.CV↗
arXiv2023

A Dyadic Simulation Approach to Efficient Range-Summability

Efficient range-summability (ERS) of a long list of random variables is a fundamental algorithmic problem that has applications to three important database applications, namely, data stream processing, space-efficient histogram maintenance (SEHM), and approximate nearest neighbor searches (ANNS). In this work, we propose a novel dyadic simulation framework and develop three novel ERS solutions, namely Gaussian-dyadic simulation tree (DST), Cauchy-DST and Random Walk-DST, using it. We also propose novel rejection sampling techniques to make these solutions computationally efficient. Furthermore, we develop a novel k-wise independence theory that allows our ERS solutions to have both high computational efficiencies and strong provable independence guarantees.

cs.DS↗
arXiv2023

On Efficient Range-Summability of Ideally IID Random Variables in Two or Higher Dimensions

$d$-dimensional (for $d>1$) efficient range-summability ($d$D-ERS) of random variables (RVs) is a fundamental algorithmic problem that has applications to two important families of database problems, namely, fast approximate wavelet tracking (FAWT) on data streams and approximately answering range-sum queries over a data cube. Whether there are efficient solutions to the $d$D-ERS problem, or to the latter database problem, have been two long-standing open problems. Both are solved in this work. Specifically, we propose a novel solution framework to $d$D-ERS on RVs that have Gaussian or Poisson distribution. Our $d$D-ERS solutions are the first ones that have polylogarithmic time complexities. Furthermore, we develop a novel $k$-wise independence theory that allows our $d$D-ERS solutions to have both high computational efficiencies and strong provable independence guarantees. Finally, we show that under a sufficient and likely necessary condition, certain existing solutions for 1D-ERS can be generalized to higher dimensions.

cs.DS↗
arXiv2023

Measuring deformed neutron skin with free spectator nucleons in relativistic heavy-ion collisions

The neutron skin in deformed nuclei is generally not uniformly distributed but has an angular distribution, depending on both the spin-dependent nuclear interaction and the nuclear symmetry energy. To extract the information of the deformed neutron skin, we have explored the possibility of using free spectator nucleons in central tip-tip and body-body collisions at top RHIC energy with four typical deformed nuclei. The density distributions of neutrons and protons are consistently obtained from the Skyrme-Hartree-Fock-Bogolyubov calculation, and the angular distribution of the neutron skin can be varied by adjusting the strength of the nuclear spin-orbit coupling. With the information of spectator nucleons obtained based on a Monte-Carlo Glauber model, the free spectator nucleons are generated from a multifragmentation process. By investigating the results from different systems and with different collision configurations, we found that although it is difficult to probe the deformed neutron skin in $^{96}$Zr and $^{238}$U by their collisions, it is promising to extract the polar angular distributions of the neutron skin in $^{96}$Ru and $^{197}$Au by comparing the yield ratios of free spectator neutrons to protons in their central tip-tip and body-body collisions. The proposed observables can be measured by dedicated zero-degree calorimeters in heavy-ion collision experiments that have been carried out in recent years by RHIC.

nucl-th↗
arXiv2023

Collision geometry effect on free spectator nucleons in relativistic heavy-ion collisions

Based on the deformed nucleon distributions obtained from the constrained Skyrme-Hartree-Fock-Bogolyubov calculation using different nuclear symmetry energies, we have investigated the effects of the neutron skin and the collision geometry on the yield of free spectator nucleons as well as the yield ratio $N_n/N_p$ of free spectator neutrons to protons in collisions of deformed nuclei at RHIC energies. We found that tip-tip (body-body) collisions with prolate (oblate) nuclei lead to fewest free spectator nucleons, compared to other collision configurations. While the $N_n/N_p$ ratio is sensitive to the average neutron-skin thickness of colliding nuclei and the symmetry energy, it is affected by the polar angular distribution of the neutron skin in different collision configurations. We also found that the collision geometry effect can be as large as 50% the symmetry energy effect in some collision systems. Due to the particular deformed neutron skin in $^{238}$U and $^{96}$Zr, the symmetry energy effect on the $N_n/N_p$ ratio is enhanced in tip-tip $^{238}$U+$^{238}$U collisions and body-body $^{96}$Zr+$^{96}$Zr collisions compared to other collision orientations in the same collision system. Our study may shed light on probing deformed neutron skin by selecting desired configurations in high-energy collisions with deformed nuclei.

nucl-th↗