arXiv subjects

Jun Deng

Publications and source records attributed to Jun Deng.

41 records · Page 3Linked to original sources

arXiv2014

Monte Carlo Simulation of Indoor External Exposure due to Gamma-emitting Radionuclides in Building Materials

The use of building materials containing naturally occurring radionuclides,such as K-40, U-238 and Th-232 and their progeny, could lead to external exposures of the residents of such buildings. In this paper, a set of models are set up to calculate the specific effective dose rates(the effective dose rate per Bq/kg of K-40, U-238 series, and Th-232 series) imposed to residents by building materials with MCNPX code. Effect of chemical composition, position concerned in the room and thickness as well as density of material is analyzed. In order to facilitate more precise assessment of indoor external dose due to gamma emitting radionuclides in building materials, three regressive expressions are proposed and validated by measured data to calculate specific effective rate for K-40, U-238 series and Th-232 series, respectively.

physics.ins-det↗

arXiv2013

Arbitrages in a Progressive Enlargement Setting

This paper completes the analysis of Choulli et al. Non-Arbitrage up to Random Horizons and after Honest Times for Semimartingale Models and contains two principal contributions. The first contribution consists in providing and analysing many practical examples of market models that admit classical arbitrages while they preserve the No Unbounded Profit with Bounded Risk (NUPBR hereafter) under random horizon and when an honest time is incorporated for particular cases of models. For these markets, we calculate explicitly the arbitrage opportunities. The second contribution lies in providing simple proofs for the stability of the No Unbounded Profit with Bounded Risk under random horizon and after honest time satisfying additional important condition for particular cases of models.

math.PR↗

arXiv2013

Truthful Mechanisms for Secure Communication in Wireless Cooperative System

To ensure security in data transmission is one of the most important issues for wireless relay networks, and physical layer security is an attractive alternative solution to address this issue. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source may select several relays to help forward the signal to the corresponding destination to achieve the best security performance. However, the relays may have the incentive not to report their true private channel information in order to get more chances to be selected and gain more payoff from the source. We propose a Vickey-Clark-Grove (VCG) based mechanism and an Arrow-d'Aspremont-Gerard-Varet (AGV) based mechanism into the investigated relay network to solve this cheating problem. In these two different mechanisms, we design different "transfer payment" functions to the payoff of each selected relay and prove that each relay gets its maximum (expected) payoff when it truthfully reveals its private channel information to the source. And then, an optimal secrecy rate of the network can be achieved. After discussing and comparing the VCG and AGV mechanisms, we prove that the AGV mechanism can achieve all of the basic qualifications (incentive compatibility, individual rationality and budget balance) for our system. Moreover, we discuss the optimal quantity of relays that the source node should select. Simulation results verify efficiency and fairness of the VCG and AGV mechanisms, and consolidate these conclusions.

cs.CR↗

arXiv2011

Orthonormal Expansion l1-Minimization Algorithms for Compressed Sensing

Compressed sensing aims at reconstructing sparse signals from significantly reduced number of samples, and a popular reconstruction approach is $\ell_1$-norm minimization. In this correspondence, a method called orthonormal expansion is presented to reformulate the basis pursuit problem for noiseless compressed sensing. Two algorithms are proposed based on convex optimization: one exactly solves the problem and the other is a relaxed version of the first one. The latter can be considered as a modified iterative soft thresholding algorithm and is easy to implement. Numerical simulation shows that, in dealing with noise-free measurements of sparse signals, the relaxed version is accurate, fast and competitive to the recent state-of-the-art algorithms. Its practical application is demonstrated in a more general case where signals of interest are approximately sparse and measurements are contaminated with noise.

cs.IT↗

arXiv2007

Magnetic structure of free cobalt clusters studied with Stern-Gerlach deflection experiments

We have studied the magnetic properties of free cobalt clusters in two semi-independent Stern-Gerlach deflection experiments at temperatures between 60 and 307 K. We find that clusters consisting of 13 to 200 cobalt atoms exhibit behavior that is entirely consistent with superparamagnetism, though complicated by finite-system fluctuations in cluster temperature. By fitting the data to the Langevin function, we report magnetic moments per atom for each cobalt cluster size and compare the results of our two measurements and all those performed previously. In addition to a gradual decrease in moment per atom with increasing size, there are oscillations that appear to be caused by geometrical shell structure. We discuss our observations in light of the two competing models for Langevin-like magnetization behavior in free clusters, superparamagnetism and adiabatic magnetization, and conclude that the evidence strongly supports the superparamagnetic model.

physics.atm-clus↗