检索结果-南通市图书馆

Dynamic Evolutionary Game-based Modeling,Analysis and Performance Enhancement of Blockchain Channels

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2023年第1期10卷 188-202页

作者： PeiYun Zhang MengChu Zhou ChenXi Li abdullah abusorrah IEEE the School of Computer Science Nanjing University of Information Science&TechnologyNanjing 210044China the Helen and John C.Hartmann Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA the School of Computer and Information Anhui Normal UniversityWuhu 241003China the Department of Electrical and Computer Engineering Faculty of Engineeringand Center of Research Excellence in Renewable Energy and Power SystemsKing Abdulaziz UniversityJeddah 21481Saudi Arabia

The recent development of channel technology has promised to reduce the transaction verification time in blockchain *** transactions are transmitted through the channels created by nodes,the nodes need to cooperate with each *** one party refuses to do so,the channel is unstable.A stable channel is thus *** nodes may show uncooperative behavior,they may have a negative impact on the stability of such *** order to address this issue,this work proposes a dynamic evolutionary game model based on node *** model considers various defense strategies'cost and attack success ratio under *** can dynamically adjust their strategies according to the behavior of attackers to achieve their effective *** equilibrium stability of the proposed model can be *** proposed model can be applied to general channel *** is compared with two state-of-the-art blockchain channels:Lightning network and Spirit *** experimental results show that the proposed model can be used to improve a channel's stability and keep it in a good cooperative stable *** its use enables a blockchain to enjoy higher transaction success ratio and lower transaction transmission delay than the use of its two peers.

关键词： Blockchain channel network evolutionary game malicious behavior secure computing stability analysis

Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling Problem

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2021年第6期8卷 1199-1209页

作者： Ziyan Zhao Shixin Liu MengChu Zhou abdullah abusorrah State Key Laboratory of Synthetical Automation for Process Industries and the College of Information Science and Engineering Northeastern UniversityShenyang 110819China Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewark NJ 07102 USA Center of Research Excellence in Renewable Energy and Power Systems King Abdulaziz UniversityJeddah 21481Saudi Arabia Department of Electrical and Computer Engineering Faculty of Engineeringand Center of Research Excellence in Renewable Energy and Power SystemsKing Abdulaziz UniversityJeddah 21481Saudi Arabia

Group scheduling problems have attracted much attention owing to their many practical *** work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time,release time,and due *** is originated from an important industrial process,i.e.,wire rod and bar rolling process in steel production *** objective functions,i.e.,the number of late jobs and total setup time,are minimized.A mixed integer linear program is established to describe the *** obtain its Pareto solutions,we present a memetic algorithm that integrates a population-based nondominated sorting genetic algorithm II and two single-solution-based improvement methods,i.e.,an insertion-based local search and an iterated greedy *** computational results on extensive industrial data with the scale of a one-week schedule show that the proposed algorithm has great performance in solving the concerned problem and outperforms its *** high accuracy and efficiency imply its great potential to be applied to solve industrial-size group scheduling problems.

关键词： Insertion-based local search iterated greedy algorithm machine learning memetic algorithm nondominated sorting genetic algorithm II(NSGA-II) production scheduling

Fine-Grained Resource Provisioning and Task Scheduling for Heterogeneous Applications in Distributed Green Clouds

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2020年第5期7卷 1380-1393页

作者： Haitao Yuan Meng Chu Zhou Qing Liu abdullah abusorrah Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA Department of Electrical and Computer Engineering Faculty of Engineeringand the Center of Research Excellence in Renewable Energy and Power SystemsKing Abdulaziz UniversityJeddah 21589Saudi Arabia IEEE

An increasing number of enterprises have adopted cloud computing to manage their important business applications in distributed green cloud(DGC)systems for low response time and high cost-effectiveness in recent *** scheduling and resource allocation in DGCs have gained more attention in both academia and industry as they are costly to manage because of high energy *** factors in DGCs,e.g.,prices of power grid,and the amount of green energy express strong spatial *** dramatic increase of arriving tasks brings a big challenge to minimize the energy cost of a DGC provider in a market where above factors all possess spatial *** work adopts a G/G/1 queuing system to analyze the performance of servers in *** on it,a single-objective constrained optimization problem is formulated and solved by a proposed simulated-annealing-based bees algorithm(SBA)to find SBA can minimize the energy cost of a DGC provider by optimally allocating tasks of heterogeneous applications among multiple DGCs,and specifying the running speed of each server and the number of powered-on servers in each GC while strictly meeting response time limits of tasks of all *** databased experimental results prove that SBA achieves lower energy cost than several benchmark scheduling methods do.

关键词： Bees algorithm data centers distributed green cloud(DGC) energy optimization intelligent optimization simulated annealing task scheduling machine learning

Disassembly Sequence Planning:A Survey

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2021年第7期8卷 1308-1324页

