Searcharxiv⌕ Search

arXiv subjects

Lei Yang

Publications and source records attributed to Lei Yang.

At least 397 records · Page 22Linked to original sources

Proximal Gradient Method with Extrapolation and Line Search for a Class of Nonconvex and Nonsmooth Problems

In this paper, we consider a class of possibly nonconvex, nonsmooth and non-Lipschitz optimization problems arising in many contemporary applications such as machine learning, variable selection and image processing. To solve this class of problems, we propose a proximal gradient method with extrapolation and line search (PGels). This method is developed based on a special potential function and successfully incorporates both extrapolation and non-monotone line search, which are two simple and efficient accelerating techniques for the proximal gradient method. Thanks to the line search, this method allows more flexibilities in choosing the extrapolation parameters and updates them adaptively at each iteration if a certain line search criterion is not satisfied. Moreover, with proper choices of parameters, our PGels reduces to many existing algorithms. We also show that, under some mild conditions, our line search criterion is well defined and any cluster point of the sequence generated by PGels is a stationary point of our problem. In addition, by assuming the Kurdyka-$Ł$ojasiewicz exponent of the objective in our problem, we further analyze the local convergence rate of two special cases of PGels, including the widely used non-monotone proximal gradient method as one case. Finally, we conduct some numerical experiments for solving the $\ell_1$ regularized logistic regression problem and the $\ell_{1\text{-}2}$ regularized least squares problem. Our numerical results illustrate the efficiency of PGels and show the potential advantage of combining two accelerating techniques.

math.OC↗

Capillary interactions, aggregate formation and the rheology of particle-laden flows: a lattice Boltzmann study

The agglomeration of particles caused by the formation of capillary bridges has a decisive impact on the transport properties of a variety of at a first sight very different systems such as capillary suspensions, fluidized beds in chemical reactors, or even sand castles. Here, we study the connection between the microstructure of the agglomerates and the rheology of fluidized suspensions using a coupled lattice Boltzmann and discrete element method approach. We address the influence of the shear rate, the secondary fluid surface tension, and the suspending liquid viscosity. The presence of capillary interactions promotes the formation of either filaments or globular clusters, leading to an increased suspension viscosity. Unexpectedly, filaments have the opposite effect on the viscosity as compared to globular clusters, decreasing the suspension viscosity at larger capillary interaction strengths. In addition, we show that the suspending fluid viscosity also has a non-trivial influence on the effective viscosity of the suspension, a fact usually not taken into account by empirical models.

physics.flu-dyn↗

Dislocation induced energy dissipation in a tunable trilayer graphene resonator

In crystalline materials, the creation and modulation of dislocations are often associated with plastic deformation and energy dissipation. Here we report a study on the energy dissipation of a trilayer graphene ribbon resonator. The vibration of the ribbon generates cyclic mechanical loading to the graphene ribbon, during which mechanical energy is dissipated as heat. Measuring the quality factor of the graphene resonator provides a way to evaluate the energy dissipation. The graphene ribbon is integrated with silicon micro actuators, allowing its in-plane tension to be finely tuned. As we gradually increased the tension, we observed, in addition to the well-known resonance frequency increase, a large change in the energy dissipation. We propose that the dominating energy dissipation mechanism shifts over three regions. With small applied tension, the graphene is in elastic region, and the major energy dissipation is through graphene edge folding; as the tension increases, dislocations start to develop in the sample to gradually dominate the energy dissipation; finally, at large enough tension, graphene layers become decoupled and start to slide and cause friction, which induces the more severe energy dissipation. The generation and modulation of dislocations are modeled by molecular dynamics calculation and a method to count the energy loss is proposed and compared to the experiment.

cond-mat.mes-hall↗

Distributed Attention for Grounded Image Captioning

