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

IEEE International Conference on Software Quality, Reliability and Security (QRS)

作者： Yuntao Zhang Yanhao Wang Yuwei Liu Zhengyuan Pang Binxing Fang Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beijing China QI-ANXIN Technology Group Inc. Beijing China Chinese Academy of Sciences Institute of Software Beijing China Beijing DigApis Technology Co. Ltd Beijing China

Binary code similarity identification is an important technique applied to many security applications (e.g., plagiarism detection, bug search). The primary challenge of this research topic is how to extract sufficient information from the binary code for similarity comparison. Although numerous approaches have been proposed to address the challenge, most of them leverage features determined by human experience or extracted using machine learning methods and ignore some critical technique semantic information. Additionally, they assess their approach exclusively in laboratory environments and lack real-world datasets. Both problems lead to the limited effectiveness of these methods in real application scenarios (e.g., vulnerable function search).In this paper, we propose a novel approach PDG2Vec, which extracts the data dependence graph and control dependence graph (i.e., program dependence graph (PDG)) as the features of functions and uses them for identifying function similarity. Meanwhile, we design several strategies to optimize the PDG’s construction and use them in similarity comparison to balance time-consuming and accuracy. We implement the prototype of PDG2Vec, which can perform binary code similarity comparison across architectures of x86, x86_64, MIPS32, ARM32, and ARM64. We evaluate PDG2Vec with two datasets. The experimental results show that PDG2Vec is resilient to cross-architecture and extracts more precise semantics than other approaches. Moreover, PDG2Vec outperforms the state-of-the-art tools in the vulnerable function search scenario and has excellent performance.

关键词： Plagiarism Semantics Prototypes Binary codes Software quality Feature extraction Search problems

来源：评论

学校读者我要写书评

暂无评论

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning

arXiv

引用

arXiv 2024年

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3DAD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. Copyright © 2024, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Algebraic analysis and control of networked opacity with bounded communication delays

Algebraic analysis and control of networked opacity with bou...

引用

第40届中国控制会议

作者： Qian Xu Zhipeng Zhang Chengyi Xia Zengqiang Chen Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Engineering Research Center of Learning-Based Intelligent System Ministry of Education College of Artificial Intelligence Nankai University

Networked finite state machine takes the delay factor into consideration, and its security has become an significant research topic. In this paper, we explore the impact of bounded communication delays on networked opacity of finite state machine from an algebraic point. Firstly, by making use of Boolean semi-tensor product（Boolean STP）, we propose an algebraic equation to characterize the current dynamics with bounded observation delays. Subsequently, we give the verification criterion for networked opacity, and calculate the delayed dynamics by introducing the state reachability matrix. Meanwhile, we investigate the effect of bound number on the opacity-enforcement problem, and compute the minimum bound of communication delay to ensure the state opacity property. Finally, a numerical example is provided to demonstrate the results.

关键词： Semi-tensor product（STP） of matrices finite state machine state opacity observation delays

来源：评论

学校读者我要写书评

暂无评论

Adaptive finite time stability of delayed systems via aperiodically intermittent control and quantized control

arXiv

引用

arXiv 2020年

作者： Liu, Xiwei Ma, Hailian Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

In this brief, we set up the finite time stability (FnTSta) theory for dynamical systems with bounded timevarying delays via aperiodically intermittent control (AIC) and quantized control (QC). A more general QC is designed in this brief. The bound of time-varying delay is required to be less than the infimum in AIC. Two-phases-method (2PM) is applied to solve the FnTSta for delayed system, i.e., it divides the whole proof process into two phases, one phase is that the process for the norm of system error evolving from initial values to 1, and the other is the process for the norm of system error evolving from 1 to 0. By proving that these two phases both use FnT to realize, the whole FnTSta for system is proved. We also design the adaptive rules and prove its validity rigorously. Furthermore, the obtained theories are used to discuss the finite time synchronization (FnTSyn) of neural networks as an application. Finally, some simulations are given to illustrate the effectiveness of our theoretical result. Copyright © 2020, The Authors. All rights reserved.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive finite time stability of delayed systems with applications to network synchronization

