arXiv subjects

Min Li

Publications and source records attributed to Min Li.

At least 289 records · Page 16Linked to original sources

arXiv2015

The Trigger System for the External Target Experiment in CSR of HIRFL

A trigger system was designed for the external target experiment in the Cooling Storage Ring (CSR) of the Heavy Ion Research Facility in Lanzhou (HIRFL). Considering that different detectors are scattered in a large area, the trigger system is designed based on a master-slave structure and fiber-based serial data transmission technique. The trigger logic is organized in hierarchies, and flexible reconfiguration of the trigger function is achieved based on command register access or overall field-programmable gate array (FPGA) logic on-line reconfiguration controlled by remote computers. We also conducted tests to confirm the function of the trigger electronics, and the results indicate that this trigger system works well.

physics.ins-det↗

arXiv2015

Selective enhancement of resonant multiphoton ionization with strong laser fields

High-resolution photoelectron momentum distributions of Xe atoms ionized by 800-nm linearly polarized laser fields have been traced at intensities from 1.1*1013 to 3.5*1013W/cm2 using velocity-map imaging techniques. At certain laser intensities, the momentum spectrum exhibits a distinct double-ring structure for low-order above-threshold ionization, which appears to be absent at lower or higher laser intensities. By investigating the intensity-resolved photoelectron energy spectrum, we find that this double-ring structure originates from resonant multiphoton ionization involving multiple Rydberg states of atoms. Varying the laser intensity, we can selectively enhance the resonant multiphoton ionization through certain atomic Rydberg states. The photoelectron angular distributions of multiphoton resonance are also investigated for the low-order above-threshold ionization.

physics.atom-ph↗

arXiv2015

Identifying the Absorption Bump with Deep Learning

The pervasive interstellar dust grains provide significant insights to understand the formation and evolution of the stars, planetary systems, and the galaxies, and may harbor the building blocks of life. One of the most effective way to analyze the dust is via their interaction with the light from background sources. The observed extinction curves and spectral features carry the size and composition information of dust. The broad absorption bump at 2175 Angstrom is the most prominent feature in the extinction curves. Traditionally, statistical methods are applied to detect the existence of the absorption bump. These methods require heavy preprocessing and the co-existence of other reference features to alleviate the influence from the noises. In this paper, we apply Deep Learning techniques to detect the broad absorption bump. We demonstrate the key steps for training the selected models and their results. The success of Deep Learning based method inspires us to generalize a common methodology for broader science discovery problems. We present our on-going work to build the DeepDis system for such kind of applications.

cs.CV↗

arXiv2015

Assembly-Dependent Interfacial Property of Carbon Nanotube Fibers with Epoxy and Its Enhancement via Generalized Surface Sizing

In building up composite structures using carbon nanotube (CNT) fibers, the fiber-to-matrix interfacial shear strength (IFSS) is one of the most important issues. Originating from the assembly characteristics of CNT fiber, the IFSS strongly depends on the fiber's twisting level and densification level. Furthermore, there are rich ways to modify the fiber surface and thus enhance the IFSS, including the physical and chemical modification on fiber surface, the infiltration of matrix resin into CNT fiber, and the introduction of silane coupling agent. A new feature differing from carbon fibers is that all these treatments either change the fiber's surface structure or form a several-hundreds-nm-thick interphase inside rather than around the fiber. These "generalized" treatments obviously extend the common concept of surface sizing and can be used for various forms of CNT assembly structures.

cond-mat.mtrl-sci↗

arXiv2015

Constraining cosmology with pairwise velocity estimator

In this paper, we develop a full statistical method for the pairwise velocity estimator previously proposed, and apply Cosmicflows-2 catalogue to this method to constrain cosmology. We first calculate the covariance matrix for line-of-sight velocities for a given catalogue, and then simulate the mock full-sky surveys from it, and then calculate the variance for the pairwise velocity field. By applying the $8315$ independent galaxy samples and compressed $5224$ group samples from Cosmicflows-2 catalogue to this statistical method, we find that the joint constraint on $Ω^{0.6}_{\rm m}h$ and $σ_{8}$ is completely consistent with the WMAP 9-year and Planck 2015 best-fitting cosmology. Currently, there is no evidence for the modified gravity models or any dynamic dark energy models from this practice, and the error-bars need to be reduced in order to provide any concrete evidence against/to support $Λ$CDM cosmology.

