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

11th International Conference on Natural Computation, ICNC 2015

作者： Li, Xia Niu, Peifeng Li, Guoqiang Liu, Jianping Hui, Huihui Key Lab of Industrial Computer Control Engineering of Hebei Province Yanshan University Qinhuangdao066000 China College of Mathematics and Information Technology Hebei Normal University of Science and Technology Qinhuangdao066000 China

ISBN: (纸本)9781467376792

The Teaching-Learning-Based Optimization(TLBO) algorithm does not require special parameters setting for working the algorithm, but there are some shortcomings such as slow convergence speed and long running time. Therefore, some improvements have been done on the TLBO algorithm in the paper. Firstly, the population initialization of the TLBO algorithm is random, which does not ensure the uniform distribution of initial solutions in the solution space, and then it will affect the algorithm's efficiency to some extent. Therefore, the paper proposes opposing-based learning to initialize and renewal the population of the TLBO algorithm. Secondly, to efficiently speed up the convergence speed of the algorithm, a linear decreasing inertia weight (DIW) strategy and two nonlinear DIW strategies (a parabola opening upwards and a parabola opening downwards curve) are combined with the TLBO respectively. Finally, improved TLBO algorithms have been evaluated by 13 benchmark functions. The experimental results show that improved TLBO algorithms have much better optimization performances than the TLBO algorithm on most benchmark functions. © 2015 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Reach almost sure consensus with only group information

Reach almost sure consensus with only group information

引用

作者： Lin, Zhiyun Hou, Jian Yan, Gangfeng Yu, Changbin State Key Laboratory of Industrial Control Technology College of Electrical Engineering Zhejiang University 38 Zheda Road Hangzhou310027 China School of Electrical Engineering and Computer Science University of Newcastle CallaghanNSW2308 Australia Beijing Aerospace Automatic Control Institute Beijing100854 China National Key Laboratory of Science and Technology on Aerospace Intelligence Control Beijing100854 China Research School of Engineering Australian National University CanberraACT2600 Australia

This brief presents a new distributed scheme to solve the consensus problem for a group of agents if neither their absolute states nor inter-agent relative states are available. The new scheme considers a random partition of agents into two subgroups at each step and then uses the relative group representative state as feedback information for the consensus purpose. It is then shown that almost sure consensus can be achieved under the proposed scheme in both discrete time and continuous time. For the discrete time case, almost sure consensus is achieved if and only if the weighting parameter for state update is greater than one. For the continuous time case, almost sure consensus is realized when the weighting parameter is positive. Moreover, it is shown that if a uniform probability is considered for group selection, then the group of agents can reach average consensus in mean. © 2014 Elsevier. Ltd All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

General Multi-key Searchable Encryption

General Multi-key Searchable Encryption

引用

International Conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Jun Yang Chuan Fu Nan Shen Zheli Liu Chunfu Jia Jin Li College of Computer and Control Engineering Nankai University China School of Computer Science and Educational Software Guangzhou University China

ISBN: (纸本)9781479917761

We analysis outsourced server with multi-users and classify the data sharing into two main types. We focus on the data sharing between users in Searchable Encryption and the corresponding security goal. Then we present a general scheme for Searchable Encryption in which the cipher text can be generated from parameter by authorized users. With the concept of homomorphism and one-way function, we construct a general model to illustrate and fulfill the goals involved. We also promote such a model to a general Multi-Key Searchable Encryption which enables only a single submission for the retrievals in the documents encrypted by different keys. We also give two concrete examples to illustrate the feasibility and security in such a general model.

关键词： Encryption Servers Data models Access control Concrete

来源：评论

学校读者我要写书评

暂无评论

Verification analysis of self-verifying automata via semi-tensor product of matrices

引用

The Journal of China Universities of Posts and Telecommunications 2014年第4期21卷 96-104页

作者： YAN Yong-yi CHEN Zeng-qiang LIU Zhong-xin College of Computer and Control Engineering Nankai University College of Science Civil Aviation University of China

