With the increment of the number of Gaussian components, the computation cost increases in the Gaussian mixture probability hypothesis density(GM-PHD) filter. Based on the theory of Chen et al, we propose an improved ...With the increment of the number of Gaussian components, the computation cost increases in the Gaussian mixture probability hypothesis density(GM-PHD) filter. Based on the theory of Chen et al, we propose an improved pruning algorithm for the GM-PHD filter, which utilizes not only the Gaussian components’ means and covariance, but their weights as a new criterion to improve the estimate accuracy of the conventional pruning algorithm for tracking very closely proximity targets. Moreover, it solves the end-less while-loop problem without the need of a second merging step. Simulation results show that this improved algorithm is easier to implement and more robust than the formal ones.展开更多
This paper presents a simple but informative mathematical model to describe the mixing of three dissimilar components of particulate solids that have the tendency to segregate within one another. A nonlinear Markov ch...This paper presents a simple but informative mathematical model to describe the mixing of three dissimilar components of particulate solids that have the tendency to segregate within one another. A nonlinear Markov chain model is proposed to describe the process. At each time step, the exchange of particulate solids between the cells of the chain is divided into two virtual stages. The first is pure stochastic mixing accompanied by downward segregation. Upon the completion of this stage, some of the cells appear to be overfilled with the mixture, while others appear to have a void space. The second stage is related to upward segregation. Components from the overfilled cells fill the upper cells （those with the void space） according to the proposed algorithm. The degree of non-homogeneity in the mixture （the standard deviation） is calculated at each time step, which allows the mixing kinetics to be described. The optimum mixing time is found to provide the maximum homogeneity in the ternary mixture. However, this “common” time differs from the optimum mixing times for individual components. The model is verified using a lab-scale vibration vessel, and a reasonable correlation between the calculated and experimental data is obtained展开更多
In this paper, the transmission of confidential messages through single-input multiple-output （SIMO） independent and identically generMized-K （KG） fading channels is considered, where the eavesdropper overhears th...In this paper, the transmission of confidential messages through single-input multiple-output （SIMO） independent and identically generMized-K （KG） fading channels is considered, where the eavesdropper overhears the transmission from the transmitter to the receiver. Both the receiver and the eavesdropper are equipped with multiple antennas, and both active and passive eavesdroppings are considered where the channel state information of the eavesdropper＇s channel is or is not available at the transmitter. The secrecy performance of SIMO KG systems is investigated. Analytical expressions for secrecy outage probability and average secrecy capacity of SIMO systems are derived via two different methods, in which KG distribution is approximated by the Gamma and mixture Gamma distributions, respectively. Numerical results are presented and verified via the Monte-Carlo simulation.展开更多
基金supported by the National Natural Science Foundation of China(61703228)
文摘With the increment of the number of Gaussian components, the computation cost increases in the Gaussian mixture probability hypothesis density(GM-PHD) filter. Based on the theory of Chen et al, we propose an improved pruning algorithm for the GM-PHD filter, which utilizes not only the Gaussian components’ means and covariance, but their weights as a new criterion to improve the estimate accuracy of the conventional pruning algorithm for tracking very closely proximity targets. Moreover, it solves the end-less while-loop problem without the need of a second merging step. Simulation results show that this improved algorithm is easier to implement and more robust than the formal ones.
文摘This paper presents a simple but informative mathematical model to describe the mixing of three dissimilar components of particulate solids that have the tendency to segregate within one another. A nonlinear Markov chain model is proposed to describe the process. At each time step, the exchange of particulate solids between the cells of the chain is divided into two virtual stages. The first is pure stochastic mixing accompanied by downward segregation. Upon the completion of this stage, some of the cells appear to be overfilled with the mixture, while others appear to have a void space. The second stage is related to upward segregation. Components from the overfilled cells fill the upper cells （those with the void space） according to the proposed algorithm. The degree of non-homogeneity in the mixture （the standard deviation） is calculated at each time step, which allows the mixing kinetics to be described. The optimum mixing time is found to provide the maximum homogeneity in the ternary mixture. However, this “common” time differs from the optimum mixing times for individual components. The model is verified using a lab-scale vibration vessel, and a reasonable correlation between the calculated and experimental data is obtained
基金Project supported in part by the National Natural Science Foundation of China （Nos. 61471076 and 61401372）, the Program for Changjiang Scholars and Innovative Research Team in University, China （No. IRT1299）, the Natural Science Foundation Project of CQ CSTC （No. cstc2013jcyjA40040）, the Project of Fundamental and Frontier Research Plan of Chongqing, China （No. cstc2015jcyjBX0085）, the Special Fund of Chongqing Key Laboratory （CSTC）, the Scientific and Technological Research Program of Chongqing Municipal Education Commission, China （No. KJ1600413）, the Research Fund for the Doctoral Program of Higher Education of China （No. 20130182120017）, and the Fundamental Research Funds for the Central Universities, China （No. XDJK2015B023）. Parts of this publication, specifically Sections 1, 3, and 4, were made possible by PDRA （Post- Doctoral Research Award） from the Qatar National Research Fund （QNRF） （a member of Qatar Foundation （QF））, Qatar （No. PDRA1-1227-13029）
文摘In this paper, the transmission of confidential messages through single-input multiple-output （SIMO） independent and identically generMized-K （KG） fading channels is considered, where the eavesdropper overhears the transmission from the transmitter to the receiver. Both the receiver and the eavesdropper are equipped with multiple antennas, and both active and passive eavesdroppings are considered where the channel state information of the eavesdropper＇s channel is or is not available at the transmitter. The secrecy performance of SIMO KG systems is investigated. Analytical expressions for secrecy outage probability and average secrecy capacity of SIMO systems are derived via two different methods, in which KG distribution is approximated by the Gamma and mixture Gamma distributions, respectively. Numerical results are presented and verified via the Monte-Carlo simulation.