astro-ph.CO↗

arXiv2015

Multidimensional BSDEs with uniformly continuous coefficients: the general result

In this paper, by introducing a new notion of envelope of the stochastic process, we construct a family of random differential equations whose solutions can be viewed as solutions of a family of ordinary differential equations and prove that the multidimensional backward stochastic differential equations (BSDEs for short) with the general uniformly continuous coefficients are uniquely solvable. As a result, we solve the open problem of multidimensional BSDEs with uniformly continuous coefficients.

math.PR↗

arXiv2015

A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization

This paper presents a majorized alternating direction method of multipliers (ADMM) with indefinite proximal terms for solving linearly constrained $2$-block convex composite optimization problems with each block in the objective being the sum of a non-smooth convex function and a smooth convex function, i.e., $\min_{x \in {\cal X}, \; y \in {\cal Y}}\{p(x)+f(x) + q(y)+g(y)\mid A^* x+B^* y = c\}$. By choosing the indefinite proximal terms properly, we establish the global convergence and $O(1/k)$ ergodic iteration-complexity of the proposed method for the step-length $τ\in (0, (1+\sqrt{5})/2)$. The computational benefit of using indefinite proximal terms within the ADMM framework instead of the current requirement of positive semidefinite ones is also demonstrated numerically. This opens up a new way to improve the practical performance of the ADMM and related methods.

math.OC↗

arXiv2015

Adaptive Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems

The Primal-Dual hybrid gradient (PDHG) method is a powerful optimization scheme that breaks complex problems into simple sub-steps. Unfortunately, PDHG methods require the user to choose stepsize parameters, and the speed of convergence is highly sensitive to this choice. We introduce new adaptive PDHG schemes that automatically tune the stepsize parameters for fast convergence without user inputs. We prove rigorous convergence results for our methods, and identify the conditions required for convergence. We also develop practical implementations of adaptive schemes that formally satisfy the convergence requirements. Numerical experiments show that adaptive PDHG methods have advantages over non-adaptive implementations in terms of both efficiency and simplicity for the user.

math.NA↗

arXiv2015

Streaking temporal double slit interference by an orthogonal two-color laser field

We investigate electron momentum distributions from single ionization of Ar by two orthogonally polarized laser pulses of different color. The two-color scheme is used to experimentally control the interference between electron wave packets released at different times within one laser cycle. This intracycle interference pattern is typically hard to resolve in an experiment. With the two-color control scheme these features become the dominant contribution to the electron momentum distribution. Furthermore the second color can be used for streaking of the otherwise interfering wave packets establishing a which-way marker. Our investigation shows that the visibility of the interference fringes depends on the degree of the which-way information determined by the controllable phase between the two pulses.

physics.atom-ph↗

arXiv2015

Anti-dark and Mexican-hat solitons in the Sasa-Satsuma equation on the continuous wave background

In this letter, via the Darboux transformation method we construct new analytic soliton solutions for the Sasa-Satsuma equation which describes the femtosecond pulses propagation in a monomode fiber. We reveal that two different types of femtosecond solitons, i.e., the anti-dark (AD) and Mexican-hat (MH) solitons, can form on a continuous wave (CW) background, and numerically study their stability under small initial perturbations. Different from the common bright and dark solitons, the AD and MH solitons can exhibit both the resonant and elastic interactions, as well as various partially/completely inelastic interactions which are composed of such two fundamental interactions. In addition, we find that the energy exchange between some interacting soliton and the CW background may lead to one AD soliton changing into an MH one, or one MH soliton into an AD one.

nlin.SI↗

arXiv2014

A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block

