Bundle recommendation is provided to users by combining related items into a bundle, enhancing the user's shopping experience and increase the merchant's sales revenue. Despite the success of existing solutions based on Graph Neural Networks(GNN), there are still some significant challenges: (1)It is demanding to explicitly model multiple complex associations using standard graph neural networks. (2)Numerous additional nodes and edges are introduced to approximate higher-order associations. (3)The user-bundle historical interaction data is highly sparse. In this work, we propose a Global Structural Hypergraph Convolution model for Bundle Recommendation (SHCBR) to address the above problems. Specifically, we jointly incorporate multiple complex interactions between users, items, and bundles(three entities) into a relational hypergraph without introducing additional nodes and edges. Higher-order associations are already involved in the hypergraph structure which alleviate the training burden of neural networks and the dilemma of scarce data. In addition, we design a special matrix propagation rule that captures non-pairwise complex relationships between entities. Using item nodes as links, hypergraph convolution propagation between user and bundle nodes generates the learned representations. Experimental results on two real-world datasets demonstrate that SHCBR outperforms the state-of-the-art baselines by 11.07%-25.66\% on Recall and 16.81%-33.53% on NDCG. We publicly release the codes and datasets at https://github.com/Lxtdzh/SHCBR-master/.

Recent years have witnessed a rapid growth of code-reuse attacks in advance persistent threats and cyberspace crimes. Carefully crafted code-reuse exploits circumvent modern protection mechanisms and hijack the execution flow of a program to perform expected functionalities by chaining together existing codes. The sophistication and intrication of code-reuse exploits hinder the scrutinization and dissection on them. Although the previous literature has introduced some feasible approaches, effectiveness and reliability in practical applications remain severe challenges. To address this issue, we propose Horus, a data-driven framework for effective and reliable detection on code-reuse exploits. In order to raise the effectiveness against underlying noises, we comprehensively leverage the strengths of time-series and frequency-domain analysis, and propose a learning-based detector that synthesizes the contemporary twofold features. Then we employ a lightweight interpreter to speculatively and tentatively translate the suspicious bytes to open the black box and enhance the reliability and interpretability. Additionally, a functionality-preserving data augmentation is adopted to increase the diversity of limited training data and raise the generality for real-world deployment. Comparative experiments and ablation studies are conducted on a dataset composed of real-world instances to verify and prove the prevalence of Horus. The experimental results illustrate that Horus outperform existing methods on the identification of code-reuse exploits from data stream with an acceptable overhead. Horus does not rely on any dynamic executions and can be easily integrated into existing defense systems. Moreover, Horus is able to provide tentative interpretations about attack semantics irrespective of target program, which further improve system's effectiveness and reliability.