We study the problem of weakly supervised grounded image captioning. That is, given an image, the goal is to automatically generate a sentence describing the context of the image with each noun word grounded to the corresponding region in the image. This task is challenging due to the lack of explicit fine-grained region word alignments as supervision. Previous weakly supervised methods mainly explore various kinds of regularization schemes to improve attention accuracy. However, their performances are still far from the fully supervised ones. One main issue that has been ignored is that the attention for generating visually groundable words may only focus on the most discriminate parts and can not cover the whole object. To this end, we propose a simple yet effective method to alleviate the issue, termed as partial grounding problem in our paper. Specifically, we design a distributed attention mechanism to enforce the network to aggregate information from multiple spatially different regions with consistent semantics while generating the words. Therefore, the union of the focused region proposals should form a visual region that encloses the object of interest completely. Extensive experiments have demonstrated the superiority of our proposed method compared with the state-of-the-arts.

cs.CV↗

Learning Skeletal Graph Neural Networks for Hard 3D Pose Estimation

Various deep learning techniques have been proposed to solve the single-view 2D-to-3D pose estimation problem. While the average prediction accuracy has been improved significantly over the years, the performance on hard poses with depth ambiguity, self-occlusion, and complex or rare poses is still far from satisfactory. In this work, we target these hard poses and present a novel skeletal GNN learning solution. To be specific, we propose a hop-aware hierarchical channel-squeezing fusion layer to effectively extract relevant information from neighboring nodes while suppressing undesired noises in GNN learning. In addition, we propose a temporal-aware dynamic graph construction procedure that is robust and effective for 3D pose estimation. Experimental results on the Human3.6M dataset show that our solution achieves 10.3\% average prediction accuracy improvement and greatly improves on hard poses over state-of-the-art techniques. We further apply the proposed technique on the skeleton-based action recognition task and also achieve state-of-the-art performance. Our code is available at https://github.com/ailingzengzzz/Skeletal-GNN.

cs.CV↗

Geometry Uncertainty Projection Network for Monocular 3D Object Detection

Geometry Projection is a powerful depth estimation method in monocular 3D object detection. It estimates depth dependent on heights, which introduces mathematical priors into the deep model. But projection process also introduces the error amplification problem, in which the error of the estimated height will be amplified and reflected greatly at the output depth. This property leads to uncontrollable depth inferences and also damages the training efficiency. In this paper, we propose a Geometry Uncertainty Projection Network (GUP Net) to tackle the error amplification problem at both inference and training stages. Specifically, a GUP module is proposed to obtains the geometry-guided uncertainty of the inferred depth, which not only provides high reliable confidence for each depth but also benefits depth learning. Furthermore, at the training stage, we propose a Hierarchical Task Learning strategy to reduce the instability caused by error amplification. This learning algorithm monitors the learning situation of each task by a proposed indicator and adaptively assigns the proper loss weights for different tasks according to their pre-tasks situation. Based on that, each task starts learning only when its pre-tasks are learned well, which can significantly improve the stability and efficiency of the training process. Extensive experiments demonstrate the effectiveness of the proposed method. The overall model can infer more reliable object depth than existing methods and outperforms the state-of-the-art image-based monocular 3D detectors by 3.74% and 4.7% AP40 of the car and pedestrian categories on the KITTI benchmark.

cs.CV↗

A second-order semi-implicit method for the inertial Landau-Lifshitz-Gilbert equation

Recent theoretical and experimental advances show that the inertia of magnetization emerges at sub-picoseconds and contributes to the ultrafast magnetization dynamics which cannot be captured intrinsically by the LLG equation. Therefore, as a generalization, the inertial Landau-Lifshitz-Gilbert (iLLG) equation is proposed to model the ultrafast magnetization dynamics. Mathematically, the LLG equation is a nonlinear system of parabolic type with (possible) degeneracy. However, the iLLG equation is a nonlinear system of mixed hyperbolic-parabolic type with degeneracy, and exhibits more complicated structures. It behaves like a hyperbolic system at the sub-picosecond scale while behaves like a parabolic system at larger timescales. Such hybrid behaviors impose additional difficulties on designing numerical methods for the iLLG equation. In this work, we propose a second-order semi-implicit scheme to solve the iLLG equation. The second temporal derivative of magnetization is approximated by the standard centered difference scheme and the first derivative is approximated by the midpoint scheme involving three time steps. The nonlinear terms are treated semi-implicitly using one-sided interpolation with the second-order accuracy. At each step, the unconditionally unique solvability of the unsymmetric linear system of equations in the proposed method is proved with a detailed discussion on the condition number. Numerically, the second-order accuracy in both time and space is verified. Using the proposed method, the inertial effect of ferromagnetics is observed in micromagnetics simulations at small timescales, in consistency with the hyperbolic property of the model at sub-picoseconds. For long time simulations, the results of the iLLG model are in nice agreements with those of the LLG model, in consistency with the parabolic feature of the iLLG model at larger timescales.