作者： Xiwang Guo MengChu Zhou abdullah abusorrah Fahad Alsokhiry Khaled Sedraoui the College of Computer and Communication Engineering Liaoning Shihua UniversityFushun 113001China the Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewark NJ 07102 USA the Center of Research Excellence in Renewable Energy and Power Systems King Abdulaziz UniversityJeddah 21481Saudi Arabia the Department of Electrical and Computer Engineering Faculty of Engineeringand the Center of Research Excellence in Renewable Energy and Power SystemsKing Abdulaziz UniversityJeddah 21481Saudi Arabia

It is well-recognized that obsolete or discarded products can cause serious environmental pollution if they are poorly be *** contain reusable resource that can be recycled and used to generate desired economic ***,performing their efficient disassembly is highly important in green manufacturing and sustainable economic *** typical examples are electronic appliances and electromechanical/mechanical *** paper presents a survey on the state of the art of disassembly sequence *** can help new researchers or decision makers to search for the right solution for optimal disassembly *** reviews the disassembly theory and methods that are applied for the processing,repair,and maintenance of obsolete/discarded *** paper discusses the recent progress of disassembly sequencing planning in four major aspects:product disassembly modeling methods,mathematical programming methods,artificial intelligence methods,and uncertainty *** survey should stimulate readers to be engaged in the research,development and applications of disassembly and remanufacturing methodologies in the Industry 4.0 era.

关键词： Artificial intelligence(AI) disassembly sequence planning(DSP) intelligent optimization modeling methods multiobjective optimization single-objective optimization uncertainty.

Evolutionary Optimization Methods for High-Dimensional Expensive Problems:A Survey

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第5期11卷 1092-1105页

作者： MengChu Zhou Meiji Cui Dian Xu Shuwei Zhu Ziyan Zhao abdullah abusorrah Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA School of Information and Electronic Engineering Zhejiang Gongshang UniversityHangzhou 310018China School of Intelligent Manufacturing Nanjing University of Science and TechnologyNanjing 210094China Institute of Systems Engineering Macao University of Science and TechnologyMacao 999078China School of Artificial Intelligence and Computer Jiangnan UniversityWuxi 214122China School of Information Science and Engineering Northeastern UniversityShenyang 110819China Center of Research Excellence in Renewable Energy and Power Systems Department of Electrical and Computer EngineeringFaculty of EngineeringKing Abdulaziz UniversityJeddah 21589Saudi Arabia K.A.CARE Energy Research and Innovation Center King Abdulaziz UniversityJeddah 21589Saudi Arabia

Evolutionary computation is a rapidly evolving field and the related algorithms have been successfully used to solve various real-world optimization *** past decade has also witnessed their fast progress to solve a class of challenging optimization problems called high-dimensional expensive problems(HEPs).The evaluation of their objective fitness requires expensive resource due to their use of time-consuming physical experiments or computer ***,it is hard to traverse the huge search space within reasonable resource as problem dimension *** evolutionary algorithms(EAs)tend to fail to solve HEPs competently because they need to conduct many such expensive evaluations before achieving satisfactory *** reduce such evaluations,many novel surrogate-assisted algorithms emerge to cope with HEPs in recent *** there lacks a thorough review of the state of the art in this specific and important *** paper provides a comprehensive survey of these evolutionary algorithms for *** start with a brief introduction to the research status and the basic concepts of ***,we present surrogate-assisted evolutionary algorithms for HEPs from four main *** also give comparative results of some representative algorithms and application ***,we indicate open challenges and several promising directions to advance the progress in evolutionary optimization algorithms for HEPs.

关键词： computer optimization evolutionary

A Bi-population Cooperative Optimization Algorithm Assisted by an Autoencoder for Medium-scale Expensive Problems

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2022年第11期9卷 1952-1966页

作者： Meiji Cui Li Li MengChu Zhou Jiankai Li abdullah abusorrah Khaled Sedraoui IEEE the School of Intelligent Manufacturing Nanjing University of Science and TechnologyNanjing 210094China the Department of Electronics and Information Engineering Tongji UniversityShanghai 201804China the Helen and John C.Hartmann Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA Center of Research Excellence in Renewable Energy and Power Systems Department of Electrical and Computer EngineeringFaculty of Engineeringand K.A.CARE Energy Research and Innovation CenterKing Abdulaziz UniversityJeddah 21589Saudi Arabia

