Accurate prediction of future events brings great benefits and reduces losses for society in many domains,such as civil unrest,pandemics,and crimes.Knowledge graph is a general language for describing and modeling com...Accurate prediction of future events brings great benefits and reduces losses for society in many domains,such as civil unrest,pandemics,and crimes.Knowledge graph is a general language for describing and modeling complex systems.Different types of events continually occur,which are often related to historical and concurrent events.In this paper,we formalize the future event prediction as a temporal knowledge graph reasoning problem.Most existing studies either conduct reasoning on static knowledge graphs or assume knowledges graphs of all timestamps are available during the training process.As a result,they cannot effectively reason over temporal knowledge graphs and predict events happening in the future.To address this problem,some recent works learn to infer future events based on historical eventbased temporal knowledge graphs.However,these methods do not comprehensively consider the latent patterns and influences behind historical events and concurrent events simultaneously.This paper proposes a new graph representation learning model,namely Recurrent Event Graph ATtention Network(RE-GAT),based on a novel historical and concurrent events attention-aware mechanism by modeling the event knowledge graph sequence recurrently.More specifically,our RE-GAT uses an attention-based historical events embedding module to encode past events,and employs an attention-based concurrent events embedding module to model the associations of events at the same timestamp.A translation-based decoder module and a learning objective are developed to optimize the embeddings of entities and relations.We evaluate our proposed method on four benchmark datasets.Extensive experimental results demonstrate the superiority of our RE-GAT model comparing to various base-lines,which proves that our method can more accurately predict what events are going to happen.展开更多
The theory and experiment of quantum information have been studied extensively in recent years,and the feasibility of quantum communication has been proved.Although the fundamental technology is not yet mature,researc...The theory and experiment of quantum information have been studied extensively in recent years,and the feasibility of quantum communication has been proved.Although the fundamental technology is not yet mature,research on quantum internet should be conducted.To implement quantum internet,an architecture that describes how quantum nodes are linked to form networks and how protocol functions are vertically composed need to be developed urgently.In this paper,we present a novel design of a clusterbased structure to describe how quantum nodes are interconnected,and how the structure can improve the performance of qubit transmission and reduce the network complexity.The idea of the quantum local area network(QLAN)is proposed as an essential component of the quantum internet.Besides,each quantum repeater links to neighboring repeaters to form a core network,and multiple QLANs are connected through the core network.The core network can be grouped into different hierarchical quantum repeater networks according to needed service requirements.For the sake of interoperability and fast prototyping,we adopt the idea of OSI layering model of the current Internet in the design of quantum internet.Finally,we elaborate on the composition of quantum nodes and the realization of end-to-end communication.展开更多
Policy conflicts may cause substantial economic losses.Although a large amount of effort has been spent on detecting intra-domain policy conflict,it can not detect conflicts of heterogeneous policies.In this paper,con...Policy conflicts may cause substantial economic losses.Although a large amount of effort has been spent on detecting intra-domain policy conflict,it can not detect conflicts of heterogeneous policies.In this paper,considering background knowledge,we propose a conflict detection mechanism to search and locate conflicts of heterogeneous policies.First,we propose a general access control model to describe authorization mechanisms of cloud service and a translation scheme designed to translate a cloud service policy to an Extensible Access Control Markup Language(XACML)policy.Then the scheme based on Multi-terminal Multi-data-type Interval Decision Diagram(MTMIDD)and Extended MTMIDD(X-MTMIDD)is designed to represent XACML policy and search the conflict among heterogeneous policies.To reduce the rate of false positives,the description logic is used to represent XACML policy and eliminate false conflicts.Experimental results show the efficiency of our scheme.展开更多
Robust 3D mesh watermarking is a traditional research topic in computer graphics,which provides an efficient solution to the copyright protection for 3D meshes.Traditionally,researchers need manually design watermarki...Robust 3D mesh watermarking is a traditional research topic in computer graphics,which provides an efficient solution to the copyright protection for 3D meshes.Traditionally,researchers need manually design watermarking algorithms to achieve suffcient robustness for the actual application scenarios.In this paper,we propose the first deep learning-based 3D mesh watermarking network,which can provide a more general framework for this problem.In detail,we propose an end-to-end network,consisting of a watermark embedding sub-network,a watermark extracting sub-network and attack layers.We employ the topology-agnostic graph convolutional network(GCN)as the basic convolution operation,therefore our network is not limited by registered meshes(which share a fixed topology).For the specific application scenario,we can integrate the corresponding attack layers to guarantee adaptive robustness against possible attacks.To ensure the visual quality of watermarked 3D meshes,we design the curvature consistency loss function to constrain the local geometry smoothness of watermarked meshes.Experimental results show that the proposed method can achieve more universal robustness while guaranteeing comparable visual quality.展开更多
Leakage assessment is the most common approach applied for assessing side-channel information leakage and validating the effectiveness of side-channel countermeasures.Established evaluation approaches are usually base...Leakage assessment is the most common approach applied for assessing side-channel information leakage and validating the effectiveness of side-channel countermeasures.Established evaluation approaches are usually based on Test Vector Leakage Assessment(TVLA)that deployed in a divide and conquer flow with offline computations,which causes two apparent shortcomings in required memory and time.In this paper,a lightweight framework of online leakage assessment is proposed.The problems were analyzed and the evaluation approach was further validated with a Field Programmable Gate Array(FPGA).The experimental results show that it can implement online processing on newly collected data,and instantly stop to give the result when detecting credible leakage.The online leakage assessment can significantly economize on memory and time.It has good performance when there is limited memory or real-time evaluations are needed.展开更多
基金supported by the National Natural Science Foundation of China under grants U19B2044National Key Research and Development Program of China(2021YFC3300500).
文摘Accurate prediction of future events brings great benefits and reduces losses for society in many domains,such as civil unrest,pandemics,and crimes.Knowledge graph is a general language for describing and modeling complex systems.Different types of events continually occur,which are often related to historical and concurrent events.In this paper,we formalize the future event prediction as a temporal knowledge graph reasoning problem.Most existing studies either conduct reasoning on static knowledge graphs or assume knowledges graphs of all timestamps are available during the training process.As a result,they cannot effectively reason over temporal knowledge graphs and predict events happening in the future.To address this problem,some recent works learn to infer future events based on historical eventbased temporal knowledge graphs.However,these methods do not comprehensively consider the latent patterns and influences behind historical events and concurrent events simultaneously.This paper proposes a new graph representation learning model,namely Recurrent Event Graph ATtention Network(RE-GAT),based on a novel historical and concurrent events attention-aware mechanism by modeling the event knowledge graph sequence recurrently.More specifically,our RE-GAT uses an attention-based historical events embedding module to encode past events,and employs an attention-based concurrent events embedding module to model the associations of events at the same timestamp.A translation-based decoder module and a learning objective are developed to optimize the embeddings of entities and relations.We evaluate our proposed method on four benchmark datasets.Extensive experimental results demonstrate the superiority of our RE-GAT model comparing to various base-lines,which proves that our method can more accurately predict what events are going to happen.
基金supported in part by the Natural Science Foundation of China (62102386, 62002334,62072421, 62121002)Fundamental Research Funds for the Central Universities (WK2100000018,WK2100000011)+1 种基金Exploration Fund Project of University of Science and Technology of China (YD3480 002001)Open Fund of Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation。
基金supported in part by Anhui Initiative in Quantum Information Technologies under grant No.AHY150300Youth Innovation Promotion Association Chinese Academy of Sciences(CAS)under grant No.Y202093。
文摘The theory and experiment of quantum information have been studied extensively in recent years,and the feasibility of quantum communication has been proved.Although the fundamental technology is not yet mature,research on quantum internet should be conducted.To implement quantum internet,an architecture that describes how quantum nodes are linked to form networks and how protocol functions are vertically composed need to be developed urgently.In this paper,we present a novel design of a clusterbased structure to describe how quantum nodes are interconnected,and how the structure can improve the performance of qubit transmission and reduce the network complexity.The idea of the quantum local area network(QLAN)is proposed as an essential component of the quantum internet.Besides,each quantum repeater links to neighboring repeaters to form a core network,and multiple QLANs are connected through the core network.The core network can be grouped into different hierarchical quantum repeater networks according to needed service requirements.For the sake of interoperability and fast prototyping,we adopt the idea of OSI layering model of the current Internet in the design of quantum internet.Finally,we elaborate on the composition of quantum nodes and the realization of end-to-end communication.
基金This work has been funded by the National Natural Science Foundation of China(No.U1836203)the Shandong Provincial Key Research and Development Program(2019JZZY20127).
文摘Policy conflicts may cause substantial economic losses.Although a large amount of effort has been spent on detecting intra-domain policy conflict,it can not detect conflicts of heterogeneous policies.In this paper,considering background knowledge,we propose a conflict detection mechanism to search and locate conflicts of heterogeneous policies.First,we propose a general access control model to describe authorization mechanisms of cloud service and a translation scheme designed to translate a cloud service policy to an Extensible Access Control Markup Language(XACML)policy.Then the scheme based on Multi-terminal Multi-data-type Interval Decision Diagram(MTMIDD)and Extended MTMIDD(X-MTMIDD)is designed to represent XACML policy and search the conflict among heterogeneous policies.To reduce the rate of false positives,the description logic is used to represent XACML policy and eliminate false conflicts.Experimental results show the efficiency of our scheme.
基金supported in part by the Natural Science Foundation of China underGrant 62072421,62002334,62102386,62121002 and U20B2047Anhui Science Foundation of China under Grant 2008085QF296+1 种基金Exploration Fund Project of University of Science and Technology of China under Grant YD3480002001by Fundamental Research Funds for the Central Universities WK5290000001.
文摘Robust 3D mesh watermarking is a traditional research topic in computer graphics,which provides an efficient solution to the copyright protection for 3D meshes.Traditionally,researchers need manually design watermarking algorithms to achieve suffcient robustness for the actual application scenarios.In this paper,we propose the first deep learning-based 3D mesh watermarking network,which can provide a more general framework for this problem.In detail,we propose an end-to-end network,consisting of a watermark embedding sub-network,a watermark extracting sub-network and attack layers.We employ the topology-agnostic graph convolutional network(GCN)as the basic convolution operation,therefore our network is not limited by registered meshes(which share a fixed topology).For the specific application scenario,we can integrate the corresponding attack layers to guarantee adaptive robustness against possible attacks.To ensure the visual quality of watermarked 3D meshes,we design the curvature consistency loss function to constrain the local geometry smoothness of watermarked meshes.Experimental results show that the proposed method can achieve more universal robustness while guaranteeing comparable visual quality.
基金The authors would like to thank Information Science Laboratory Center of USTC for the hardware/software services.This work was supported by National Natural Science Foundation of China(Nos.61972370 and 61632013)Fundamental Research Funds for Central Universities in China(No.WK3480000007).
文摘Leakage assessment is the most common approach applied for assessing side-channel information leakage and validating the effectiveness of side-channel countermeasures.Established evaluation approaches are usually based on Test Vector Leakage Assessment(TVLA)that deployed in a divide and conquer flow with offline computations,which causes two apparent shortcomings in required memory and time.In this paper,a lightweight framework of online leakage assessment is proposed.The problems were analyzed and the evaluation approach was further validated with a Field Programmable Gate Array(FPGA).The experimental results show that it can implement online processing on newly collected data,and instantly stop to give the result when detecting credible leakage.The online leakage assessment can significantly economize on memory and time.It has good performance when there is limited memory or real-time evaluations are needed.