http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Radio Resource Management with Proportional Rate Constraint in the Heterogeneous Networks
Peng Xue,Peng Gong,Jae Hyun Park,Daeyoung Park,Duk Kyung Kim IEEE 2012 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS Vol.11 No.3
<P>We study the radio resource management (RRM) in orthogonal frequency division multiple access (OFDMA) involved heterogeneous networks, to maximize the system sum-rate under the proportional user rate constraint. An analytical model which reflects the network access features is presented. Allowing multi-homing access and resource element sharing, the RRM problem can be formulated as a linear programming (LP) problem, and the optimal solution provides upper-bound performance. In order to analyze the network selection criterion, we consider an approximated RRM problem with average resource allocations. Two different multi-homing formulations are used, and both are proven to have the same solution, where the network selection is related to the users' rate ratios between different networks. Then, we propose a low complexity suboptimal RRM algorithm, which is composed of a basic part without multi-homing access and a supplementary part with multi-homing support. The basic part makes single network selection and resource allocations. The network selection algorithm is designed based on the criterion found in the approximated problem. After network selection, an efficient resource allocation algorithm is utilized in the OFDMA network, which can employ the multi-user time and frequency diversity well. If multi-homing is allowed, the supplementary part selects the multi-homing users and reallocates partial resources to further improve the performance. Our simulation results show that the proposed suboptimal algorithm can achieve considerable gains over the previous schemes with minor performance degradation compared with the optimal solution.</P>
( Gong Peng-cheng ) 성균관대학교 유교문화연구소 2005 儒敎文化硏究(中文版) Vol.5 No.-
This article deals with Confucianism and its religiousization. Since the Republic of China, the social structure has rapidly changed due to modernization, and the social organization of Confucianism is gradually collapsing. However, it is indeed these Confucian religious groups that remain the only one in the present society and are still active. As the discussion begins on the religiousization of Confucianism, the author briefly explains two examples of Confucian temples. Introducing Bixia Palace, a historic site in Yilan County and Xietian Temple, both reflecting Confucianism's role in religious education activities and ethical attitudes, although they may not make Confucian propaganda their mission. The second focuses on the connection between Confucianism and Wumiao in the sense of Confucianism and Confucianism as religion. Wumiao plays a complementary role with Confucianism in the promotion of Confucianism and can be said to be a branch of Confucianism in Chinese society. Third, the development of Confucianism in Chinese society does not depend only on the academic world and the national political education system. The reason Confucianism can be popularized in Chinese society has become a certain ethics and values of people's lives, and there are also a series of social and religious groups that depend on it. These clans and communities spread throughout Chinese society, allowing Confucianism to become widespread and infiltrate villages and communities.
Reconstruction of Living Confucianism
Gong, Peng-Cheng 성균관대학교 동아시아학술원 2001 Sungkyun Journal of East Asian Studies Vol.1 No.1
Reconstruction of Living Confucianism
Gong, Peng,Cao, Ning,Kim, Duk Kyung John Wiley Sons, Ltd. 2011 WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Vol.11 No.9
<P><B>Abstract</B></P><P>In this paper, a threshold bounded antenna selection scheduler (TBS) and a computational complexity bounded antenna selection scheduler (CCBS) are proposed to reduce computational complexity in multiple input multiple output (MIMO) uplink. In contrast to previous works, a spatially correlated MIMO channel model is considered and a transmitter correlation value (TCV) is newly introduced to assist the antenna selection in addition to the channel gain. For the TBS or CCBS, with predetermined threshold of TCV or ratio of successful antennas (RSAs), full searching (FS) and sub searching (SS) are applied more efficiently to user equipments (UEs) compared with previous schedulers. As a result, the number of candidate antennas in the scheduling set can be reduced, which translates into a lower computational complexity in terms of number of evaluated antenna combinations. Additionally, compared with the TBS, the peak computational complexity can be further reduced by the CCBS. Simulation results show that with proposed schedulers the computational complexity can be reduced by at least 50% with an acceptable compromise of capacity. Copyright © 2010 John Wiley & Sons, Ltd.</P>
Optimum Power Allocation in a Nonorthogonal Amplify-and-Forward Relay-Assisted Network
Peng Gong,Peng Xue,Daeyoung Park,Duk Kyung Kim IEEE 2011 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY Vol.60 No.3
<P>In this paper, we address the problems of power allocation at relays to maximize the transmission rate in a nonorthogonal amplify-and-forward (AF) relay-assisted network, in which multiple relays simultaneously transmit the amplified signals in the same time and frequency. We first formulate a power allocation problem that aims to maximize the minimum of transmission rates in a multicast under a sum power constraint. Then, we prove that the optimal solution can be alternatively obtained by solving its inverse problem, which minimizes the sum power consumption at relays while achieving the target signal-to-noise ratio (SNR) with the same constraint. The inverse problem can be solved by using linear programming, and the inverse problem's complexity can be further reduced by a proposed suboptimal power allocation algorithm. As in the special case of multicast, the optimal solution is derived in unicast, and two suboptimal algorithms are proposed to reduce the feedback overhead and complexity, in which multirelay diversity is also investigated.</P>
Throughput Maximization in Cooperation Based Symbiotic Cognitive Radio Networks
XUE, Peng,GONG, Peng,KIM, Duk Kyung The Institute of Electronics, Information and Comm 2010 IEICE TRANSACTIONS ON COMMUNICATIONS - Vol.93 No.11
<P>In the symbiotic cognitive radio (CR) networks, the CR users (CUs) may assist the primary transmission in a cooperation time, and obtain an incentive time for their own data transmission. In this letter, we study the throughput maximization problem in the symbiotic CR networks. Under the symbiosis and transmit power constraints, we aim to find the optimal cooperation time to assist the primary transmission and power allocations among the CUs. Given the cooperation time, the optimal power allocations can be solved by multi-level water-filling (MWF) with individual volume limits. A theoretical analysis is presented on the cooperation time and a modified bisection algorithm with low complexity is proposed to find the sub-optimal cooperation time. Simulation results show that the spectrum usage efficiency can be significantly improved as the number of CUs increases.</P>