Data-flow errors are prevalent in cyber-physical systems(CPS).Although various approaches based on business process modeling notation(BPMN)have been devised for CPS modeling,the absence of formal specifications compli...Data-flow errors are prevalent in cyber-physical systems(CPS).Although various approaches based on business process modeling notation(BPMN)have been devised for CPS modeling,the absence of formal specifications complicates the verification of data-flow.Formal techniques such as Petri nets are popularly used for identifying data-flow errors.However,due to their interleaving semantics,they suffer from the state-space explosion problem.As an unfolding method for Petri nets,the merged process(MP)technique can well represent concurrency relationships and thus be used to address this issue.Yet generating MP is complex and incurs substantial overhead.By designing and applyingα-deletion rules for Petri nets with data(PNDs),this work simplifies MP,thus resulting in simplified MP(SMP)that is then used to identify data-flow errors.Our approach involves converting a BPMN into a PND and then constructing its SMP.The algorithms are developed to identify data-flow errors,e.g.,redundantdata and lost-data ones.The proposed method enhances the efficiency and effectiveness of identifying data-flow errors in CPS.It is expected to prevent the problems caused by data-flow errors,e.g.,medical malpractice and economic loss in some practical CPS.Its practicality and efficiency of the proposed method through several CPS.Its significant advantages over the state of the art are demonstrated.展开更多
Online social networks are increasingly connecting people around the world.Influence maximization is a key area of research in online social networks,which identifies influential users during information dissemination...Online social networks are increasingly connecting people around the world.Influence maximization is a key area of research in online social networks,which identifies influential users during information dissemination.Most of the existing influence maximization methods only consider the transmission of a single channel,but real-world networks mostly include multiple channels of information transmission with competitive relationships.The problem of influence maximization in an environment involves selecting the seed node set for certain competitive information,so that it can avoid the influence of other information,and ultimately affect the largest set of nodes in the network.In this paper,the influence calculation of nodes is achieved according to the local community discovery algorithm,which is based on community dispersion and the characteristics of dynamic community structure.Furthermore,considering two various competitive information dissemination cases as an example,a solution is designed for self-interested information based on the assumption that the seed node set of competitive information is known,and a novel influence maximization algorithm of node avoidance based on user interest is proposed.Experiments conducted based on real-world Twitter dataset demonstrates the efficiency of our proposed algorithm in terms of accuracy and time against notable influence maximization algorithms.展开更多
基金supported by the National Natural Science Foundation of China(62402415)in part by the Natural Science Foundation of Shandong Province of China(ZR2024MF129)in part by State Key Laboratory of Massive Personalized Customization System and Technology(No.H&C-MPC-2023-02-03).
文摘Data-flow errors are prevalent in cyber-physical systems(CPS).Although various approaches based on business process modeling notation(BPMN)have been devised for CPS modeling,the absence of formal specifications complicates the verification of data-flow.Formal techniques such as Petri nets are popularly used for identifying data-flow errors.However,due to their interleaving semantics,they suffer from the state-space explosion problem.As an unfolding method for Petri nets,the merged process(MP)technique can well represent concurrency relationships and thus be used to address this issue.Yet generating MP is complex and incurs substantial overhead.By designing and applyingα-deletion rules for Petri nets with data(PNDs),this work simplifies MP,thus resulting in simplified MP(SMP)that is then used to identify data-flow errors.Our approach involves converting a BPMN into a PND and then constructing its SMP.The algorithms are developed to identify data-flow errors,e.g.,redundantdata and lost-data ones.The proposed method enhances the efficiency and effectiveness of identifying data-flow errors in CPS.It is expected to prevent the problems caused by data-flow errors,e.g.,medical malpractice and economic loss in some practical CPS.Its practicality and efficiency of the proposed method through several CPS.Its significant advantages over the state of the art are demonstrated.
基金supported by the National Natural Science Foundation of China(Nos.61502209 and 61502207)
文摘Online social networks are increasingly connecting people around the world.Influence maximization is a key area of research in online social networks,which identifies influential users during information dissemination.Most of the existing influence maximization methods only consider the transmission of a single channel,but real-world networks mostly include multiple channels of information transmission with competitive relationships.The problem of influence maximization in an environment involves selecting the seed node set for certain competitive information,so that it can avoid the influence of other information,and ultimately affect the largest set of nodes in the network.In this paper,the influence calculation of nodes is achieved according to the local community discovery algorithm,which is based on community dispersion and the characteristics of dynamic community structure.Furthermore,considering two various competitive information dissemination cases as an example,a solution is designed for self-interested information based on the assumption that the seed node set of competitive information is known,and a novel influence maximization algorithm of node avoidance based on user interest is proposed.Experiments conducted based on real-world Twitter dataset demonstrates the efficiency of our proposed algorithm in terms of accuracy and time against notable influence maximization algorithms.
