设X={ Xn,n≥1 }是一列可交换的随机变量,并假设X中仅仅有部分随机变量能够被观测到。在随机缺失情形下,本文证明了完全样本极值次序统计量与非完全样本极值次序统计量的联合极限分布,并用所得结果研究了阿基米德Copula相依结构下完全...设X={ Xn,n≥1 }是一列可交换的随机变量,并假设X中仅仅有部分随机变量能够被观测到。在随机缺失情形下,本文证明了完全样本极值次序统计量与非完全样本极值次序统计量的联合极限分布,并用所得结果研究了阿基米德Copula相依结构下完全样本极值次序统计量与非完全样本极值次序统计量的渐近关系。Let X={ Xn,n≥1 }be a sequence of exchangeable variables and suppose that only parts of them can be observed. In this paper, we derived the joint asymptotic distributions of extreme order statistics of complete and incomplete samples under conditional independence. We also investigate the joint asymptotic relation between extreme order statistics of complete and incomplete samples under Archimedean copulas.展开更多
The sampling problem for input-queued (IQ) randomized scheduling algorithms is analyzed.We observe that if the current scheduling decision is a maximum weighted matching (MWM),the MWM for the next slot mostly falls in...The sampling problem for input-queued (IQ) randomized scheduling algorithms is analyzed.We observe that if the current scheduling decision is a maximum weighted matching (MWM),the MWM for the next slot mostly falls in those matchings whose weight is closed to the current MWM.Using this heuristic,a novel randomized algorithm for IQ scheduling,named genetic algorithm-like scheduling algorithm (GALSA),is proposed.Evolutionary strategy is used for choosing sampling points in GALSA.GALSA works with only O(N) samples which means that GALSA has lower complexity than the famous randomized scheduling algorithm,APSARA.Simulation results show that the delay performance of GALSA is quite competitive with respect to that of APSARA.展开更多
A protocol for quantum dialogue is proposed to exchange directly the communicator＇s secret messages by using a three-dimensional Bell state and a two-dimensional Bell state as quantum channel with quantum superdence ...A protocol for quantum dialogue is proposed to exchange directly the communicator＇s secret messages by using a three-dimensional Bell state and a two-dimensional Bell state as quantum channel with quantum superdence coding, local collective unitary operations, and entanglement swapping. In this protocol, during the process of trans- mission of particles, the transmitted particles do not carry any secret messages and are transmitted only one time. The protocol has higher source capacity than protocols using symmetric two-dimensional states. The security is ensured by the unitary operations randomly performed on all checking groups before the particle sequence is transmitted and the application of entanglement swapping.展开更多
文摘设X={ Xn,n≥1 }是一列可交换的随机变量,并假设X中仅仅有部分随机变量能够被观测到。在随机缺失情形下,本文证明了完全样本极值次序统计量与非完全样本极值次序统计量的联合极限分布,并用所得结果研究了阿基米德Copula相依结构下完全样本极值次序统计量与非完全样本极值次序统计量的渐近关系。Let X={ Xn,n≥1 }be a sequence of exchangeable variables and suppose that only parts of them can be observed. In this paper, we derived the joint asymptotic distributions of extreme order statistics of complete and incomplete samples under conditional independence. We also investigate the joint asymptotic relation between extreme order statistics of complete and incomplete samples under Archimedean copulas.
文摘The sampling problem for input-queued (IQ) randomized scheduling algorithms is analyzed.We observe that if the current scheduling decision is a maximum weighted matching (MWM),the MWM for the next slot mostly falls in those matchings whose weight is closed to the current MWM.Using this heuristic,a novel randomized algorithm for IQ scheduling,named genetic algorithm-like scheduling algorithm (GALSA),is proposed.Evolutionary strategy is used for choosing sampling points in GALSA.GALSA works with only O(N) samples which means that GALSA has lower complexity than the famous randomized scheduling algorithm,APSARA.Simulation results show that the delay performance of GALSA is quite competitive with respect to that of APSARA.
文摘A protocol for quantum dialogue is proposed to exchange directly the communicator＇s secret messages by using a three-dimensional Bell state and a two-dimensional Bell state as quantum channel with quantum superdence coding, local collective unitary operations, and entanglement swapping. In this protocol, during the process of trans- mission of particles, the transmitted particles do not carry any secret messages and are transmitted only one time. The protocol has higher source capacity than protocols using symmetric two-dimensional states. The security is ensured by the unitary operations randomly performed on all checking groups before the particle sequence is transmitted and the application of entanglement swapping.
