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

A CPK-Based Identity Authentication Scheme for IoT

Computer Systems Science & engineering 2022年第3期40卷 1217-1231页

作者： Mingming Zhang Jiaming Mao Yuanyuan Ma Liangjie Xu Chuanjun Wang Ran Zhao Zhihao Li Lu Chen Wenbing Zhao State Grid Jiangsu Electric Power Co. Ltd.Information&Telecommunication BranchNanjing210008China State Grid Key Laboratory of Information&Network Security Institute of Information and CommunicationGlobal Energy Interconnection Research InstituteNanjing210003China Anhui Jiyuan Software Co.Ltd SGITGHefei230088China Engineering Research Center of Post Big Data Technology and Application of Jiangsu Province Research and Development Center of Post Industry Technology of the State Posts Bureau(Internet of Things Technology)Engineering Research Center of Broadband Wireless Communication Technology of the Ministry of EducationNanjing University of Posts and TelecommunicationsNanjing210003China Department of Electrical Engineering and Computer Science Cleveland State UniversityCleveland44115USA

As the power Internet of Things(IoT)enters the security construction stage,the massive use of perception layer devices urgently requires an identity authentication scheme that considers both security and *** existing public key infrastructure(PKI)-based security authentication scheme is currently difficult to apply in many terminals in *** key distribution and management costs are high,which hinders the development of power IoT security *** Public key(CPK)technology uses a small number of seeds to generate unlimited public *** is very suitable for identity authentication in the power Internet of *** this paper,we propose a novel identity authentication scheme for power *** scheme combines the physical unclonable function(PUF)with improved CPK technology to achieve mutual identity authentication between power IoT terminals and *** proposed scheme does not require third-party authentication and improves the security of identity authentication for power ***,the scheme reduces the resource consumption of power IoT *** improved CPK algorithm solves the key collision problem,and the third party only needs to save the private key and the public key *** results show that the amount of storage resources occupied in our scheme is *** proposed scheme is more suitable for the power IoT.

关键词： Power Internet of Things terminal equipment identity authentication CPK PUF

来源：评论

学校读者我要写书评

暂无评论

Multiagent Q-Learning for Multicrew Dynamic Scheduling and Routing in Road Network Restoration

Multiagent Q-Learning for Multicrew Dynamic Scheduling and R...

引用

Chinese Control and Decision Conference, CCDC

作者： Yufeng Shen Lianqi Duan Qianshun Zhu Zhaopin Su Guofu Zhang School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 School of Computer Science and Information Engineering Hefei University of Technology Hefei Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei Intelligent Interconnected Systems Laboratory of Anhui Province (Hefei University of Technology) Hefei Anhui Province Key Laboratory of Industry Safety and Emergency Technology (Hefei University of Technology) Heifei

ISBN: (纸本)9781665478977

Road network restoration is an important issue in the post-disaster disposal and rescue, especially when extraordinarily serious natural disasters (e.g., floods and earthquakes) occur. Central to this endeavour is the problem of determining how to reasonably schedule and route the repair crew to quickly restore the damaged road network and establish reliable supply lines from supply nodes to demand nodes. However, most existing work focuses on the activities of the single repair crew in the static road network, which is unable to adapt to the dynamic changes of the road network caused by secondary disasters, such as rock slides and debris flows. Consequently, this work is concentrated on multicrew dynamic scheduling and routing in road network restoration. Specifically, a model of multicrew dynamic scheduling and routing is first presented. Next, the Markov decision process is adopted to construct a decision model for repair crews, based on which a multiagent Q-learning algorithm is developed to find the best scheduling and routing strategy. Finally, experimental results demonstrate that the proposed method can make repair crews adjust their scheduling and routing strategies according to the dynamic changes of the damaged road network and provides a useful attempt to restore the damaged road network in complex, dynamic emergency scenarios of post-disaster.

关键词： Schedules Q-learning Roads Heuristic algorithms Maintenance engineering Markov processes Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Robust and Fast Measure of Information via Low-rank Representation

arXiv

引用

arXiv 2022年

作者： Dong, Yuxin Gong, Tieliang Yu, Shujian Chen, Hong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China Machine Learning Group UiT - The Arctic University of Norway Norway College of Science Huazhong Agriculture University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China

