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

5th International Conference on Model-Driven Engineering and Software Development (MODELSWARD)

作者： Ma, Zhiyi Peking Univ Sch Elect Engn & Comp Sci Software Inst Beijing Peoples R China Peking Univ Minist Educ Key Lab High Confidence Software Technol Beijing Peoples R China

ISBN: (纸本)9789897582103

There are a large number of modeling languages based on metamodels, and many of the languages are large and complex. In many cases, only part of a metamodel is needed. Hence, it is necessary to automatically extract needed part from a metamodel. By deeply analyzing the characteristics such as special relations between packages and step-by-step strictly defining mechanism of modeling concepts, this paper presents an approach to pruning metamodels like UML as needed. The approach can effectively prune metamodels, control the size of pruned metamodels, and make pruned metamodels comply with its initial metamodels.

关键词： Metamodel pruning algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel pruning Method Based on Correlation Applied in Full-Connection Layer Neurons 8th

A Novel Pruning Method Based on Correlation Applied in Full-...

引用

8th International Conference on Artificial Intelligence and Security (ICAIS)

作者： Dong, Shuoyu Liu, Xiaozhang Li, Xiulai Xie, Gengquan Tang, Xin Hainan Univ Haikou 570228 Peoples R China Hainan Hairui Zhong Chuang Technol Co Ltd Haikou 570228 Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

ISBN: (纸本)9783031067884;9783031067877

DNN (Deep Neural Networks) has achieved great success in various fields, but its deployment on many small devices is limited due to its huge model structure and low computing speed. The neural network faces the problems of large models and slow calculations. Experiments have shown that reasonable pruning methods can be effectively solved. In terms of network pruning, pruning technology can be divided into structured pruning and unstructured pruning. Compared with the limited application of unstructured pruning, structured pruning can greatly compress the model and increase the calculation speed under any framework, and has stronger applicability. In current structured pruning, there is a problem that the accuracy of the model decreases too quickly after a large number of neurons are deleted. To address this problem, we propose a new pruning method based on neuron similarity, which sorts the weights of neurons, according to the principle that neural network parameters will change with training, the integration method is introduced to reconstruct the neuron assignment, and the more relevant neurons are deleted by comparing the current ranking and the cumulative ranking difference of the integration system. Based on the experiments of MLP model, compared with other pruning methods, this method shows its superiority, which can compress the model by 10 times and reduce the accuracy by less than 1%.

关键词： DNN pruning algorithm Structured Correlation

来源：评论

学校读者我要写书评

暂无评论

An Efficient pruning Method of Digital Predistortion Suitable for Power Amplifiers with Scalable Output Power

An Efficient Pruning Method of Digital Predistortion Suitabl...

引用

8th IEEE MTT-S International Wireless Symposium (IWS) part of China Microwave Week

作者： Wu, Huibo Chen, Wenhua Liu, Xin Feng, Zhenghe Tsinghua Univ Dept Elect Engn Beijing Peoples R China Sci & Technol Commun Networks Lab Beijing Peoples R China

ISBN: (纸本)9781665435277

In this paper, a new pruning method of digital predistortion based on optimal brain surgeon (OBS) algorithm is proposed, which reduces the algorithm complexity significantly in power scalable applications. The conventional OBS algorithm is modified for complex value DPD application by pruning the redundant items according to their impact on model accuracy such as normalized mean squared error (NMSE). Compared to conventional DPD, more than 60% of the coefficients can be reduced almost without obvious performance degradation.

关键词： Digital predistortion (DPD) Power amplifier (PA) pruning algorithm Scalable output power

来源：评论

学校读者我要写书评

暂无评论

Optimizing the echo state network based on mutual information for modeling fed-batch bioprocesses

引用

NEUROCOMPUTING 2017年 225卷 111-118页

作者： Wang, Heshan Ni, Chunjuan Yan, Xuefeng Zhengzhou Univ Coll Elect Engn Zhengzhou 450001 Peoples R China East China Univ Sci & Technol Minist Educ Key Lab Adv Control & Optimizat Chem Proc Shanghai 200237 Peoples R China

Echo state networks (ESNs) have become one of the most effective dynamic neural networks because of its excellent fitting performance in real-valued time series modeling tasks and simple training processes. The original ESN concept used randomly fixed created reservoirs, and this concept is considered to be one of its main advantages. However, ESNs have been criticized for its randomly created connectivity and weight parameters. Determining the appropriate weight parameters for a given task is an important problem. An optimization method based on mutual information (MI) is proposed in this study to optimize the input scaling parameters and the structure of ESN to address the aforementioned problem and improve the performance of ESN. The MI optimization method mainly consists of two parts: First, the scaling parameters of multiple inputs are adjusted based on the MI between the network inputs and outputs. Second, some output weight connections are pruned for optimization based on the MI between reservoir states. Furthermore, three MI-ESN models are proposed for a fed-batch penicillin fermentation process. Our experimental outcomes reveal that the obtained MI-ESN models outperform the ESN models without optimization and other traditional neural networks.

