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

35th Chinese Control and Decision Conference (CCDC)

作者： Cui, Yameng Wei, Bingyu Wen, Jiabao Zhao, Bo Li, Deqiang Beijing Aerosp Automat Control Inst Beijing Peoples R China

ISBN: (纸本)9798350334722

Modern warfare is developing towards systematic warfare. The cooperation of multiple aircraft can improve the overall combat capability, and the optimal attack effect can be obtained by optimizing the cooperative target assignment scheme. Cooperative target assignment can also he called weapon target assignment problem. To solve the problem of long search time and low search efficiency, an improved Monte Carlo Tree search algorithm is proposed. First of all, a dynamic cooperative target assignment algorithm is designed according to the optimized cooperative target assignment type, and each aircraft performs dynamic target assignment as the number of targets changes. Then aiming at the problem that the search time of Monte Carlo tree search algorithm is too long, the pruning algorithm is added to improve the search process of Monte Carlo, and the MCTS_prun algorithm with a shorter search time is designed. Finally, the original Monte Carlo tree search method and MCTS_prun algorithm in different confrontation scenarios are compared. It is verified that using the MCTS_prun algorithm to make target assignment decisions can save target assignment time while ensuring the optimal overall damage effect, and improve the search efficiency of MCTS algorithm.

关键词： Cooperative operation Target assignment Monte Carlo Tree Search pruning algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Trim of Multilayer Feedforward Small World Network Based on E-exponential Information Entropy 9

Research on Trim of Multilayer Feedforward Small World Netwo...

引用

9th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)

作者： Guo, Dongwei Liu, Yang Jilin Univ JLU Coll Comp Sci & Technol Changchun Jilin Peoples R China

ISBN: (纸本)9781538630228

In recent years, it has been recognized that the there is a gapbetween artificial neural network and the brain neural network. The biological neural network is neither a random network nor a regular network, it is a network structure between the two. While the small world network has both a larger clustering coefficient of a regular network and a smaller average path length of a random network [1], so the superiority of the small world network has aroused people's attention. As the BP algorithm converges slowly in the process of error back propagation, it is easy to fall into the local minimum point in the modified weight stage, so this paper Optimizes the BP algorithm to improve the convergence rate of the network and improve the problem that the network is easy to fall into the local minimal. The connection between nodes is too close because there are too many hidden nodes, as a result, the problem of overfitting is arisen. In other words, as for data that are not in the training sample, the learning ability of the network is not strong, resulting in a decrease in the practical value of the network. So we need to find a suitable network structure [2]. Therefore, this paper proposes a e-exponential information entropy multilayer feedforward small world network pruning algorithm based on Shannon entropy principle. By constantly training the network, the network is trimmed according to the entropy of the hidden nodes until the network tends to be stable. The experimental results show that the it has been improved obviously in terms of calculated error and test accuracy for trimmed network, which improved the problem of over-fitting to some extent.

关键词： small world network multilayer feedforward network overfitting pruning algorithm

来源：评论

学校读者我要写书评

暂无评论

The Computer Interlocking Software System Reliability Test Based on the Monte Carlo

The Computer Interlocking Software System Reliability Test B...

引用

International Conference on Machinery, Electronics and Control Simulation (ICMECS)

作者： Guan, Qiong Tao, Han Qing Huang, Bin Liuzhou Railway Vocat Tech Coll Liuzhou Peoples R China

ISBN: (纸本)9783038352105

The railway switch failure prediction for railway signal equipment maintenance plays an important role. The paper put forward railway switch failure prediction algorithm based on least squares support vector machine, and chose five characteristic indexes composed of railway switch failure prediction models characteristic input vectors. It reduces the dimension of input vectors, shorten the least squares support vector machine training time, and use a pruning algorithm to accelerate the computing speed maintaining a good regression performance at the same time. The experiment proved that railway switch failure prediction algorithm has strong self-learning ability and higher prediction accuracy based on least squares support vector machine. And it can accelerate the speed of switch failure prediction and improve the accuracy and reliability of railway switch failure prediction.

关键词： Railway switch Failure Prediction Least Squares Support Vector Machine Characteristic Index pruning algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Adaptive Fuzzy Neural Network (EAFNN) Approach for Short Term Load Forecasting

引用

10th International Conference on Artificial Intelligence and Soft Computing (ICAISC 2010)

作者： Du, Juan Er, Meng Joo Rutkowski, Leszek Nanyang Technol Univ Sch EEE Singapore 639798 Singapore Czestochowa Tech Univ Dept Comp Engn PL-42200 Czestochowa Poland Acad Management SWSPiZ Inst Informat Technol PL-90113 Lodz Poland

ISBN: (纸本)9783642132070