math.NA↗

The Automatic Calibration Unit in JUNO

This paper describes the design and construction of the automatic calibration unit (ACU) for the JUNO experiment. The ACU is a fully automated mechanical system. It is capable of deploying multiple radioactive sources, an ultraviolet (UV) laser source, or an auxiliary sensor such as a temperature sensor, one at a time, into the central detector of JUNO along the central axis. It is designed as a primary tool to precisely calibrate the energy scale of detector, aligning timing for the photosensors, and partially monitoring the position-dependent energy scale variations.

physics.ins-det↗

Capillary-bridge Forces Between Solid Particles: Insights from Lattice Boltzmann Simulations

Liquid capillary-bridge formation between solid particles has a critical influence on the rheological properties of granular materials and, in particular, on the efficiency of fluidized bed reactors. The available analytical and semi-analytical methods have inherent limitations, and often do not cover important aspects, like the presence of non-axisymmetric bridges. Here, we conduct numerical simulations of the capillary bridge formation between equally and unequally-sized solid particles using the lattice Boltzmann method, and provide an assessment of the accuracy of different families of analytical models. We find that some of the models taken into account are shown to perform better than others. However, all of them fail to predict the capillary force for contact angles larger than $π/2$, where a repulsive capillary force attempts to push the solid particle outwards to minimize the surface energy, especially at a small separation distance.

cond-mat.soft↗

Lite-FPN for Keypoint-based Monocular 3D Object Detection

