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

International Conference on Computational Intelligence and Security

作者： Xingsi Xue Junfeng Chen Aihong Ren College of Information Science and Engineering Intelligent Information Processing Research Center Fujian Key Lab for Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China College of IOT Engineering Hohai University ChanZhou China School of Mathematics and Information Science Baoji University of Arts and Sciences Baoji China

ISBN: (数字)9781728160924

ISBN: (纸本)9781728160931

Since different ontologies are mostly developed independently, establishing meaningful links between their entities, so-called ontology matching, is critical to ensure their communication. Due to the complexity of the ontology matching problem, Evolutionary Algorithm (EA) can present a good methodology for determining ontology alignments. However, since none of the similarity measure can distinguish all the identical ontology entities in any context, ontology alignments generated by the automatic matching tools should be validated by the users to ensure their qualities. To improve the quality of the ontology alignment, in this work, a similarity measure is first proposed to calculate the similarity value of two ontology entities; then, an optimal model for ontology matching problem is constructed; after that, an EA-based automatic matcher is presented to solve the ontology matching problem, which can also adaptively determine the timing of getting user involved; and finally, the ontology concept hierarchy graph based reasoning approaches are proposed to tradeoff the user's workload and his work's effect. The experiment is conducted on the Interactive track provided by the Ontology Alignment Evaluation Initiative (OAEI), and the comparisons with OAEI's participants show the effectiveness of our proposal.

关键词： Ontologies Graph theory Pattern matching Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

A novel experience-based exploration method for q-learning 1

引用

4th International Conference of Pioneer Computer Scientists, Engineers and Educators, ICPCSEE 2018

作者： Yang, Bohong Lu, Hong Li, Baogen Zhang, Zheng Zhang, Wenqiang Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai China Shanghai Engineering Research Center for Video Technology and System School of Computer Science Fudan University Shanghai China School of Computer Science New York University Shanghai Shanghai China

ISBN: (数字)9789811322037

ISBN: (纸本)9789811322020

Reinforcement learning algorithms are used to deal with a lot of sequential problems, such as playing games, mechanical control, and so on. Q-Learning is a model-free reinforcement learning method. In traditional Q-learning algorithms, the agent stops immediately after it has reached the goal. We propose in this paper a new method—Experience-based Exploration method—in order to sample more efficient state-action pairs for Q-learning updating. In the Experience-based Exploration method, the agent does not stop and continues to search the states with high bellman-error inversely. In this setting, the agent will set the terminal state as a new start point, and generate pairs of action and state which could be useful. The efficacy of the method is proved analytically. And the experimental results verify the hypothesis on Gridworld. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Center Difference Set Membership Filter by Zonotopes for Nonlinear System

Center Difference Set Membership Filter by Zonotopes for Non...

引用

International Conference on Modelling, Identification and Control (ICMIC)

作者： Rong Cheng Jian Huang Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan Hubei P.R. China

The paper proposes an improved approach to state estimation for nonlinear discrete-time systems based on zonotopes. To overcome the inherent defect of Taylors formula, a lower-order multi-dimensional extension of Stirling's interpolation formula is used to realize the linearization of nonlinear models. A nonlinear programming method is used to optimize the guaranteed margin of linearization error to obtain a more compact bound estimation, thereby reducing the conservativeness of the algorithm. Simulation results have shown the effectiveness and improved performance of the proposed algorithm.

关键词： State estimation Taylor series Kalman filters Strips Nonlinear systems Interpolation Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Learning oriented cross-entropy approach to user association in load-balanced HetNet

arXiv

引用

arXiv 2018年

作者： Huang, Xietian Xu, Wei Xie, Guo Jin, Shi You, Xiaohu Southeast University Nanjing China Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'An University of Technology Xi'an China