In this paper, an Efficient Adaptive Fuzzy Neural Network (EAFNN) model is proposed for electric load forecasting. The proposed approach is based on an ellipsoidal basis function (EBF) neural network, which is functionally equivalent to the TSK model-based fuzzy system. EAFNN uses the combined pruning algorithm where both Error Reduction Ratio (ERR) method and a modified Optimal Brain Surgeon (OBS) technology are used to remove the unneeded hidden units. It can not only reduce the complexity of the network but also accelerate the learning speed. The proposed EAFNN method is tested on the actual electrical load data from well-known EUNITE competition data. Results show the proposed approach provides the superior forecasting accuracy when applying in the real data.

关键词： Fuzzy Neural Network Short Term load forecasting pruning algorithm

来源：评论

学校读者我要写书评

暂无评论

Real-time Vehicle Detection and Tracking Based on YOLOv3 pruning Model

Real-time Vehicle Detection and Tracking Based on YOLOv3 Pru...

引用

第33届中国控制与决策会议

作者： Mingxiu Lin Jiayi Li Jiaxin Zhang Xinghui Li Shiyao Ji Yunli He College of Information Science and Engineering Northeastern University

Real-time detection and tracking of vehicles is very important in the field of automatic *** this paper,a YOLOv3 network based on pruning algorithm is proposed to solve the problem of real-time vehicle *** reducing the number of channels and layers in the backbone network,the computation of the model is *** thus,the rate of detection is greatly *** the basis of vehicle detection,the real-time tracking of multiple vehicle targets is completed by using Kalman filter algorithm for prediction and Hungarian algorithm for data *** experimental results show that compared with the original YOLOv3 network,the model size is compressed by 95% to11.25 MB and the detection rate is doubled to 128.1 frames/s while the average accuracy is basically *** detection and tracking frame rate of the whole algorithm is 18 fps,and the recall is 98.5%.The algorithm also has strong robustness on complex traffic roads,and can basically realize real-time detection and tracking of road vehicles.

关键词： Real-time detection and tracking pruning algorithm Kalman filter algorithm Hungarian algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient CNN Training Accelerator Leveraging Transposable Block Sparsity 4

An Efficient CNN Training Accelerator Leveraging Transposabl...

引用

IEEE International Conference on Artificial Intelligence Circuits and Systems (AICAS) - Intelligent Technology in the Post-Pandemic Era

作者： Xu, Mingyang Lu, Jinming Wang, Zhongfeng Lin, Jun Nanjing Univ Sch Elect Sci & Engn Nanjing Peoples R China

ISBN: (数字)9781665409964

ISBN: (纸本)9781665409964

Convolutional neural network (CNN) training is computationally intensive, requiring a great deal of time and resources. Exploiting data sparsity is a promising method to accelerate CNN training. In this work, we propose a novel algorithm for sparse training processes in which the weight matrices are pruned in a fine-grained block-wise manner. Both the forward propagation (FP) and backward propagation (BP) phases use the identical data layout. It can eliminate the matrix transposition procedure, reducing storage space and training time. Based on this pruning approach, we developed an FPGA-based accelerator for CNN training using a systolic array. The architecture can effectively skip the zero values calculation without incurring the imbalance between different processing elements (PEs). Our experimental results indicate that our design achieves 1.024 TOPS and 118.4 GOPS/VV in terms of computational throughput and energy efficiency. Our design is 1.41x similar to 4.93x more energy efficient than the state-of-the-art training accelerator.

关键词： CNN sparsity pruning algorithm hardware accelerator

来源：评论

学校读者我要写书评

暂无评论

PyEvolve: a toolkit for statistical modelling of molecular evolution

引用

BMC BIOINFORMATICS 2004年第1期5卷 1-1页

作者： Butterfield, A Vedagiri, V Lang, E Lawrence, C Wakefield, MJ Isaev, A Huttley, GA Australian Natl Univ John Curtin Sch Med Res Ctr Bioinformat Sci Canberra ACT 0200 Australia Australian Natl Univ Inst Math Sci Canberra ACT 0200 Australia HeliXense Pte Ltd Singapore 118254 Singapore Australian Natl Univ Res Sch Biol Sci ARC Ctr Kangaroo Genom Canberra ACT 0200 Australia

