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

Phase Retrieval based on Cosine Grating Modulation and Transport of Intensity Equation

Phase Retrieval based on Cosine Grating Modulation and Trans...

International Symposium on Optoelectronic Technology and Application 2016(OTA 2016)——Conf.5 Optical Measurement Technology and Instrument

作者： Ya-ping CHEN Quan-bing ZHANG Hong CHENG Shan-feng HU Qian-qian LV Key Laboratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui University

In order to calculate the lost phase from the intensity information effectively,a new method of phase retrieval which based on cosine grating modulation and transport of intensity equation is proposed

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cross-Layer Power Allocation Scheme for Wireless Full Duplex Relaying System

Cross-Layer Power Allocation Scheme for Wireless Full Duplex...

引用

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

作者： Mengmeng He Yanjun Hu Hui Zhi Quan Yuan Key Lab of Intelligent Computing and Signal Processing Ministry of Education School of Electronics and Information Engineering Anhui University

In this paper,we propose a cross-layer power allocation scheme over wireless relay networks for quality-of-service(Qo S)*** formulate our original throughput maximization problem into effective capacity maximization problem by applying information theory and the concept of the effective *** our scheme,we focus on full duplex mode and amplify-and-forward(AF)*** particular,our proposed scheme derives closed-form expressions and analyzes the impacts of the SNR of the interference channel on the performance of full duplex relaying *** comparison purpose,we also give the analysis of half duplex relaying *** results show that our proposed power allocation scheme can support diverse Qo S guarantees and achieve better effective capacity than equal power allocation scheme and direct transmission *** analysis also indicate that the perfect full duplex mode can achieve twice optimal effective capacity of the half duplex mode.

关键词： power allocation scheme effective capacity full duplex quality-of-service(Qo S) amplify-and-forward(AF)

来源：评论

学校读者我要写书评

暂无评论

Cross-Layer Power Allocation Scheme for Two-Way Amplify-and-Forward Relaying System

Cross-Layer Power Allocation Scheme for Two-Way Amplify-and-...

引用

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

作者： Quan Yuan Yanjun Hu Hui Zhi Mengmeng He Key Lab of Intelligent Computing and Signal Processing Ministry of Education School of Electronics and Information Engineering Anhui University

Two-way relaying can considerably improve spectral efficiency in relay-assisted bidirectional ***,most existing works focus on physical layer to exploit its resource *** benefits and flexible structures of two-way relaying on datalink layer are much less *** in this paper,the cross-layer optimization for amplify-and-forward(AF)two-way relaying system is studied and an optimal power allocation scheme is *** goal is to find the optimal power allocation factors to maximize the weighted sum effective capacity of two sources in the physical layer while guaranteeing the statistical delay quality-of-service(QoS)requirement for each source in the datalink *** statistical delay Qo S requirement is characterized by the QoS exponentq,which is the only requested information exchanged between the physical layer and the datalink layer in our cross-layer design based *** integrating the concept of effective capacity,the cross-layer optimization problem is equivalent to a weighted sum effective capacity maximization *** problem is formulated into a convex optimization problem,and an algorithm is presented to solve this *** results show that proposed optimal power allocation scheme can achieve better weighted sum effective capacity than equal power allocation scheme and direct transmission scheme,and the relay transmission combined with direct links can get the max weighted sum effective capacity.

关键词： two-way relaying quality-of-service(Qo S) cross-layer optimization power allocation effective capacity

来源：评论

学校读者我要写书评

暂无评论

An Optimization Algorithm for Service Composition Based on an Improved FOA

引用

Tsinghua Science and Technology 2015年第1期20卷 90-99页

作者： Yiwen Zhang Guangming Cui Yan Wang Xing Guo Shu Zhao the School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University

Large-scale service composition has become an important research topic in Service-Oriented computing（SOC）. Quality of Service（Qo S） has been mostly applied to represent nonfunctional properties of web services and to differentiate those with the same functionality. Many studies for measuring service composition in terms of Qo S have been completed. Among current popular optimization methods for service composition, the exhaustion method has some disadvantages such as requiring a large number of calculations and poor scalability. Similarly,the traditional evolutionary computation method has defects such as exhibiting slow convergence speed and falling easily into the local optimum. In order to solve these problems, an improved optimization algorithm, WS FOA（Web Service composition based on Fruit Fly Optimization Algorithm） for service composition, was proposed, on the basis of the modeling of service composition and the FOA. Simulated experiments demonstrated that the algorithm is effective, feasible, stable, and possesses good global searching ability.

关键词： service composition Fruit Fly Optimization Algorithm（FOA） Quality of Service（QoS） index

来源：评论

学校读者我要写书评

暂无评论

MR-IDPSO: A Novel Algorithm for Large-Scale Dynamic Service Composition

引用

Tsinghua Science and Technology 2015年第6期20卷 602-612页

作者： Yanping Zhang Zihui Jing Yiwen Zhang School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal ProcessingMinistry of EducationAnhui University

In the era of big data, data intensive applications have posed new challenges to the field of service composition. How to select the optimal composited service from thousands of functionally equivalent services but different Quality of Service(Qo S) attributes has become a hot research in service computing. As a consequence,in this paper, we propose a novel algorithm MR-IDPSO(Map Reduce based on Improved Discrete Particle Swarm Optimization), which makes use of the improved discrete Particle Swarm Optimization(PSO) with the Map Reduce to solve large-scale dynamic service composition. Experiments show that our algorithm outperforms the parallel genetic algorithm in terms of solution quality and is efficient for large-scale dynamic service composition. In addition,the experimental results also demonstrate that the performance of MR-IDPSO becomes more better with increasing number of candidate services.

