Institution
Beijing University of Posts and Telecommunications
Education•Beijing, Beijing, China•
About: Beijing University of Posts and Telecommunications is a education organization based out in Beijing, Beijing, China. It is known for research contribution in the topics: MIMO & Quality of service. The organization has 39576 authors who have published 41525 publications receiving 403759 citations. The organization is also known as: BUPT.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, an energy harvesting scheme for a multi-user multiple-input-multiple-output (MIMO) secrecy channel with artificial noise (AN) transmission is investigated, where the transmit beamforming matrix, the AN covariance matrix, and the power splitting ratio are jointly optimized to minimize the transmit power under the target secrecy rate, the total transmit power, and harvested energy constraints.
Abstract: In this paper, an energy harvesting scheme for a multi-user multiple-input-multiple-output secrecy channel with artificial noise (AN) transmission is investigated. Joint optimization of the transmit beamforming matrix, the AN covariance matrix, and the power splitting ratio is conducted to minimize the transmit power under the target secrecy rate, the total transmit power, and the harvested energy constraints. The original problem is shown to be non-convex, which is tackled by a two-layer decomposition approach. The inner layer problem is solved through semi-definite relaxation, and the outer problem, on the other hand, is shown to be a single-variable optimization that can be solved by 1-D line search. To reduce computational complexity, a sequential parametric convex approximation method is proposed to find a near-optimal solution. This paper is then extended to the imperfect channel state information case with norm-bounded channel errors. Furthermore, tightness of the relaxation for the proposed schemes is validated by showing that the optimal solution of the relaxed problem is rank-one. Simulation results demonstrate that the proposed SPCA method achieves the same performance as the scheme based on 1-D but with much lower complexity.
97 citations
••
01 Jul 2006TL;DR: In this article, the authors investigated distributed consensus control for networks of agents with double integrator dynamics and proved that the largest tolerable time-delay is only related to the largest eigenvalue of the graph Laplacian.
Abstract: In this paper, distributed consensus control is investigated for networks of agents with double integrator dynamics. Two kinds of networks are analyzed, i.e., directed networks with fixed topology and undirected networks with fixed topology and time-delay. For each of the networks, a sufficient and necessary condition is given to guarantee the consensus. It is proved that the largest tolerable time-delay is only related to the largest eigenvalue of the graph Laplacian. Finally, two numerical examples are provided to illustrate the obtained results.
97 citations
••
TL;DR: A new representation learning framework called Recommendation via Dual-Autoencoder (ReDa) is proposed, which simultaneously learns the new hidden representations of users and items using autoencoders, and develops a gradient descent method to learn hidden representations.
97 citations
••
TL;DR: It is shown that the eavesdropper Eve can totally obtain the session key by sending entangled qubits as the fake signal to Alice and performing collective measurements after Alice's encoding, just like a dense-coding communication between Eve and Alice.
Abstract: Cryptanalysis is an important branch in the study of cryptography, including both the classical cryptography and the quantum one. In this paper we analyze the security of two three-party quantum key distribution protocols (QKDPs) proposed recently, and point out that they are susceptible to a simple and effective attack, i.e., the dense-coding attack. It is shown that the eavesdropper Eve can totally obtain the session key by sending entangled qubits as the fake signal to Alice and performing collective measurements after Alice's encoding. The attack process is just like a dense-coding communication between Eve and Alice, where a special measurement basis is employed. Furthermore, this attack does not introduce any errors to the transmitted information and consequently will not be discovered by Alice and Bob. The attack strategy is described in detail and a proof for its correctness is given. Finally, the root cause of this insecurity and a possible way to improve these protocols are discussed.
97 citations
••
TL;DR: A new version of MBO algorithm, incorporating crossover operator, supplemented with Greedy strategy and self-adaptive Crossover operator is presented, which can significantly improve the diversity of population during the later run phase of the search.
Abstract: Recently, by examining and simulating the migration behavior of monarch butterflies in nature, Wang et al. proposed a new swarm intelligence-based metaheuristic algorithm, called monarch butterfly optimization (MBO), for addressing various global optimization tasks. The effectiveness of MBO was verified by benchmark evaluation on an array of unimodal and multimodal test functions in comparison with the five state-of-the-art metaheuristic algorithms on most benchmarks. However, MBO failed to come up with satisfactory performance (Std values and mean fitness) on some benchmarks. In order to overcome this, a new version of MBO algorithm, incorporating crossover operator is presented in this paper. A variant of the original MBO, the proposed one is essentially a self-adaptive crossover (SAC) operator. A kind of greedy strategy is also utilized. It ensures that only the better monarch butterfly individuals, satisfying a certain criterion, are allowed to pass to the next generation, instead of all the updated monarch butterfly individuals, as was done in the basic MBO. In other words, the proposed methodology is essentially a new version of the original MBO, supplemented with Greedy strategy and self-adaptive Crossover operator (GCMBO). In GCMBO, the SAC operator can significantly improve the diversity of population during the later run phase of the search. In butterfly adjusting operator, the greedy strategy is used to select only those monarch butterfly individuals, possessing improved fitness and hence can aid towards accelerating convergence. Finally, the proposed GCMBO method is benchmarked by twenty-five standard unimodal and multimodal test functions. The results clearly demonstrate the capability of GCMBO in significantly outperforming the basic MBO method for almost all the test cases. The MATLAB code used in the paper can be found in the website: http://www.mathworks.com/matlabcentral/fileexchange/55339-gcmbo
.
97 citations
Authors
Showing all 39925 results
Name | H-index | Papers | Citations |
---|---|---|---|
Jie Zhang | 178 | 4857 | 221720 |
Jian Li | 133 | 2863 | 87131 |
Ming Li | 103 | 1669 | 62672 |
Kang G. Shin | 98 | 885 | 38572 |
Lei Liu | 98 | 2041 | 51163 |
Muhammad Shoaib | 97 | 1333 | 47617 |
Stan Z. Li | 97 | 532 | 41793 |
Qi Tian | 96 | 1030 | 41010 |
Xiaodong Xu | 94 | 1122 | 50817 |
Qi-Kun Xue | 84 | 589 | 30908 |
Long Wang | 84 | 835 | 30926 |
Jing Zhou | 84 | 533 | 37101 |
Hao Yu | 81 | 981 | 27765 |
Mohsen Guizani | 79 | 1110 | 31282 |
Muhammad Iqbal | 77 | 961 | 23821 |