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

7th IEEE International Conference on Smart Cloud, SmartCloud 2022

作者： Chen, Lin Yu, Qingchun Liang, Wei Cai, Jiahong Zhu, Hangyu Xie, Songyou Hunan University of Science and Technology Hunan Key Laboratory for Service computing and Novel Software Technology School of Computer Science and Engineering Xiangtan China Shenzhen Research Institute Sun Yat-sen University and Novel Software Technology ShenZhen China Hunan University College of Computer Science and Electronic Engineering Changsha China

ISBN: (数字)9781665451796

ISBN: (纸本)9781665451796

With the increasing growth of electronic medical data, the difficulties of data sharing among medical institutions and the leakage of data privacy have become the focus of the public and medical workers. The blockchain has the characteristics of decentralization, traceability, and immutability, which can provide new ideas for fine-grained secure access to medical research. This article first introduces blockchain and blockchain-based privacy protection technology;then analyzes the advantages and disadvantages of electronic medical records, and introduces the current development status of electronic medical records based on blockchain technology;then from data encryption, access the three aspects of control and transaction anonymity introduce the medical data privacy protection method based on blockchain technology;finally, the full text is summarized and prospected. © 2022 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Enrich Code Search Query Semantics with Raw Descriptions 19th

Enrich Code Search Query Semantics with Raw Descriptions

引用

19th EAI International Conference on Collaborative computing: Networking, Applications and Worksharing, CollaborateCom 2023

作者： Liu, Xiangzheng Liu, Jianxun Hu, Haize Liu, Yi School of Computer Science and Engineering Hunan University of Science and Technology Hunan Xiangtan China Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Hunan University of Science and Technology Hunan Xiangtan China

ISBN: (纸本)9783031545207

Code search can recommend relevant source code according to the development intention (query statement) of the demander, thereby improving the efficiency of software development. In the research of deep code search model, code description is used to replace query sentences for training. However, the heterogeneity existing between the query statement and the code description will seriously affect the accuracy of the code search model. In order to make up for the shortcomings of code search, this paper proposes a sentence-integrated query expansion method—SIQE. Unlike previous query expansion methods that focus on word-level expansion, SIQE uses the entire code description fragment as the source of query expansion. And by learning the mapping relationship between the query statement and the code description, the heterogeneity problem between them is compensated. In order to verify the effect of the proposed model in code search tasks, the article conducts code search experiments and analyzes on two languages: python and java. Experimental results show that, compared with the baseline model, SIQE has higher code search results. Therefore, the SIQE model can effectively improve the search effect of query statements, improve the accuracy of code search, and further improve the development of software engineering. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

DSCR: A Dynamic Secure Clustering Routing Scheme for UANETs Based on Reputation Mechanism

引用

IEEE Internet of Things Journal 2024年第10期12卷 14109-14123页

作者： Gong, Yinyan Chen, Yuxiang Li, Kuanching Liang, Wei Li, Xiong Wang, Jin Xiang, Yang Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan411201 China Hunan University of Science and Technology Sanya Research Institute Sanya572024 China Hunan Key Laboratory for Service Computing and Novel Software Technology Xiangtan411201 China University of Electronic Science and Technology of China Institute for Cyber Security School of Computer Science and Engineering China Swinburne University of Technology School of Software and Electrical Engineering HawthornVIC Australia

In Unmanned Aerial Vehicle Ad Hoc Networks (UANETs), rapid movement of nodes leads to frequent changes in network topology, increasing the risk of packet loss and affecting data transmission. Furthermore, current research on drone clustering lacks security considerations, which reduces the reliability of data transmission. Due to this, improving the stability and reliability of network data transmission in dynamically changing UANETs remains a challenge. In this work, we propose the reputation mechanism DSCR (Dynamically Secure Cluster Routing) Scheme for UANETs, a design for cluster head election in UANETs using the evaluated value and reputation value of drones and forms clusters through this reputation mechanism to avoid malicious nodes from interfering with the clusters to improve the security of UANETs. We apply a residual link survival time-based intra-and inter-cluster algorithm based on residual link survival time for data forwarding of nodes, optimizing the dynamic routing strategy and reducing the packet loss rate of nodes. In addition, reinforcement learning is used in UANETs to achieve cluster decisions based on the current network state and cluster dynamics, effectively improving the stability of clusters. Experiments were conducted on the proposed method to verify its efficiency and stability. Compared to the ICRA, RICR, and DCA algorithms, the stability of the cluster is improved by 11.92%, 28.12%, and 75.2%, respectively, and the packet loss rate reduced by 41.48%, 44.17%, and 55.74%, demonstrating that DSCR is a compelling dynamic routing solution applicable to UANETs. © 2014 IEEE.

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

A real-time privacy-preserving scheme based on grouping queries for continuous location-based services

A real-time privacy-preserving scheme based on grouping quer...

引用

作者： Liu, Haoyu Zhang, Shiwen Li, Mengling Liang, Wei Arthur Sandor, Voundi Koe School of Computer Science and Engineering Hunan University of Science and Technology Hunan Xiangtan China Hunan Key Laboratory for Service Computing and Novel Software Technology Hunan Xiangtan China Institute of Artificial Intelligence and Blockchain Guangzhou University Guangdong Guangzhou China