Background: Examining the distribution of variation has proven an extremely profitable technique in the effort to identify sequences of biological significance. Most approaches in the field, however, evaluate only the conserved portions of sequences - ignoring the biological significance of sequence differences. A suite of sophisticated likelihood based statistical models from the field of molecular evolution provides the basis for extracting the information from the full distribution of sequence variation. The number of different problems to which phylogeny-based maximum likelihood calculations can be applied is extensive. Available software packages that can perform likelihood calculations suffer from a lack of flexibility and scalability, or employ error-prone approaches to model parameterisation. Results: Here we describe the implementation of PyEvolve, a toolkit for the application of existing, and development of new, statistical methods for molecular evolution. We present the object architecture and design schema of PyEvolve, which includes an adaptable multi-level parallelisation schema. The approach for defining new methods is illustrated by implementing a novel dinucleotide model of substitution that includes a parameter for mutation of methylated CpG's, which required 8 lines of standard Python code to define. Benchmarking was performed using either a dinucleotide or codon substitution model applied to an alignment of BRCA1 sequences from 20 mammals, or a 10 species subset. Up to five-fold parallel performance gains over serial were recorded. Compared to leading alternative software, PyEvolve exhibited significantly better real world performance for parameter rich models with a large data set, reducing the time required for optimisation from similar to10 days to similar to6 hours. Conclusion: PyEvolve provides flexible functionality that can be used either for statistical modelling of molecular evolution, or the development of new methods in the field. The

关键词： Partial Likelihood pruning algorithm Subgroup Size Codon Model Real World Performance

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Neural Network for Pattern Classification

引用

Procedia Computer Science 2020年 167卷 2606-2616页

作者： Arun Kulkarni Nikita kulkarni Research Scholar SGGS Institute of Engineering and Technology Nanded-413601 India Associate Applications developer Oracle Financial Services software Ltd. Goregaon(E) Mumbai 400063 India

This research work proposes a fuzzy neural network (FNN) for pattern classification. The proposed network is the modified version of the Radial basis function neural network (RBFNN). FNN uses supervised fuzzy clustering and pruning algorithm to determine the precise number of clusters with proper centroid and width to form the processing nodes in the hidden layer. These clusters represent fuzzy set hyperspheres (FSHs), which are defined by the fuzzy membership function. The training between the hidden layer to output layer which is done by using the LMS algorithm in RBFNN is avoided, and the output is determined by using the fuzzy union operation. The fuzzy membership function shields the clustered patterns resulting in 100% accuracy for the data set used during training. Unlike other clustering algorithms used to construct the hidden layer of RBFNN, the proposed clustering algorithm is independent of tuning parameters and is fast in training and retrieval. Thus FNN reduces the computation time, guarantees 100% accuracy for any training set, and provides superior and comparable recognition accuracy for the datasets with the precise number of FSHs in the hidden layer. Hence the proposed FNN can be used for pattern classification.

关键词： Fuzzy neural network Radial basis function neural network pruning algorithm Fuzzy Membership function

来源：评论

学校读者我要写书评

暂无评论

An Improved Adaptive Thinning Framework

引用

ENGINEERING LETTERS 2022年第3期30卷 1138页

作者： Ma, Jun Ren, Xunhuan Liu, Yuan Tsviatkou, Viktar Yurevich Kanapelka, Valery Kanstantinavich Belarusian State Univ Informat & Elect Minsk BELARUS Belarusian State Univ Informat & Elect Dept Infocommun Technol Minsk BELARUS

The thinning algorithm is one of the fastest approaches to extract skeletons from an object, especially when adopting the parallel strategy. Skeletons are very useful descriptors and can be applied in many recognition fields. However, one of the drawbacks that limits the use of these techniques is that thinning algorithms are not robust against inner noise and outer noise, which may produce many unwanted branches. To alleviate the influence of noise and increase the robustness, pruning methods and scale-space methods have been proposed in the past, in which pruning methods are aimed at suppressing the outer noise (boundary noise) and scale-space methods are aimed at suppressing the inner noise (such as scratch noise and dithering noise). In this paper, we proposed an improved framework that can deal with both inner noise and outer noise. The experiment proved that the proposed framework has better visual effects than the existing pruning method and existing scale-space method. In addition, the proposed framework is an adaptive framework that does not require manual tuning of parameters.

关键词： Adaptive framework Thinning algorithm Robustness against noise pruning algorithm scale-space filtering

来源：评论

学校读者我要写书评

暂无评论

The Research of Parameters Automatic selection Reduction Tikhonov Regularized SVM

The Research of Parameters Automatic selection Reduction Tik...

引用

7th World Congress on Intelligent Control and Automation

作者： Chen, Yongqi Chen, Qijun Tongji Univ Dept Control Sci & Engn Shanghai 201804 Peoples R China

ISBN: (纸本)9781424421138

Tikhonov regularized SVM is a kind of new SVM which can convert multi-class problems to be single optimized problems. Since SVM has some limitations in disposition of big data collection, this paper puts forward a new reduction Tikhonov regularized SVM by utilizing pruning algorithm to gain reduction data collection. Meanwhile, the paper applies genetic algorithm to make automatic selection from the balance parameter and kernel function parameter of Tikhonov regularized SVM. The experiment proves this newly improved Tikhonov Regularized SVM is more advantageous for classifying precision and train rate.

关键词： SVM pruning algorithm genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：