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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Consensus control for Second-Order Multi-Agent with Time-Delay on Antagonistic Networks

Consensus Control for Second-Order Multi-Agent with Time-Del...

引用

第35届中国控制会议

作者： Penglin LI Yue LIU Yadong ZHAO Jie YANG Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University State Key Laboratory of Industrial Control Technology Institute of Industrial Process ControlCollege of Control Science and EngineeringZhejiang University Key Laboratory of System Control and Information Processing Ministry of Education

ISBN: (纸本)9781509009107

In this paper,we discuss consensus problems for antagonistic networks with double integrator *** cases are analyzed:(1) undirected graphs with fixed topology on antagonistic networks;(2) undirected graphs with fixed topology and time-delay on antagonistic *** both cases,distributed consensus protocols are proposed,with sufficient and necessary conditions *** is proved that the largest tolerable time-delay is only related to the largest eigenvalue of the graph ***,simulations are provided to demonstrate the obtained theoretical results.

关键词： Consensus Fixed Topology Multi-agent Antagonistic Networks Time-delay

来源：评论

学校读者我要写书评

暂无评论

Optimizing application layer multicast routing via artificial fish swarm algorithm

Optimizing application layer multicast routing via artificia...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Xuan Ma Rongjun Tang Jingyan Kang Qing Liu Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an University of Technology Xi'an China Faculty of Automation and Information Engineering

ISBN: (纸本)9781509040940

In this paper, we propose an approach based on the use of artificial fish swarm algorithm (AFSA) for solving the problem of multicast routing on application layer. Taking delay, stretch, and degree as three optimization objectives, we design the behaviors of artificial fish individual (AF), i.e. moving randomly, preying, following, and use Pareto ranking to evaluate the fitness of AF. The simulation results show that the proposed algorithm is an appropriate method to explore the search space of the complex problem and leads to good solutions in a reasonable amount of time.

关键词： Delays Routing Optimization Fish Network topology Algorithm design and analysis Visualization

来源：评论

学校读者我要写书评

暂无评论

Limit Set Problem of Multi-Agent Systems with Finite States: An Eigenvalue-Based Approach

引用

Journal of Systems Science & Complexity 2015年第3期28卷 570-579页

作者： WANG Lin WANG Xiaofan WANG Jinhuan Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education School of Sciences Hebei University of Technology

This paper studies the limit set of multi-agent system with finite states, in which the system is converted into a linear system through an expansion of space. Then, the structure properties of the system matrix are investigated, and the relationships between the eigenvalues and the limit set are developed. As an application, the nilpotent problem of elementary cellular automata(ECA) known as algorithmically undecidable is considered, and all the nilpotent ECA are found out which consists of rules 0, 8, 64, 239, 253, 255.

关键词： Cellular automata eigenvalue finite states limit set multi-agent system nilpotent.

来源：评论

学校读者我要写书评

暂无评论

Membrane algorithm with genetic operation and VRPTW-based public optimization system 11th

Membrane algorithm with genetic operation and VRPTW-based pu...

引用

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

作者： Duan, Yingying Zhou, Kang Qi, Huaqing Zhang, Zhiqiang School of Math and Computer Wuhan Polytechnic University Wuhan430023 China Department of Economics and Management Wuhan Polytechnic University Wuhan430023 China Key Laboratory of Image Information Processing and Intelligent Control School of Automation Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9789811036101

That combining membrane computing with optimization technology offers a new information interaction model for the research of problems in optimization filed. Based on this, a membrane algorithm owned six basic membranes is proposed to solve the defects of the slow convergence and the small diversity in solving vehicle routing problem with time window. In order to further improve the efficiency and the precision, some new rules are designed: for the former problem, a node classifier is introduced to improve the efficiency by filtering directly a plenty of in-feasible solutions;two methods for the latter problems: an uncertain segment crossover is designed in the corresponding membrane in order to explore directly two feasible segments and segment-node insertion operation is introduced in order to make two individuals inserted synchronously another path. In order to verify the effectiveness of the algorithm, a series of experiments are designed. Known through the results of experiments that these two properties of membranes make the search ability of the algorithm improving quickly for local and global exploration and node classifier improves effectively the running efficiency of this algorithm, which proves that membrane algorithm can accelerate the convergence speed and increase diversity of population. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Membranes

来源：评论

学校读者我要写书评

暂无评论

Bandwidth Allocation with Minimum Rate Constraints in Cluster-based Femtocell Networks

引用

International Journal of automation and computing 2015年第1期12卷 77-82页

作者： Kai Ma Liang Li Jie Yang Zhi-Xin Liu Xin-Bin Li Xin-Ping Guan School of Electrical Engineering Key Laboratory of Industrial Computer Control Engineering of Hebei Province Yanshan University Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information ProcessingMinistry of Education

Inter-femtocell interference becomes serious when femtocells are densely deployed. To mitigate the inter-femtocell interference, this paper proposes a cluster-based bandwidth allocation algorithm. We create femtocell clusters by constructing a weighted interference graph and allocate bandwidth to each cluster based on a Nash bargaining solution(NBS). Simulation results show that the cluster-based bandwidth allocation algorithm can reduce the inter-femtocell interference and meet the minimum rate constraint of each cluster.

