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

International Conference on BioMedical Engineering and Informatics (BMEI)

作者： Wei Sun Xiaoying Song Fasheng Wang Software Center Northeastern University Shenyang China Liaoning Key Lab of Network Security and Computing Technology Dalian Neusoft University Information Dalian China

Clustering protocol for data gathering is one of the effective ways to solve the energy hole problem in wireless sensor networks. However, most of the existing clustering protocols focus on the network model with uniform node distribution. They cannot effectively apply to the real network where the sensor nodes are randomly non-uniformly deployed. In this paper, we propose an energy-balanced clustering routing protocol (EBCRP) based on task separation. In this scheme, the network is firstly divided into clusters by using global information. And each of them has the same number of sensor nodes in order to balance the energy consumption of intra-cluster. In succession, task separation, the tasks of traditional single cluster head are separated and achieved by two cluster heads respectively, is proposed to reduce the traffic burden for single cluster head. Then, we explore an energy-efficient and reliable inter-cluster routing algorithm, which considers comprehensively three factors: residual energy, distance and available buffer space of nodes. Simulation results and performance evaluation of EBCRP show significant improvement in network lifetime and energy balance.

关键词： Energy consumption Protocols Head Clustering algorithms Routing Algorithm design and analysis Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Duplication based energy aware scheduling algorithm in heterogeneous many-core system-on-chip

引用

Journal of Computational Information Systems 2015年第8期11卷 2981-2988页

作者： Liu, Yan An, Mengmeng Chen, Xiaoming Key Laboratory for Embedded and Network Computing of Hunan Province Hunan University Changsha China College of Computer National University of Defense Technology Changsha China

With the rapid development of semiconductor technology, hundreds of processor cores can be integrated into a single chip, known as "many-core system-on-chip". For the problem that performance and power consumption are equally important in heterogeneous many-core system-on-chip, this paper proposes an duplication based energy aware task scheduling algorithm, which balances the relationship between task scheduling time and energy consumption. Simulation experimental results show that the proposed algorithm can reduce the completion time and energy consumption, and leverage the relationship between them effectively. ©, 2015, Binary Information Press. All right reserved.

关键词： System-on-chip

来源：评论

学校读者我要写书评

暂无评论

Practical synchronization on complex dynamical networks via optimal pinning control

引用

Physical Review E 2015年第1期92卷 010903(R)-010903(R)页

作者： Kezan Li Weigang Sun Michael Small Xinchu Fu School of Mathematics and Computing Science Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology Guilin 541004 People's Republic of China Institute of Applied Mathematics and Engineering Computations Hangzhou Dianzi University Hangzhou 310018 People's Republic of China School of Mathematics and Statistics The University of Western Australia Crawley Western Australia 6009 Australia Department of Mathematics Shanghai University Shanghai 200444 People's Republic of China

We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.

关键词： OPTIMAL control theory SYNCHRONIZATION TOPOLOGY FEEDBACK control systems PONTRYAGIN'S minimum principle

来源：评论

学校读者我要写书评

暂无评论

The 5th International Conference on Biomedical Engineering and Biotechnology (ICBEB 2016) Abstracts

引用

BMC MEDICAL IMAGING 2016年第SUPPL 1期16卷 65-65页

作者： [Anonymous] Department of MRI Shandong Medical Imaging Research Institute Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China Department of Interventional Radiology Shandong Provincial Hospital Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China College of Information Science and Technology Engr. Research Center of Digitized Textile & Fashion Tech. for Ministry of Education Donghua University Shanghai 201620 China Intelligent multimedia information processing Lab College of Software Northeastern University Shenyang Liaoning Province 110004 China Institute of Biomedical and Health Engineering Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen 518055 China School of Computer Science and Technology Nanjing Normal University Nanjing China Department of Electrical Engineering The City College of New York CUNY New York USA Jiangsu Key Laboratory of 3D Printing Equipment and Manufacturing Nanjing China School of Electronic Science and Engineering Nanjing University Nanjing Jiangsu 210046 China College of Engineering Nanyang Technological University Singapore 639798 Singapore School of Electronic Information Shanghai Dianji University Shanghai China School of Natural Sciences and Mathematics Shepherd University Shepherdstown WV 25443 USA Davis College of Agriculture Natural Resources and Design West Virginia University Morgantown WV 26505 USA State Key Laboratory of Millimeter Waves Southeast University Nanjing 210096 China Center of Medical Physics and Technology Hefei Institutes of Physical Science Chinese Academy of Sciences Hefei China College of Agricultural and Life Sciences University of Florida Gainesville FL 32611 USA Courant Institute of Mathematical Sciences New York University New York NY 10012 USA Translational Imaging Division & MRI Unit Columbia University and New York State Psychiatric Institute New York NY 10032 USA Guangxi Key Laboratory of Manufacturing System & Adv

