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

International Conference on computer Supported Cooperative Work in Design

作者： Haoran Lin Zhongyuan Yu Guijuan Wang Anming Dong Xiang Tian School of Computer Science Qufu Normal University Rizhao China School of Information Science and Engineering Lanzhou University Lanzhou China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331513054

ISBN: (纸本)9798331513061

Ensuring safe and reliable data sharing is crucial for the development of Internet of Vehicles (IoV) technology. To provide a trusted data environment for IoV and enable traditional consensus algorithms to meet the high dynamic requirements of the IoV. In this article, we propose a blockchain-based data sharing scheme for IoV (BLDTS) to achieve secure and trusted sharing. First, we design a false information identification strategy that utilizes a bayesian inference model to determine the authenticity of shared data with the assistance of reputation value. Second, the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) is used to construct a novel lightweight consensus mechanism based on vehicle reputation values and traffic environment factors, and the nodes with high scores were selected as participants in the consensus, which can reduce the computational overhead. Finally, experimental results show that our scheme has advantages in improving the accuracy of false message identification and consensus efficiency.

关键词： Data privacy Federated learning Heuristic algorithms Bayes methods Consensus protocol Reliability Vehicle dynamics Protection Fake news Internet of Vehicles

来源：评论

学校读者我要写书评

暂无评论

Precise sensitivity recognizing,privacy preserving,knowledge graph-based method for trajectory data publication

引用

Frontiers of computer Science 2022年第4期16卷 219-221页

作者： Xianxian Li Bing Cai Li-e Wang Lei Lei Guangxi Key Lab of Multi-source Information Mining and Security Guangxi Normal UniversityGuilin541004China College of Computer Science and Information Engineering Guangxi Normal UniversityGuilin541004China Nanning Tiancheng Zhiyuan Intellectual Property Service Co.Ltd. Nanning530000China

1Introduction The existing privacy protection methods of trajectory data publication have two ***,existing methods[1-3]cannot resist attribute link attacks *** practical scenarios,it is necessary to integrate data from a variety of fields for data analysis,such as cross-domain *** usually need to obtain the user attributes outside of the trajectory data as background knowledge.

关键词： knowledge outside preserving

来源：评论

学校读者我要写书评

暂无评论

Medical Entity Disambiguation with Medical Mention Relation and Fine-grained Entity Knowledge 30

Medical Entity Disambiguation with Medical Mention Relation ...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Lu, Wenpeng Zhang, Guobiao Peng, Xueping Guan, Hongjiao Wang, Shoujin 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 Jinan China Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia Data Science Institute University of Technology Sydney Sydney Australia Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9782493814104

Medical entity disambiguation (MED) plays a crucial role in natural language processing and biomedical domains, which is the task of mapping ambiguous medical mentions to structured candidate medical entities from knowledge bases (KBs). However, existing methods for MED often fail to fully utilize the knowledge within medical KBs and overlook essential interactions between medical mentions and candidate entities, resulting in knowledge- and interaction-inefficient modeling and suboptimal disambiguation performance. To address these limitations, this paper proposes a novel approach, MED with Medical Mention Relation and Fine-grained Entity Knowledge (MMR-FEK). Specifically, MMR-FEK incorporates a mention relation fusion module and an entity knowledge fusion module, followed by an interaction module. The former employs a relation graph convolutional network to fuse mention relation information between medical mentions to enhance mention representations, while the latter leverages an attention mechanism to fuse synonym and type information of candidate entities to enhance entity representations. Afterwards, an interaction module is designed to employ a bidirectional attention mechanism to capture interactions between medical mentions and entities to generate the matching representation. Extensive experiments on two publicly available real-world datasets demonstrate MMR-FEK's superiority over state-of-the-art(SOTA) MED baselines across all metrics. Our source code is publicly available. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Multi-Relational Variational Contrastive Learning for Next POI Recommendation

Multi-Relational Variational Contrastive Learning for Next P...

引用

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

