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

Attribute-Based Data Sharing Scheme with Flexible Search Functionality for Cloud-Assisted Autonomous Transportation System

引用

IEEE Transactions on Industrial Informatics 2023年第11期19卷 10977-10986页

作者： Xiong, Hu Wang, Hanxiao Meng, Weizhi Yeh, Kuo-Hui University of Electronic Science and Technology of China School of Information and Software Engineering Network and Data Security Key Laboratory of Sichuan Province Chengdu610054 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610025 China Technical University of Denmark Department of Applied Mathematics and Computer Science Kongens Lyngby2800 Denmark National Dong Hwa University Department of Information Management Hualien97401 Taiwan National Sun Yat-sen University Department of Computer Science and Engineering Kaohsiung804201 Taiwan

The existing group public key encryption with equality test schemes could only support one-to-one data sharing and are not suitable for cloud-assisted autonomous transportation systems, which demand one-to-many data sharing. To tackle this problem efficiently, in this article, we put forward the group-attribute-based encryption with equality test (G-ABEET) scheme. The presented G-ABEET allows sensors equipped in vehicles to encrypt traffic data with an expressive access policy before sharing it. Only users with attributes required by the access policy ought to access the shared ciphertexts, thus achieving selective one-to-many data sharing. Meanwhile, the authorized cloud server could provide group users with equality tests over the ciphertexts, realizing ciphertext search ability. Furthermore, with the group mechanism, the G-ABEET scheme could resist offline message recovery attacks. Besides, in the standard model, we give rigorous security proof of the G-ABEET construction. The feasibility and efficiency of G-ABEET are demonstrated by experimental simulations. © 2005-2012 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A Shortest Path Query Approach for Encrypted Graphs Based on Padding Dictionary Structure

A Shortest Path Query Approach for Encrypted Graphs Based on...

引用

2023 China Automation Congress, CAC 2023

作者： Yang, Ming Zhang, Kaiyang Mu, Chao Wang, Xin Liu, Yuanlong Zhang, Heng Key Laboratory of Computing Power Network and Information Security Shandong Computer Science Center Ministry of Education Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China State Grid Shandong Electric Power Company Jinan China School of Computer Engineering Jiangsu Ocean University Lianyungang China

ISBN: (纸本)9798350303759

Hybrid intelligence has emerged as an innovative approach that synergistically combines the strengths of human intelligence and artificial intelligence (AI) to address complex problems. In this paradigm, knowledge graphs play a pivotal role by supplying vital background information and contextual understanding to hybrid intelligence systems. However, due to limitations in local storage capacity, managing large-scale graph data often requires outsourcing to cloud servers. Nevertheless, the use of untrusted cloud servers poses a risk of potential user data leaks. To address these concerns, this paper presents an encryption scheme specifically designed to protect graph data, enabling queries involving intermediate nodes in the shortest path between two nodes within the graph. The proposed scheme ensures the privacy and security of outsourced data by employing a novel method that utilizes padding dictionary structure encryption. This method ensures strict limitations on the cloud server's capabilities, restricting it solely to query operations, it effectively prevents any compromise of user data or unauthorized access to sensitive information, users can securely store and process their graph data on servers, significantly reducing the potential risk of data leakage and unauthorized breaches. To validate the feasibility and effectiveness of the proposed solution, practical experiments were conducted using real-world data. © 2023 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Cross Elitist Learning Multifactorial Evolutionary Algorithm 1

引用

3rd International Conference on Neural Computing for Advanced Applications, NCAA 2022

作者： Li, Wei Luo, Haonan Wang, Lei School of Computer Science and Engineering Xi’an University of Technology Xi’an710048 China Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an710048 China

ISBN: (数字)9789811961427

ISBN: (纸本)9789811961410

Multifactorial Evolutionary Algorithm (MFEA) is a popular optimization algorithm in recent years. It has implicit parallelism and can solve different problems at the same time in the same search space. However, premature convergence is a significant shortcoming of MFEA. The main reason for this phenomenon is the lack of population diversity and the inability to migrate effectively between tasks. To address this shortcoming, this paper proposes a cross elitist learning multifactorial evolutionary algorithm (CEL-MFEA). Firstly, the cross elitist strategy guides the individuals to learn from the elite individual, which can improve the convergence of the proposed CEL-MFEA. Secondly, the Nelder-Mead algorithm is used to provide an effective knowledge transfer between different tasks. Finally, the opposition learning mechanism is employed to ensure population diversity. The comprehensive ability of the proposed CEL-MFEA is evaluated by 9 classical multifactorial optimization problem test sets. Experimental results show that the CEL-MFEA is more competitive than MFEA algorithm and several popular multifactorial optimization algorithms. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Activity Recognition Method Based on Kernel Supervised Laplacian Eigenmaps

Activity Recognition Method Based on Kernel Supervised Lapla...

引用

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

作者： Pengjia Tu Cheng Tian Dandan Du Junhuai Li Huaijun Wang School of Computer Science and Engineering Xi’an University of Technology China Shaanxi Key Laboratory for Network Computing and Security Technology China