arXiv

引用

arXiv 2020年

作者： Liu, Xiwei Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

The finite time stability (FnTSta) theory of delayed systems has not been set up until now. In this paper, we propose a two-phases-method (2PM), to achieve this object. In the first phase, we prove that the time for norm of system error evolving from initial values to 1 is finite;then in the second phase, we prove that the time for norm of the error evolving from 1 to 0 is also finite, thus FnTSta is obtained. Considering the cost and complexity of controller, we use only two simple terms to realize this aim. For the proposed 2PM, time delays can be the same or asynchronous, bounded or unbounded, etc;the norm can be 2-norm, 1-norm, ∞-norm, which show that 2PM is powerful and has a wide scope of applications. Furthermore, we also prove the adaptive finite time stability (AFnTSta) theory of delayed systems using 2PM. As an application of the obtained FnTSta theory, we consider the finite time outer synchronization (FnTOSyn) for complex networks with asynchronous unbounded time delays, corresponding criteria are also obtained. Finally, two numerical examples are given to demonstrate the validity of our theories. Copyright © 2020, The Authors. All rights reserved.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Global µ-stability and finite-time control of octonion-valued neural networks with unbounded delays✡

arXiv

引用

arXiv 2020年

作者： Wang, Jingzhu Liu, Xiwei Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

Octonion-valued neural networks (OVNNs) are a type of neural networks for which the states and weights are octonions. In this paper, the global µ-stability and finite-time stability problems for octonion-valued neural networks are considered under unbounded and asynchronous time-varying delays. To avoid the non-communicative and non-associative multiplication feature of the octonions, we firstly decompose the OVNNs into eight real-valued neural networks (RVNNs) equivalently. Through the use of generalized norm and the Cauchy convergence principle, we obtain the sufficient criteria which assure the existence, uniqueness of the equilibrium point and global µ-stability of OVNNs. By adding controllers, the criteria to ensure the finite-time stability for OVNNs are presented by dividing the analysis of finite-time stability process into two phases. Furthermore, we also prove the adaptive finite time stability theory of above networks. At last, the simulation results of specified examples is given to substantiate the effectiveness and correctness of the theoretical results. Copyright © 2020, The Authors. All rights reserved.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Neuromodulated Meta-Learning

arXiv

引用

arXiv 2024年

作者： Wang, Jingyao Guo, Huijie Qiang, Wenwen Li, Jiangmeng Zheng, Changwen Xiong, Hui Hua, Gang University of Chinese Academy of Sciences Beijing China National Key Laboratory of Space Integrated Information System Institute of Software Chinese Academy of Sciences Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing China Thrust of Artificial Intelligence Hong Kong University of Science and Technology Guangzhou China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong Wormpex AI Research LLC BellevueWA98004 United States

Humans excel at adapting perceptions and actions to diverse environments, enabling efficient interaction with the external world. This adaptive capability relies on the biological nervous system (BNS), which activates different brain regions for distinct tasks. Meta-learning similarly trains machines to handle multiple tasks but relies on a fixed network structure, not as flexible as BNS. To investigate the role of flexible network structure (FNS) in meta-learning, we conduct extensive empirical and theoretical analyses, finding that model performance is tied to structure, with no universally optimal pattern across tasks. This reveals the crucial role of FNS in meta-learning, ensuring meta-learning to generate the optimal structure for each task, thereby maximizing the performance and learning efficiency of meta-learning. Motivated by this insight, we propose to define, measure, and model FNS in meta-learning. First, we define that an effective FNS should possess frugality, plasticity, and sensitivity. Then, to quantify FNS in practice, we present three measurements for these properties, collectively forming the structure constraint with theoretical supports. Building on this, we finally propose Neuromodulated Meta-Learning (NeuronML) to model FNS in meta-learning. It utilizes bi-level optimization to update both weights and structure with the structure constraint. Extensive theoretical and empirical evaluations demonstrate the effectiveness of NeuronML on various tasks. Code is publicly available at https://***/WangJingyao07/NeuronML. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Single node injection attack against graph neural networks

arXiv

引用

arXiv 2021年