作者： Lin Chen Peipei Wang Xiaohui Han Lijuan Xu 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) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China Quan Cheng Laboratory Jinan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Next point-of-interest (POI) recommendation aims to predict the next interested POI to the user based on their historical check-in data in location-based social services. Most existing studies have attempted to model user visiting behaviors via sequence-based and graph-based models, and have achieved impressive performance. However, there is still room to explore the implicit transition preferences and contextual multiple semantic relationships among various POIs. To this end, we propose a novel graph-based Multi-Relational Variational Contrastive Learning (MRVCL) method for next POI recommendation, which captures local similarity associations and global contextual dependencies among POIs. Specifically, an order-free local-relational adaptive weighting module is designed to alleviate the problem of insufficient utilization of multi-hop neighbor information caused by the limit of neighbor order of nodes. We then develop a contextaware global-relational encoding module to capture implicit semantic sequential relationships. Finally, generative variational-contrastive learning is employed to construct a continuous representation of the latent features and reinforce the quality of representation learning. Extensive experiments on two real-world datasets validate that our MRVCL outperforms existing state-of-the-art methods on various evaluation metrics. To facilitate future research, our code and data are open-sourced at https://***/LinCH-en/MRVCL.

关键词： Representation learning Measurement Correlation Semantics Neural networks Contrastive learning Signal processing Transformers Encoding Speech processing

来源：评论

学校读者我要写书评

暂无评论

A Multi-Channel Composite Recommendation Method in Federated Learning

A Multi-Channel Composite Recommendation Method in Federated...

引用

2023 IEEE International Conference on Dependable, Autonomic and Secure Computing, 2023 International Conference on Pervasive Intelligence and Computing, 2023 International Conference on Cloud and Big Data Computing, 2023 International Conference on Cyber Science and Technology Congress, DASC/PiCom/CBDCom/CyberSciTech 2023

作者： Chen, Shi Li, Qianmu Wang, Qi Zhao, Xinjian Ge, Hao Li, Nianzhe State Grid Jiangsu Information & Telecommunication Company Nanjing China School of Computer Science Ana Engineering Nanjing University of Science and Technology Nanjing China State Grid Smart Grid Research Institute Co. Ltd. State Grid Key Laboratory of Information & Network Security Nanjing China

ISBN: (纸本)9798350304602

There are various data security risks in power grid systems, and recommendation systems are a good solution to the selection of security strategies. Federated learning is a machine learning framework that can protect the data privacy of each participant and can effectively solve the data security external collaborative training modeling challenges. This paper proposed a flexible implantable recommendation algorithm based on knowledge graph and multi-channel composite to enhance federated learning on demand. The algorithm designs three different feature extraction modules to learn to construct multi-dimensional features on multi-attribute collaborative knowledge graphs. Among them, the distance translation module utilizes the Trans R recommendation algorithm to learn the internal semantic structure information in knowledge graph triples and terminal-security policy selection history;the random walk module uses the Node2Vec algorithm to learn the homogeneous and Structured information in the multi-attribute collaborative knowledge graph;the graph convolutional network module learns the high-order neighborhood multi-attribute collaborative information of terminal/security policy nodes through multi-layer feature propagation and aggregation. The composite network module adopts a convolutional neural network-like operation to first locally optimize the three modules, and then extracts the highly informative elements to obtain the final feature representation of the terminal/security policy. Finally, the algorithm merges the vectors of terminal-security policy pairs into the multi-layer perceptron to learn and calculate the prediction score for recommendation. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

FPPNet: Fast Privacy-Preserving Neural network via Three-Party Arithmetic Secret Sharing 15th

FPPNet: Fast Privacy-Preserving Neural Network via Three-Pa...

引用

15th EAI International Conference on Mobile Multimedia Communications, MobiMedia 2022

作者： Bi, Renwan Xiong, Jinbo Li, Qi Liu, Ximeng Tian, Youliang Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Fuzhou350117 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal University Hangzhou311121 China Key Laboratory of Information Security of Network Systems College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China

ISBN: (纸本)9783031239014