来源：评论

学校读者我要写书评

暂无评论

Noisy image super-resolution reconstruction based on sparse representation

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2015年第4期52卷 943-951页

作者： Dou, Nuo Zhao, Ruizhen Cen, Yigang Hu, Shaohai Zhang, Yongdong Institute of Information Science Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Advanced Information Science and Network Technology Institute of Information Science Beijing Jiaotong University Beijing100044 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

Denoising and super-resolution reconstruction are performed separately in traditional methods for noisy image super-resolution reconstruction, while in the noisy image super-resolution reconstruction method based on sparse representation and dictionary learning the two processes are compounded together. Since an image patch can be well represented as a sparse linear combination of elements from an appropriately chosen over-complete dictionary, two dictionaries are trained respectively from noisy low-and clean high-resolution image patches by enforcing the similarity of two sparse representations with respect to their own dictionary. Given a noisy low-resolution image, sparse representations of low-resolution patches via trained low-dictionary are computed, then the high-resolution image can be reconstructed from high-resolution patches with the help of the related low-resolution sparse representations and trained high-dictionary, after global optimization a clean high-resolution is obtained to accomplish the goal of image super-resolution and denosing simultaneously. The experiments show that zooming low-resolution image to a middle-resolution using locally adaptive zooming algorithm for extracting features can get a better reconstructed image than bicubic interpolation algorithm. By setting the parameter λ, we can obtain the best performance both in super-resolution and denoising with absolute advantages in image quality and visual effect, which demonstrates the validity and robustness of our algorithm. ©, 2015, Science Press. All right reserved.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

A new logistic map based chaotic biogeography-based optimization approach for cluster analysis

A new logistic map based chaotic biogeography-based optimiza...

引用

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

作者： Shui-Hua Wang Hui-Min Lu Yu-Jie Li Yang Wang Zhi-Min Chen Yu-Min Wei Wen-Juan Jia Fang-Yuan Liu Yu-Dong Zhang Hunan Provincial Key Laboratory of Network Investigational Technology Hunan Policy Academy Changsha Hunan China School of Computer Science and Technology Nanjing Normal University Nanjing Jiangsu China Department of Electrical Engineering CUNY New York NY USA Department of Mechanical and Control Engineering Kyushu Institute of Technology Fukuoka Prefecture Japan School of Information Engineering Yangzhou University Yangzhou Jiangsu China School of Physics and Electronic Engineering Taizhou University Taizhou Zhejiang China School of Electronic Information Shanghai Dianji University Shanghai China School of Energy and Mechanical Engineering Nanjing Normal University Nanjing Jiangsu China Key Laboratory of Intelligent Computing and Information Processing in Fujian Provincial University Quanzhou Normal University Quanzhou Fujian China

ISBN: (纸本)9781509034857

Cluster analysis is important in scientific and industrial fields. In this study, we proposed a novel chaotic biogeography-based optimization (CBBO) method, and applied it in centroid-based clustering methods. The results over three types of simulation data showed that this proposed CBBO method gave better performance than chaotic particle swarm optimization, genetic algorithm, firefly algorithm, and quantum-behaved particle swarm optimization. In all, our CBBO method is effective in centroid-based clustering.

关键词： Genetic algorithms Optimization Clustering algorithms Particle swarm optimization Algorithm design and analysis Logistics Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Activity Fuzzer: Detecting the security Vulnerabilities of Android Activity Components

Activity Fuzzer: Detecting the Security Vulnerabilities of A...

引用

2nd International Conference on Simulation and Modeling Methodologies,Technologies and Applications(SMTA 2015)

作者： Yongke Wang Jianwei Zhuge Donghong Sun Wu Liu Fenghua Li State Key Laboratory of Information Security Institute of Information Engineering CAS Tsinghua National Laboratory for Information Science and Technology Institute for Network Science and Cyberspace Tsinghua University