关键词： Map Reduce service composition Quality of Service(

来源：评论

学校读者我要写书评

暂无评论

A routing scheme based on Spray-and-Wait and Connecting-Capability of Node

A routing scheme based on Spray-and-Wait and Connecting-Capa...

引用

IEEE International Conference on Progress in Informatics and computing (PIC)

作者： Guizhu Wang Hui Zhang Dong Pan Jian Tao Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

ISBN: (纸本)9781509034857

DTNs overcome the problems associated with intermittent connectivity, long or variable delay, asymmetric data rates, and high error rates by using store-carry-forward message switching. In DTNs, a node is an entity with a bundle layer. A node may be a host, router, or gateway (or some combination) acting as a source, destination, or forwarder of bundles. In addition, the performance of node shows great differences. However, the previous DTN routings show blindly and randomly, which do not measure the performance of node when they forward messages. To deal with this issue, we present the concept of Node Connection Intensity (NCI) and Node Connection Stability (NCS), then propose a routing scheme based on Spray-and-Wait and Connecting-Capability of Node (SW-CCN), which evaluate relay node's forward capability synthetically according to the NCI and the NCS. The SW-CCN routing can allocate message replications dynamically and solve the problem of selecting the relay node blindly. Compared with the classical routing protocols, the simulation results show that the proposed algorithm can significantly enhance delivery rate and improve network performance.

关键词： Routing Relays Nickel Delays Stability analysis Heuristic algorithms Spraying

来源：评论

学校读者我要写书评

暂无评论

An artificial anisotropy WCS-FDTD method

An artificial anisotropy WCS-FDTD method

引用

International Symposium on Antennas, Propagation and EM Theory (ISAPE)

作者： Kaikun Niu Bo Wu Zhixiang Huang Xianliang Wu Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China

ISBN: (纸本)9781509047444

In this letter, we present a three-dimensional (3-D) artificial anisotropy weakly conditional stability finite-difference time-domain (WCS-FDTD) method to achieve better dispersion performance. This artificial anisotropy WCS-FDTD algorithm can minimize the dispersion error for arbitrary incident angles and different time-step sizes. Stability analysis presents that this algorithm is weakly conditionally stable if proper artificial anisotropy parameter values are chosen. Dispersion analysis illustrates the error of the numerical phase velocity can be controlled.

关键词： Dispersion Finite difference methods Anisotropic magnetoresistance Numerical stability Stability analysis Time-domain analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Pessimistic multi-granulation rough set in incomplete information system

引用

Revista Tecnica de la Facultad de Ingenieria Universidad del Zulia 2016年第2期39卷 203-208页

作者： Yao, Sheng Zhao, Peng Jin, Haijun Chu, Xiaofang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui230039 China School of Computer Science and Technology Hefei Anhui246011 China Quality and Technical Supervision and Inspection Center of QuZhou QuZhou Zhejiang324000 China Hefei Municipal Public Security Bureau Hefei Anhui230011 China

According to granular computing, Pawlak s rough set theory is based on a single granulation; however, multi-granulation rough set theory is applied to describe an uncertain concept by multiple binary relations. In this paper, the multi-granulation rough set approach with maximal consistent block technique has been introduced into the incomplete information system. Based on this maximal consistent block technique, a new pessimistic multi-granulation rough set in the incomplete information system is proposed. The lower and upper approximations of an uncertain set are defined based on this new model, and some properties are proposed for this new model.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Construction of One-Gray Weight Codes and Two-Gray Weight Codes over Z4+uZ4

引用

Journal of Systems Science & Complexity 2016年第5期29卷 1472-1484页

作者： SHI Minjia WANG Dandan GAO Jian WU Bo Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei 230039 China National Mobile Communications Research Laboratory Southeast University Nanjing 210096China School of Mathematical Sciences Anhui University Hefei 230601 China. School of Science Shandong University of Technology Zibo 255091 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Bcijing 100093 China

This paper firstly gives some necessary conditions on one-Gray weight linear codes. And then we use these results to construct several classes of one-Gray weight linear codes over Z_4 +uZ_4(u^2=u) with type 16^(k_1)8^(k_2)8^(k_3)4^(k_4)4^(k_5)4^(k_6)2^(k_7)2^(k_8) based on a distance-preserving Gray map from(Z4 + u Z4)n to Z2n4. Secondly, the authors use the similar approach to do works on two-Gray(projective) weight linear codes. Finally, some examples are given to illustrate the construction methods.

关键词： Generator matrix Gray map linear code one-Gray weight code two-Gray weight code

来源：评论

学校读者我要写书评

暂无评论

Application of community detection algorithm with link clustering in inhibition of social network worms

引用

International Journal of Network Security 2017年第3期19卷 458-468页

作者： Wang, Yibing Fang, Jie Wu, Fuhu Center of Computer Teaching Anhui University No.111 Jiulong Road Hefei Anhui236061 China School of Electronics and Information Engineering Chinese Academy of Sciences No.350 Shushanhu Road Hefei Anhui230031 China Key Laboratory of Intelligent Computing Signal Processing of Ministry of Education Anhui University No.3 Feixi Road Hefei Anhui230039 China

The community detection was performed from the perspective of links, and we proposed an inhibition method against social network worms. Firstly, a community detection algorithm was proposed, which based on link clustering, and we got related link incremental information through the network structure information at various time points. In order to obtain the link communities, we adopted an improved link partition density function to dispose the link incremental information. Next, we gave three selection strategies of key nodes in community and proposed corresponding worm inhibition method. Finally, on the basis of real web data sets, we applied community detection and worm inhibition experiments to prove validity of algorithm in this paper.

关键词： signal detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：