With the advancement of global positioning systems and communication technologies, location-based services (LBS) have become widely used. However, user location privacy is vulnerable during service exchange, and location-related queries may result in serious privacy disclosure issues. In this article, considering that attackers may make use of auxiliary information to track a mobile user, we propose a real-time privacy-preserving scheme based on the grouping of queries in continuous LBS. In this scheme, we first design the probability density functions to select (Figure presented.) virtual locations. Then, we group these virtual locations and the query location of the user into several queries. Simultaneously, we send these grouping queries to the LBS server. Following the steps outlined above, grouping queries can be used to conceal the true query. Moreover, the results of security analyses and performance evaluations show that the proposed scheme is effective and secure. © 2022 John Wiley & Sons, Ltd.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

An Efficient Authentication Protocol for Brand Cosmetics Anti-Counterfeiting System 10

An Efficient Authentication Protocol for Brand Cosmetics Ant...

引用

10th IEEE International Conference on Cyber Security and Cloud computing and 9th IEEE International Conference on Edge computing and Scalable Cloud, CSCloud-EdgeCom 2023

作者： Meng, Xiangwei Yu, Qingchun Lang, Wei Liang, Yufeng Xu, Zisang Li, Kuanching Nanjing University of Aeronautics and Astronautics Nanjing China Hunan University of Science and Technology Xiangtan China Hunan University of Science and Technology Hunan Key Laboratory for Service computing and Novel Software Technology Xiangtan China Changsha University of Science and Technology Changsha China

ISBN: (纸本)9798350312461

The counterfeit brand cosmetics made available on the market have always been a widespread concern. Traditional anti-counterfeiting schemes usually focus on the authenticity of brand cosmetics. However, verifying the identity of the sales counter is also a challenging issue to be solved. In this paper, we propose a new authentication protocol for brand cosmetics anti-counterfeiting system which is used for checking the identity of sales counter and the authenticity of brand cosmetics. The sales counter authenticated by the anticounterfeiting server obtains a cosmetic authentication confirmation about the authenticity of the brand cosmetic. Besides, the security of proposed protocol is proved by informally analysis. Performance evaluation shows that the proposed protocol is efficiency. © 2023 IEEE.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

Cost-Optimized Microservice Deployment for IoT Application in Cloud-Edge Collaborative Environment 26

Cost-Optimized Microservice Deployment for IoT Application i...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Zhang, Xiaoyuan Tang, Bing Yang, Qing Xu, Wei Guo, Feiyan Hunan University of Science and Technology Hunan Key Laboratory for Service Computing and Novel Software Technology School of Computer Science and Engineering Xiangtan411201 China Guangzhou Maritime University School of Information and Communication Engineering Guangzhou510725 China

ISBN: (纸本)9798350331684

With the popularity of cloud native and DevOps, container technology is widely used and combined with microservices. The deployment of container-based microservices in distributed cloud-edge infrastructure requires suitable strategies to ensure the quality of service for users. However, the existing container orchestration tools cannot flexibly select the best deployment location according to the user's cost budget, and are insufficient in personalized deployment solutions. From the perspective of application providers, this paper considers the location distribution of users, application dependencies, and server price differences, and proposes a genetic algorithm-based Internet-of-Things (IoT) application deployment strategy for personalized cost budgets. The application deployment problem is defined as an optimization problem that minimizes user service latency under cost constraints. This problem is an NP-hard problem, and genetic algorithm is introduced to solve the optimization problem effectively and improve the deployment efficiency. The proposed algorithm is compared with four baseline algorithms, Time-Greedy, Cost-Greedy, Random and PSO, using real datasets and some synthetic datasets. The results show that the proposed algorithm outperforms other competing baseline algorithms. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A One-Dimensional Residual Network and Physical Fitness-Based Exercise Prescription Recommendation Method 10

A One-Dimensional Residual Network and Physical Fitness-Base...

引用

10th IEEE International Conference on Cyber Security and Cloud computing and 9th IEEE International Conference on Edge computing and Scalable Cloud, CSCloud-EdgeCom 2023

作者： Fan, Runqing Peng, Zhenlian Cao, Buqing Liu, Jianxun Che, Peng Chen, Tieping Hunan University of Science and Technology School of Computer Science and Engineering Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Xiangtan China Hunan University of Science and Technology School of Physical Education Xiangtan China

ISBN: (纸本)9798350312461

In the context of the national big data strategy, physical fitness test data has become one of the main influencing factors in guiding and promoting the participation of the population in sports and fitness. Recommending exercise prescriptions based on national physical fitness test data has become an important research topic. However, currently, there is little research on how to accurately use computer data processing technology to recommend exercise prescriptions based on physical fitness test data. In this study, we propose a ResNet-based Exercise Prescription (ResNet-EP) method that utilizes one-dimensional residual neural network technology to recommend exercise prescriptions based on physical fitness testing data. This method comprehensively analyzes physical fitness testing data and exercise prescription data and realizes the automatic recommendation of exercise prescriptions. Experimental results on a real dataset demonstrate that the ResNet-EP model outperforms other comparison models in terms of precision (79.98%), recall (83.73%), and F1 score (81.81%). This study provides novel insights into the combination of physical fitness testing and exercise. © 2023 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

