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

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

来源：评论

学校读者我要写书评

暂无评论

Constructing multi-modality and multi-classifier radiomics predictive models through reliable classifier fusion

arXiv

引用

arXiv 2017年

作者： Zhou, Zhiguo Zhou, Zhi-Jie Hao, Hongxia Li, Shulong Chen, Xi Zhang, You Folkert, Michael Wang, Jing Department of Radiation Oncology UT Southwestern Medical Center DallasTX United States High-Tech Institute of Xi'an Xi'an China Department of Information and Control Engineering Xi'an University of Technology Xi'an China School of Computer Science and Technology Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education Xidian University Xi'an China School of Biomedical Engineering Southern Medical Unversity Guangzhou China Institute of Image Processing and Pattern Recognition Xi'an Jiaotong Unversity Xi'an China

Radiomics aims to extract and analyze large numbers of quantitative features from medical images and is highly promising in staging, diagnosing, and predicting outcomes of cancer treatments. Nevertheless, several challenges need to be addressed to construct an optimal radiomics predictive model. First, the predictive performance of the model may be reduced when features extracted from an individual imaging modality (e.g. PET, CT, MRI) are blindly combined into a single predictive model. Second, because many different types of classifiers are available to construct a predictive model, selecting an "optimal" classifier for a particular application is still challenging. In this work, we developed multi-modality and multi-classifier radiomics predictive models that address the aforementioned issues in currently available models. Specifically, a new reliable classifier fusion strategy was proposed to optimally combine output from different modalities and classifiers. In this strategy, modality-specific classifiers were first trained, and an analytic evidential reasoning (ER) rule was developed to fuse the output score from each modality to construct an optimal predictive model. One public datasets and two clinical case studies were performed to validate model performance. The experimental results indicated that the proposed ER rule based radiomics models outperformed the traditional models that rely on a single classifier or simply use combined features from different modalities. Copyright © 2017, The Authors. All rights reserved.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Assignment-Driven Multi-consensus in Second-order Multi-agent Systems via Impulsive Control with Heterogeneous delays

Assignment-Driven Multi-consensus in Second-order Multi-agen...

引用

IEEE International Conference on Control and Automation

作者： Yao-Wen Wei Jing-Wen Yi Yan-Wu Wang Jiang-Wen Xiao 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: (纸本)9781509017393

An assignment-driven multi-consensus problem of multi-agent systems with heterogeneous delays is investigated in this paper. By introducing a concept of intelligent adjustment factor, a distributed impulsive protocol is designed, in which only the delayed sampled relative positions to neighbors and the relative position to the last sampling state are utilized. Combined with the characteristic of impulsive control, three steps of model transformation are performed, and the assignment-driven multi-consensus problem of the original continuous-time system is converted to the stability problem of a discrete-time expanded analogous error system. A necessary and sufficient criterion is derived to guarantee the assignment-driven multi-consensus of the multi-agent system. An interesting simulation is proposed to demonstrate the effectiveness of the theoretical result and reveal the effect of intelligent adjustment factors on the assignment-driven multi-consensus.

关键词： Protocols Delays Multi-agent systems Network topology Automation Stability criteria

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Cyber-physical System Security for Networked Industrial Processes

引用

International Journal of Automation and computing 2015年第6期12卷 567-578页

作者： Shuang Huang Chun-Jie Zhou Shuang-Hua Yang Yuan-Qing Qin School of Automation Huazhong University of Science and Technology Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Department of Computer Science Loughborough University

Cyber-physical systems(CPSs) are integrations of networks, computation and physical processes, where embedded computing devices continually sense, monitor, and control the physical processes through networks. Networked industrial processes combining internet, real-time computer control systems and industrial processes together are typical CPSs. With the increasingly frequent cyber-attack, security issues have gradually become key problems for CPSs. In this paper, a cyber-physical system security protection approach for networked industrial processes, i.e., industrial CPSs, is proposed. In this approach, attacks are handled layer by layer from general information technology(IT) security protection, to active protection, then to intrusion tolerance and physical security protection. The intrusion tolerance implemented in real-time control systems is the most critical layer because the real time control system directly affects the physical layer. This novel intrusion tolerance scheme with a closed loop defense framework takes into account the special requirements of industrial CPSs. To illustrate the effectiveness of the CPS security protection approach, a networked water level control system is described as a case study in the architecture analysis and design language(AADL) environment. Simulation results show that 3 types of injected attacks can be quickly defended by using the proposed protection approach.

关键词： Critical infrastructures cyber-physical systems(CP

来源：评论

学校读者我要写书评

暂无评论

SAR image Despeckling Using Scale Mixtures of Gaussians in the Nonsubsampled Contourlet Domain

引用

Chinese Journal of Electronics 2015年第1期24卷 205-211页

作者： CHANG Xia JIAO Licheng LIU Fang SHA Yuheng Institute of Image Processing and Understanding School of Mathematics and Information Science Beifang University of Nationalities Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China International Research Center for Intelligent Perception and Computation Xidian University School of Computer Science and Technology Xidian University

The edge and contour details in SAR images are important for subsequent processing tasks. The multiscale geometric analysis method — Nonsubsampled contourlet transform(NSCT) is able to capture the geometric information of SAR images effectively. Describing the aggregation behavior of the neighborhoods coefficients, the scale mixtures of Gaussians model has exhibited favorable performances. A novel SAR image despeckling method is presented by constructing the scale mixtures of Gaussians model of NSCT. This method models the SAR images using the multiscale and multidirection information in NSCT domain. The dependency relationship of NSCT neighborhoods coefficients are also taken into consideration in our model. The speckle noise coefficients are shrinkaged by statistical prior estimation based on SAR image model constructed. Experimental results demonstrate that our method is advantageous at directional information preservation and the speckle restraint.

关键词： Synthetic aperture radar(SAR) image despeckling Stationary wavelet transform Nonsubsampled contourlet transform Scale mixtures of Gaussians model.

来源：评论

学校读者我要写书评

暂无评论

Hybrid variable neighbourhood search for multi-objective bus driver rostering

引用

Journal of Computational and Theoretical Nanoscience 2016年第6期13卷 3989-3996页

作者： Peng, Kunkun Shen, Yindong School of Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education Wuhan430074 China

Bus driver rostering is a world-wide problem, which is NP-hard. Two objectives exist in the problem: (1) minimizing the number of drivers;(2) minimizing excess workload of each driver and balancing excess workload among the drivers. To solve the problem, a Hybrid Variable Neighbourhood Search (HVNS) approach is developed, in which two compound neighbourhood structures are devised, each corresponds to an objective and the two neighbourhood structures are employed in turn. Simulated Annealing (SA) is integrated into the HVNS to serve as a solver for neighbourhood search. In the SA, the traditional acceptance criterion is enhanced by accepting 'deteriorated' solutions with control and probability without losing the randomness;moreover, two evaluation functions are built to handle user preferences. Experiments show that the proposed HVNS can produce good results. Copyright © 2016 American Scientific Publishers. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：