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

13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)

作者： Bi, Xia-an Sun, Qi Hunan Normal Univ Coll Math & Comp Sci Changsha 410081 Hunan Peoples R China

ISBN: (纸本)9781538621653

This paper presents an evolutionary game model and proposes a dynamic evolutionary algorithm based on the model. We use the game model with numerous populations to analyze the dynamic selection course of the virtual routers running on multiprocessor systems, and the evolutionary equilibrium is regarded as the solution to this game. Our dynamic evolutionary algorithm is designed with the ability to make the whole system to converge at a stable state. The algorithm is equalizing on an equilibrium fixed point, in which each virtual router tries different processors, and changes the processor selection until a stable proportion distribution is formed. The experimental results show that the dynamic evolutionary approach has very fast convergence speed and is able to effectively balance loads among processors, guarantee fair usage of computing resources among virtual routers and maintain stable high-throughputs of the system.

关键词： Virtual Routers Multiprocessor dynamic evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

A dynamic multi-objective optimization model for inner-industry carbon responsibility allocation based on carbon tax and carbon offsets accounting

引用

APPLIED ENERGY 2025年 377卷

作者： Zhang, Linzi Shi, Yong Commun Univ China Sch Econ & Management Beijing 100024 Peoples R China Chinese Acad Sci Res Ctr Fictitious Econ & Data Sci Beijing 100190 Peoples R China Univ Nebraska Coll Informat Sci & Technol Omaha NE 68182 USA

The setting of Intergovernmental Panel on Climate Change (IPCC) raises concerns on curbing the excessive carbon emissions, and European Union (EU) has been proactively attempting "green"initiatives striving to achieve carbon neutrality. The current Carbon Border Adjustment Mechanism (CBAM) only works on shortterm carbon reduction without much "greenness"investment incentives so far, and few studies focus on the long-standing inner-industrial carbon reduction coordination. To address these issues, this paper creatively presents a dynamic multi-objective carbon responsibility allocation model (CRAM) for EU carbon market, allows the carbon trade with a taxation based on carbon offsets accounting, and considers the final targets of sustainable "greenness"investment incentives. To find the optimal results of the designed dynamic CRAM, an improved KT-NSGA-II algorithm is proposed to detect the Pareto frontiers of each successive periods. Data from EU Cement and Aluminium industries are then selected for empirical analysis to compare the proposed CRAM to conventional CBAM model. The findings demonstrate that the superiority of CRAM in carbon emissions reduction, economic benefits improvement and green invests encouragement. With the adjustment of the inner- industrial carbon allowance trade, total carbon emissions decreased by 28.03% and the "greenness"investment initiative increased by 39.24% in contrast to the CBAM. The sensitivity analysis of the model also provides suggestions on the settings of carbon quota and tax with different industrial production process, and proposes policy recommendations for CRAM implementation.

关键词： Sustainable carbon reduction Multi-objective optimization dynamic evolutionary algorithm Carbon taxation Carbon quota accounting

来源：评论

学校读者我要写书评

暂无评论

The dynamic Role Mining Problem: Role Mining in dynamically Changing Business Environments 13th

The Dynamic Role Mining Problem: Role Mining in Dynamically ...

引用

13th International Joint Conference on Computational Intelligence (IJCCI) / 13th International Conference on evolutionary Computation Theory and Applications (ECTA)

作者： Anderer, Simon Kempter, Tobias Scheuermann, Bernd Mostaghim, Sanaz Hsch Karlsruhe Fac Management Sci & Engn Moltkestr 30 Karlsruhe Germany Otto von Guericke Univ Inst Intelligent Cooperating Syst Magdeburg Germany

ISBN: (纸本)9789897585340

Role Based Access Control is one of the most frequently used concepts for authorization management in today's business landscapes. The corresponding optimization problem, the so-called Role Mining Problem (RMP), which was shown to be NP-complete, relies in finding a minimal set of roles and a corresponding assignment of those roles to users based on a static user permission assignment. However, as job duties, positions and responsibilities of users in companies constantly change, the corresponding user permission assignment is also subject to changes. Thus, the RMP in its present form has to be extended by dynamically occurring events, representing the changes in business environments. This paper defines the dynamic Role Mining Problem (DynRMP) and presents the most relevant events from business perspective as well as their algorithmic implications for the RMP. Furthermore, several methods to include those events into the framework of an evolutionary algorithm, which is a suitable solution strategy for the RMP, are presented and evaluated in a range of experiments.

关键词： Role Based Access Control dynamic Role Mining Problem dynamic evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

Advancing dynamic evolutionary Optimization Using In-Memory Database Technology 20th

Advancing Dynamic Evolutionary Optimization Using In-Memory ...

引用

20th European Conference on the Applications of evolutionary Computation (EvoApplications)

作者： Jordan, Julia Cheng, Wei Scheuermann, Bernd Univ Appl Sci Hsch Karlsruhe Karlsruhe Germany CAS Software AG Karlsruhe Germany SAP Innovat Ctr Network Potsdam Germany

ISBN: (纸本)9783319557922;9783319557915