Laplacian dimensionality reduction can effectively achieve feature transformation and preserve the important structure of high-dimensional features. However, the trained model with this method usually require better generalization ability to new samples. Hence, a human activity recognition method based on kernel-supervised laplacian eigenmaps (KSLE) by combining the kernel method, laplacian mapping, and supervised learning is proposed. Firstly, the adjacency distance relationship of original samples features in the high-dimensional kernel space is obtained. Secondly, the category labels in the high-dimensional feature set are incorporated in the manifold learning for dimensionality reduction. Then, kernel trick is utilized to directly solve the low-dimensional embedding structure of the test feature set. Finally, the obtained low-dimensional feature set is input into the classifier for recognition. Extensive experiments conduct on two public datasets confirm the effectiveness of the proposed approach for improving the generalization ability of new samples.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Probability analysis of system vulnerability distribution based on the matroid theory

Probability analysis of system vulnerability distribution ba...

引用

International Conference on networking and network Applications (NaNA)

作者： Yichuan Wang Peipei Li Xin Song Yeqiu Xiao Xiaoxue Liu School of computer science and engineering Xi’an University of technology Xi’an China Shanxi Key Laboratory for Network Computing and Security Technology

ISBN: (数字)9798350376777

ISBN: (纸本)9798350376784

In recent years, system vulnerability mining techniques have emerged in an endless stream. At present, the existing vulnerability mining techniques are mainly to analyze the source code or monitor and analyze the behavior in order to find security vulnerabilities. Most of these techniques require the configuration of the operating environment. Based on the mapping function defined in the network in this paper, a matroid based on system services and vulnerability points is established by utilizing the marking of the number of function set elements in the mapping function. The existence of vulnerable points in the system is verified by analyzing the properties of this matroid. The basic characteristics of the circuit, base and rank of the established matroid are given, and the properties such as the closure of the matroid are analyzed. The results show that, under certain circumstances, a change in the number of elements in the set of services does not lead to a change in the number of vulnerable points distributed in these services. Using this method, probability analysis of system vulnerability distribution can be performed, which is important for the discovery of network security threats.

关键词： Source coding network security Monitoring

来源：评论

学校读者我要写书评

暂无评论

Laryngeal Leukoplakia Classification Via Dense Multiscale Feature Extraction in White Light Endoscopy Images 48

Laryngeal Leukoplakia Classification Via Dense Multiscale Fe...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： You, Zhenzhen Yan, Yan Shi, Zhenghao Zhao, Minghua Yan, Jing Liu, Haiqin Hei, Xinhong Ren, Xiaoyong Xi'An University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology School of Computer Science and Engineering Xi'an China Xi'An Jiaotong University Second Affiliated Hospital of Medical College Department of Otorhinolaryngology Xi'an China

ISBN: (纸本)9781728163277

Laryngeal leukoplakia classification is challenging using white light endoscopy images. Relevant research focus on normal tissues versus non normal tissues, cancer versus non cancer classification. The objective of this paper is to classify laryngeal leukoplakia in white light endoscopy images into six classes: normal tissues, inflammatory keratosis, mild dysplasia, moderate dysplasia, severe dysplasia and squamous cell carcinoma. We proposed a dense multiscale convolutional neural network including parallel multiscale convolution, dense convolution and recurrent convolution in favor of extracting dense multiscale features of laryngeal leukoplakia for fine classification. The proposed network achieved an overall accuracy of 0.8958 for the six-class classification. It has high sensitivity and specificity for each class which are, respectively, 1.0000 and 0.9394 for normal tissues, 0.6667 and 1.0000 for inflammatory keratosis, 0.8889 and 0.9744 for mild dysplasia and moderate dysplasia, 0.7500 and 1.0000 for severe dysplasia, 1.0000 and 0.9767 for squamous cell carcinoma. The experimental results show that our proposed model is superior to the state-of-the-art deep learning-based models. © 2023 IEEE.

关键词： Endoscopy

来源：评论

学校读者我要写书评

暂无评论

Crucial Interaction Elements Detection for 5G Core network based on the Complex network Model

Crucial Interaction Elements Detection for 5G Core Network b...

引用

International Conference on networking and network Applications (NaNA)

作者： Ruinan Peng Xinhong Hei Yichuan Wang Xiaoxue Liu Yeqiu Xiao School of Computer Science and Engineering Xi’an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an China

ISBN: (数字)9798350376777

ISBN: (纸本)9798350376784

This paper focuses on the issue of crucial interaction elements detection in the 5G core network. Given the current absence of an effective method for quantification evaluating the importance of interaction elements, we define the crucial interaction elements as crucial nodes in this paper, and also undertake a comprehensive exploration of various data interaction scenarios within the 5G core network. This aims to overcome the limitations of traditional network analysis methods, which often operate independently in multi-layer data processing. By extracting multilayer data interaction elements across diverse scenarios, these elements are characterized within a complex network framework. Subsequently, a quantification scoring system for crucial nodes is constructed, incorporating multiple centrality indicators and node weights. Notably, the fitness function within the genetic algorithm is improved to facilitate a dynamic weight optimization strategy, responding to real-time changes in network topology. The optimized weight combination is then allocated to various evaluation indicators within the system, culminating in the design of a quantification scoring model for crucial node. Based on this model, a suite of 5G core network crucial point detection methods, tailored to different data scenarios is proposed. This method enable the quantification evaluation of each node’s importance, realizes crucial interaction elements detection. Such an approach serves to bolster the stable operation of the 5G core network, thereby more effectively meeting modern society’s security imperatives concerning information transmission.

