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

International Conference on Software Engineering (ICSE)

作者： Zhen Li Ning Wang Deqing Zou Yating Li Ruqian Zhang Shouhuai Xu Chao Zhang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Jin YinHu Laboratory Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado Springs Colorado USA Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers; and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities.

关键词： Deep learning Detectors Open source software Software engineering

来源：评论

学校读者我要写书评

暂无评论

Feature Decoupled of Deep Mutual Information Maximization

Feature Decoupled of Deep Mutual Information Maximization

引用

Automation, Robotics and Computer Engineering (ICARCE), International Conference on

作者： Xing He Changgen Peng Lin Wang Weijie Tan Zifan Wang State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China Guizhou Big Data Academy Guizhou University Guiyang China Guizhou Key Laboratory of Pattern Recognition and Intelligent System Guizhou Minzu University Guiyang China Institute of Guizhou Aerospace Measuring and Testing Technology Guiyang China

In deep learning, supervised learning techniques usually require a large amount of expensive labeled data to train the network, and the feature representations extracted by the model usually mix multiple attributes, resulting in feature representations that are difficult to decouple and are non-interpretable, which restricts the application and development of deep learning techniques, and for this reason, it is particularly important to study decoupled feature representation methods for unsupervised learning. Although the Learning deep representations by mutual information estimation and maximization (DIM) method achieves excellent results in unsupervised learning, the feature representations learned by the DIM method still suffer from the problem of difficult decoupling. decoupling problem. To address this problem, we minimize the mutual information between the intermediate layer feature representations learned by the hidden layer of the encoder during the encoder training process, so that the features learned by each filter are as uncorrelated as possible, thus realizing feature decoupling, and our method is called FP-DIM. Finally, the effectiveness of the FP-DIM method is verified on the CIFAR-10, STL-10, and Fashion-MNIST datasets. The experiments show that our proposed FP-DIM method is more significant for the learned decouplable middle layer feature representation. Finally, we also propose a reflection of future research for the FP-DIM method, aiming to provide a research idea and direction for solving unsupervised interpretable machine learning and to lay a solid theoretical and application foundation for machine learning fields such as image classification and migration learning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FACOS: Enabling Privacy Protection Through Fine-Grained Access Control with On-chain and Off-chain system

arXiv

引用

arXiv 2024年

作者： Liu, Chao Hou, Cankun Jiang, Tianyu Ning, Jianting Qiao, Hui Wu, Yusen Fujian Provincial Key Laboratory of Data Intensive Computing the Key Laboratory of Intelligent Computing and Information Processing Fujian China The School of Computer Science and Technology Xidian University Shaanxi Xi’an710071 China The Department of Computer Science University of Miami MiamiFL33146 United States College of Computer and Cyber Security Fujian Normal University Fuzhou350007 China The Faculty of Data Science City University of Macau China

data-driven landscape across finance, government, and healthcare, the continuous generation of information demands robust solutions for secure storage, efficient dissemination, and fine-grained access control. Blockchain technology emerges as a significant tool, offering decentralized storage while upholding the tenets of data security and accessibility. However, on-chain and off-chain strategies are still confronted with issues such as untrusted off-chain data storage, absence of data ownership, limited access control policy for clients, and a deficiency in data privacy and auditability. To solve these challenges, we propose a permissioned blockchain-based privacy-preserving fine-grained access control on-chain and off-chain system, namely FACOS. We applied three fine-grained access control solutions and comprehensively analyzed them in different aspects, which provides an intuitive perspective for system designers and clients to choose the appropriate access control method for their systems. Compared to similar work that only stores encrypted data in centralized or non-fault-tolerant IPFS systems, we enhanced off-chain data storage security and robustness by utilizing a highly efficient and secure asynchronous Byzantine fault tolerance (BFT) protocol in the off-chain environment. As each of the clients needs to be verified and authorized before accessing the data, we involved the Trusted Execution Environment (TEE)-based solution to verify the credentials of clients. Additionally, our evaluation results demonstrated that our system1 offers better scalability and practicality than other state-of-the-art designs. We deployed our system on Alibaba Cloud and Tencent Cloud and conducted multiple evaluations. The results indicate that it takes about 2.79 seconds for a client to execute the protocol for uploading and about 0.96 seconds for downloading. Compared to other decentralized systems, our system exhibits efficient latency for both download and upload operations.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

