检索结果-内蒙古大学图书馆

IEEE International Conference on Software Engineering and Service Sciences (ICSESS)

作者： Jianmin Bao Shu Zhang Junjie Zhang Kun Wang Haifeng Hu Key Lab of Broadband Wireless Communication and Sensor Network Technology (Nanjing Univ. of Posts and Telecommunications) Nanjing University of Posts and Telecommunications Nanjing Jiangsu Province China

The Delay/Disruption Tolerant network (DTN) is characterized with long delay, high bit-error rate, intermittent connectivity and frequent partitions. Due to this, network coding is introduced to improve its transmission performance significantly. Numerous DTN routing algorithms based on network coding have been developed. However, they are susceptible to various malicious attacks. In this paper, we propose a new kind of networking scheme suitable to the DTN, which can resist the eavesdropping attacks to a certain extant. Firstly, we establish a DTN network model based on the packet path optimization allocation algorithm and redefine the packet format to meet the algorithm requirements. Meanwhile, to resist the dropping attacks, the source node dynamically adds redundancy factors at the certain time. Then the pollution attacks and the data tampering attacks can almost be resisted by means of mutual authentication between intermediate nodes. This approach avoids the traditional anti-tampering attack algorithm over-reliant on the source node. The security analysis and simulation results show that our scheme can effectively resist the joint attacks and optimize the network performance.

关键词： Routing network coding Delays Mathematical model Encoding Equations Security

来源：评论

学校读者我要写书评

暂无评论

Lorentzian Hard Thresholding Pursuit for Compressed Sensing in the Presence of Impulsive Noise

Lorentzian Hard Thresholding Pursuit for Compressed Sensing ...

引用

2014 4th IEEE International Conference on Information Science and technology

作者： Ji Yun-yun Yang Zhen College of Communications and Information Engineering Nanjing University of Posts and Telecommunications Key Lab of “Broadband Wireless Communication and Sensor Network Technology” Ministry of Education Nanjing University of Posts and Telecommunications

The Lorentzian hard thresholding pursuit algorithm is proposed in this paper to achieve efficient reconstruction for compressed sensing in the presence of impulsive noise. In the Lorentzian hard thresholding pursuit algorithm, the minimum norm problem is solved with respect to a support which is obtained through the hard thresholding operator. The convergence and reconstruction performance of the Lorentzian hard thresholding pursuit algorithm is proved in theory in this paper. Experimental results show that the reconstruction performance of the Lorentizian hard thresholding pursuit algorithm is superior to the Lorentzian iterative hard thresholding algorithm which is also an effective algorithm for sparse reconstruction of compressed sensing in the impulsive noise environment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fast encoding method using CU depth for quality scalable HEVC

Fast encoding method using CU depth for quality scalable HEV...

引用

IEEE Workshop on Advanced Research and technology in Industry Applications (WARTIA)

作者： Qingyang Ge Dong Hu Education Ministry's Key Lab of Broadband Wireless Communication and Sensor Network Technology Jiangsu Province's Key Lab of Image Procession and Image Communications Nanjing University of Posts and Telecommunications Nanjing CN

In this paper, a new fast encoding scheme using CU depth information for quality scalable HEVC was proposed. The proposed scheme based on the correlation between the base layer and enhancement layer, as well as the correlation between current frame and reference frame, which obtained by experiment. The main idea of the algorithm is that when each LCU is encoded in enhancement layer, it's corresponding encoded LCU's best coding depth in base layer is used as the new maximum encoding depth in enhancement layer, thereby, it can reduce the unnecessary CU division process then reduce the computational complexity. On the other hand, for base layer, when each LCU encoding in current frame, the corresponding LCU's depth in already coded reference frame is utilized to skip parts process of mode selection before reach this reference depth, so that the computational complexity can be reduced again. Experimental results show that compared with the original SHM5.1, our proposed method saves about 59.45% and 67.71% encoding time in whole encoding layers and enhancement layer respectively, with a negligible decrease in PSNR of 0.014 dB and bitrate increase of 0.46% in EL, as well as PSNR of 0.05 dB and bitrate increase of 1.15% in BL averagely.

关键词： Encoding Scalability Computational complexity Correlation PSNR Bit rate

来源：评论

学校读者我要写书评