The matrix-based Rényi’s entropy allows us to directly quantify information measures from given data, without explicit estimation of the underlying probability distribution. This intriguing property makes it widely applied in statistical inference and machine learning tasks. However, this information theoretical quantity is not robust against noise in the data, and is computationally prohibitive in large-scale applications. To address these issues, we propose a novel measure of information, termed low-rank matrix-based Rényi’s entropy, based on low-rank representations of infinitely divisible kernel matrices. The proposed entropy functional inherits the specialty of of the original definition to directly quantify information from data, but enjoys additional advantages including robustness and effective calculation. Specifically, our low-rank variant is more sensitive to informative perturbations induced by changes in underlying distributions, while being insensitive to uninformative ones caused by noises. Moreover, low-rank Rényi’s entropy can be efficiently approximated by random projection and Lanczos iteration techniques, reducing the overall complexity from O(n3) to O(n2s) or even O(ns2), where n is the number of data samples and s n. We conduct large-scale experiments to evaluate the effectiveness of this new information measure, demonstrating superior results compared to matrix-based Rényi’s entropy in terms of both performance and computational efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

可持续发展情景下丝绸之路沿线国家土地利用及其对陆地碳库影响

引用

Science Bulletin 2023年第7期68卷 740-749页

作者：曹敏田雅吴凯陈旻陈玉胡雪孙中昶左丽君林键骆磊朱瑞许振赐 Temenoujka Bandrova Milan Konecny 袁文平郭华东林珲闾国年 Key Laboratory of Virtual Geographic Environment Ministry of EducationNanjing Normal UniversityNanjing 210023China International Research Center of Big Data for Sustainable Development Goals Beijing 100094China Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application Nanjing 210023China School of Geography and Environment Jiangxi Normal UniversityNanchang 330022China Aerospace Information Research Institute Chinese Academy of SciencesBeijing 100094China The Key Laboratory of Urban Land Resources Monitoring and Simulation Ministry of Natural ResourcesShenzhen 518034China Sierra Nevada Research Institute University of CaliforniaMerced CA 95348USA Institute of High Performance Computing Agency for ScienceTechnology and ResearchSingapore 138632Singapore Department of Geography the University of Hong KongHong Kong 999077China Laboratory on Cartography University of ArchitectureCivil Engineering and GeodesySofia 1164Bulgaria Laboratory on Geoinformatics and Cartography Institute of GeographyMasaryk UniversityBrno 60177Czech Republic School of Atmospheric Sciences Southern Marine Science and Engineering Guangdong Laboratory(Zhuhai)Sun Yat-sen UniversityZhuhai 519082China Key Laboratory of Poyang Lake Wetland and Watershed Research Ministry of EducationJiangxi Normal UniversityNanchang 330022China

可持续发展目标(SDGs)呼吁全世界共同采取行动,促进繁荣并保护地球.本研究面向SDGs构建了环境、粮食和经济等可持续发展情景,预测2020~2030年丝绸之路沿线国家的土地利用变化,并分析其对陆地碳库的影响。研究表明:未来土地利用变化及其... 详细信息

可持续发展目标(SDGs)呼吁全世界共同采取行动,促进繁荣并保护地球.本研究面向SDGs构建了环境、粮食和经济等可持续发展情景,预测2020~2030年丝绸之路沿线国家的土地利用变化,并分析其对陆地碳库的影响。研究表明:未来土地利用变化及其对陆地碳库的影响在不同情景下存在显著差异。在可持续环境情景下,林地得到了有效保护,相较于2020年中国林地碳储量增加了约0.60%;在可持续粮食情景下,耕地流失得到了缓解,尤其在南亚及东南亚地区的耕地面积呈现上升趋势:在可持续经济情景下,城市扩张速度加快,引起的碳损失量最多这项研究有助于推进丝绸之路沿线甚至全球可持续发展进程,为探寻可持续发展路径提供了科学依据。

关键词： Sustainable development goals(SDGs) Land-use projection Carbon pool Scenarios System dynamics model Cellular automata

来源：评论

学校读者我要写书评

暂无评论

CAFI: News Recommendation with Candidate Perception of Fine-Grained Interaction Information