In order to detect security problems in android activity components, we designed one detection method based on fuzzing and dynamic hooking technology, and developed our detection tool called Activity Fuzzer. Activity Fuzzer constructs Intent objects by parsing android APK file, then sends them to activity components. At the same time, Activity Fuzzer monitors the android system logs to find if security vulnerabilities occur, such as permission leaks and runtime crashes. Besides, we designed a feedback mechanism to reduce false negatives. We use Activity Fuzzer to detect 100 android applications, and find 60% applications existing security problems. During the experiment, we find mobile QQ leaks ACCESSETWORKTATE permission, causing that other applications can access the OAuth service without any permission. And we find a serious Do S vulnerability of wechat.

关键词： Activity Fuzzer Intent Detecting the security Vulnerabilities of Android Activity Components security

来源：评论

学校读者我要写书评

暂无评论

An Improved Precoding of Approximative Matrix Inverse Computations Based on Norm Minimization Algorithm in Massive MIMO System

An Improved Precoding of Approximative Matrix Inverse Comput...

引用

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

作者： Hongliu Tu Yanjun Hu Yaohua Xu Fengrong Li Key laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Key Laboratory of Wireless Sensor Network & Communication Shanghai Institute of Microsystem and Information TechnologyChinese Academy of Sciences

In massive multiple-input multiple-output（MIMO） system, scaling up the antennas of base station（BS） has a clear benefit on sum rate and energy efficiency, but the signal processing complexity can be very high and many algorithms cannot be implemented in practice for high hardware cost. Approximati ve Matrix Inverse Computations（AMIC） algorithm is a kind of lowcomplexity precoding for large multiuser MIMO systems, but the Bite Error Rate（BER） performance is shown to be not better than the classical MMSE precoding. To improve the BER performance of AMIC algorithm, in this paper, we use norm minimization algorithm to change the coefficient of the precoding matrix to improve the BER performance of AMIC algorithm. It can verify that the proposed algorithm can achieve better BER performance than the AMIC algorithm by using only a limited number of Neumann series iterations, and keep lower complexity. The proposed scheme is a compromise solution between complexity and BER performance.

关键词： Massive MIMO linear precoding algorithm approximative matrix inverse norm minimization

来源：评论

学校读者我要写书评

暂无评论

Dynamic negotiation strategy based parallel-offer in cloud computing

引用

Journal of Computational Information Systems 2015年第10期11卷 3691-3699页

作者： Hu, Jun Xu, Ru Xiao, Deyu College of Computer Science and Electronics Engineering Hunan University Changsha China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Key Laboratory for Embedded and Network Computing of Hunan Province Changsha China

Cloud computing can dynamically provide service based on service level agreements that between cloud services and consumers. Establish a viable and efficient dynamic negotiation strategy is one of hot research in cloud negotiation. This paper proposes a dynamic negotiation strategy based on parallel-offer under cloud computing environment, which combines dynamic concession strategy with parallel-offer tradeoff mechanism. The strategy can adjust negotiation strategy according to the supply demand relationship and tradeoff strategy of multi-issue, to achieve flexible and efficient cloud computing negotiation. This work firstly, establishes predicting market supply-demand relationship model, to build the dynamic concession strategy. Then on the base of above, introduces a parallel offer multi-issue tradeoff strategy into negotiation strategy, to achieve the dynamic concession tradeoff strategy (DCT). Finally, DCT mechanism is implemented in CloudSim test bed, and empirical results show DCT negotiation mechanism reach faster agreements and achieve higher utilities than other related approaches in cloud computing environment. ©, 2015, Binary Information Press. All right reserved.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Localization Extension of COSMIC-FFP Method on Complex Algorithms

Localization Extension of COSMIC-FFP Method on Complex Algor...

引用

2015 6th IEEE International Conference on Software Engineering and Service Science(ICSESS 2015)

作者： Yuan Zeng Haidong Yang Haiyong Chen State Key Laboratory of Mathematical Engineering and Advanced Computing Department of Cyber Space SecurityInformation Engineering University Southwest Research Institute of Electronic and Telecommunication Technology

Functional size measurement is an important feature property of software metrics. As the core of software, algorithms are difficult to estimate due to different technologic methods and processing flows. This paper establishes the localization extension measurement principles on COS MIC-FFP FPA for complex algorithms and proposes function recognition principles, data group recognition principles and measurement steps. The paper also analyses the influence of complex data on software metrics. Measurement results of algorithms written by different languages in signal processing, characteristic pick-up and location tracking has indicated that the localization extension method excels standard method.

关键词： Software Metrics Software Functional Size COSMIC-FFP Algorithms Size Function Point Analysis Functional Process

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：