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

2016 8th IEEE International Conference on Communication Software and Networks(ICCSN 2016)

作者： Fu Hongliang Li Chao Henan University of Technology Key Laboratory of Grain Information Processing and Controlling Henan University of Technology College of Information Science and Engineering

In order to solve the problem of feedback link overhead in MIMO-OFDM system, and improve the transmission efficiency, a limited feedback method based on KL domain is proposed in this paper. In this method, the state information which is obtained from the channel estimation performed in KL domain sparse at the receiving end. Thereby a small amount of linear measurements are obtained which represents the total channel state information, Then these measurements are fed back to the transmitting end. In the transmitter, the channel state information is reconstructed through orthogonal matching pursuit algorithm. The simulation results show that the proposed limited feedback based on KL(Karhuner-Loeve) domain method can achieve full channel state feedback effect and decreases the overhead in the feedback link.

关键词： MIMO-OFDM limited feedback in KL domain channel state information feedback orthogonal matching pursuit

来源：评论

学校读者我要写书评

暂无评论

controllability of giant connected components in a directed network

引用

Physical Review E 2017年第4期95卷 042318-042318页

作者： Xueming Liu Linqiang Pan H. Eugene Stanley Jianxi Gao Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology Wuhan 430074 Hubei China Center for Polymer Studies and Department of Physics Boston University Boston Massachusetts 02215 USA School of Electric and Information Engineering Zhengzhou University of Light Industry Zhengzhou 450002 Henan China Center for Complex Network Research and Department of Physics Northeastern University Boston Massachusetts 02115 USA

When controlling a complex networked system it is not feasible to control the full network because many networks, including biological, technological, and social systems, are massive in size and complexity. But neither is it necessary to control the full network. In complex networks, the giant connected components provide the essential information about the entire system. How to control these giant connected components of a network remains an open question. We derive the mathematical expression of the degree distributions for four types of giant connected components and develop an analytic tool for studying the controllability of these giant connected components. We find that for both Erdős-Rényi (ER) networks and scale-free (SF) networks with p fraction of remaining nodes, the minimum driver node density to control the giant component first increases and then decreases as p increases from zero to one, showing a peak at a critical point p=pm. We find that, for ER networks, the peak value of the driver node density remains the same regardless of its average degree 〈k〉 and that it is determined by pm〈k〉. In addition, we find that for SF networks the minimum driver node densities needed to control the giant components of networks decrease as the degree distribution exponents increase. Comparing the controllability of the giant components of ER networks and SF networks, we find that when the fraction of remaining nodes p is low, the giant in-connected, out-connected, and strong-connected components in ER networks have lower controllability than those in SF networks.

关键词： Network structure

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional picture arrays and Parikh q—matrices

引用

Journal of Physics: Conference Series 2018年第1期1132卷

作者： Somnath Bera Kalpana Mahalingam Linqiang Pan K. G. Subramanian Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology Wuhan 430074 Hubei China Department of Mathematics Indian Institute of Technology Madras Chennai 600036 India School of Electric and Information Engineering Zhengzhou University of Light Industry Zhengzhou 450002 Henan China Department of Mathematics Madras Christian college Tambaram Chennai 600017 India

Based on the idea of 'q—count' of certain subwords of a word and generalizing the notion of Parikh matrix of a word, the notion of Parikh q—matrix of a word over an ordered alphabet was introduced. On the other hand, with a two-dimensional picture array of symbols arranged in rows and columns, two kinds of upper triangular matrices, known as row and column Parikh matrices have also been introduced and investigated. Here combining these two kinds of matrices of a picture array, we introduce row/column Parikh q—matrix of an array, leading to the concept of q—ambiguity of a picture array. Results relating to q—ambiguity of picture arrays are derived in the context of these Parikh q—matrices of arrays.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Correction to: Synchronization of coupled neural networks with infinite-time distributed delays via quantized intermittent pinning control

引用

Nonlinear Dynamics 2018年第3期94卷 2305-2305页