In this paper, we present a semi-proximal alternating direction method of multipliers (ADMM) for solving $3$-block separable convex minimization problems with the second block in the objective being a strongly convex function and one coupled linear equation constraint. By choosing the semi-proximal terms properly, we establish the global convergence of the proposed semi-proximal ADMM for the step-length $τ\in (0, (1+\sqrt{5})/2)$ and the penalty parameter $σ\in (0, +\infty)$. In particular, if $σ>0$ is smaller than a certain threshold and the first and third linear operators in the linear equation constraint are injective, then all the three added semi-proximal terms can be dropped and consequently, the convergent $3$-block semi-proximal ADMM reduces to the directly extended $3$-block ADMM with $τ\in (0, (1+\sqrt{5})/2)$.

math.OC↗

arXiv2014

Statistical computation of Boltzmann entropy and estimation of the optimal probability density function from statistical sample

In this work, we investigate the statistical computation of the Boltzmann entropy of statistical samples. For this purpose, we use both histogram and kernel function to estimate the probability density function of statistical samples. We find that, due to coarse-graining, the entropy is a monotonic increasing function of the bin width for histogram or bandwidth for kernel estimation, which seems to be difficult to select an optimal bin width/bandwidth for computing the entropy. Fortunately, we notice that there exists a minimum of the first derivative of entropy for both histogram and kernel estimation, and this minimum point of the first derivative asymptotically points to the optimal bin width or bandwidth. We have verified these findings by large amounts of numerical experiments. Hence, we suggest that the minimum of the first derivative of entropy be used as a selector for the optimal bin width or bandwidth of density estimation. Moreover, the optimal bandwidth selected by the minimum of the first derivative of entropy is purely data-based, independent of the unknown underlying probability density distribution, which is obviously superior to the existing estimators. Our results are not restricted to one-dimensional, but can also be extended to multivariate cases. It should be emphasized, however, that we do not provide a robust mathematical proof of these findings, and we leave these issues with those who are interested in them.

stat.ME↗

arXiv2014

Message and State Cooperation in a Relay Channel When Only the Relay Knows the State

A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. The source and the relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel connects the source and the relay, on one side, and the destination, on the other. Via the orthogonal links, the source can convey information about the message to be delivered to the destination to the relay while the relay can forward state information to the source. This exchange enables cooperation between the source and the relay on transmission of message and state information to the destination. First, two achievable schemes are proposed that exploit both message and state cooperation. It is shown that a transmission scheme inspired by noisy network coding performs better than a strategy based on block Markov coding and backward decoding. Next, based on the given achievable schemes and appropriate upper bounds, capacity results are identified for some special cases. Finally, a Gaussian model is studied, along with corresponding numerical results that illuminate the relative merits of state and message cooperation.

cs.IT↗

arXiv2013

Molecular dynamics simulations of cumulative helium bombardments on tungsten surfaces

Molecular dynamics (MD) simulations were performed to study the cumulative bombardments of low-energy (60-200 eV) helium (He) atoms on tungsten (W) surfaces. The behaviour of He and the response of the W surface were investigated. The He incident energy and tungsten temperature play important roles on the formation and growth of He clusters. The temperature can promote the coalescence of He clusters and increase the size of the He clusters. A stratification phenomenon of the He depth distribution has been observed. The rupture of the He clusters and, at the same time, the escape and re-deposition of the W atoms have been observed. During the formation of He clusters, the interstitial W atoms are produced and evolve into bundles of <111> crowdions, which would be constrained around the He clusters for a long time. However, they will finally move onto the top surface along the <111> direction, which results in stacking the W atoms on the surface. The complex combination effects of the He clusters and the interstitial atoms result in the growth of the surfaces.

cond-mat.mtrl-sci↗

arXiv2013

A modified W-W interatomic potential based on ab initio calculations