关键词： Femtocell cluster inter-femtocell interference bandwidth allocation Nash bargaining solution(NBS)

来源：评论

学校读者我要写书评

暂无评论

Variable-numbered multi-target tracking algorithm based on universal track initiation model with adaptive threshold

Variable-numbered multi-target tracking algorithm based on u...

引用

Chinese control Conference (CCC)

作者： Dayu Huang Duo Wang Shaofeng Wu Yunze Cai Science and Technology on Avionics Integration Laboratory Shanghai Department of Automation Key Laboratory of System Control and Information Processing Shanghai P. R. China

This paper firstly proposed a universal track initiation method with adaptive threshold. Using this method, performance under heavy clutter tracking environment is improved. Besides, joint probabilistic data association filter is the common data association method, which only deal with the fixed-numbered multi-target tracking problem. Introducing the data pre-association process, an improved JPDAF algorithm is proposed to accomplish variable-numbered multi-target tracking, which is validated by simulation results.

关键词： Target tracking Clutter Adaptation models Reliability Probabilistic logic Filtering algorithms Loss measurement

来源：评论

学校读者我要写书评

暂无评论

Application of discrete ant colony optimization in VRPTW 11th

Application of discrete ant colony optimization in VRPTW

引用

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

作者： Fu, Qinhong Zhou, Kang Qi, Huaqing Wu, Tingfang School of Math and Computer Wuhan Polytechnic University WuhanHubei430023 China Department of Economics and Management Wuhan Polytechnic University WuhanHubei430023 China Key Laboratory of Image Information Processing and Intelligent Control School of Automation Huazhong University of Science and Technology WuhanHubei430074 China

ISBN: (纸本)9789811036132

The classical ant colony algorithm for vehicle routing problem with time windows (VRPTW) has problems of low efficiency, slow convergence and prematurity. And the discrete ant colony optimization (DACO) is proposed for these problem. It adopts the one-dimensional discrete coding that can make the data structure simpler and bring in faster convergence speed. In addition, self-convergence mode is used to calculate the optimal vehicle number rather than setting the optimal vehicle number at the beginning, which makes the algorithm more flexible and accelerates the convergence speed effectively. The time window and vehicle load are not considered in the optimization process, when ants complete the whole process and then the path is explained, this move not only expands the ant search scope but also improves the efficiency of the algorithm. The above highlights make the most of the selfadaptation and self-regulating mechanism, which effectively reduces the probability of the local optimal solution at the same time. Experimental results for Solomon benchmark test problems indicate that DACO outperforms both in reducing time and space complexity in the premise of not affecting the accuracy. Thus proves DACO is effective and feasible in solving the VRPTW. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

An image threshold segmentation algorithm with hybrid evolutionary mechanisms based on membrane computing 11th

An image threshold segmentation algorithm with hybrid evolut...

引用

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

作者： Liu, Shuo Zhou, Kang Zeng, Shan Qi, Huaqing Wu, Tingfang Department of Math and Computer Wuhan Polytechnic University WuhanHubei430023 China Department of Economics and Management Wuhan Polytechnic University WuhanHubei430023 China Key Laboratory of Image Information Processing and Intelligent Control School of Automation Huazhong University of Science and Technology WuhanHubei430074 China

ISBN: (纸本)9789811036101

Focused on the contradiction between selective pressure and population diversity in the optimization algorithm using hybrid evolutionary mechanisms, this paper proposes a membrane image threshold segmentation algorithm based on the idea of membrane computing. The proposal uses a hybrid tissue P system of three one-level-membranestructure (OLMS) membranes in which genetic algorithm (GA) and particle swarm optimal algorithm (PSO) are used as evolution operator. The proposed algorithm uses the communication rules and transfer rules to establish the interactions among the membranes, and then enhances the diversity of population in the system and improves the convergence of the algorithm. After comparing with the conventional methods, simulation results and dynamic behavior analysis show that the proposal evidently improve the validity and feasibility of the image segmentation algorithm. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved multi-step iterative algorithms for the fixed points of strongly pseudo-contractive mappings 11th

Improved multi-step iterative algorithms for the fixed point...

引用

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

作者： Liu, Jiangrong Zhou, Kang Zeng, Shan Qi, Huaqing Song, Bosheng Wu, Tingfang Department of Math and Computer Wuhan Polytechnic University WuhanHubei430023 China Department of Economics and Management Wuhan Polytechnic University WuhanHubei430023 China Key Laboratory of Image Information Processing and Intelligent Control School of Automation Huazhong University of Science and Technology WuhanHubei430074 China

ISBN: (纸本)9789811036132

In Banach Spaces, we introduce a new improved multi-step iterative algorithm for the fixed points of strongly pseudo-contractive mappings, by proving the convergence for modified Mann iterative sequence, and that the multi-step iterative sequence and Mann iterative scheme are equivalent. We prove the convergence of iterative sequences generalized by the improved multi-step iterative algorithms. The results extend and improve the corresponding related results. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Banach spaces

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：