作者： Yang, Xinsong Feng, Yuming Yiu, Ka Fai Cedric Song, Qiang Alsaadi, Fuad E. School of Mathematical Sciences Chongqing Normal University Chongqing China Key Laboratory of Intelligent Information Processing and Control of Chongqing Municipal Institutions of Higher Education Chongqing China Department of Applied Mathematics Hong Kong Polytechnic University Hong Kong China College of Electrical Engineering Henan University of Technology Zhengzhou China Faculty of Engineering King Abdulaziz University Jeddah Saudi Arabia

The third author’s name was incomplete and incorrect in the original publication.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Matrix flat splicing systems 11th

Matrix flat splicing systems

引用

11th International Conference on Bio-inspired Computing – Theories and Applications, BIC-TA 2016

作者： Ceterchi, Rodica Pan, Linqiang Song, Bosheng Subramanian, K.G. Faculty of Mathematics and Computer Science University of Bucharest 14 Academiei Street Bucharest010014 Romania School of Electric and Information Engineering Zhengzhou University of Light Industry ZhengzhouHenan450002 China Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology WuhanHubei430074 China Department of Mathematics Madras Christian College Chennai600059 India

ISBN: (纸本)9789811036101

In dealing with the problem of modelling DNA recombination, the operation of splicing on linear and circular strings of symbols was introduced. Inspired by splicing on circular strings, the operation of flat splicing on a pair of strings (u, v) was considered. This operation involves "cutting" u at a specified position and "inserting" v into it, with v having a pre-specified prefix as well as suffix defined by a flat splicing rule. In this work, we consider a well-known technique in formal language theory, known as "matrix of rules", and introduce matrix of flat splicing rules and thus define matrix flat splicing system (MFSS). Some results on the language generative power of MFSS are provided. An application of MFSS in the generation of chain code pictures is also pointed out. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

Page Dissemination Modeling and Optimization for Coding-Based Reprogramming Protocols in Wireless Sensor Networks

Page Dissemination Modeling and Optimization for Coding-Base...

引用

International Conference on Networking and Network Applications (NaNA)

作者： Lina Yang Shining Li Weidong Yang Gang Liu Jinhui Yuan School of Cryptographic Engineering Information Engineering University Zhengzhou China School of Computer Science and Technology Northwestern Polytechnical University Xi‘an China Key Laboratory of Grain Information Technology and Control Ministry of Education Zhengzhou China School of Information Science and Engineering Henan University of Technology Zhengzhou China

ISBN: (纸本)9781467398046

Coding-based reprogramming protocols are presented to realize efficient over-the-air reprogramming in wireless sensor networks with high packet loss rate. However, existing mathematical analysis models for these protocols have considerable deviation with real data. In this paper, we present a novel page dissemination time model to reduce the deviation. Our model comprehensively analyzes the details of the protocols, handling the impacts on page encoding, page decoding, page pipelining and negotiation mechanism. It can be used to aid protocol design for performance optimizations. For minimizing the time of page dissemination, we present a Firefly Algorithm with feasibility-based rules to search an optimal solution (i.e., the number of data packets per page). Results from the simulations of a representative coding-based reprogramming protocol as Rateless Deluge are in good accordance with the performance forecasted by our model, thus verifying the validity of our model. Moreover, our Firefly Algorithm can converge to the global optimal solution quickly and efficiently.

关键词： Protocols Wireless sensor networks Encoding Decoding Mathematical model Analytical models Pipeline processing

来源：评论

学校读者我要写书评

暂无评论

Analogical China map constructed by single-stranded DNA tiles assembly

引用

Journal of Computational and Theoretical Nanoscience 2016年第6期13卷 3865-3870页

作者： Wang, Yanfeng Ma, Xin Li, Mengmeng Pan, Linqiang Cui, Guangzhao Key Lab of Information-Based Electrical Appliances Zhengzhou University of Light Industry Zhengzhou450002 China Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan Hubei430074 China