Based on ab initio calculations, a Finnis-Sinclair-type interatomic potential for W-W interactions has been developed. The modified potential is able to reproduce the correct formation energies of self-interstitial atom defects in tungsten, offering a significant improvement over the Ackland-Thetford tungsten potential. Using the modified potential, the thermal expansion is calculated in a temperature range from 0 K to 3500 K, and the results are in reasonable agreement with the experimental data, thus overcoming the shortcoming of the negative thermal expansion using the Derlet-Nguyen-Manh-Dudarev tungsten potential. The present W-W potential is also applied to study in detail the diffusion of self-interstitial atoms in tungsten. It is revealed that the initial self-interstitial atom initiates a sequence of W atom displacements and replacements in the <111> direction. An Arrhenius fit to the diffusion data at temperatures below 550 K indicates a migration energy of 0.022 eV, in reasonable agreement with the experimental data.

cond-mat.mtrl-sci↗

arXiv2013

Qunatum Parrondo's games constructed by quantum random walk

We construct a Parrondo's game using discrete time quantum walks. Two lossing games are represented by two different coin operators. By mixing the two coin operators $U_{A}(α_{A},β_{A},γ_{A})$ and $U_{B}(α_{B},β_{B},γ_{B})$, we may win the game. Here we mix the two games in position instead of time. With a number of selections of the parameters, we can win the game with sequences ABB, ABBB, \emph{et al}. If we set $β_{A}=45^{\circ},γ_{A}=0,α_{B}=0,β_{B}=88^{\circ}$, we find the game 1\emph{}with {\normalsize $U_{A}^{S}=U^{S}(-51^{\circ},45^{\circ},0)$, $U_{B}^{S}=U^{S}(0,88^{\circ},-16^{\circ})$ will win and get the most profit.}If we set $α_{A}=0,β_{A}=45^{\circ},α_{B}=0,β_{B}=88^{\circ}$ and{\normalsize{} the game 2 with $U_{A}^{S}=U^{S}(0,45^{\circ},-51^{\circ})$, $U_{B}^{S}=U^{S}(0,88^{\circ},-67^{\circ})$, will win most. And}game 1\emph{}{\normalsize is equivalent to the}game\emph{}2\emph{}with the changes of sequences and steps. But at a large enough steps, the game will loss at last.

quant-ph↗

arXiv2013

A 3D Curve Offset Approach for Ruled Surface Generation in Engineering Design

Ruled surface is widely used in engineering design such as parting surface design of injection mold and checking surface design of checking fixture, which are usually generated by offsetting 3D curves. However, in 3D curve offset, there often exist break,interaction and overlapping problems which can't be solved by current CAD software automatically. This paper is targeted at developing a 3D curve offsetting algorithm for ruled surface generation, and three key technologies are introduced in details: An improved curve division method is proposed to reduce the offset accuracy error resulted from different offset distances and curvatures; An offsetting curve overlapping detection and elimination method is proposed; And then, a curve transition method is presented to improve curve offsetting quality for the break and intersection/overlapping regions, where a new algorithm for generating positive weights spherical rational quartic Bezier curve is proposed to bridge the breaks of offset curves to create a smooth ruled surface. Finally, two practical design cases, parting surface and checking surface generation, show that the proposed approach can enhance the efficiency and quality for ruled surface generation in engineering design.

cs.CG↗

arXiv2012

Molecular dynamics simulations with many-body potentials on multiple GPUs - the implementation, package and performance

Molecular dynamics (MD) is an important research tool extensively applied in materials science. Running MD on a graphics processing unit (GPU) is an attractive new approach for accelerating MD simulations. Currently, GPU implementations of MD usually run in a one-host-process-one-GPU (OHPOG) scheme. This scheme may pose a limitation on the system size that an implementation can handle due to the small device memory relative to the host memory. In this paper, we present a one-host-process-multiple-GPU (OHPMG) implementation of MD with embedded-atom-model or semi-empirical tight-binding many-body potentials. Because more device memory is available in an OHPMG process, the system size that can be handled is increased to a few million or more atoms. In comparison with the CPU implementation, in which Newton's third law is applied to improve the computational efficiency, our OHPMG implementation has achieved a 28.9x~86.0x speedup in double precision, depending on the system size, the cut-off ranges and the number of GPUs. The implementation can also handle a group of small boxes in one run by combining the small boxes into a large box. This approach greatly improves the GPU computing efficiency when a large number of MD simulations for small boxes are needed for statistical purposes.

physics.comp-ph↗