|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | An improved multilevel fuzzy comprehensive evaluation algorithm for security performance显示文摘It is of great importance to take various factors into account when evaluating the network security performance. Multilevel fuzzy comprehensive evaluation is a relatively valid method. However, the traditional multilevel fuzzy comprehensive evaluation algorithm relies on the expert’s knowledge and experiences excessively, and the result of the evaluation is usually less accurate. In this article, an improved multilevel fuzzy comprehensive evaluation algorithm, based on fuzzy sets core and entropy weight is presented. Furthermore, a multilevel fuzzy comprehensive evaluation model of P2P network security performance has also been designed, and the improved algorithm is used to make an instant computation based on the model. The advantages of the improved algorithm can be embodied in comparison with the traditional evaluation algorithm. | LI Ling-juan SHEN Ling-tong | 2006 | The Journal of China Universities of Posts and Telecommunications2006，13，4： | 21 |
| 2 | Mining microblog user interests based on TextRank with TF-IDF factor显示文摘It is of great value and significance to model the interests of microblog user in terms of business and sociology.This paper presents a framework for mining and analyzing personal interests from microblog text with a new algorithm which integrates term frequency-inverse document frequency(TF-IDF) with TextRank.Firstly, we build a three-tier category system of user interest based on Wikipedia.In order to obtain the keywords of interest, we preprocess the posts, comments and reposts in different categories to select the keywords which appear both in the category system and microblogs.We then assign weight to each category and calculate the weight of keyword to get TF-IDF factors.Finally we score the ranking of each keyword by the TextRank algorithm with TF-IDF factors.Experiments on real Sina microblog data demonstrate that the precision of our approach significantly outperforms other existing methods. | Tu Shouzhong Huang Minlie | 2016 | The Journal of China Universities of Posts and Telecommunications2016，23，5： | 19 |
| 3 | Design and implementation of high-speed real-time data acquisition system based on FPGA显示文摘The electromagnetic radiation will result in informa- tion leakage being recovered when computers work. This article presents a high-speed real-time data acquisition system based on peripheral component interconnect (PCI) bus and field programmable gate array (FPGA) for sampling electromagnetic radiation caused by video signal. The hardware design and controlling flow of each module are introduced in detail. The sampling rate can reach 64 Msps and system transfers speed can be up to 128 Mb/s by using time interleaving, which increases the overall sampling speed of a system by operating two data converters in parallel. | WANG Xu-ying LU Ying-hua ZHANG Li-kun | 2006 | The Journal of China Universities of Posts and Telecommunications2006，13，4： | 12 |
| 4 | Mobility and QoS Support in Mobile IP Networks显示文摘This paper presents the state of the art of the Quality of Service (QoS) and mobility support mechanisms for mobile IP networks, which includes the issues and challenges in QoS support, an overview of the Mobile IP protocol, a general description of the QoS and Mobility framework, and the End-To-End QoS architecture in the next-generation all-IP mobile network. | DUANLian WUWei-ling | 2004 | The Journal of China Universities of Posts and Telecommunications2004，11，1： | 12 |
| 5 | Tree-based backoff protocol for fast RFID tag identification显示文摘This paper proposes a tree-based backoff (TBB) protocol that reduces the number of iterations implemented in the procedure of tag collision arbitration in radio frequency identification (RFID) systems. This is achieved by employing the following mechanisms: one is send the request command iteratively to all tags in the interrogation zone until a single tag is identified. The other is backward to the parent node instead of root node to obtain the request parameters and send the request command again until all tags are identified. Compared with the traditional tree-based protocol, on average, simulated results show that the TBB protocol reduces the number of the iterations by 72.3% and the identification delay by 58.6% and achieves the goal of fast tag identification. | ZHENG Jia-li QIN Tuan-fa NI Guang-nan | 2013 | The Journal of China Universities of Posts and Telecommunications2013，20，2： | 12 |
| 6 | Power-Controlled MAC Protocols with Dynamic Neighbor Prediction for Ad hoc Networks显示文摘Energy and bandwidth are the scarce resources in ad hoc networks because most of the mobile nodes are battery-supplied and share the exclusive wireless medium. Integrating the power control into MAC protocol is a promising technique to fully exploit these precious resources of ad hoc wireless networks. In this paper, a new intelligent power-controlled Medium Access Control (MAC) (iMAC) protocol with dynamic neighbor prediction is proposed. Through the elaborate design of the distributed transmit-receive strategy of mobile nodes, iMAC greatly outperforms the prevailing IEEE 802.11 MAC protocols in not only energy conservation but also network throughput. Using the Dynamic Neighbor Prediction (DNP), iMAC performs well in mobile scenes. To the best of our knowledge, iMAC is the first protocol that considers the performance deterioration of power-controlled MAC protocols in mobile scenes and then proposes a solution. Simulation results indicate that DNP is important and necessary for power-controlled MAC protocols in mobile ad hoc networks. | LIMeng ZHANGLin XIAOYong-kang SHANXiu-ming | 2004 | The Journal of China Universities of Posts and Telecommunications2004，11，1： | 11 |
| 7 | A Tracking-Based Target Locating Algorithm in Wireless Sensor Networks显示文摘This paper proposes a tracking-based target locating algorithm to locate a target moving in a geographical region under the surveillance of a wireless sensor network. This algorithm first finds a sensor node that has detected the target, and then uses local messages between neighboring nodes to track the trail of the target. The authors implement this algorithm and compare it with an optimized flood-based target locating algorithm. Simulation results show that this algorithm effectively reduces the message transmission, conserves energy and consequently enhances the practicability of resource-limited wireless sensor networks. | SUNXue-bin ZHOUZheng | 2004 | The Journal of China Universities of Posts and Telecommunications2004，11，1： | 11 |
| 8 | Identity-based key agreement and encryption for wireless sensor networks显示文摘It is an important challenge to find out suitable cryptography for wireless sensor networks (WSN) because of the limitations of power, computation capability, and storage resources. Many schemes based on public or symmetric key cryptography are investigated. Recently, a practical identity-based encryption technique is proposed. In this article, we present an identity-based key agreement and encryption scheme for WSNs. This scheme is an elliptic curve cryptography type algorithm. First, we briefly review regarding identity-based encryption and decryption, particularly, the Boneh-Franklin algorithms. Then we describe a key agreement and encryption scheme on the basis of the Boneh-Franklin algorithms for WSNs. We discuss the efficiency and security of our scheme by comparing it with traditional public key technique and symmetric key technique. | YANG Geng RONG Chun-ming VEIGNER Christian WANG Jiang-tao CHENG Hong-bing | 2006 | The Journal of China Universities of Posts and Telecommunications2006，13，4： | 10 |
| 9 | Balance energy-efficient and real-time with reliable communication protocol for wireless sensor network显示文摘In many wireless sensor network applications, it should be considered that how to trade off the inherent conflict between energy efficient communication and desired quality of service such as real-time and reliability of transportation. In this paper, a novel routing protocols named balance energy-efficient and real-time with reliable communication (BERR) for wireless sensor networks (WSNs) are proposed, which considers the joint performances of real-time, energy efficiency and reliability. In BERR, a node, which is preparing to transmit data packets to sink node, estimates the energy cost, hop count value to sink node and reliability using local information gained from neighbor nodes. BERR considers not only each sender' energy level but also that of its neighbor nodes, so that the better energy conditions a node has, the more probability it will be to be chosen as the next relay node. To enhance real-time delivery, it will choose the node with smaller hop count value to sink node as the possible relay candidate. To improve reliability, it adopts retransmission mechanism. Simulation results show that BERR has better performances in term of energy consumption, network lifetime, reliability and small transmitting delay. | LIU Zhi-xin DAI Li-li MA Kai GUAN Xin-ping | 2013 | The Journal of China Universities of Posts and Telecommunications2013，20，1： | 10 |
| 10 | Face recognition system based on CNN and LBP features for classifier optimization and fusion显示文摘Face recognition has been a hot-topic in the field of pattern recognition where feature extraction and classification play an important role. However,convolutional neural network( CNN) and local binary pattern( LBP) can only extract single features of facial images,and fail to select the optimal classifier. To deal with the problem of classifier parameter optimization,two structures based on the support vector machine( SVM) optimized by artificial bee colony( ABC) algorithm are proposed to classify CNN and LBP features separately. In order to solve the single feature problem,a fusion system based on CNN and LBP features is proposed. The facial features can be better represented by extracting and fusing the global and local information of face images. We achieve the goal by fusing the outputs of feature classifiers. Explicit experimental results on Olivetti Research Laboratory( ORL) and face recognition technology( FERET) databases show the superiority of the proposed approaches. | Wu Yulin Jiang Mingyan | 2018 | The Journal of China Universities of Posts and Telecommunications2018，25，1： | 10 |
| 11 | Hamming-distance-based adaptive quantum-inspired evolutionary algorithm for network coding resources optimization显示文摘An adaptive quantum-inspired evolutionary algorithm based on Hamming distance(HD-QEA) was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was taken into consideration, and a suitable rotation angle step(RAS) was assigned to each individual according to the Hamming distance. Performance comparisons were conducted among the HD-QEA, a basic quantum-inspired evolutionary algorithm(QEA) and an individual's fitness based adaptive QEA. A solid demonstration was provided that the proposed HD-QEA is better than the other two algorithms in terms of the convergence speed and the global optimization capability when they are employed to optimize the network coding resources in multicast networks. | Qu Zhijian Liu Xiaohong Zhang Xianwei Xie Yinbao Li Caihong | 2015 | The Journal of China Universities of Posts and Telecommunications2015，22，3： | 10 |
| 12 | Channel Adaptive Shortest Path Routing for Ad Hoc Networks显示文摘Routing in Mobile Ad Hoc Network (MANET) is a challenge owing to the dynamic nature of network topology and the resource constraints. To maximize the channel resource utilization and minimize the network transfer delay along the path, the shortest path with the minimum hops approach is often adopted. However, the quality of wireless channels among the mobile nodes is time varying owing to fading, shadowing and path loss. Considering adaptive channel coding and modulation scheme, the channel state can be characterized by different link throughputs. If routing selection based on the link throughput is implemented, the minimum transfer delay from source to destination and the maximal throughput may be obtained. In this paper, a Channel Adaptive Shortest Path Routing (CASPR) is presented. Based on the adaptive channel coding and modulation, the CASPR transforms the link throughput into the channel quality factor Q and finds the shortest routing according to the Q measure. Simulation results show that the average path length in the proposed routing scheme may be slightly higher than that of the conventional shortest path with the minimum hops approach, but it can reduce the average transfer delay and increase the packet deliver rate. | TIAN Hui, XIE Fang, HU Jian dong, ZHANG Ping (Wireless Technology Innovation Labs, Beijing University of Posts & Telecommunications, Beijing 100876, P. R. China) | 2003 | The Journal of China Universities of Posts and Telecommunications2003，10，3： | 9 |
| 13 | Quasi-cyclic LDPC codes with high-rate and low error floor based on Euclidean geometries显示文摘An improved Euclidean geometry approach to design quasi-cyclic(QC) Low-density parity-check(LDPC) codes with high-rate and low error floor is presented.The constructed QC-LDPC codes with high-rate have lower error floor than the original codes.The distribution of the minimum weight codeword is analyzed,and a sufficient existence condition of the minimum weight codeword is found.Simulations show that a lot of QC-LDPC codes with lower error floor can be designed by reducing the number of the minimum weight codewords satisfying this sufficient condition. | LIU Yuan-hua ZHANG Mei-ling FAN Jiu-lun | 2012 | The Journal of China Universities of Posts and Telecommunications2012，19，2： | 9 |
| 14 | Study of the Improvement on Network Management Performance with Mobile Agent显示文摘Owing to the increasing great complexity, computer network systems require more sophisticated management strategies to be adopted so as to guarantee adequate levels of performance. The classic centralized paradigm, adopted by SNMP , which was once appropriate in the prevenient phrase, has posed problems with the explosive expansion of networks, as well as other centralized models. Mobile Agent (MA) , owing to its capability of implementing a distributed system, represents a challenging approach to provide network management with high performance. In this paper we analyze the network management structure model based on MA at first, and then we put forward a reference scenario based on MA and compare it with the traditional model. We also describe a prototype implementation based on our mobile agent system named MAS . Finally, we do some experiments to verify the performance of our framework prototype. | LIJie WANGRu-chuan | 2003 | The Journal of China Universities of Posts and Telecommunications2003，10，3： | 9 |
| 15 | Clustering and multi-hop routing with power control in wireless sensor networks显示文摘Clustering routing protocols excel in several aspects of wireless sensor networks (WSNs). This article proposes a clustering and multihop routing protocol (CMRP). In CMRP, a node independently makes its decision to compete for becoming a cluster head or join a cluster, according to its residual energy and average broadcast power of all its neighbors. To minimize the power consumption of the cluster head, CMRP sends the data in a power-aware multihop manner to the base station (BS) through a quasi-fixed route (QFR). In addition, CMRP presents a transmission power control algorithm with dynamic intercluster neighbor position estimation (DCNPE) to save energy. Simulation results show that the performance of CMRP is better than the hybrid, energy-efficient, distributed clustering approach (HEED). In the best case, CMRP increases the sensor network lifetime by 150.2%. | GUO Shu-jie ZHENG Jie QU Yu-gui ZHAO Bao-hua PAN Quan-ke | 2007 | The Journal of China Universities of Posts and Telecommunications2007，14，1： | 9 |
| 16 | HPSIN: a new hybrid P2P spatial indexing network显示文摘Geographic information system (GIS) is increasingly managing very large sets of data, hence a centralized data index may not always provide the most scalable solution. Recently, the peer to peer (P2P) networks have become very popular for sharing information in a totally decentralized manner. In this paper, a new hybrid P2P spatial indexing network (HPSIN) is proposed, which combines distributed quad-tree with distributed Hash table (DHT) based Chord network to maintain both query efficiency and system load balance. In addition, a simple theoretical model based on opened queueing network for HPSIN is established. Assuming each peer as M/M/1 queueing processor in the model, fundamental characteristics of the system is captured, and expression of average query delay is obtained in close form. The theoretical analysis and numerical computing results show that there exists an optimum point of tradeoff between efficiency and load balance. By setting a proper value of start index level ls for different network scale and query rate, HPSIN will achieve the minimum overall query delay, therefore, can adapt to different P2P application environments. | WU Jia-gao JIANG Nan ZOU Zhi-qiang HU Bin HUANG Lin FENG Jia-li | 2010 | The Journal of China Universities of Posts and Telecommunications2010，17，3： | 9 |
| 17 | Facial expression feature extraction using hybrid PCA and LBP显示文摘In order to recognize facial expression accurately, the paper proposed a hybrid method of principal component analysis (PCA) and local binary pattern (LBP). Firstly, the method of eight eyes segmentation was introduced to extract the effective area of facial expression image, which can reduce some useless information to subsequent feature extraction. Then PCA extracted the global grayscale feature of the whole facial expression image and reduced the data size at the same time. And LBP extracted local neighbor texture feature of the mouth area, which contributes most to facial expression recognition. Fusing the global and local feature will be more effective for facial expression recognition. Finally, support vector machine (SVM) used the fusion feature to complete facial expression recognition. Experiment results show that, the method proposed in this paper can classify different expressions more effectively and can get higher recognition rate than the traditional recognition methods. | LUO Yuan WU Cai-ming ZHANG Yi | 2013 | The Journal of China Universities of Posts and Telecommunications2013，20，2： | 9 |
| 18 | A Fault-Tolerant Architecture for Parlay Application Server显示文摘As the value-added service providing system in the Next-Generation Networks (NGN), Application Servers (AS) are required to provide the carrier-class reliability. To increase the reliability of AS, the fault-tolerant technology is often adopted. This paper proposes a fault-tolerant architecture for AS against single-point faults. The result of analysis shows that the architecture has a good reliability and is easily extendable. Such an advantage is attributed to a kind of special fault-tolerant design, which is different from others in that two Service Logic Program (SLP) instances do not only provide backups to each other, but also share them in the service traffic. | LIYong-ping CHENJun-liang | 2004 | The Journal of China Universities of Posts and Telecommunications2004，11，1： | 9 |
| 19 | Improvement of location methods based on RFID显示文摘The most common location algorithms based on received signal strength(RSS)are location identification based on dynamic active radio frequency identification(LANDMARC)and virtual reference elimination(VIRE).However,both the original algorithms suffer from some drawbacks.In this paper,several aspects of the two original algorithms have been modified to reduce the positioning errors.Firstly,Lagrange interpolation has been used instead of linear interpolation.Secondly,adaptive threshold has been introduced in the new algorithm.Thirdly,insert virtual reference tags to improve the location accuracy of the boundary of the sensing area.Finally,combine LANDMARC with VIRE to absorb both advantages.Compared with the original algorithms,on average,simulated results show that the modified algorithms can improve the location performance efficiently and achieve the goal of accurate positioning in indoor environment. | WU Ling HUANG Li-ya | 2013 | The Journal of China Universities of Posts and Telecommunications2013，20，6： | 9 |
| 20 | Analysis of M-LWDF fairness and an enhanced M-LWDF packet scheduling mechanism显示文摘Modified largest weighted delay first(M-LWDF)is a typical packet scheduling algorithm for supporting hybrid real-time services over wireless networks.However,so far,there is little literature available regarding the theoretic analysis of M-LWDF fairness.This paper gives a theoretic analysis of M-LWDF fairness,which shows that M-LWDF fairness is related to channel condition,packet's arrival process and the ratio of quality of service(QoS)requirements of different service queues.Given service QoS requirements and other parameters related to channel model and packet's arrival process,the fairness is merely related to the ratio of the number of users in the service queues.Based on the analysis,an enhanced M-LWDF algorithm(EM-LWDF)is proposed and demonstrated in this paper.EM-LWDF is strictly designed in light of the fairness criteria of QoS requirements,so its fairness is almost not related to the ratio of the number of users in the service queues,and the theoretical value of fairness index is equal to 1.Simulation results validate the theoretic analysis and show the effectiveness of EM-LWDF in improving fairness. | XIAN Yong-ju TIAN Feng-chun XU Chang-biao YANG Yue | 2011 | The Journal of China Universities of Posts and Telecommunications2011，18，4： | 8 |
您所在的机构暂未开通此部分的功能，请联系管理员