The semi-tensor product （STP） of matrices was used in the article, as a new matrix analysis tool, to investigate the problem of verification of self-verifying automata （SVA）. SVA is a special variant of finite automata which is essential to nondeterministic communication with a limited number of advice bits. The status, input and output symbols are expressed in vector forms, the dynamic behaviour of SVA is modelled as matrix product is STP. By such algebraic formulation, three an algebraic equation of the states and inputs, in which the necessary and sufficient conditions are presented for the verification problem, by which three algorithms are established to find out all the strings which are accepted, rejected, or unrecognized by a SVA. Testing examples show the correctness of the results.

关键词： SVA recognition power matrix approach STP matrices

来源：评论

学校读者我要写书评

暂无评论

Laplacian Scale-Space Behavior of Planar Curve Corners

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2015年第11期37卷 2207-2217页

作者： Zhang, Xiaohong Qu, Ying Yang, Dan Wang, Hongxing Kymer, Jeff Key Laboratory of Dependable Service Computing Cyber Physical Society Ministry of Education Chongqing400044 China School of Software Engineering Chongqing University Chongqing401331 China State Key Laboratory of Coal Mine Disaster Dynamics and Control Chongqing400044 China College of Computer Science Chongqing University Chongqing400044 China

Scale-space behavior of corners is important for developing an efficient corner detection algorithm. In this paper, we analyze the scale-space behavior with the Laplacian of Gaussian (LoG) operator on a planar curve which constructs Laplacian Scale Space (LSS). The analytical expression of a Laplacian Scale-Space map (LSS map) is obtained, demonstrating the Laplacian Scale-Space behavior of the planar curve corners, based on a newly defined unified corner model. With this formula, some Laplacian Scale-Space behavior is summarized. Although LSS demonstrates some similarities to Curvature Scale Space (CSS), there are still some differences. First, no new extreme points are generated in the LSS. Second, the behavior of different cases of a corner model is consistent and simple. This makes it easy to trace the corner in a scale space. At last, the behavior of LSS is verified in an experiment on a digital curve. © 2015 IEEE.

关键词： Laplace transforms

来源：评论

学校读者我要写书评

暂无评论

Software watermarking using Return-Oriented Programming 15

Software watermarking using Return-Oriented Programming

引用

10th ACM Symposium on Information, computer and Communications Security, ASIACCS 2015

作者： Ma, Haoyu Lu, Kangjie Ma, Xinjie Zhang, Haining Jia, Chunfu Gao, Debin College of Computer and Control Engineering Nankai University China School of Computer Science Georgia Institute of Technology United States School of Information Systems Singapore Management University Singapore Singapore Information Security Evaluation Center of Civil Aviation Civil Aviation University of China China

ISBN: (纸本)9781450332453

We propose a novel dynamic software watermarking design based on Return-Oriented Programming (ROP). Our design formats watermarking code into well-crafted data arrangements that look like normal data but could be triggered to execute. Once triggered, the pre-constructed ROP execution will recover the hidden watermark message. The proposed ROP-based watermarking technique is more stealthy and resilient over existing techniques since the watermarking code is allocated dynamically into data region and therefore out of reach of attacks based on code analysis. Evaluations show that our design not only achieves satisfying stealth and resilience, but also causes significantly lower overhead to the watermarked program. Copyright © 2015 ACM.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Thermal-aware task scheduling for hot-spots avoidance in cloud

引用

Journal of Computational Information Systems 2015年第10期11卷 3665-3673页

作者： Wang, Jiru Wang, Jihe Guo, Bing Shen, Yan Computer Science College Sichuan University Chengdu China School of Control Engineering Chengdu University of Information Technology Chengdu China

The serious problem of hot spot may lead to overheated nodes and potential hardware failures and then damage the reliability of cloud data centers. So much more energy is wasted by lowering the inlet air temperature or increasing the air quantity of air-conditions to alleviate hot-spots. In this paper, a method is developed to quantify the temperature uniformity degree of racks by using information entropy theory, and a new thermal-aware task scheduling scheme based on Hadoop-MapReduce is developed to balance the heat distribution of data center. Simulation results show that this model can alleviate the hot-spot phenomenon and hence improve the system reliability of cloud data center. ©, 2015, Binary Information Press. All right reserved.

关键词： Multitasking