关键词： Echo State Network Mutual Information pruning algorithm Penicillin cultivation process modeling Parameters optimizing

来源：评论

学校读者我要写书评

暂无评论

On k-Path Covers and their applications

引用

VLDB JOURNAL 2016年第1期25卷 103-123页

作者： Funke, Stefan Nusser, Andre Storandt, Sabine Univ Stuttgart FMI Univ Str 38 D-70569 Stuttgart Germany Univ Freiburg Georges Kohler Allee 51 D-79110 Freiburg Germany

For a directed graph G with vertex set V, we call a subset a k-(All-)Path Cover if C contains a node from any simple path in G consisting of k nodes. This paper considers the problem of constructing small k-Path Covers in the context of road networks with millions of nodes and edges. In many application scenarios, the set C and its induced overlay graph constitute a very compact synopsis of G, which is the basis for the currently fastest data structure for personalized shortest path queries, visually pleasing overlays of subsampled paths, and efficient reporting, retrieval and aggregation of associated data in spatial network databases. Apart from a theoretic investigation of the problem, we provide efficient algorithms that produce very small k-Path Covers for large real-world road networks (with a posteriori guarantees via instance-based lower bounds). We also apply our algorithms to other (social, collaboration, web, etc.) networks and can improve in several instances upon previous approaches.

关键词： Path cover Graph compression VC-dimension pruning algorithm Personalized route planning Spatial network database

来源：评论

学校读者我要写书评

暂无评论

Holiday Passenger Flow Forecasting Based on the Modified Least-Square Support Vector Machine for the Metro System

引用

JOURNAL OF TRANSPORTATION ENGINEERING PART A-SYSTEMS 2017年第2期143卷 UNSP 04016005-UNSP 04016005页

作者： Liu, Shasha Yao, Enjian Beijing Jiaotong Univ MOE Key Lab Urban Transportat Complex Syst Theory Beijing 100044 Peoples R China

Holiday passenger flow forecasting is essential to transportation plan-making and passenger flow organization in metro systems during holidays. Usually, daily passenger flow characteristics show a great difference between holidays and normal days, and the annual growth of holiday passenger flow seems more complicated. Least-square support vector machine (LSSVM) is able to handle the complex fluctuations in holiday daily passenger flow, but it suffers from critical parameter selection, and sparseness is also lost in the LSSVM solution. In an attempt to forecast holiday passenger flow accurately, this paper proposes an approach based on the modified LSSVM, in which an improved particle-swarm optimization (IPSO) algorithm is developed to optimize parameters and pruning algorithm is used to achieve sparseness, as well as a new evaluation indicator based on the k-fold cross-validation method to evaluate the training performance. Finally, passenger flow data for Guangzhou Metro stations in China during the National Day holiday from 2011 to 2014 are applied as numerical examples to validate the performance of the proposed approach. The results show that the modified LSSVM model is an effective forecasting approach with higher accuracy than other alternative models. (C) 2016 American Society of Civil Engineers.

关键词： Metro system Holiday passenger flow forecasting Least-square support vector machine Improved particle-swarm optimization algorithm pruning algorithm

来源：评论

学校读者我要写书评

暂无评论

ERANN: An algorithm to Extract Symbolic Rules from Trained Artificial Neural Networks

引用

IETE JOURNAL OF RESEARCH 2012年第2期58卷 138-154页

作者： Kamruzzaman, S. M. Hamid, Md. Abdul Sarkar, A. M. Jehad Hankuk Univ Foreign Studies Dept Elect Engn Yongin 449791 Kyonggi Do South Korea

This paper presents an algorithm to extract symbolic rules from trained artificial neural networks (ANNs), called ERANN. In many applications, it is desirable to extract knowledge from ANNs for the users to gain a better understanding of how the networks solve the problems. Although ANN usually achieves high classification accuracy, the obtained results sometimes may be incomprehensible, because the knowledge embedded within them is distributed over the activation functions and the connection weights. This problem can be solved by extracting rules from trained ANNs. To do so, a rule extraction algorithm has been proposed in this paper to extract symbolic rules from trained ANNs. A standard three-layer feedforward ANN with four-phase training is the basis of the proposed algorithm. Extensive experimental studies on a set of benchmark classification problems, including breast cancer, iris, diabetes, wine, season, golfplaying, and lenses classification, demonstrates the applicability of the proposed method. Extracted rules are comparable with other methods in terms of number of rules, average number of conditions for a rule, and the rules accuracy. The proposed method achieved accuracy values 96.28, 98.67, 76.56, 91.01, 100, 100, and 100 for the above problems, respectively. It has been seen that these results are one of the best results comparing with results obtained from related previous studies.

关键词： Backpropagation Clustering algorithm Constructive algorithm Continuous activation function pruning algorithm Rule extraction algorithm Symbolic rules

来源：评论

学校读者我要写书评

暂无评论