关键词： 5G mobile communication Transfer learning Complex networks Reinforcement learning Nonhomogeneous media Data models Robustness

来源：评论

学校读者我要写书评

暂无评论

A Gradient-Guided Method for Hyperspectral Band Selection Based on Spatial-Spectral Weighting

A Gradient-Guided Method for Hyperspectral Band Selection Ba...

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Jing Hu Ke Lit Yunfei Ju Minghua Zhao Shaanxi Key Laboratory for Network Computing and Security Technology School of Computer Science and Engineering Xi'an University of Technology Xi'an China

ISBN: (数字)9798350363999

ISBN: (纸本)9798350364002

Hyperspectral image(HSI) band selection is a crucial task in image processing. It is necessary to screen out bands with rich information and low correlation, to achieve data dimensionality reduction and retain key information, thereby improving image processing efficiency. Aiming at the differences in reflectance characteristics of targets in different regions in hyperspectral images(HSls) and the strong correlation between bands, this paper proposes a gradient- guided spatial-spectral weighted hyperspectral band selection method. Firstly, gradient information is introduced to enhance the edge texture features of different targets. Then, the entropy rate superpixel segmentation algorithm is used to segment the first principal component of the image and divide multiple uniform regions. Secondly, to more comprehensively capture the global relationship between all bands in the image, a multi-graph complementary strategy is proposed to construct a regional similarity graph, aiming to maximize the mutual contribution between superpixels with spatial-spectral similarity. Finally, a unified clustering graph is generated by spectral clustering. After normalized cutting, the band with the least noise information in each sub-cube is selected to form a new band subset. The effectiveness of the proposed method is verified by classification results and data analysis.

关键词： Reflectivity Dimensionality reduction Image segmentation Correlation Data analysis Image edge detection Noise Smart systems Entropy Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

Hyperspectral Band Selection Based on Classification Reward Adjustment

Hyperspectral Band Selection Based on Classification Reward ...

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Jing Hu Jiawei Liang Yunfei Ju Minghua Zhao Shaanxi Key Laboratory for Network Computing and Security Technology School of Computer Science and Engineering Xi'an University of Technology Xi'an China

ISBN: (数字)9798350363999

ISBN: (纸本)9798350364002

Hyperspectral image band selection is a crucial link in image processing. It is necessary to screen out bands with rich information and low correlation, to achieve data dimensionality reduction and retain key information, thereby improving image processing efficiency. Aiming at the differences in reflectance characteristics of targets in different regions in hyperspectral images and the strong correlation between bands, this paper proposes a gradient-guided spatial-spectral weighted hyperspectral band selection method. Firstly, gradient information is introduced to enhance the edge texture features of different targets. Then, the entropy rate superpixel segmentation algorithm is used to segment the first principal component of the image and divide multiple uniform regions. Secondly, to more comprehensively capture the global relationship between all bands in the image, a multi-graph complementary strategy is proposed to construct a regional similarity graph, aiming to maximize the mutual contribution between superpixels with spatial-spectral similarity. Finally, a unified clustering graph is generated by spectral clustering. After normalized cutting, the band with the least noise information in each sub-cube is selected to form a new band subset. The effectiveness of the proposed method is verified by classification experimental results and data analysis.

关键词： Training Reflectivity Image segmentation Correlation Noise Memory modules Predictive models Smart systems Spatiotemporal phenomena Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

A Novel Auralization Model for network security Situation Assessment

A Novel Auralization Model for Network Security Situation As...

引用

International Conference on networking and network Applications (NaNA)

作者： Yeqiu Xiao Yibin Ma Yichuan Wang Kun Jiang Lanlan Cui School of Computer Science and Engineering Xi’an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an China

ISBN: (数字)9798350376777

ISBN: (纸本)9798350376784

Situation assessment is one of indispensable part for protecting network security. However, with the development of network attacks, the timeliness of attack threat assessment using traditional mathematical methods has gradually become difficult to apply to large-scale and high-speed network attacks. In order to solve this problem, this paper explores the relationship between the influencing factors of network threats and music elements, studies a new method of situation assessment that combines network situation with MIDI music, and builds a network situation auralization model. First, for the network situation assessment model, this paper starts from the perspective of network attacks, designs and extracts attack attributes, and constructs a sliding window-based attack threat dynamic assessment strategy to evaluate risk levels and reflect the current network security status. Secondly, for the MIDI music mapping model, extract key attributes in music, design an emotion classification model based on MIDI music and build a MIDI music library, and finally map it to the network situation. Experimental results show that the auralization model in this paper is more efficient in situation assessment and presentation.

关键词： Deep learning Accuracy High-speed networks network security Threat assessment Libraries

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：