来源：评论

学校读者我要写书评

暂无评论

An ADMM + Consensus Based Distributed Algorithm for Dynamic Economic Power Dispatch in Smart Grid

An ADMM + Consensus Based Distributed Algorithm for Dynamic ...

引用

第三十四届中国控制会议

作者： Hao Xing Zhiyun Lin Minyue Fu Department of Control Science and Engineering Zhejiang University State Key Laboratory of Industrial Control Technology College of Electrical Engineering Zhejiang University School of Electrical Engineering and Computer Science University of Newcastle

ISBN: (纸本)9781467374439

In this paper, we propose a distributed algorithm for the dynamic economic dispatch problem(DEDP) in a smart grid scenario. Different from the static economic dispatch problem(SEDP), the DEDP aims at minimizing the aggregate operating costs of a group of generators over a time period with ramp rate constraints. The proposed algorithm is based on the average consensus algorithm on undirected graphs and the alternating direction method of multipliers(ADMM). Our algorithm is distributed in the sense that no leader or master nodes are needed, while all the nodes(generators) conduct local computation and merely communicate with their neighbors. Convergence analysis shows that the proposed algorithm converges to the optimal solution.

关键词： Economic Dispatch,Dynamic Economic Dispatch,Distributed Convex Optimization,Smart Grid

来源：评论

学校读者我要写书评

暂无评论

Identifiability and Parameter Estimation of Linear Continuous-time Systems under Irregular and Random Sampling

引用

IFAC-PapersOnLine 2015年第28期48卷 332-337页

作者： Mu, Biqiang Guo, Jin Wang, Le Yi Yin, George Xu, Lijian Zheng, Wei Xing Key Laboratory of Systems and Control Chinese Academy of Sciences Beijing100190 China School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing100083 China Department of Electrical and Computer Engineering Wayne State University DetroitMI48202 United States Department of Mathematics Wayne State University DetroitMI48202 United States Department of Electrical and Computer Engineering Technology Farmingdale State College State University of New York FarmingdaleNY11735 United States School of Computing Engineering and Mathematics University of Western Sydney PenrithNSW2751 Australia

This paper considers the problem of identifiability and parameter estimation of single-input-single-output, linear, time-invariant, stable, continuous-time systems under irregular and random sampling schemes. Conditions for system identifiability are established under inputs of exponential polynomial types and a tight bound on sampling density. Identification algorithms of Gauss-Newton iterative types are developed to generate convergent estimate sequences. When the sampled output is corrupted by observation noises, input design, sampling times, and convergent algorithms are intertwined. Persistent excitation (PE) conditions for strongly convergent algorithms are derived. Unlike the traditional identification, the PE conditions under irregular and random sampling involve both sampling times and input values. Under the given PE conditions, iterative and recursive algorithms are developed to estimate the original continuous-time system parameters. The corresponding convergence results are obtained. Several simulation examples are displayed to verify the theoretical results. © 2015

关键词： Continuous time systems Iterative methods Lyapunov methods Nonlinear control systems Parameter estimation Sampling convergence and asymptotical normality Estimation algorithm Identifiability Irregular sampling Linear continuous time system Non linear least squares

来源：评论

学校读者我要写书评

暂无评论

A New Logistic Map Based Chaotic Biogeography-based Optimization Approach for Cluster Analysis

A New Logistic Map Based Chaotic Biogeography-based Optimiza...

引用

2016 IEEE International Conference on Progress in Informatics and Computing

作者： 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 School of Computer Science and Technology Nanjing Normal University Hunan Provincial Key Laboratory of Network Investigational Technology Hunan Policy Academy Department of Electrical Engineering The city college of New YorkCUNY Department of Mechanical and Control Engineering Kyushu Institute of Technology School of Information Engineering Yangzhou University School of Physics and Electronic Engineering Taizhou University School of Electronic Information Shanghai Dianji University School of Energy and Mechanical Engineering Nanjing Normal University Key Laboratory of Intelligent Computing and Information Processing in Fujian Provincial University Quanzhou Normal University

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.

关键词： chaotic biogeography-based optimization cluster analysis centroid-based clustering simulation particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：