An agent-based method for trust graph calculation in resource constrained environments

引用

INTEGRATED COMPUTER-AIDED ENGINEERING 2020年第1期27卷 37-56页

作者： Bordel, Borja Alcarria, Ramon Martin, Diego Sanchez-de-Rivera, Diego Univ Politecn Madrid Dept Telemat Engn Madrid Spain Univ Politecn Madrid Dept Topog Engn & Cartog Madrid Spain

In future resource constrained systems such as Industry 4.0 and Cyber-Physical Systems, thousands of resource constrained embedded devices communicate in order to reach a common objective. Information, then, is processed and transformed several times since it is acquired at physical level until it is received by user applications. Moreover, usually, each component in an current engineered system has almost no information about the other deployed modules. In that way, any malicious component may severely affect systems through the modification of operation data, as high-level applications can check the validity of received information in a hard way. Therefore, future technological components should only communicate with other trustworthy modules. Typically, solutions to address this problem are based on heavy technologies (such as certificates) which do not fulfil the requirements of embedded devices making up future systems. Thus, in this paper, a light computational solution to calculate the graph representing the trustworthy routes through which an application may obtain information is provided. Systems are represented as directed graphs, and untrustworthy branches are identified based on probability offered by a biparametric stochastic process (which is estimated by means an agent-based solution, consisting of a static and a mobile agent). Untrustworthy paths are also pruned following a hierarchical and scalable process. The proposed solution is based on the execution of some "elemental requests" whose response is known. Using the NS3 simulator, virtualization technologies and TAP bridges, the proposed algorithm is validated in a simulation scenario representing a real deployment.

关键词： Trust security resource constrained environments graphs pruning algorithm

来源：评论

学校读者我要写书评

暂无评论

The Use of an Improved LSSVM and Joint Normalization on Temperature Prediction of Gearbox Output Shaft in DFWT

引用

ENERGIES 2017年第11期10卷 1877-1877页

作者： Xiao, Yancai Dai, Ruolan Zhang, Guangjian Chen, Weijia Beijing Jiaotong Univ Sch Mech Elect & Control Engn Beijing 100044 Peoples R China North China Elect Power Univ Dept Elect Engn Baoding 071003 Peoples R China

In the working process of Double-Fed Wind Turbines (DFWT), it is very important to monitor and predict the temperature of the high-speed output shaft of the gearbox timely and effectively. Support vector machine has more advantages in the temperature prediction of wind turbines. Least squares support vector machine is suitable for online prediction due to reducing the computational complexity of support vector machine. In order to solve the sparsity of least squares support vector machine, an improved least squares support vector machine based on pruning algorithm is proposed in this paper to predict the temperature of the high-speed output shaft of gearbox using the practical data of Double-Fed Wind Turbines. At the same time, in order to improve the prediction accuracy and to solve the problem of few links between different feature parameters in common normalization method, the paper uses the method of joint normalization to preprocess the data. The principal component analysis is used to reduce the dimension of the data. Particle swarm optimization algorithm is used to optimize the parameters of the pruning least squares support vector machine. The proposed model that is established in this paper is a new model to forecast the temperature of the high-speed output shaft. The results show that its prediction accuracy is higher than that of other algorithms.

关键词： temperature prediction least squares support vectormachine (LSSVM) pruning algorithm joint normalization principal component analysis (PCA) particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Enhancing the generalization ability of deep learning model for radio signal modulation recognition

引用

APPLIED INTELLIGENCE 2023年第15期53卷 18758-18774页

作者： Wang, Faquan Zhou, Yucheng Yan, Hanzhi Luo, Ruisen Sichuan Univ South Sect 24 1One Ring Rd Chengdu 610065 Peoples R China Univ Elect Sci & Technol China Glasgow Coll Chengdu 611731 Peoples R China Xian Univ Sci & Technol Coll Commun & Informat Engn Xian 710600 Peoples R China Southwest Minzu Univ Sch Comp Sci & Engn Chengdu 610041 Peoples R China

Automatic modulation recognition is a major project in the field of radio cognition;however, the generalization ability of conventional models cannot satisfy practical applications. In order to improve the generalization performance of the deep learning model and increase its recognition efficiency, we propose a novel model: ElsNet (elastic convolutional neural network). This network designs a channel optimization module, by inputting the average pooling information of the feature map and the intrinsic parameters of the batch normalization layer, to dynamically optimize the connection relations between network neurons and enhance the generalization ability of the model. ElsNet achieves an accuracy of about 94% at signal-to-noise ratios of 0-20 dB. Subsequent experiments have also demonstrated that, the ElsNet has a satisfying performance in transferred data sets and a peak accuracy of 82% through transfer learning, which to a certain extent alleviates the problem that the current signal modulation recognition can only be applied to signals with the same modulation parameters as the training dataset and has poor performance in recognizing real signals with different modulation parameters.

关键词： Signal modulation recognition Deep learning Grouped convolution pruning algorithm Transfer learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：