LDGCN: An Edge-End Lightweight Dual GCN Based on Single-Channel EEG for Driver Drowsiness Monitoring

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Huang, Jingwei Wang, Chuansheng Huang, Jiayan Fan, Haoyi Xue, Xingsi Zhang, Fuquan Fuzhou University College of Computer and Big Data Fuzhou China Polytechnic University of Catalonia Department of Automatic Control Barcelona Spain Putian University New Engineering Industry College Putian China Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian Fuzhou350118 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou China Minjiang University College of Computer and Control Engineering Fuzhou China Sichuan Conservatory of Music Digital Media Art Key Laboratory of Sichuan Province Chengdu China Minjiang University Fuzhou Technology Innovation Center of Intelligent Manufacturing information System Fuzhou China Fuzhou China

Driver drowsiness electroencephalogram (EEG) signal monitoring can promptly alert drivers of their drowsiness in edge-end Consumer Electronics (CE), thereby reducing the probability of traffic accidents. Graph convolutional networks (GCNs) have shown significant advancements in processing the non-stationary, time-varying, and non-Euclidean nature of EEG signals. However, the existing single-channel EEG adjacency graph construction process lacks interpretability, which hinders the ability of GCNs to effectively extract adjacency graph features, thus affecting the performance of drowsiness monitoring. To address this issue, we propose an edge-end Lightweight Dual Graph Convolutional Network (LDGCN). Specifically, we are the first to incorporate neurophysiological knowledge to design a Baseline Drowsiness Status Adjacency Graph (BDSAG), which characterizes driver drowsiness status. Additionally, to express more features within limited EEG data, we introduce the Augmented Graph-level Module (AGM). This module captures global and local information at the graph level, ensuring that BDSAG features remain intact while enhancing effective feature expression capability. To further enhance the application of CE, we apply Adaptive Pruning Optimization (APO) to the channels and neurons of LDGCN, which nearly halves the inference latency. Experiments on benchmark datasets demonstrate that LDGCN offers the best trade-off between monitoring performance and hardware resource utilization, outperforming existing state-of-the-art algorithms. © 1975-2011 IEEE.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

Multimodal Dialogue Emotion Recognition Based on Label Optimization and Coarse-Grained Assisted Fine-Grained

Multimodal Dialogue Emotion Recognition Based on Label Optim...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhibo Zhang Zhenyu Yang Yan Huang Baojie Xu Wenyue Hu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Multimodal dialogue emotion recognition integrates data from multiple modalities to accurately identify emotional states in conversations. However, differences in expression and information density across modalities complicate the fusion of features. Traditional methods may introduce redundant information from other utterances, reducing the accuracy of emotion recognition. Existing one-hot labels often fail to capture the full range of emotional expressions, leading to biased results. To address these issues, we propose a model that fuses different modalities within the same utterance to avoid redundancy. It employs a progressive classification process, refining emotion recognition from coarse to fine granularity. Additionally, we use emotion polarity probabilities as weights for fine-grained classification and introduce a multimodal information-rich label that considers both the data and their interactions. Experiments on IEMOCAP and MELD datasets demonstrate the model’s effectiveness, significantly improving dialog emotion recognition accuracy. Our code is available at https://***/r/LOCG-188E.

关键词： Emotion recognition Accuracy Fuses Refining Termination of employment Speech recognition Signal processing Speech processing Optimization Faces

来源：评论

学校读者我要写书评

暂无评论

Unveiling Optimal SDG Pathways: An Innovative Approach Leveraging Graph Pruning and Intent Graph for Effective Recommendations

arXiv

引用

arXiv 2023年