A missing physical fitness test data classification method based on MLP 10

A missing physical fitness test data classification method b...

引用

10th IEEE International Conference on Cyber Security and Cloud computing and 9th IEEE International Conference on Edge computing and Scalable Cloud, CSCloud-EdgeCom 2023

作者： Che, Peng Peng, Zhenlian Cao, Buqing Liu, Jianxun Chen, Tieping Fan, Runqing Hunan University of Science and Technology School of Computer Science and Engineering Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Xiangtan China Hunan University of Science and Technology School of Physical Education Xiangtan China

ISBN: (纸本)9798350312461

In recent years, the physical health status of college students have been attached by the country and all universities. Much effort is spent every year to conduct physical health tests, generating a large amount of physical fitness data. Due to some irresistible reasons, such as entering incorrect data or students being unable to participate in some physical fitness programs, missing data exists in the physical fitness test, and the calculation of total points according to the existing rules of weighted summation may lead to inaccurate classification of some students grades. To this end, a classification method based on physical fitness test data with missing items is proposed in this paper. Firstly, the method collects the raw data set and constructs a structured data set. Then, the MLP method is used to construct a classifier model to classify the test data set with missing items. Finally, compared experiments are conducted with the training model constructed by GaussianNB, SVM and XGBoost and the results show that the classification effect of MLP is excellent, and the accuracy of classification can reach 93.29 %. © 2023 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

SC-GAT: Web services Classification Based on Graph Attention Network 16th

SC-GAT: Web Services Classification Based on Graph Attention...

引用

16th EAI International Conference on Collaborative computing: Networking, Applications, and Worksharing, CollaborateCom 2020

作者： Peng, Mi Cao, Buqing Chen, Junjie Liu, Jianxun Li, Bing School of Computer Science and Engineering & Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan China School of Computer Wuhan University Wuhan China

ISBN: (纸本)9783030675363

The classification of Web services with high similarity is conducive to the promotion for service management and service discovery. With the increasing number of Web services, how to accurately and efficiently classify the Web services becomes an urgent and challenging task. Although the existing methods achieve significant results in the task for service classification via integrating the structure information of service network with the content features of service node, it fails to discriminate the importance of neighbor services in the service network on the service node needed to be classified. To solve this problem, we propose a Web services classification method based on graph attention network. Firstly, according to the composition and shared annotation relationship of Web services, it applies the description documents, tags of Web services and the call relationship between mashups and services to build a service relationship network. Then, the attention coefficient of service nodes in the network is calculated by the self-attention mechanism, and different service nodes in the neighborhood are assigned different weights to classify Web services. Through the graph attention network, the content features of Web service can be well integrated with its structure information. Also, the learned attention weight is more interpretable. The experimental results on the real dataset of ProgrammableWeb platform show that the precision, recall and macro-F1 of the proposed method are greatly improved compared to those of GCN, Node2vec, DeepWalk and Line. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A Web service Recommendation Method Based on Adaptive Gate Network and xDeepFM 1

引用

22nd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2022

作者： Tao, Zhi Cao, Buqing Ye, Hongfan Kang, Guosheng Peng, Zhenlian Wen, Yiping School of Computer Science and Engineering and Hunan Key Laboratory of Service Computing and New Software Service Technology Hunan University of Science and Technology Hunan Xiangtan China School of Computer and Artificial Intelligence Huaihua University Huaihua China

ISBN: (数字)9783031226779

ISBN: (纸本)9783031226762

With the rapid development of service computing technology, more and more companies and organizations are encapsulating and publishing their operational data or resources to the Internet in the form of Web services, resulting in an exponential increase in the number of Web services. To automatically generate or recommend a group of Web services according to the user's natural language requirements description, to build a Mashup application to meet the user's requirement is a hot topic in service computing. Some researchers enhance the quality of Web service recommendation by using auxiliary information into the recommendation system. However, they mainly focus on adding external information (e.g., pre-training of external corpora) to enhance semantic features, while some internal statistical features of the corpus such as word distribution on labels and frequency are not fully exploited. Compared to other exterior knowledge, statistical features are naturally compatible with Web service recommendation tasks. To fully exploit the statistical features, this paper proposes a Web service recommendation method based on adaptive gate network and xDeepFM model. In this method, firstly, the description document of Web services is taken as the basic corpus, the semantic and statistical information in the corpus are mined by utilizing the adaptive gate network, and the statistical features are encoded by a variational encoder. Secondly, the similarity between Web services is derived from the semantic features, at the same time the popularity and co-occurrence of Web services are calculated. Thirdly, the xDeepFM model is used to mine the explicit and implicit higher-order interactions in the sparse matrix which consists of the above information to recommend Web services for Mashup application. Finally, a multiple sets of experiments based on the dataset crawled from the ProgrammableWeb have been conducted to evaluate the proposed method and the experimental result shows that t

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：