期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到6,348篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Temperature control for liquid-cooled fuel cells based on fuzzy logic and variable-gain generalized supertwisting algorithm 认领 引用
1
作者 CHEN Lin JIA Zhi-huan +1 位作者 DING Tian-wei GAO Jin-wu 《控制理论与应用》 EI CAS CSCD 北大核心 2025年第8期1596-1605,共10页
The liquid cooling system(LCS)of fuel cells is challenged by significant time delays,model uncertainties,pump and fan coupling,and frequent disturbances,leading to overshoot and control oscillations that degrade tempe... The liquid cooling system(LCS)of fuel cells is challenged by significant time delays,model uncertainties,pump and fan coupling,and frequent disturbances,leading to overshoot and control oscillations that degrade temperature regulation performance.To address these challenges,we propose a composite control scheme combining fuzzy logic and a variable-gain generalized supertwisting algorithm(VG-GSTA).Firstly,a one-dimensional(1D)fuzzy logic controler(FLC)for the pump ensures stable coolant flow,while a two-dimensional(2D)FLC for the fan regulates the stack temperature near the reference value.The VG-GSTA is then introduced to eliminate steady-state errors,offering resistance to disturbances and minimizing control oscillations.The equilibrium optimizer is used to fine-tune VG-GSTA parameters.Co-simulation verifies the effectiveness of our method,demonstrating its advantages in terms of disturbance immunity,overshoot suppression,tracking accuracy and response speed. 展开更多
关键词 liquid-cooled fuel cell temperature control generalized supertwisting algorithm fuzzy control equilibrium optimizer
暂未订购 下载PDF
Generalized Self-Adaptive Genetic Algorithms 认领 引用 被引量：2
2
作者 Bin Wu Xuyan Tu +1 位作者 Jian Wu Information Engineering School, University of Science and Technology Beijing, Beijing 100083, China Department of Information and Control Engineering, Southwest Institute of Technology, Mianyang 621002, China 《International Journal of Minerals,Metallurgy and Materials》 SCIE EI CAS 2000年第1期72-75,共4页
In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed init... In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality im- migrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching per- formance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the val- idity of this modified genetic algorithm is proved. 展开更多
关键词 generalized self-adaptive genetic algorithm initial population immigration fitness function
暂未订购 下载PDF
A PROJECTION-TYPE ALGORITHM FOR SOLVING GENERALIZED MIXED VARIATIONAL INEQUALITIES 认领 引用 被引量：2
3
作者 涂凯 夏福全 《Acta Mathematica Scientia》 SCIE CSCD 2016年第6期1619-1630,共12页
We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping... We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping is continuous and f-pseudomonotone with nonempty compact convex values on dom（f）, where f ： Rn --RU{＋∞} is a proper func- tion. The algorithm presented in this paper generalize and improve some known algorithms in literatures. Preliminary computational experience is also reported. 展开更多
关键词 projection-type algorithm generalized mixed variational inequality f-pseudo-monotone mapping
暂未订购 下载PDF
PROXIMAL POINT ALGORITHM WITH ERRORS FOR GENERALIZED STRONGLY NONLINEARQUASIVARIATIONAL INCLUSIONS 认领 引用 被引量：1
4
作者 丁协平 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 1998年第7期637-643,共7页
In this paper, a class of generalized strongly nonlinear quasivariational inclusions are studied. By using the properties of the resolvent operator associated with a maximal monotone; mapping in Hilbert space, an exis... In this paper, a class of generalized strongly nonlinear quasivariational inclusions are studied. By using the properties of the resolvent operator associated with a maximal monotone; mapping in Hilbert space, an existence theorem of solutions for generalized strongly nonlinear quasivariational inclusion is established and a new proximal point algorithm with errors is suggested for finding approximate solutions which strongly converge to the exact solution of the generalized strongly, nonlinear quasivariational inclusion. As special cases, some known results in this field are also discussed. 展开更多
关键词 generalized strongly nonlinear quasivariational inclusion proximal point algorithm with errors
暂未订购 下载PDF
Data-Driven Algorithms for Finite-Horizon and Infinite-Horizon Indefinite Linear Quadratic Stochastic Optimal Control Problems 认领 引用
5
作者 Guangchen Wang Heng Zhang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第6期1459-1469,共11页
This paper is devoted to devising data-driven algorithms for finite-horizon and infinite-horizon linear quadratic stochastic optimal control(LQSOC)problems.In our study,the diffusion terms of system dynamics are permi... This paper is devoted to devising data-driven algorithms for finite-horizon and infinite-horizon linear quadratic stochastic optimal control(LQSOC)problems.In our study,the diffusion terms of system dynamics are permitted to hinge upon both control and state variables,and the weighting matrices of cost functionals are allowed to be indefinite.It is acknowledged that the optimal controls of finite-horizon and infinite-horizon indefinite LQSOC problems are correlated with a generalized differential Riccati equation(GDRE)and a generalized algebraic Riccati equation(GARE).Herein,we propose two data-driven algorithms to approximate the solutions of these Riccati equations,and thereby determine optimal controls,without leveraging the information of all system parameters.Additionally,we prove the convergence of these algorithms and examine the impact of computational errors.Finally,we validate the performance of these data-driven algorithms via three simulation examples. 展开更多
关键词 Data-driven algorithm generalized algebraic Riccati equation (GARE) generalized differential Riccati equation (GDRE) indefinite problem linear quadratic stochastic optimal control (LQSOC)
暂未订购 下载PDF
Risk-sensitive reinforcement learning algorithms with generalized average criterion 认领 引用
6
作者 殷苌茗 王汉兴 赵飞 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2007年第3期405-416,共12页
A new algorithm is proposed, which immolates the optimality of control policies potentially to obtain the robnsticity of solutions. The robnsticity of solutions maybe becomes a very important property for a learning s... A new algorithm is proposed, which immolates the optimality of control policies potentially to obtain the robnsticity of solutions. The robnsticity of solutions maybe becomes a very important property for a learning system when there exists non-matching between theory models and practical physical system, or the practical system is not static, or the availability of a control action changes along with the variety of time. The main contribution is that a set of approximation algorithms and their convergence results are given. A generalized average operator instead of the general optimal operator max （or rain） is applied to study a class of important learning algorithms, dynamic prOgramming algorithms, and discuss their convergences from theoretic point of view. The purpose for this research is to improve the robnsticity of reinforcement learning algorithms theoretically. 展开更多
关键词 reinforcement learning risk-sensitive generalized average algorithm convergence
暂未订购 下载PDF
PREDICTOR-CORRECTOR ALGORITHMS FOR SOLVING GENERALIZED MIXED IMPLICIT QUASI-EQUILIBRIUM PROBLEMS 认领 引用
7
作者 丁协平 林炎诚 姚任之 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2006年第9期1157-1164,共8页
A new class of generalized mixed implicit quasi-equilibrium problems （GMIQEP） with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems... A new class of generalized mixed implicit quasi-equilibrium problems （GMIQEP） with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems and generalized mixed implicit quasi-variational inequality problems as many special cases. By employing the auxiliary principle technique, some predictor-corrector iterative algorithms for solving the GMIQEP are suggested and analyzed. The convergence of the suggested algorithm only requires the continuity and the partially relaxed implicit strong monotonicity of the mappings 展开更多
关键词 generalized mixed implicit quasi-equilibrium problem auxiliary variational inequality predictor-corrector iterative algorithms partially relaxed implicit strong monotonicity
暂未订购 下载PDF
Smoothing Newton Algorithm for Solving Generalized Complementarity Problem 认领 引用
8
作者 刘晓红 倪铁 《Transactions of Tianjin University》 EI CAS 2010年第1期75-79,共5页
The generalized complementarity problem includes the well-known nonlinear complementarity problem and linear complementarity problem as special cases.In this paper, based on a class of smoothing functions, a smoothing... The generalized complementarity problem includes the well-known nonlinear complementarity problem and linear complementarity problem as special cases.In this paper, based on a class of smoothing functions, a smoothing Newton-type algorithm is proposed for solving the generalized complementarity problem.Under suitable assumptions, the proposed algorithm is well-defined and global convergent. 展开更多
关键词 generalized complementarity problem smoothing Newton algorithm NCP function global convergence
暂未订购 下载PDF
A hyperspectral image endmember extraction algorithm based on generalized morphology 认领 引用
9
作者 王东辉 杨秀坤 赵岩 《Optoelectronics Letters》 EI 2014年第5期387-390,共4页
Generalized morphological operator can generate less statistical bias in the output than classical morphological operator. Comprehensive utilization of spectral and spatial information of pixels, an endmember extracti... Generalized morphological operator can generate less statistical bias in the output than classical morphological operator. Comprehensive utilization of spectral and spatial information of pixels, an endmember extraction algorithm based on generalized morphology is proposed. For the limitations of morphological operator in the pixel arrangement rule and replacement criteria, the reference pixel is introduced. In order to avoid the cross substitution phenomenon at the boundary of different object categories in the image, an endmember is extracted by calculating the generalized opening-closing(GOC) operator which uses the modified energy function as a distance measure. The algorithm is verified by using simulated data and real data. Experimental results show that the proposed algorithm can extract endmember automatically without prior knowledge and achieve relatively high extraction accuracy. 展开更多
关键词 Extraction Morphology Pixels Spectroscopy Comprehensive utilizations Endmember extraction algorithms Extraction accuracy Generalized morphological operators Hyper spectral images Morphological operator Object categories Spatial informations
暂未订购 下载PDF
Existence and algorithm of solutions for a system of generalized mixed implicit equilibrium problems in Banach spaces 认领 引用
10
作者 丁协平 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2010年第9期1049-1062,共14页
A new system of generalized mixed implicit equilibrium problems is introduced and studied in Banach spaces. First, the notion of the Yosida proximal mapping for generalized mixed implicit equilibrium problems is intro... A new system of generalized mixed implicit equilibrium problems is introduced and studied in Banach spaces. First, the notion of the Yosida proximal mapping for generalized mixed implicit equilibrium problems is introduced. By using the notion, a system of generalized equation problems is considered, and its equivalence with the system of generalized mixed implicit equilibrium problems is also proved. Next, by applying the system of generalized equation problems, we suggest and analyze an iterative algorithm to compute the approximate solutions of the system of generalized mixed implicit equilibrium problems. The strong convergence of the iterative sequences generated by the algorithm is proved under quite mild conditions. The results are new and unify and generalize some recent results in this field. 展开更多
关键词 generalized mixed implicit equilibrium problem Yosida proximal mapping,generalized equation problem iterative algorithm Banach space
暂未订购 下载PDF
Iterative algorithm for solutions to new system of generalized mixed implicit equilibrium 认领 引用
11
作者 丁协平 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2013年第1期113-126,共14页
A new system of generalized mixed implicit equilibrium problems （SGMIEP） involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium pro... A new system of generalized mixed implicit equilibrium problems （SGMIEP） involving nonmonotone set-valued mappings is introduced and studied in real reflexive Banach spaces. First, an auxiliary mixed equilibrium problem （AMEP） is introduced. The existence and the uniqueness of the solutions to the AMEP are proved under quite mild assumptions without any coercive conditions. Next, by using the solution mapping of the AMEP, a system of generalized equation problems （SGEP） is considered, and its equivalence with the SGMIEP is shown. By using the SGEP, a new iterative algorithm for solving the SGMIEP is proposed and analyzed. The strong convergence of the iterative sequences generated by the algorithm is proved under suitable conditions. These results are new, which unify and generalize some recent results in this field. 展开更多
关键词 system of generalized mixed implicit equilibrium problems （SGMIEP）,auxiliary mixed equilibrium problem （AMEP） system of generalized equation problems（SGEP） iterative algorithm reflexive Banach space
暂未订购 下载PDF
Conditional Generative Adversarial Network-Based Travel Route Recommendation 认领 引用
12
作者 Sunbin Shin Luong Vuong Nguyen +3 位作者 Grzegorz J.Nalepa Paulo Novais Xuan Hau Pham Jason J.Jung 《Computers, Materials & Continua》 SCIE EI 2026年第1期1178-1217,共40页
Recommending personalized travel routes from sparse,implicit feedback poses a significant challenge,as conventional systems often struggle with information overload and fail to capture the complex,sequential nature of... Recommending personalized travel routes from sparse,implicit feedback poses a significant challenge,as conventional systems often struggle with information overload and fail to capture the complex,sequential nature of user preferences.To address this,we propose a Conditional Generative Adversarial Network(CGAN)that generates diverse and highly relevant itineraries.Our approach begins by constructing a conditional vector that encapsulates a user’s profile.This vector uniquely fuses embeddings from a Heterogeneous Information Network(HIN)to model complex user-place-route relationships,a Recurrent Neural Network(RNN)to capture sequential path dynamics,and Neural Collaborative Filtering(NCF)to incorporate collaborative signals from the wider user base.This comprehensive condition,further enhanced with features representing user interaction confidence and uncertainty,steers a CGAN stabilized by spectral normalization to generate high-fidelity latent route representations,effectively mitigating the data sparsity problem.Recommendations are then formulated using an Anchor-and-Expand algorithm,which selects relevant starting Points of Interest(POI)based on user history,then expands routes through latent similarity matching and geographic coherence optimization,culminating in Traveling Salesman Problem(TSP)-based route optimization for practical travel distances.Experiments on a real-world check-in dataset validate our model’s unique generative capability,achieving F1 scores ranging from 0.163 to 0.305,and near-zero pairs−F1 scores between 0.002 and 0.022.These results confirm the model’s success in generating novel travel routes by recommending new locations and sequences rather than replicating users’past itineraries.This work provides a robust solution for personalized travel planning,capable of generating novel and compelling routes for both new and existing users by learning from collective travel intelligence. 展开更多
关键词 Travel route recommendation conditional generative adversarial network heterogeneous information network anchor-and-expand algorithm
暂未订购 下载PDF
A ROBUST PHASE-ONLY DIRECT DATA DOMAIN ALGORITHM BASED ON GENERALIZED RAYLEIGH QUOTIENT OPTIMIZATION USING HYBRID GENETIC ALGORITHM 认领 引用 被引量：2
13
作者 Shao Wei Qian Zuping Yuan Feng 《Journal of Electronics(China)》 2007年第4期560-566,共7页
A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on gen- eralized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency ... A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on gen- eralized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency and computational speed are improved via the hybrid GA com- posed of standard GA and Nelder-Mead simplex algorithms. First, the objective function, with a form of generalized Rayleigh quotient, is derived via the standard D3LS algorithm. It is then taken as a fitness function and the unknown phases of all adaptive weights are taken as decision variables. Then, the nonlinear optimization is performed via the hybrid GA to obtain the optimized solution of phase-only adaptive weights. As a phase-only adaptive algorithm, the proposed algorithm is sim- pler than conventional algorithms when it comes to hardware implementation. Moreover, it proc- esses only a single snapshot data as opposed to forming sample covariance matrix and operating matrix inversion. Simulation results show that the proposed algorithm has a good signal recovery and interferences nulling performance, which are superior to that of the phase-only D3LS algorithm based on standard GA. 展开更多
关键词 Generalized Rayleigh quotient Hybrid genetic algorithm Phase-only optimization Direct Data Domain Least Squares （D^3LS） algorithm Nelder-Mead simplex algorithm
暂未订购 下载PDF
Improved Gain Shared Knowledge Optimizer Based Reactive Power Optimization for Various Renewable Penetrated Power Grids with Static Var Generator Participation 认领 引用
14
作者 Xuan Ruan HanYan +4 位作者 DonglinHu Min Zhang YingLi DiHai Bo Yang 《Energy Engineering》 EI 2026年第3期23-56,共34页
An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale... An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale wind/solar farms with shunt static var generators(SVGs).The model explicitly represents reactive-power regulation characteristics of doubly-fed wind turbines and PV inverters under real-time meteorological conditions,and quantifies SVG high-speed compensation capability,enabling seamless transition from localized VAR management to a globally coordinated strategy.An enhanced adaptive gain-sharing knowledge optimizer(AGSK-SD)integrates simulated annealing and diversity maintenance to autonomously tune voltage-control actions,renewable source reactive-power set-points,and SVG output.The algorithm adaptively modulates knowledge factors and ratios across search phases,performs SA-based fine-grained local exploitation,and periodically re-injects population diversity to prevent premature convergence.Comprehensive tests on IEEE 9-bus and 39-bus systems demonstrate AGSK-SD’s superiority over NSGA-II and MOPSO in hypervolume(HV),inverse generative distance(IGD),and spread metrics while maintaining acceptable computational burden.The method reduces network losses from 2.7191 to 2.15 MW(20.79%reduction)and from 15.1891 to 11.22 MW(26.16%reduction)in the 9-bus and 39-bus systems respectively.Simultaneously,the cumulative voltage-deviation index decreases from 0.0277 to 3.42×10−4 p.u.(98.77%reduction)in the 9-bus system,and from 0.0556 to 0.0107 p.u.(80.76%reduction)in the 39-bus system.These improvements demonstrate significant suppression of line losses and voltage fluctuations.Comparative analysis with traditional heuristic optimization algorithms confirms the superior performance of the proposed approach. 展开更多
关键词 Gained-sharing knowledge improved algorithm adaptive parameter adjustment simulated annealing local search algorithms diversity enhancement mechanisms wind and solar new energy static var generator reactive power optimization
暂未订购 下载PDF
ONLINE REGULARIZED GENERALIZED GRADIENT CLASSIFICATION ALGORITHMS 认领 引用
15
作者 Leilei Zhang Baohui Sheng Jianli Wang 《Analysis in Theory and Applications》 2010年第3期278-300,共23页
This paper considers online classification learning algorithms for regularized classification schemes with generalized gradient. A novel capacity independent approach is presented. It verifies the strong convergence o... This paper considers online classification learning algorithms for regularized classification schemes with generalized gradient. A novel capacity independent approach is presented. It verifies the strong convergence of sizes and yields satisfactory convergence rates for polynomially decaying step sizes. Compared with the gradient schemes, this al- gorithm needs only less additional assumptions on the loss function and derives a stronger result with respect to the choice of step sizes and the regularization parameters. 展开更多
关键词 online learning algorithm reproducing kernel Hilbert space generalized gra-dient Clarke＇s directional derivative learning rate
暂未订购 下载PDF
Convergence of 6G-Empowered Edge Intelligence and Generative AI:Theories,Algorithms,and Applications 认领 引用
16
作者 Wu Yuan Dusit Niyato +5 位作者 Cui Shuguang Zhao Lian Tony Q.S.Quek Zhang Yan Qian Liping Li Rongpeng 《China Communications》 SCIE EI CSCD 2025年第7期I0002-I0005,共4页
The rapid advancement of 6G communication technologies and generative artificial intelligence(AI)is catalyzing a new wave of innovation at the intersection of networking and intelligent computing.On the one hand,6G en... The rapid advancement of 6G communication technologies and generative artificial intelligence(AI)is catalyzing a new wave of innovation at the intersection of networking and intelligent computing.On the one hand,6G envisions a hyper-connected environment that supports ubiquitous intelligence through ultra-low latency,high throughput,massive device connectivity,and integrated sensing and communication.On the other hand,generative AI,powered by large foundation models,has emerged as a powerful paradigm capable of creating. 展开更多
关键词 G ubiquitous intelligence edge intelligence algorithms generative artificial intelligence ai theories large foundation modelshas intelligent computingon
暂未订购 下载PDF
Solving the Generalized Traveling Salesman Problem Using Sequential Constructive Crossover Operator in Genetic Algorithm 认领 引用
17
作者 Zakir Hussain Ahmed Maha Ata Al-Furhood +1 位作者 Abdul Khader Jilani Saudagar Shakir Khan 《Computer Systems Science & Engineering》 2024年第5期1113-1131,共19页
The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is h... The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is highly expensive,we will develop genetic algorithms(GAs)to obtain heuristic solutions to the problem.In GAs,as the crossover is a very important process,the crossovermethods proposed for the traditional TSP could be adapted for the GTSP.The sequential constructive crossover(SCX)and three other operators are adapted to use in GAs to solve the GTSP.The effectiveness of GA using SCX is verified on some GTSP Library(GTSPLIB)instances first and then compared against GAs using the other crossover methods.The computational results show the success of the GA using SCX for this problem.Our proposed GA using SCX,and swap mutation could find average solutions whose average percentage of excesses fromthe best-known solutions is between 0.00 and 14.07 for our investigated instances. 展开更多
关键词 Generalized travelling salesman problem NP-hard genetic algorithms sequential constructive crossover swap mutation
暂未订购 下载PDF
Architectures and Algorithms of Generalized Congruence Neural Networks 认领 引用 被引量：7
18
作者 靳蕃 《Journal of Modern Transportation》 1998年第2期2-8,共7页
In this paper a novel class of neural networks called generalized congruence neural networks (GCNN) is proposed. All neurons in the neural networks are activated in the form of congruence. The architectures, learning ... In this paper a novel class of neural networks called generalized congruence neural networks (GCNN) is proposed. All neurons in the neural networks are activated in the form of congruence. The architectures, learning rules and two algorithms are presented. Simulation results indicate that such network has satisfactory generalization properties near the sample points. Since this kind of neural nets can be easily operated and implemented, it is appropriate to make further research concerning the theory and applications of GCNN. 展开更多
关键词 generalized congruence congruence neuron artificial neural networks recurrence algorithms
暂未订购 下载PDF
An Approach to Carbon Emissions Prediction Using Generalized Regression Neural Network Improved by Genetic Algorithm 认领 引用 被引量：1
19
作者 Zhida Guo Jingyuan Fu 《Electrical Science & Engineering》 2020年第1期4-10,共7页
The study on scientific analysis and prediction of China’s future carbon emissions is conducive to balancing the relationship between economic development and carbon emissions in the new era,and actively responding t... The study on scientific analysis and prediction of China’s future carbon emissions is conducive to balancing the relationship between economic development and carbon emissions in the new era,and actively responding to climate change policy.Through the analysis of the application of the generalized regression neural network(GRNN)in prediction,this paper improved the prediction method of GRNN.Genetic algorithm(GA)was adopted to search the optimal smooth factor as the only factor of GRNN,which was then used for prediction in GRNN.During the prediction of carbon dioxide emissions using the improved method,the increments of data were taken into account.The target values were obtained after the calculation of the predicted results.Finally,compared with the results of GRNN,the improved method realized higher prediction accuracy.It thus offers a new way of predicting total carbon dioxide emissions,and the prediction results can provide macroscopic guidance and decision-making reference for China’s environmental protection and trading of carbon emissions. 展开更多
关键词 Carbon emissions Genetic Algorithm Generalized Regression Neural Network Smooth Factor Prediction
暂未订购 下载PDF
An Improved Algorithm for the Solution of Generalized Burger-Fishers Equation 认领 引用
20
作者 Morufu Oyedunsi Olayiwola 《Applied Mathematics》 2014年第10期1609-1614,共6页
In this paper, an improved algorithm for the solution of Generalized Burger-Fisher’s Equation is presented. A Maple code is generated for the algorithm and simulated. It was observed that the algorithm gives the solu... In this paper, an improved algorithm for the solution of Generalized Burger-Fisher’s Equation is presented. A Maple code is generated for the algorithm and simulated. It was observed that the algorithm gives the solution with less computation. The solution gives a better result when compared with the numerical solutions in the existing literature. 展开更多
关键词 Algorithm PDE MVIM Generalized Burger-Fisher’s Equation
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