作者： Yu, Zhihang Wang, Shu Zhu, Yunqiang Yuan, Wen Dai, Xiaoliang Zou, Zhiqiang College of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China State Key Laboratory of Resources and Environmental Information System Institute of Geographic Sciences and Natural Resources Research Chinese Academy of Sciences Beijing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China University of Chinese Academy of Sciences Beijing China

The recommendation of appropriate development pathways, also known as ecological civilization patterns for achieving Sustainable Development Goals (namely, sustainable development patterns), are of utmost importance for promoting ecological, economic, social, and resource sustainability in a specific region. To achieve this, the recommendation process must carefully consider the region's natural, environmental, resource, and economic characteristics. However, current recommendation algorithms in the field of computer science fall short in adequately addressing the spatial heterogeneity related to environment and sparsity of regional historical interaction data, which limits their effectiveness in recommending sustainable development patterns. To overcome these challenges, this paper proposes a method called User Graph after Pruning and Intent Graph (UGPIG). Firstly, we utilize the high-density linking capability of the pruned User Graph to address the issue of spatial heterogeneity neglect in recommendation algorithms. Secondly, we construct an Intent Graph by incorporating the intent network, which captures the preferences for attributes including environmental elements of target regions. This approach effectively alleviates the problem of sparse historical interaction data in the region. Through extensive experiments, we demonstrate that UGPIG outperforms state-of-the-art recommendation algorithms like KGCN, KGAT, and KGIN in sustainable development pattern recommendations, with a maximum improvement of 9.61% in Top-3 recommendation performance. Copyright © 2023, The Authors. All rights reserved.

关键词： Sustainable development

来源：评论

学校读者我要写书评

暂无评论

Fast Estimation of Relative Transformation Based on Fusion of Odometry and UWB Ranging data

arXiv

引用

arXiv 2024年

作者： Fu, Yuan Zhang, Zheng Zeng, Guangyang Liu, Chun Wu, Junfeng Ren, Xiaoqiang School of Mechatronic Engineering and Automation Shanghai University China Shanghai Artificial Intelligence Laboratory China Institute of Artificial Intelligence Shanghai University China School of Data Science The Chinese University of HongKong Shenzhen China Key Laboratory of Marine Intelligent Unmanned Swarm Technology and System Ministry of Education China

MSC Codes 93J08In this paper, we investigate the problem of estimating the 4-DOF (three-dimensional position and orientation) robot-robot relative frame transformation using odometers and distance measurements between robots. Firstly, we apply a two-step estimation method based on maximum likelihood estimation. Specifically, a good initial value is obtained through unconstrained least squares and projection, followed by a more accurate estimate achieved through one-step Gauss-Newton iteration. Additionally, the optimal installation positions of Ultra-Wideband (UWB) are provided, and the minimum operating time under different quantities of UWB devices is determined. Simulation demonstrates that the two-step approach offers faster computation with guaranteed accuracy while effectively addressing the relative transformation estimation problem within limited space constraints. Furthermore, this method can be applied to real-time relative transformation estimation when a specific number of UWB devices are installed. Copyright © 2024, The Authors. All rights reserved.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Gnn-Mgrpool: Enhanced Graph Neural Networks with Multi-Granularity Pooling for Graph Classification

SSRN

引用

SSRN 2023年

作者： Sun, Haichao Wang, Guoyin Liu, Qun Guo, Yike Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Computer Science and Engineering The Hong Kong University of Science and Technology 999077 Hong Kong School of Computer Engineering and Science Shanghai University Shanghai200444 China

Graph neural networks (GNNs) have gained significant attention and have been applied in various domain tasks. Currently, numerous pooling approaches have been proposed to aggregate node features and obtain node embeddings. However, current GNNs are almost black-box models that typically use a flat or single pooling step to aggregate nodes by only considering the similarity between nodes within the cluster. These approaches ignore the influence of relationships within and between clusters. To address this issue, we propose a novel multi-granular pooling method to aggregate nodes by simultaneously considering density and relationships among nodes and clusters. This method allows to obtain multi-granular node embedding clusters. The clusters in the current layer are built upon the previous layer, and these clusters change from fine to coarse as the number of clusters decreases, which is achieved by using multi-granular pooling (MgrPool for short). Additionally, the node representation of each layer is established through the ratio of node distance within clusters to that of between clusters. Finally, we conduct several experiments on node and graph classification tasks by this pooling approach. The results demonstrate that our GNN-MgrPool model outperforms the state-of-the-art similar algorithms and largely improves the interpretability of the learning process. © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Constructing Three-way Decision with Fuzzy Granular-ball Rough Sets Based on Uncertainty Invariance