In the past nearly two decades, DNA self-assembly technology as a promising technology, a body of laboratory work has been emerged in an endless stream. Single-stranded DNA tile (SST) assembly provides a simple, modular and robust framework for constructing nanostructures with prescribed shapes from short synthetic DNA strands. In this research, we present a nanoscale DNA structure of analogical China map which is constructed by a number of SSTs, and label streptavidin in the capital beijing location. The constructing nanostructure is roughly 98 nm×67 nm in diameter with a spatial resolution of 3 nm×7 nm. The pattern appeared in atomic force microscopy (AFM) conforms to the pre-designed shape of Chinese map with the approximately expected dimensions, and AFM images of the field selected randomly from the mica give an 11% assembly yield. Through this research, the capability of constructing complicated two-dimensional shapes by SST and the controllability of the internal array are fully vindicated. Copyright © 2016 American Scientific Publishers. All rights reserved.

关键词： Nanostructures

来源：评论

学校读者我要写书评

暂无评论

Urban traffic congestion prediction using floating car trajectory data 15th

Urban traffic congestion prediction using floating car traje...

引用

15th International Conference on Algorithms and Architectures for Parallel processing, ICA3PP 2015

作者： Yang, Qiuyuan Wang, Jinzhong Song, Ximeng Kong, Xiangjie Xu, Zhenzhen Zhang, Benshi School of Software Dalian University of Technology Dalian116620 China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China Key Laboratory of Control Engineering of Henan Province Henan Polytechnic University Jiaozuo454000 China

ISBN: (纸本)9783319271217

Traffic congestion prediction is an important precondition to promote urban sustainable development. Nevertheless, there is a lack of a unified prediction method to address the performance metrics, such as accuracy, instantaneity and stability, systematically. In the paper, we propose a novel approach to predict the urban traffic congestion efficiently with floating car trajectory data. Specially, an innovative traffic flow prediction method utilizing particle swarm optimization algorithm is responsible for calculating the traffic flow parameters. Then, a congestion state fuzzy division module is applied to convert the predicted flow parameters to citizens’ cognitive congestion states. We conduct extensive experiments with real floating car data and the experimental results show that our proposed method has advantage in terms of accuracy, instantaneity and stability. © Springer International Publishing Switzerland 2015.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

Picture array generation using flat splicing operation

引用

Journal of Computational and Theoretical Nanoscience 2016年第6期13卷 3568-3577页

作者： Pan, Linqiang Nagar, Atulya K. Subramanian, K.G. Song, Bosheng School of Electric and Information Engineering Zhengzhou University of Light Industry Zhengzhou Henan450002 China Department of Mathematics and Computer Science Faculty of Science Liverpool Hope University LiverpoolL16 9JD United Kingdom Key Laboratory of Image Information Processing and Intelligent Control School of Automation Huazhong University of Science and Technology Wuhan Hubei430074 China

The operation of splicing on words was introduced by Tom Head while proposing a theoretical model of DNA recombination. Subsequent investigations on splicing on linear and circular strings of symbols have resulted in a number of theoretical properties. A different kind of splicing on two words, referred to as flat splicing, has been considered recently. This operation is extended to flat splicing on picture arrays, thus defining a new model of generation of digitized pictures, which is called as array flat splicing system (AFS). Results on the generative power of AFS in comparison with certain well-known picture array defining models and certain non-closure results are obtained. Copyright © 2016 American Scientific Publishers. All rights reserved.

关键词： Nanoscience

来源：评论

学校读者我要写书评

暂无评论

UWB-GPR Clutter Suppression technology Based on Gradient Transform Algorithm

UWB-GPR Clutter Suppression Technology Based on Gradient Tra...

引用

2015 International Conference on control, Automation and Artificial Intelligence(CAAI 2015)

作者： Yao QIN De-mei YANG Li-hong QIAO College of Information Science and Engineering Henan University of Technology Key Laboratory of Grain Information Processing and Control Henan University of TechnologyMinistry of Education

Clutter is a serious problem existing in ultra wideband ground penetrating radar(UWB-GPR) *** heavily influences the target detection ability of radar *** scale of GPR reflected image is very different between target reflected position and non-target reflected position,so as the gradient value of GPR reflected *** on this theory,gradient transform method to suppress GPR clutter is used in this *** first,the variety of clutter are been discussed,then the principle of gradient transform is been *** dealing with GPR experiment image,it shows that the gradient transform method used in GPR clutter suppression technology is effectiveness and stability.

关键词： GPR Clutter suppression Gradient transform algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：