This letter considers optimizing user association in a heterogeneous network via utility maximization, which is a combinatorial optimization problem due to integer constraints. Different from existing solutions based on convex optimization, we alternatively propose a cross-entropy (CE)-based algorithm inspired by a sampling approach developed in machine learning. Adopting a probabilistic model, we first reformulate the original problem as a CE minimization problem which aims to learn the probability distribution of variables in the optimal association. An efficient solution by stochastic sampling is introduced to solve the learning problem. The integer constraint is directly handled by the proposed algorithm, which is robust to network deployment and algorithm parameter choices. Simulations verify that the proposed CE approach achieves near-optimal performance quite efficiently. Copyright © 2018, The Authors. All rights reserved.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Impulsive Multisynchronization of Coupled Multistable Neural Networks with Time-Varying Delay

引用

IEEE Transactions on Neural Networks and Learning Systems 2017年第7期28卷 1560-1571页

作者： Wang, Yan-Wu Yang, Wu Xiao, Jiang-Wen Zeng, Zhi-Gang School of Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan430074 China

This paper studies the synchronization problem of coupled delayed multistable neural networks (NNs) with directed topology. To begin with, several sufficient conditions are developed in terms of algebraic inequalities such that every subnetwork has multiple locally exponentially stable periodic orbits or equilibrium points. Then two new concepts named dynamical multisynchronization (DMS) and static multisynchronization (SMS) are introduced to describe the two novel kinds of synchronization manifolds. Using the impulsive control strategy and the Razumikhin-Type technique, some sufficient conditions for both the DMS and the SMS of the controlled coupled delayed multistable NNs with fixed and switching topologies are derived, respectively. Simulation examples are presented to illustrate the effectiveness of the proposed results. © 2012 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Automatic Reading System for Analog Instruments Based on Computer Vision and Inspection Robot for Power Plant

Automatic Reading System for Analog Instruments Based on Com...

引用

International Conference on Modelling, Identification and Control (ICMIC)

作者： Junzhe Wang Jian Huang Rong Cheng Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan Hubei P.R. China

In this paper, an automatic reading system for analog instruments has been designed for monitoring in power plants. In a general automatic reading system, there are many limitations to the reading correctness and system robustness such as the high cost for the reason that there is only one instrument could be monitored by a single system, the strict restrict of the camera angle, and being not suitable for instruments with dense scales and so on. We present some solutions to overcome these limitations. Firstly, we combine a mobile inspection robot with an image capture device and the image processing method to cut the cost of the monitoring of analog instruments in power plants. Then, we use Hough transform and perspective transform to correct the geometric distortion of images caused by camera angle. Eventually, we get the result of dense scaled instruments based on polar transform. Experiments show that our system performs quite well, and the reading error is less than the results which obtained from the general automatic reading system.

关键词： Instruments Cameras Inspection Robot kinematics Transforms Monitoring

来源：评论

学校读者我要写书评

暂无评论

Optimizing multi-criteria k-shortest paths in graph by a natural routing genotype-based genetic algorithm

Optimizing multi-criteria k-shortest paths in graph by a nat...

引用

IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Yang Wang Qing Liu Haipeng Ren Xuan Ma Long Liu Wenqing Wang Jing Zhang Department of Information and Control Engineering Xi'an University of technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an China

k-shortest path problem (KSP) is a more general form of the classical shortest path problem in graph. Its task is no longer to find the shortest path between two vertices, but to find the shortest k paths. So far, the reported KSP-algorithms only considers finding shortest k paths with regard to a single criterion, while far more application scenarios of the KSP require to determine k paths by taking more criteria into account. This article formulates the KSP as a multi-objective optimization problem. In consideration of the problem's property and genetic algorithm's great success in multi-objective optimization, the genetic algorithm is utilized as the optimization tool. The genotype is directly represented as the form of natural routing. In order to make the related genetic operators risk-free, the conception of gene-bank is introduced. And the crossover and mutation are both implemented based on the introduced gene-bank. The proposed genetic algorithm is tested on an undirected graph of 9-vertex/65-edge. The testing result shows that, our proposed algorithm is valid and outperforms some other swarm intelligence-based algorithms in terms of the obtained paths' quality.

关键词： Genetic algorithms Optimization Genetics Routing Task analysis Encoding Sociology

来源：评论

学校读者我要写书评

暂无评论

Self-Evolutionary Neuron Model for Fast-Response Spiking Neural Networks

TechRxiv

引用

TechRxiv 2019年