引用

IEEE Transactions on Fuzzy systems 2025年

作者： Yang, Jie Liu, Zhuangzhuang Wang, Guoyin Zhang, Qinghua Xia, Shuyin Wu, Di Liu, Yanmin Zunyi Normal University School of Physics and Electronic Science Zunyi563002 China Jiangsu University of Science and Technology School of Computer Zhenjiang212100 China Chongqing University of Posts and Telecommunications Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China Zunyi Normal University School of Mathematics Zunyi563002 China

Granular-ball computing (GBC) proposed by Xia adaptively generates a different neighborhood for each object, resulting in greater generality and flexibility. Moreover, GBC greatly improves the efficiency by replacing point input with granular-ball. However, the current GB-based classifiers rigidly assign a specific class label to each data instance and lacks of the necessary strategies to address uncertain instances. These far-fetched certain classification approachs toward uncertain instances may suffer considerable risks. In this paper, we introduce three-way decision (3WD) into GBC to construct a novel three-way decision with fuzzy granular-ball rough sets (3WD-FGBRS) from the perspective of uncertainty. This helps to construct reasonable multi-granularity spaces for handling complex decision problems with uncertainty. Firstly, 3WD-FGBRS is constructed in a data-driven method based on fuzziness, which avoids the subjective definition of certain risk parameters when calculating the threshold pairs. Based on 3WD-FGBRS, we further propose a sequential three-way decision with fuzzy granular-ball rough sets (S3WD-FGBRS) and analyze the fuzziness loss of multilevel decision result in S3WD-FGBRS. Then, the optimal granular-ball space selection mechanism of S3WD-FGBRS is introduced by combining fuzziness and granular-ball space distance. Finally, extensive comparative experiments are conducted with 3 state-of-the-art GB-based classifiers and 3 classical machine learning classifiers on 12 public benchmark datasets. The results show that our models almost outperform other comparison methods in terms of effectiveness, efficiency and robustness. © 1993-2012 IEEE.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

New Approach for Efficient Malicious Multiparty Private Set Intersection

SSRN

引用

SSRN 2023年

作者： Lv, Siyi Wei, Yu Jia, Jingyu Li, Xinhao Liu, Zheli Chen, Xiaofeng Guo, Liang College of Cyber Science The College of Computer Science Key Laboratory of Data and Intelligent System Security Ministry of Education Nankai University Tianjin China Department of Computer Science Purdue University United States School of Cyber Engineering Xidian University Xi’an China Huawei Technology Co. Ltd Shenzhen China

The Multiparty Private Set Intersection (MPSI) protocol allows untrusted parties to compute the intersection of their sets without revealing any additional information. However, existing solutions face challenges in terms of security and efficiency. Some schemes are secure only against semi-honest adversaries and cannot effectively defend against malicious adversaries. Other schemes, while capable of withstanding malicious adversaries, exhibit efficiency problems, especially as the number of corrupt participants increases. A practical solution must maintain high security and efficiency, even when handling large-scale data and a majority of corrupted *** paper introduces a novel scheme named TH-PSI, built upon a new star-shaped topological network communication framework based on the trusted execution environment. TH-PSI has been rigorously proven to be secure within the standard UC framework against malicious adversaries. To demonstrate the efficiency of TH-PSI, we implement the TH-PSI scheme and tested it in both LAN and WAN settings, involving up to 30 participants and datasets as large as $2^{22}$. We compare TH-PSI with state-of-the-art schemes, ENOC21 and NTY21. Our experiments show that TH-PSI is an efficient solution capable of delivering results within a matter of seconds, even when dealing with data at the million-level and a majority of corrupted participants. © 2023, The Authors. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：