3D object detection with a single image is an essential and challenging task for autonomous driving. Recently, keypoint-based monocular 3D object detection has made tremendous progress and achieved great speed-accuracy trade-off. However, there still exists a huge gap with LIDAR-based methods in terms of accuracy. To improve their performance without sacrificing efficiency, we propose a sort of lightweight feature pyramid network called Lite-FPN to achieve multi-scale feature fusion in an effective and efficient way, which can boost the multi-scale detection capability of keypoint-based detectors. Besides, the misalignment between classification score and localization precision is further relieved by introducing a novel regression loss named attention loss. With the proposed loss, predictions with high confidence but poor localization are treated with more attention during the training phase. Comparative experiments based on several state-of-the-art keypoint-based detectors on the KITTI dataset show that our proposed methods manage to achieve significant improvements in both accuracy and frame rate. The code and pretrained models will be released at \url{https://github.com/yanglei18/Lite-FPN}.

cs.CV↗

IPS300+: a Challenging Multimodal Dataset for Intersection Perception System

Due to the high complexity and occlusion, insufficient perception in the crowded urban intersection can be a serious safety risk for both human drivers and autonomous algorithms, whereas CVIS (Cooperative Vehicle Infrastructure System) is a proposed solution for full-participants perception in this scenario. However, the research on roadside multimodal perception is still in its infancy, and there is no open-source dataset for such scenario. Accordingly, this paper fills the gap. Through an IPS (Intersection Perception System) installed at the diagonal of the intersection, this paper proposes a high-quality multimodal dataset for the intersection perception task. The center of the experimental intersection covers an area of 3000m2, and the extended distance reaches 300m, which is typical for CVIS. The first batch of open-source data includes 14198 frames, and each frame has an average of 319.84 labels, which is 9.6 times larger than the most crowded dataset (H3D dataset in 2019) by now. In order to facilitate further study, this dataset tries to keep the label documents consistent with the KITTI dataset, and a standardized benchmark is created for algorithm evaluation. Our dataset is available at: http://www.openmpd.com/column/other_datasets.

cs.CV↗

Securing Parallel-chain Protocols under Variable Mining Power

Several emerging PoW blockchain protocols rely on a "parallel-chain" architecture for scaling, where instead of a single chain, multiple chains are run in parallel and aggregated. A key requirement of practical PoW blockchains is to adapt to mining power variations over time. In this paper, we consider the design of provably secure parallel-chain protocols which can adapt to such mining power variations. The Bitcoin difficulty adjustment rule adjusts the difficulty target of block mining periodically to get a constant mean inter-block time. While superficially simple, the rule has proved itself to be sophisticated and successfully secure, both in practice and in theory. We show that natural adaptations of the Bitcoin adjustment rule to the parallel-chain case open the door to subtle, but catastrophic safety and liveness breaches. We uncover a meta-design principle that allow us to design variable mining difficulty protocols for three popular PoW blockchain proposals (Prism, OHIE, and Fruitchains) inside a common rubric. The principle has three components:(M1) a pivot chain, based on which blocks in all chains choose difficulty, (M2) a monotonicity condition for referencing pivot chain blocks and (M3) translating additional protocol aspects from using levels (depth) to using "difficulty levels". We show that protocols employing a subset of these principles may have catastrophic failures. The security of the designs is also proved using a common rubric - the key technical challenge involves analyzing the interaction between the pivot chain and the other chains, as well as bounding the sudden changes in difficulty target experienced in non-pivot chains. We empirically investigate the responsivity of the new mining difficulty rule via simulations based on historical Bitcoin data, and find that the protocol very effectively controls the forking rate across all the chains.

cs.CR↗

On Liquid Viscosity Effects on Droplet Splash and Receding Breakup on a Smooth Solid Surface at Atmospheric Pressure

Experimental and modelling study is presented for the effect of a wide range of liquid viscosities on the droplet impact on a smooth solid surface at atmospheric pressure. A non-monotonic variation of threshold between droplet deposition and splash was observed experimentally. Specifically, the critical Weber number separating deposition from splashing decreases and then increases with increasing the Ohnesorge number. The observations of splash in low viscosity region and receding breakup in high viscosity region were analyzed qualitatively from the perspectives of Kelvin-Helmholtz instability and Rayleigh-Taylor instability, respectively. Based on instability analysis for the viscosityinduced nonmonotonicity, a new semi-empirical correlation of droplet splashing thresholds is proposed by fitting experimental results from previous and present data and shows better performance than previous correlation formulas.

physics.flu-dyn↗

The Age of Correlated Features in Supervised Learning based Forecasting

In this paper, we analyze the impact of information freshness on supervised learning based forecasting. In these applications, a neural network is trained to predict a time-varying target (e.g., solar power), based on multiple correlated features (e.g., temperature, humidity, and cloud coverage). The features are collected from different data sources and are subject to heterogeneous and time-varying ages. By using an information-theoretic approach, we prove that the minimum training loss is a function of the ages of the features, where the function is not always monotonic. However, if the empirical distribution of the training data is close to the distribution of a Markov chain, then the training loss is approximately a non-decreasing age function. Both the training loss and testing loss depict similar growth patterns as the age increases. An experiment on solar power prediction is conducted to validate our theory. Our theoretical and experimental results suggest that it is beneficial to (i) combine the training data with different age values into a large training dataset and jointly train the forecasting decisions for these age values, and (ii) feed the age value as a part of the input feature to the neural network.

cs.LG↗

Quasi-two-body $B_{(s)}\to V ππ$ Decays with Resonance $f_0(980)$ in PQCD Approach

Motivated by the measurements of branching fractions of the quasi-two-body decays $B^0\to K^{*0}(f_0(980)\to )π^+π^-$ and $B^0\to ρ^0(f_0(980)\to )π^+π^-$, we study the charmless $B\to V (f_0(980)\to ) π^+π^-$ decays in the perturbative QCD approach. Supposing that $f_0(980)$ is a two-quark state and mixture of $n\bar n=(u\bar u+d\bar d)/\sqrt 2$ and $s\bar s$ with the mixing angle $θ$, we calculate the branching fractions of these decays with the new introduced $s$-wave $π^+π^-$-pair wave function. When the mixing angle $θ$ lies in the range $[135^{\circ}, 155^{\circ}]$, the calculated branching fractions of the $B^0\to K^{*0}f_0(980)\to K^{*0}π^+π^-$ and $B^0\to ρ^0f_0(980)\to ρ^0π^+π^-$ decays are in agreement with the experimental data. The branching fractions of other decays could be measured in the current LHCb and Belle II experiments. Considering the isospin symmetry, we also estimate the branching fractions of the quasi-two-body decays $B\to Vf_0(980)\to Vπ^0π^0$, which are half of those the corresponding decays $B\to Vf_0(980)\to Vπ^+π^-$. Moreover, the direct $CP$ asymmetries of these decays are also calculated, and some of them can be tested in the current experiments.

hep-ph↗

Refer-it-in-RGBD: A Bottom-up Approach for 3D Visual Grounding in RGBD Images

Grounding referring expressions in RGBD image has been an emerging field. We present a novel task of 3D visual grounding in single-view RGBD image where the referred objects are often only partially scanned due to occlusion. In contrast to previous works that directly generate object proposals for grounding in the 3D scenes, we propose a bottom-up approach to gradually aggregate context-aware information, effectively addressing the challenge posed by the partial geometry. Our approach first fuses the language and the visual features at the bottom level to generate a heatmap that coarsely localizes the relevant regions in the RGBD image. Then our approach conducts an adaptive feature learning based on the heatmap and performs the object-level matching with another visio-linguistic fusion to finally ground the referred object. We evaluate the proposed method by comparing to the state-of-the-art methods on both the RGBD images extracted from the ScanRefer dataset and our newly collected SUNRefer dataset. Experiments show that our method outperforms the previous methods by a large margin (by 11.2% and 15.6% Acc@0.5) on both datasets.

cs.CV↗

Design of a 200-MHz Continuous-Wave Radio Frequency Quadrupole Accelerator for Boron Neutron Capture Therapy

A high-intensity continuous wave (CW) radio frequency quadrupole (RFQ) accelerator is designed for boron neutron capture therapy (BNCT). The transmission efficiency of a 20-mA proton beam accelerated from 30 keV to 2.5 MeV can reach 98.7% at an operating frequency of 200 MHz. The beam dynamics has good tolerance to errors. By comparing the high-frequency parameters of quadrilateral and octagonal RFQ cross-sections, the quadrilateral structure of the four-vane cavity is selected owing to its multiple advantages, such as a smaller cross section at the same frequency and easy processing. In addition, tuners and undercuts are designed to tune the frequency of the cavity and achieve a flat electric field distribution along the cavity. In this paper, the beam dynamics simulation and electromagnetic design are presented in detail.

physics.acc-ph↗

Efficient Compressed Sensing Based Image Coding by Using Gray Transformation

In recent years, compressed sensing (CS) based image coding has become a hot topic in image processing field. However, since the bit depth required for encoding each CS sample is too large, the compression performance of this paradigm is unattractive. To address this issue, a novel CS-based image coding system by using gray transformation is proposed. In the proposed system, we use a gray transformation to preprocess the original image firstly and then use CS to sample the transformed image. Since gray transformation makes the probability distribution of CS samples centralized, the bit depth required for encoding each CS sample is reduced significantly. Consequently, the proposed system can considerably improve the compression performance of CS-based image coding. Simulation results show that the proposed system outperforms the traditional one without using gray transformation in terms of compression performance.

cs.MM↗