暂无评论

A new inter prediction mode decision method based on temporal correlation for HEVC encoder

A new inter prediction mode decision method based on tempora...

引用

IEEE Workshop on Advanced Research and technology in Industry Applications (WARTIA)

作者： Qiuping Xu Dong Hu Education Ministry's Key Lab of Broadband Wireless Communication and Sensor Network Technology Jiangsu Province's Key Lab of Image Procession and Image Communications Nanjing University of Posts and Telecommunications Nanjing CN

To alleviate the encoder computation load in inter-frame coding of the High Efficiency Video Coding (HEVC), a new fast inter-frame prediction mode decision method is proposed by reducing the number of execution of the advanced motion vector prediction (AMVP) mode. Based on the correlation analysis between the corresponding located CU (Coding Unit) in the previous frame and the current CU, we first select the best one inter prediction mode by just performing merge mode decision process and then only perform the AMVP process on the selected one. Experimental results show that the proposed scheme provides 33.04% encoder time savings in Random Access (RA) configuration and 38.05% time savings in Low Delay (LD) configuration on average, and its increment in bit rate is 0.87% in RA and 1.29% in LD compared to the default encoding scheme in HM10.0.

关键词： Encoding Correlation Video coding Vectors Bit rate Algorithm design and analysis Copper

来源：评论

学校读者我要写书评

暂无评论

A low communication cost and delay guaranteed multicast approach for next generation vehicular ad hoc networks

A low communication cost and delay guaranteed multicast appr...

引用

IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW)

作者： Chengchao Ji Zhengkun Mi Wennai Wang Shenghui Zhao School of Computer and Information Chuzhou University Chuzhou China Key Lab of Broadband Wireless Communication and Sensor Network Technology (Ministry of Education) Nanjing University of Posts and Telecommunications Nanjing China

Vehicle Ad hoc networks (VANETs) is an emerging wireless network technology whereby information is generally shared among vehicles through multi-hopping In literature, a number of routing approaches has been proposed for reducing the end-to-end delay. However, the routing approaches applied to support multicast service will be inefficient since none of them considered the share path in VANETs. This paper considers the delay-bound guaranteed multicast service where a vehicle aims to send a message to a group of vehicles using minimal bandwidth within a guaranteed delay bound. The source and multicast destinations are location-aware and trip-aware. Therefore the multicast approach developed for VANETs is totally different to the one in ad hoc networks. The proposed approach forwards the multicast message to the vehicles in the multicast group along the road segment with the least time cost, reserving as much as possible the remaining time for carry-and-forward transmissions which helps reduce the bandwidth consumption for packet transmissions.

关键词： Vehicles Routing Delays Roads Integrated circuits Vehicular ad hoc networks Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Quantum bacterial foraging optimization algorithm

Quantum bacterial foraging optimization algorithm

引用

Congress on Evolutionary Computation

作者： Fei Li Yuting Zhang Jiulong Wu Haibo Li Key Lab of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education Nanjing University of Posts and Telecommunications Nanjing China Department of Applied Physics and Electronics Umea University Umea Sweden

ISBN: (纸本)9781479914869

This paper proposes a novel swarm intelligence optimization method which integrates bacterial foraging optimization (BFO) with quantum computing, called quantum bacterial foraging optimization (QBFO) algorithm. In QBFO, a multi-qubit which can represent a linear superposition of states in search space probabilistically is used to represent a bacterium, so that the quantum bacteria representation has a better characteristic of population diversity. A quantum rotation gate is designed to simulate the chemotactic step to drive the bacteria toward better solutions. Several tests are conducted based on benchmark functions including multi-peak function to evaluate optimization performance of the proposed algorithm. The numeric results show that the proposed QBFO has more powerful properties in convergence rate, stability and the ability of searching for the global optimal solution than the original BFO and quantum genetic algorithm. In addition, we applied our proposed QBFO to solve the traveling salesman problem, which is a well-known NP-hard problem in combinatorial optimization. The results indicate that the proposed QBFO shows better convergence behavior without premature convergence, and has more powerful properties in convergence rate, stability and the ability of searching for the global optimal solution, as compared to ant colony optimization algorithm and quantum genetic algorithm.

关键词： Microorganisms Quantum computing Optimization Convergence Benchmark testing Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