CAFI: News Recommendation with Candidate Perception of Fine-...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Yiwen Li Zhenyu Yang Xiaoyang Li Zhijun Li 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 Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The most critical task in personalized news recommendation is to perform exact matching between candidate news and users’ interests. Existing news recommendation methods usually model users’ interests from historical clicked news items without considering candidate news, which makes it difficult to precisely match candidate news with users’ interests. Moreover, it is challenging to distinguish similar news when forming a vector representation. Simply adding candidate news to the user interest modeling process without considering word-level information does not provide sufficient discrimination for recommending appropriate news. In this paper, we propose a news recommendation model with candidate-aware fine-grained interaction information (CAFI). In our approach, we propose a fine-grained interaction module that matches candidate news items and text fragments of each historical news item at each semantic granularity to achieve interaction between the two at the word level and help similar historical news form more specific and accurate representations. In addition, our proposed gated self-attention mechanism utilizes the candidate news features as channel moderation gates to implement the process of filtering out information that is irrelevant to the candidate news for learning user interest representations, thereby better matching the candidate news to specific user interests. Experiments conducted on the large real-world Microsoft News dataset (MIND) show that our model significantly outperforms the previously developed models in terms of all metrics. Our code is published at the following URL: https://***/liyiweneven/CAFI.

关键词： Uniform resource locators Measurement Codes Filtering Federated learning Semantics Focusing

来源：评论

学校读者我要写书评

暂无评论

MCAF: Multi-Headed Causal Attention Fusion Approach for Multimodal Sentiment Analysis

MCAF: Multi-Headed Causal Attention Fusion Approach for Mult...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Qingao Wang Xingang Wang Jinxiao Yang Yurun Bi 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 Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Multimodal sentiment analysis(MSA) aims to synthesize multiple pieces of information, including textual, visual, and auditory information, to more accurately infer sentiment polarity. Due to the existence of complex and diverse affective causal relationships between different modalities, they interact with each other and constitute a multidimensional expression of human emotions. In the face of unbalanced data, i.e., when there are significant differences in the number of samples between different categories, the attention mechanism of the model tends to focus on spurious correlations in the training data, seriously impairing the model’s generalization ability and leading to bias, unbalanced prediction, and false correlation identification problems. To address the above problems, this study proposes a new multimodal fusion method based on the "within-sample sampling" and "cross-sample sampling" front door adjustment methods in causal inference strategies: the multi-head causal attention fusion method (MCAF). This method aims to capture potential causal relationships between different modalities through different attention heads, helping the model focus more on key causal features and avoid paying too much attention to false correlations in the training data. This helps improve the generalization performance of the model, make the decision-making process of the model more interpretable, and enhance the accuracy and robustness of the model for multimodal sentiment analysis tasks, making it more suitable for practical application scenarios.

关键词： Analytical models Sentiment analysis Visualization Correlation Neural networks Training data Predictive models

来源：评论

学校读者我要写书评

暂无评论

Topic-based Multi-layer knowledge Filtering for Emotion Recognition in Conversation

Topic-based Multi-layer Knowledge Filtering for Emotion Reco...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Xiaoyang Li Zhenyu Yang Yiwen Li Zhijun Li 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 Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Emotion recognition in conversation (ERC) is a prominent research topic in natural language processing, widely applicable in various scenarios. However, accessing external commonsense knowledge and related dialogue topics, along with the complexity of fusing utterances, presents significant challenges. In this paper, we introduce a Topic-based Multilayer knowledge Filtering (TMKF) model to enhance dialog emotion recognition accuracy. TMKF acquires commonsense knowledge for each utterance and employs two Variational Autoencoder (VAE) modules to extract global and speaker-level dialogue topics. We utilize Global knowledge Filtering (GKF) and Local knowledge Filtering (LKF) to obtain topic-specific knowledge representations after filtering commonsense information through global and local topic hierarchies. Subsequently, we leverage relational graphs to convolve commonsense knowledge with utterances, resulting in knowledge-constrained utterance representations for classification. Our proposed model is evaluated through extensive experiments on four widely used benchmark datasets for conversational emotion recognition. The results underscore the effectiveness of TMKF, which significantly outperforms other methods in standard metric evaluations.

关键词： Measurement Emotion recognition Filtering Convolution Oral communication Benchmark testing Nonhomogeneous media

来源：评论

学校读者我要写书评

暂无评论

TSFE: Research on Transformer and Feature Enhancement Methods for Image-Text Retrieval

TSFE: Research on Transformer and Feature Enhancement Method...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Jinxiao Yang Xingang Wang Qingao Wang Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