This study presents an autoencoder-embedded optimization(AEO)algorithm which involves a bi-population cooperative strategy for medium-scale expensive problems(MEPs).A huge search space can be compressed to an informative lowdimensional space by using an autoencoder as a dimension reduction *** search operation conducted in this low space facilitates the population with fast convergence towards the *** strike the balance between exploration and exploitation during optimization,two phases of a tailored teaching-learning-based optimization(TTLBO)are adopted to coevolve solutions in a distributed fashion,wherein one is assisted by an autoencoder and the other undergoes a regular evolutionary ***,a dynamic size adjustment scheme according to problem dimension and evolutionary progress is proposed to promote information exchange between these two phases and accelerate evolutionary convergence *** proposed algorithm is validated by testing benchmark functions with dimensions varying from 50 to *** indicated in our experiments,TTLBO is suitable for dealing with medium-scale problems and thus incorporated into the AEO framework as a base *** with the state-of-the-art algorithms for MEPs,AEO shows extraordinarily high efficiency for these challenging problems,t hus opening new directions for various evolutionary algorithms under AEO to tackle MEPs and greatly advancing the field of medium-scale computationally expensive optimization.

关键词： Autoencoder dimension reduction evolutionary algorithm medium-scale expensive problems teaching-learning-based optimization

Deadlock-free Supervisor Design for Robotic Manufacturing Cells With Uncontrollable and Unobservable Events

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2021年第3期8卷 597-605页

作者： Bo Huang MengChu Zhou Cong Wang abdullah abusorrah Yusuf Al-Turki School of Computer Science and Engineering Nanjing University of Science and TechnologyNanjing 210094China Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA the Center of Research Excellence in Renewable Energy and Power Systems and the Department of Electrical and Computer Engineering King Abdulaziz UniversityJeddah 21589Saudi Arabia

In this paper,a deadlock prevention policy for robotic manufacturing cells with uncontrollable and unobservable events is proposed based on a Petri net ***,a Petri net for the deadlock control of such systems is *** admissible markings and first-met inadmissible markings(FIMs)are ***,place invariants are designed via an integer linear program(ILP)to survive all admissible markings and prohibit all FIMs,keeping the underlying system from reaching deadlocks,livelocks,bad markings,and the markings that may evolve into them by firing uncontrollable *** also ensures that the obtained deadlock-free supervisor does not observe any unobservable *** addition,the supervisor is guaranteed to be admissible and structurally minimal in terms of both control places and added *** condition under which the supervisor is maximally permissive in behavior is ***,experimental results with the proposed method and existing ones are given to show its effectiveness.

关键词： Deadlock prevention Petri nets robotic manufacturing cells structure-minimized supervisor supervisory control uncontrollability unobservability

Analysis of Evolutionary Social Media Activities: Pre-Vaccine and Post-Vaccine Emergency Use

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2023年第4期10卷 1090-1092页

作者： Haoyue Liu MengChu Zhou Xiaoyu Lu abdullah abusorrah Yusuf Al-Turki Department New Jersey Institute of TechnologyNewark 07102 USA ECE Department New Jersey Institute of TechnologyNewark 07102 USA School of Cyber Science and Engineering Nanjing University of Science and TechnologyNanjing 210014China ECE Department King Abdulaziz UniversityJeddah 21589Saudi Arabia

Dear Editor,In this letter,we analyze the public discourse sentiments over time and seek to understand the salient patterns around COVID-19 vaccines and vaccination from social media ***,more than 373 million people have been diagnosed with COVID-19 and 5.66 million have died from this disease by *** continues to have a negative impact on human daily life and the global economic development till now,due to the lack of effective treatment of COVID-19 induced issues and prevention of transmission methods.

关键词： discourse methods prevention

A Novel Multiobjective Fireworks Algorithm and Its Applications to Imbalanced Distance Minimization Problems

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1476-1489页

作者： Shoufei Han Kun Zhu MengChu Zhou Xiaojing Liu Haoyue Liu Yusuf Al-Turki abdullah abusorrah College of Computer Science and Technology Nanjing University of Aeronautics and Astronauticsand also with the Collaborative Innovation Center of Novel Software Technology and IndustrializationNanjing 211106China Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewark NJ 07102 USA Center of Research Excellence in Renewable Energy and Power Systems Department of Electrical and Computer EngineeringFaculty of Engineeringand also with the K.A.CARE Energy Research and Innovation CenterKing Abdulaziz UniversityJeddah 21589Saudi Arabia

Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing *** goal is to find a Pareto front and as many equivalent Pareto optimal solutions as *** some evolutionary algorithms for them have been proposed,they mainly focus on the convergence rate in the decision space while ignoring solutions *** this paper,we propose a new multiobjective fireworks algorithm for them,which is able to balance exploitation and exploration in the decision *** first extend a latest single-objective fireworks algorithm to handle *** we make improvements by incorporating an adaptive strategy and special archive guidance into it,where special archives are established for each firework,and two strategies(i.e.,explosion and random strategies)are adaptively selected to update the positions of sparks generated by fireworks with the guidance of special ***,we compare the proposed algorithm with eight state-of-the-art multimodal multiobjective algorithms on all 22 MMOPs from CEC2019 and several imbalanced distance minimization *** results show that the proposed algorithm is superior to compared algorithms in solving ***,its runtime is less than its peers'.

关键词： Adaptive strategy fireworks algorithm multimodal multiobjective optimization problems(MMOP)