This paper reports on IMDEA (In-Memory database dynamic evolutionary algorithm), an approach to dynamic evolutionary optimization exploiting in-memory database (IMDB) technology to expedite the search process subject to change events arising at runtime. The implemented system benefits from optimization knowledge persisted on an IMDB serving as associative memory to better guide the optimizer through changing environments. For this, specific strategies for knowledge processing, extraction and injection are developed and evaluated. Moreover, prediction methods are embedded and empirical studies outline to which extent these methods are able to anticipate forthcoming dynamic change events by evaluating historical records of previous changes and other optimization knowledge managed by the IMDB.

关键词： dynamic evolutionary algorithm Associative memory Prediction In-memory databases

来源：评论

学校读者我要写书评

暂无评论

Optimization of Fuzzy Controller Based on dynamic evolutionary algorithm

Optimization of Fuzzy Controller Based on Dynamic Evolutiona...

引用

2010 International Conference on Intelligent Computing and Cognitive Informatics (ICICCI 2010)

作者： ZENG Hui School of Computer Science Wuhan University Wuhan,ChinaLI Yuanxiang State Key Laboratory of Software Engineering Wuhan University Wuhan,ChinaXIA Xuewen Dept of Computer and Information Science Xiaogan College Xiaogan,China

The performance of fuzzy control is depends on the fuzzy control rules,quantification factor and the scale factor,because of these multiple objectives are influenced with each ***,it is very difficult to ensure the control effect only rely on expertise's *** this paper,we propose a dynamic evolutionary algorithm to optimize the fuzzy controller's multi-objectives based on the competitive relationship between particles' free energy and entropy in the phase space system.A new option strategy is put forward to maintain species diversity,and multi-parent crossover operator select some individuals to form a space and then do searching in this *** algorithm has strong ability to find the solution of the problem,and it also faster compared with other traditional *** results show that fuzzy controller optimized by our algorithm has good steady-state response time,steadystate error and overshoot.

关键词： fuzzy control dynamic evolutionary algorithm multi-parent crossover multiobjectives optimization

来源：评论

学校读者我要写书评

暂无评论

AES algorithm for dynamic Knapsack Problems in Capital Budgeting

AES algorithm for Dynamic Knapsack Problems in Capital Budge...

引用

22nd Chinese Control and Decision Conference

作者： Cui, Xiaoling Wang, Dazhi Yan, Yang Liaoning Shihua Univ Sch Econ & Management Fushun 113001 Peoples R China Northeastern Univ Sch Informat Sci & Engn Shenyang 110004 Peoples R China

ISBN: (纸本)9781424451821

dynamic knapsack problems can model many economic phenomenon, such as capital budgeting. An agent based evolutionary search algorithm (AES) is proposed to solve a set of DKP problems which are generated according to dual mapping mechanism. Existing in a grid-like environment, all agents shall compete with their neighborhood to enhance their energy and acquire knowledge through Population-Based Incremental Learning. At the same time, triggered random immigration scheme is introduced into the algorithm to maintain the diversity of the population. Simulation results on a set of dynamic knapsack problems and 1-test showed that AES with triggered random immigration scheme can obtain a better performance than several other similar genetic algorithms.

关键词： Capital budgeting dynamic knapsack problem dynamic evolutionary algorithm Agent

来源：评论

学校读者我要写书评

暂无评论

AES algorithm for dynamic Knapsack Problems in Capital Budgeting

AES algorithm for Dynamic Knapsack Problems in Capital Budge...

引用

The 22nd China Control and Decision Conference(2010年中国控制与决策会议)

作者： Xiaoling Cui Dazhi Wang Yang Yan School of Economics and Management Liaoning Shihua University Fushun 113001 School of Information Science and Engineering Northeastern University Shenyang 110004

ISBN: (纸本)9781424451814;9781424451821

dynamic knapsack problems can model many economic phenomenon, such as capital budgeting. An agent based evolutionary search algorithm (AES) is proposed to solve a set of DKP problems which are generated according to dual mapping mechanism. Existing in a grid-like environment, all agents shall compete with their neighborhood to enhance their energy and acquire knowledge through Population-Based Incremental Learning. At the same time, triggered random immigration scheme is introduced into the algorithm to maintain the diversity of the population. Simulation results on a set of dynamic knapsack problems and t-test showed that AES with triggered random immigration scheme can obtain a better performance than several other similar genetic algorithms.

关键词： Capital budgeting dynamic knapsack problem dynamic evolutionary algorithm Agent

来源：评论

学校读者我要写书评

暂无评论

AES algorithm for dynamic Knapsack Problems in Capital Budgeting

AES algorithm for Dynamic Knapsack Problems in Capital Budge...

引用

2010 Chinese Control and Decision Conference

作者： Xiaoling Cui~1,Dazhi Wang~2,Yang Yan~2 1.School of Economics and Management,Liaoning Shihua University,Fushun,113001 2.School of Information Science and Engineering,Northeastern University,Shenyang,110004

dynamic knapsack problems can model many economic phenomenon,such as capital *** agent based evolutionary search algorithm(AES) is proposed to solve a set of DKP problems which are generated according to dual mapping *** in a grid-like environment,all agents shall compete with their neighborhood to enhance their energy and acquire knowledge through Population-Based Incremental *** the same time, triggered random immigration scheme is introduced into the algorithm to maintain the diversity of the population. Simulation results on a set of dynamic knapsack problems and /-test showed that AES with triggered random immigration scheme can obtain a better performance than several other similar genetic algorithms.

关键词： Capital budgeting dynamic knapsack problem dynamic evolutionary algorithm Agent

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：