In recent years, cross-modal retrieval has a wide range of applications in fields such as information retrieval and multimedia processing, where the key is to find relevant data in another modality through one modal query. In cross-modal graphic retrieval, mutual attention mechanisms are commonly used to interact image and text features. However, this interaction mechanism makes it difficult to extract separate visual and textual features for subsequent indexing steps, especially in large-scale retrieval tasks. Furthermore, in image representation, non-semantic information in image features can lead to inaccuracies in the alignment of image and text features. Therefore this paper proposes a Transformer and Feature Enhancement Method (TSFE) for Image-Text Retrieval. The method better fuses the underlying features and the higher level features by using a hierarchical Transformer coding structure on two separate branches, image and text, to proofread and localise the final output features. The Feature Enhanced Attention (FEA) module is designed in order to infer non-semantic information in the image and enhance the features of salient regions. Channel-space attention and max pooling is introduced on top of Transformer encoder self-attention to filter redundant and interfering information from channel and spatial dimensions. Experiments on Flickr30k dataset and MS-COCO dataset in this paper show improved performance in cross-modal retrieval, thus validating the effectiveness and sophistication of the proposed method.

关键词： Visualization Semantics Pipelines Noise Image representation Transformers Feature extraction

来源：评论

学校读者我要写书评

暂无评论

LESaET: Low-Dimensional Embedding Method for Link Prediction Combining Self-Attention and Enhanced-TuckER

LESaET: Low-Dimensional Embedding Method for Link Prediction...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Lichao Ding Jing Zhao Kai Lu Zenghao Hao 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 Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

knowledge graphs (KGs) provide a structured representation of the real world through entity-relation triples. However, current KGs are often incomplete, typically containing only a small fraction of all possible facts. This involves inferring missing content from existing information, a task known as link prediction. Existing methods in the field of link prediction struggle with controlling the dimensionality of embedding vectors or suffer from overly complex models. In order to tackle these challenges, we introduce a method in this paper, named Low-Dimensional Embedding Method for Link Prediction Combining Self-Attention and Enhanced-TuckER (LESaET). LESaET leverages both self-attention mechanisms and tensor factorization to learn expressive contextual-enhanced representations of KGs. Specifically, LESaET employs the multi-head self-attention mechanism of Transformer as an encoder to capture the mutual information between entities and relationships, and utilizes Enhanced-TuckER as a decoder, ultimately achieving expressive low-dimensional embeddings for link prediction tasks. LESaET demonstrates competitive performance compared to advanced methods on standard datasets.

关键词： Tensors Stacking knowledge graphs Predictive models Transformers Vectors Decoding Standards Mutual information Periodic structures

来源：评论

学校读者我要写书评

暂无评论

HGTA: News Recommendation Based on Hierarchical Granular Semantic Embeddings and Threshold Attention

HGTA: News Recommendation Based on Hierarchical Granular Sem...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Yiwen Li Zhenyu Yang Zhijun Li Xiaoyang Li 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 Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Personalized news recommendation helps users find interesting content among much news information. Most existing news recommendation techniques densely interact a user’s historical clicked news with candidate news to capture their reading interest. However, during this process, even if certain historical clicked news is weakly correlated with the candidate news, the model still interacts with it, generating more noise information when constructing user interests. Simultaneously, the news representation learning process using neural networks is a fine-grained to coarse-grained learning process; i.e., as the network deepens, the fine-grained original news information is easily lost. Therefore, to solve the above problems, this paper proposes a news recommendation model based on hierarchical granular semantic embeddings and threshold attention (HGTA). In HGTA, we propose a threshold attention module to filter unimportant historical clicked news by setting an attention score threshold, i.e., interacting only with historical clicked news that is strongly correlated with the candidate news when capturing user interests. Thus, the model attention is focused, and the noisy interaction information is reduced. Furthermore, when training the neural network, to prevent the loss of fine-grained information, we design a hierarchical granular information extraction module to capture both coarse- and fine-grained news features to better enrich the news semantics. Experiments conducted on the large real-world Microsoft News dataset (MIND) show that our model achieves highly competitive results in terms of popular metrics. Our code is published at the following URL: https://***/liyiweneven/HGTA.

关键词： Uniform resource locators Training Representation learning Federated learning Semantics Neural networks Noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：