作者： Tao, Shuchang Cao, Qi Shen, Huawei Huang, Junjie Wu, Yunfan Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Node injection attack on Graph Neural Networks (GNNs) is an emerging and practical attack scenario that the attacker injects malicious nodes rather than modifying original nodes or edges to affect the performance of GNNs. However, existing node injection attacks ignore extremely limited scenarios, namely the injected nodes might be excessive such that they may be perceptible to the target GNN. In this paper, we focus on an extremely limited scenario of single node injection evasion attack, i.e., the attacker is only allowed to inject one single node during the test phase to hurt GNN’s performance. The discreteness of network structure and the coupling effect between network structure and node features bring great challenges to this extremely limited scenario. We first propose an optimization-based method to explore the performance upper bound of single node injection evasion attack. Experimental results show that 100%, 98.60%, and 94.98% nodes on three public datasets are successfully attacked even when only injecting one node with one edge, confirming the feasibility of single node injection evasion attack. However, such an optimization-based method needs to be re-optimized for each attack, which is computationally unbearable. To solve the dilemma, we further propose a Generalizable Node Injection Attack model, namely G-NIA, to improve the attack efficiency while ensuring the attack performance. Experiments are conducted across three well-known GNNs. Our proposed G-NIA significantly outperforms state-of-the-art baselines and is 500 times faster than the optimization-based method when inferring. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Signed bipartite graph neural networks

arXiv

引用

arXiv 2021年

作者： Huang, Junjie Shen, Huawei Cao, Qi Tao, Shuchang Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Signed networks are such social networks having both positive and negative links. A lot of theories and algorithms have been developed to model such networks (e.g., balance theory). However, previous work mainly focuses on the unipartite signed networks where the nodes have the same type. Signed bipartite networks are different from classical signed networks, which contain two different node sets and signed links between two node sets. Signed bipartite networks can be commonly found in many fields including business, politics, and academics, but have been less studied. In this work, we firstly define the signed relationship of the same set of nodes and provide a new perspective for analyzing signed bipartite networks. Then we do some comprehensive analysis of balance theory from two perspectives on several real-world datasets. Specifically, in the peer review dataset, we find that the ratio of balanced isomorphism in signed bipartite networks increased after rebuttal phases. Guided by these two perspectives, we propose a novel Signed Bipartite Graph Neural Networks (SBGNNs) to learn node embeddings for signed bipartite networks. SBGNNs follow most GNNs message-passing scheme, but we design new message functions, aggregation functions, and update functions for signed bipartite networks. We validate the effectiveness of our model on four real-world datasets on Link Sign Prediction task, which is the main machine learning task for signed networks. Experimental results show that our SBGNN model achieves significant improvement compared with strong baseline methods, including feature-based methods and network embedding methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

SCARE of Secret Ciphers under Rough Leakage Model

引用

Security and Communication Networks 2023年第1期2023卷

作者： Wang, Mengxing Tang, Ming Zhang, Xige Chen, Qi Ding, Haili Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Hubei Wuhan430000 China Beijing Smartchip Microelectronics Technology Co. Ltd. Beijing100192 China Marketing Service Center State Grid Electric Power Co. Ltd. Ningxia750002 China

Most previousside-channel analysis-based reverse engineering (SCARE) methods were based on collision attack. However, the collision-based methods generally need noise-free traces and can hardly be verified by realistic implementations. This paper proposes a novel SCARE, which is named as OSHDG-SCARE, targeting on secret S-box. We define a graph as OSHDG (one-step HD graph) to recover the parameters of any secret S-box. Due to the redundancy of OSHDG, the multiple paths can filter the correct results and improve the success rate of the reverse method even when the samples deviate from leakage model. We classify the deviation of side channel signal as two types, which are the gap between real leakage and leakage model, and measurement noise. Experiments are performed on real power traces satisfying the inaccurate HW (Hamming Weight) leakage model from a software implementation of AES-like cipher. OSHDG-SCARE recovers the secret S-box when the deviation rate of traces is 1.45%. © 2023 Mengxing Wang et al.

关键词： Side channel attack

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：