作者： Zhang, Anguo Han, Ying Hu, Jing Niu, Yuzhen Gao, Yueming Chen, Zhizhang Zhao, Kai College of Physics and Information Engineering Fuzhou University Fujian350108 China The Key Laboratory of Medical Instrumentation Pharmaceutical Technology of Fujian Province Fuzhou350116 China Research Institute of Ruijie Ruijie Networks Co. Ltd Fujian350002 China School of Public Health Xiamen University Xiamen361102 China College of Information and Intelligent Transportation Fujian Chuanzheng Communications College Fuzhou350007 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University The Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fujian350108 China College of Physics and information Engineering Fuzhou University the Key Laboratory of Medical Instrumentation Pharmaceutical Technology of Fujian Province Fujian350108 China College of Physics and Information Engineering Fuzhou University 350108 China Faculty of Science and Technology University of Macau 999078 China

We propose two simple and effective spiking neuron models to improve the response time of the conventional spiking neural network. The proposed neuron models adaptively tune the presynaptic input current depending on the input received from its presynapses and subsequent neuron firing events. We analyze and derive the firing activity homeostatic convergence of the proposed models. We experimentally verify and compare the models on MNIST handwritten digits and FashionMNIST classification tasks. We show that the proposed neuron models significantly increase the response speed to the input signal. Experiment codes are available at https://***/anvien/Evol-SNN. © 2019, CC0.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Dynamic vehicle scheduling based on HTN 36

Dynamic vehicle scheduling based on HTN

引用

第36届中国控制会议

作者： Yindong Shen Zhongyi Zeng Zhewei Wu School of Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control (Huazhong University of Science and Technology) Ministry of Education

ISBN: (纸本)9781538629185

Vehicle scheduling plays a crucial role in public transport bus companies. An efficient schedule can help bus companies reduce operating costs while being an essential guide to daily operations. However, the precompiled schedule is usually hard to be adhered to in practice due to the diversity of traffic and driving conditions. Therefore, dynamic vehicle scheduling becomes an important supplement to the daily operations. In this paper, a dynamic vehicle scheduling approach based on Hierarchical Task Network(HTN) is proposed. In the approach, two dynamic vehicle scheduling strategies are devised according to the practical scheduling philosophy. The first is to reschedule for individual vehicle independently, the objective is to maximize the execution of the precompiled schedule. The second is to reschedule for multiple vehicles simultaneously, which aims to maintain the scheduled headways. The two strategies are achieved in the HTN planning through different task decomposition processes, which are constrained by vehicle resources currently available. To verify the feasibility, this approach is implemented based on the Simple Hierarchical Ordered Planner 2(SHOP2), which is a domainindependent and state-based forward HTN planner. Experimental results show that the approach has good adaptability to solve dynamic vehicle schedule problem, meanwhile, it can be helpful to deal with the abnormal services agilely and hence to increase the service quality of public transit.

关键词： public transit dynamic vehicle scheduling scheduling strategies HTN planning SHOP2

来源：评论

学校读者我要写书评

暂无评论

Research on SDN Multi Controller Deployment based on K-means++

引用

Journal of Physics: Conference Series 2020年第1期1606卷

作者： Li Yue Chen Junyan Liang Chuxin Lei Xiaochun School of computer and information security Guilin University of Electronic Technology Guilin 541004 China Guangxi cloud computing and big data collaborative innovation center Guilin 541001 China Guangxi key laboratory of image and graphic intelligent processing Guilin 541004 China

In large-scale SDN network, a single centralized controller can not meet the demand, and multiple controllers are needed to deal with the problem, which leads to the problem of multi control balanced deployment. In this paper, the topology of SDN switches and links is known. The main research contents are as follows: the mathematical model of SDN multi controller deployment is established, and the appropriate network topology is selected and the multi controller deployment problem is solved. In the research, the number of controllers needed in the network and the switches managed by each controller is determined by the algorithm results, and the mapping relationship between controllers and switches is established. By analyzing the deployment results of the same network topology under different algorithms, the influence of different clustering algorithms on the experimental results is obtained. At the same time, the better deployment experiment results are simulated.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：