Jointing multi-source data for model training can improve the accuracy of neural network. To solve the raising privacy concerns caused by data sharing, data are generally encrypted and outsourced to a group of cloud servers for computing and processing. In this client-cloud architecture, we propose FPPNet, a fast and privacy-preserving neural network for secure inference on sensitive data. FPPNet is deployed in three cloud servers, who collaboratively execute privacy computing via three-party arithmetic secret sharing. We develop the secure conversion method between additive shares and multiplicative shares, and propose three secure protocols to calculate non-linear functions, such as comparison, exponent and division that are superior to prior three-party works. Some secure modules for running convolutional, ReLU, max-pooling and Sigmoid layers are designed to implement FPPNet. We theoretically analyze the security and complexity of the proposed protocols. With MNIST dataset and two types of neural networks, experimental results validate that our FPPNet is faster than the related works, and the accuracy is the same as that of plaintext neural network. © 2022, ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

CRCC: Collaborative Relation Context Consistency on the Knowledge Graph for Recommender Systems 35

CRCC: Collaborative Relation Context Consistency on the Know...

引用

35th International Conference on Software Engineering and Knowledge Engineering, SEKE 2023

作者： Wang, Li-E Zeng, Huachang Li, Shenghan Li, Xianxian Zhuo, Shengda Xie, Jiahua Qu, Bin Sun, Zhigang Liu, Tianran School of Computer Science and Engineering Guangxi Normal University Guilin China Guangxi Key Lab of Multi-source Information Mining Security Guangxi Normal University Guilin China Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China College of Cyber Security of Jinan University Jinan University Guangzhou China School of Information Science and Engineering Yunnan University Kunming China

Knowledge graph (KG) as auxiliary information can solve the cold-start and data sparsity problems of recommender systems. However, most existing KG-based recommendation methods focus on how to effectively encode items with that users have interacted into entities and propagate them explicitly, but neglect the relation-level and context-level modeling of collaborative signals. Therefore, it is inevitable to incorporate some unrelated entities while utilizing a propagation strategy, which may weaken part of the recommendation performance. To address this problem, we propose a novel method named Collaborative Relation Context Consistency (CRCC). Compared with other KG-based methods, we model the relation-level and context-level of collaborative signals in a fine-grained manner. Specifically, we segment the user’s collaborative knowledge graph to learn related entity information separately to enrich the embedding of users. Moreover, CRCC links the consistency score between the items that users and neighbors have interacted with as the fusion basis, and then we consider the inherent popularity of items while incorporating consistent entities to enhance the embedding representation of items. Extensive experiments on three real-world datasets show that CRCC outperforms several compelling baselines in both CTR prediction and top-K recommendation. © 2023 Knowledge Systems Institute Graduate School. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Integration of MPC into Besu through an extended private transaction model

Integration of MPC into Besu through an extended private tra...

引用

Metaverse Computing, networking and Applications (MetaCom), IEEE International Conference on

作者： Daniel Morales Isaac Agudo Javier Lopez Department of Computer Science Network Information and Computer Security Lab ITIS Software Universidad de Málaga Málaga Spain

In the last few years we have seen many different approaches to incorporate privacy features to blockchains. In the area of cryptocurrencies that would normally mean protecting the identity of the owner of some funds, but there are other applications where privacy is even more important, especially in permissioned blockchains. Permissioned blockchain platforms, such as Hyperledger Besu or Hyperledger Fabric, already include the concept of private transactions, which essentially defines a sub-group of the blockchain where their participants share some private data. We want to go one step ahead and propose an extended model for private transactions where the different participants can have a separated view of the same transaction, allowing the integration of Multi-party Computation protocols in the blockchain. Our work extends Hyperledger Besu’s design for private transactions, offering better security properties and a finer grain customization. We cover two specific MPC examples, Private Set Intersection and Byzantine Fault-Tolerant Random Number Generation, and propose a mechanism to run them using smart contract interfaces.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CustomFair: A Customized Fairness Method for Federated Recommender Systems in Social Internet of Things

引用

IEEE Internet of Things Journal 2024年