A Model-Matching Algorithm Based on Improved BP over Out-of-order Streams

A Model-Matching Algorithm Based on Improved BP over Out-of-...

引用

IEEE International Conference on communications

作者： Kun Wang Linchao Zhuo Lei Shu Yanfei Sun Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Nanjing China Guangdong Provincial Key Lab. of Petrochemical Equipment Fault Diagnosis Guangdong University of Petrochemical Technology Guangdong China

Due to the explosive increment of data in big data era, it is a challenging task to analyze and extract meaningful data for users. Data needs to be timely operated because of the time sensitivity, so it faces enormous pressure in storage and computing. To deal with the problem that it is hard to achieve valuable information from out-of-order streams over big data in short time, a model-matching algorithm based on improved BP (Back Propagation) is proposed. In the algorithm, the matching model is set dynamically. Information is extracted for users according to the order of data's arriving time. Furthermore, the algorithm parameters are automatically adjusted in the process of learning and matching. Accordingly, the responding speed of learning is accelerated and the time of matching reduces. In the simulation, a group of optimum parameters of improved BP are achieved by using self-adapting adjusting mechanism. The threshold (TH), connecting weight (CW) and learning rate (LR) are equal to 1.5, 3 and 1, respectively. We implement our model-matching algorithm on 10000 sets of out-of-order streams with these parameters. Results indicate that the proposed algorithm can obviously improve the accuracy and speed of matching and achieve better stability.

关键词： Heuristic algorithms Mathematical model Out of order Convergence Accuracy Data models Software algorithms

来源：评论

学校读者我要写书评

暂无评论

The research on joint distributed source coding and network coding for wireless multicast network

引用

Journal of Computational Information Systems 2013年第3期9卷 1147-1156页

作者： Liu, Ying Yang, Zhen Mei, Zhonghui Kong, Yuanyuan Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing 210003 China

This paper considers the problem of transmitting correlated information from multiple sources to multiple receivers, where every receiver seeks to recover all of the original sources. In order to improve the efficiency of network transmission, we combine interflow network coding and distributed source coding using syndromes (DISCUS). Furthermore, for wireless multicast multi-hop network, we propose an adaptive transmission algorithm with target of minimum energy consumption based on the above practical joint scheme. The simulation results verify the validation of theoretical results in the paper. Copyright © 2013 Binary Information Press.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

The method of gaze tracking based on iris detection

引用

International Journal of Information and communication technology 2013年第3-4期5卷 234-242页

作者： Zhang, Deng-Yin Wang, Zhou-Yang Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Nanjing 210003 China

This paper presents a new method of gaze tracking based on iris detection for images of human eyes captured by ordinary PC camera. In the basis of traditional iris detection, this paper improves the circle detection based on Hough transform by self-adopted angle step and in order to overcome the impact of light spot and noise, and presents the algorithm of interference-points elimination. The position user focus on screen is detected by comparing to the conference position after accurately calculating the centre pixel of pupil iris area. The proposed method is significant to the optimisation of network services and applications by apperceiving user experience (UE) through analysis sight movement sample of network user. Experimental results demonstrate the feasibility, the correct rate is 92%, 86% in 6×4, 8×6 screen block dividing respectively under normal circumstances. © 2013 Inderscience Enterprises Ltd.

关键词： Eye tracking

来源：评论

学校读者我要写书评

暂无评论

Domain-epidemic spray and forward routing algorithm of opportunistic networks

引用

International Journal of Information and communication technology 2013年第3-4期5卷 332-342页

作者： Zhang, Deng-Yin Cui, Lei Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Nanjing 210003 China

For the current opportunistic networks routing algorithms, their message arrival rate is not high and the delivery delay is large. This paper proposes a domain-epidemic spray and forward routing algorithm. The algorithm integrates redundancy and encounter prediction strategy. According to the probability of encounters between nodes, the nodes are divided into different domains. The spray and forward strategy is used between domains and the epidemic strategy is used to forward messages within a domain. Using the message confirmation mechanism and a list which is used to record the messages that have arrived to their destination, the new algorithm can effectively reduce redundant messages. Simulation results show our algorithm can effectively improve message arrival rate and reduce end-to-end delay to some extent. © 2013 Inderscience Enterprises Ltd.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：