作者： Chen, Guorong Li, Chao Du, Fei Yuan, Xiaohan Chi, Cheng Yin, Zihang Wang, Bin Li, Tao Bao, Xuhua Wang, Wei Beijing Jiaotong University Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing100044 China China Academy of Information and Communications Technology Beijing China Network and Data Security Hangzhou310053 China Nankai University College of Computer Science Tianjin300350 China LTD Sangfor Technologies Co Beijing China Xi'an Jiaotong University Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an China

In the Social Internet of Things (SIoT), edge computing integrates artificial intelligence to learn intricate relationships. The scale and complexity of SIoT cause a data explosion from diverse objects, hindering tailored services to users who own objects. Moreover, conventional edge computing in SIoT depends on centralized data collection, raising concerns about data privacy. To address the above two issues, federated recommender systems (FRSs) present a promising solution. FRSs can provide SIoT services to users and train a shared model while retaining sensitive data locally on objects. However, as FRSs are driven by data, they are inherently susceptible to algorithmic bias, raising substantial fairness concerns that have attracted considerable attention in SIoT. Recent fairness studies predominantly concentrate on a single sensitive attribute for users, thereby overlooking their autonomy. Therefore, we propose CustomFair, a personalized fairness framework that enables users in FRSs to select preferred sensitive attributes and acquire satisfied recommendation services in SIoT scenarios. First, we define customized fairness to ensure group fairness based on users' sensitive attributes. The server segments users into subgroups in a privacy-preserving manner. Second, CustomFair employs the DynBalance method with a flexible regularization coefficient to improve recommendation performance and utilizes the AdaptEpoch strategy to achieve fairness. Extensive experiments indicate that CustomFair improves recommendation performance by 0.1 ∼ 42.92 and enhances fairness by reducing disparities of 0.03 ∼ 5.41 compared to two baselines across three datasets. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Civil Engineering Design in IoT: Leveraging Improved Swarm Intelligence Optimization 17

Civil Engineering Design in IoT: Leveraging Improved Swarm I...

引用

IEEE Congress on Cybermatics: 17th IEEE International Conference on Internet of Things, iThings 2024, 20th IEEE International Conference on Green Computing and Communications, GreenCom 2024, 17th IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2024, 10th IEEE International Conference on Smart Data, SmartData 2024

作者： Fu, Weiheng Chen, Rongzhong Chen, Kaiwen Xie, Xiaojun Fuzhou University College of Computer and Data Science Fuzhou China Xiamen Meteorological Bureau Xiamen Key Laboratory of Straits Meteorology Xiamen China Florida Transportarion Engineeeing Inc Roadway Design Department Punta Gorda United States Fuzhou University Zhicheng College Office of Network Security and Information Fuzhou China

ISBN: (纸本)9798350351637

Nowadays, swarm intelligence algorithms are used to solve various problem in IoT environments because of their excellent performance, and the particle swarm algorithm(PSO) is a superior algorithm in swarm intelligence algorithms. The original PSO, however, exhibits certain limitations. For instance, the utilization of random initialization results in a less diverse population distribution for PSO. During the algorithm iteration process, excessively large or small weight factors can also detrimentally impact the performance of the algorithm. Moreover, when dealing with multi-modal problems, the PSO algorithm can quickly converge to local optimal because of its "precocious". In this paper, a Double-Population Particle Swarm Optimization(DP-PSO) algorithm is proposed. Firstly, the chaotic mechanism is used to initialize the population to make its distribution more uniform and obtain better convergence results. Secondly, the oscillation characteristic of the sine function is used to improve the updating method of weight by adding the sine factor, and the search area of the particle is expanded. Finally, the double-population variation mechanism is introduced to enhance the variation ability and improve the solving accuracy in the later iteration. The experimental results show that the DP-PSO is superior to other algorithms in performance and has obvious improvement in the ability to expand the search space of the population and jump out of the local optimal solution. When applied to cantilever beam design, DP-PSO also has good competitiveness in terms of stability, robustness, and scalability. © 2024 IEEE.

关键词： Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：