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

IEEE International Conference on Systems, Man and Cybernetics

作者： Haibin Geng Chenglong Shi Xuesong Jiang Zan Kong Song Liu 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 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

Document-level entity relation extraction is an important task in the field of natural language processing, which plays an important role in semantic understanding and knowledge graph construction. However, existing deep neural networks and graph neural networks models are limited by their performance and parameters number, which can not capture global semantics and have poor generalization ability. Furthermore, existing methods employing large language model for entity relation extraction do not establish good relationships among multi-tasks of entity relation extraction task, resulting in more information can not be effectively shared and transmitted between tasks. In addition, previous approaches can not effectively eliminate false entities and relationships. To solve these problems, we propose an entity relation extraction framework based on large language model and multi-tasks iterative prompt engineering. In our model, we design an iterative prompt engineering, which can better establish the relationship among multi-tasks, and ensure every task to obtain the optimal results. Moreover, we design semantic merging, group disambiguation and self-verification modules to eliminate the false entity relations and noise nodes. Additionally, we design summary prompts to provide sufficient global semantics for better text segmentation. Finally, we evaluated our model on wikiann, wikineural, ACE2005, CoNLL2003, CoNLL2004, and SciERC datasets and compared it with other baseline models.

关键词： Large language models Semantics Noise Merging Knowledge graphs Multitasking Natural language processing Iterative methods Prompt engineering data mining

来源：评论

学校读者我要写书评

暂无评论

A Collaborative Heterogeneous Graph Neural Network for Personalized News Recommendation

A Collaborative Heterogeneous Graph Neural Network for Perso...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Chenglong Shi Haibin Geng Wenfeng Jiang Jinbao Li Chao Wu Song Liu 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 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

Personalized news recommendation is the process of predicting the relevance of news to users and recommending news to user to fulfill their information needs. However, existing news recommendation methods extract semantic information from users and candidate news respectively, ignoring semantic interaction information between users and candidate news. Furthermore, previous models only use same node types for message passing, ignoring different characteristics and topology between different node types. In addition, existing methods learn news representations through text representations, ignoring semantic correlation information between entity relationships and texts. To solve these problems, we propose a personalized news recommendation model named CoHG. In our model, we design a collaborative fusion module to obtain semantic interaction information through interacting user history news with candidate news. Furthermore, we design a heterogeneous gated graph neural network that maps different node types into a same space to extract higher-order information in user graphs for message passing. Moreover, we design an enhanced relevant attention module to enhance semantic correlation information of text content by aggregating text representation and entity representation into a unified representation. Finally, we conducted experiments on MIND and Adressa datasets to compare with other baseline models.

关键词： Correlation Message passing Semantics Collaboration Logic gates Graph neural networks Topology History data mining Cybernetics

来源：评论

学校读者我要写书评

暂无评论

NQNR: News Recommendation Method Based on News Quality-Aware Modeling

NQNR: News Recommendation Method Based on News Quality-Aware...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Baojie Xu Zhenyu Yang Yan Huang Wenyue Hu Zhibo Zhang The 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 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

Personalized News Recommendation (PNR) can enhance user experience by alleviating information overload. Traditional news recommendation methods consider all clicking behaviors as user interests, resulting in biased user modeling that fails to accurately capture user interests. In addition, although there are methods to reduce the impact of low-quality news at the representation level by simply filtering it through the attention mechanism. However, this only implicitly models the news in the interaction sequence without specifically considering the quality of each news, and thus has very limited effect in identifying noise. To address these issues, this paper proposes News Recommendation method based on News Quality-aware modeling (NQNR). We attempt to explicitly model the news in the click sequence and candidate ranking one by one to visually assess the quality of each news. Specifically, we design a detection module to detect whether the input news is low-quality news. Then, by reducing the influence of low-quality news in user modeling and candidate ranking, user interests are modeled more accurately, while recommendations of such news are reduced for users. In addition, to capture the similarity of vectors more accurately, we also design a similarity computation method based on the multiple attention mechanism in the detection module. Experiments on a large real-world Microsoft News dataset (MIND) show that our model significantly outperforms previous models. Our code is posted at the following URL: https://***/xxbbjj/NQNR-.

关键词： Uniform resource locators Attention mechanisms Codes Accuracy Filtering Computational modeling Noise Vectors User experience Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Robust and Lightweight Authentication for Securing Communication in the Internet-of-Drones (IoD) Environment

Robust and Lightweight Authentication for Securing Communica...

引用

IEEE Conference on Computer Communications Workshops, INFOCOM Wksps

作者： Saeed Ullah Jan Muhammad Bilal Anwar Ghani Salabat Khan Rashid Ahmad Do–Hveun Kim Higher Education Department Govt. College Wari (Dir Upper) Khyber Pakhtunkhwa Pakistan School of Computing and Communications Lancaster University United Kingdom Big Data Research Center Jeju National University Jeju-si South Korea Faculty of Computing and Information Technology Sohar University Sohar Oman Dept. Computer Engineering Jeju National University Jeju-si South Korea

ISBN: (数字)9798350384475

ISBN: (纸本)9798350384482

Being an essential component of 5G and beyond, the Internet of Drones (IoD) enables a legitimate operator to employ several drones to carry out distinct missions in restricted airspace under the control of the GCS. Communication with the external user (mobile operator), the central server, and other drones is accomplished via a public wireless medium, which is vulnerable to numerous threats and needs robust authentication. Various authentication schemes have been presented, some of which have design issues, excessive communication, or lack of a delicate balance of security and performance due to modular exponentiation. Therefore, this article proposes a secure authentication scheme based on asymmetric cryptography to address the issues above. The security of the proposed scheme is formally scrutinized through the RoR model, ProVerif. Furthermore, the performance is analyzed through computation, communication, and storage overheads. The comparative analysis shows that the proposed scheme balances security with performance and can be implemented in a real-world IoD environment.

关键词： Wireless communication Hash functions Protocols Computational modeling Authentication Product delivery Internet

来源：评论

学校读者我要写书评

暂无评论

A Logic for Iterated Belief Revision 16

A Logic for Iterated Belief Revision

引用

16th IEEE International Conference on intelligent Systems and Knowledge Engineering, ISKE 2021

作者： Meng, Hua Long, Zhiguo Wang, Yong Xing, Bin Zhang, Hui Southwest Jiaotong University School of Mathematics Chengdu China Southwest Jiaotong University School of Computing and Artificial Intelligence Chengdu China Key Laboratory of Aerodynamic Noise Control China Aerodynamics Research and Development Center Mianyang China Innovation Center of Industrial Big-Data Chongqing China

ISBN: (纸本)9781665405539

Representing belief information is a fundamental problem in the field of belief revision. The AGM framework uses a deductively closed set of formulas, known as a theory, to represent the belief information of an agent, because the belief information of a rational agent should satisfy properties similar to a theory. However, in the iterated revision setting, the DP framework uses conditional beliefs like (φ | ψ) to represent such information, which is not natural, as conditional beliefs are not formulas and logical connections between them cannot be characterized clearly. In this paper, we propose a novel logic system for representing belief information under iterated revision as a theory in this logic system, which is more natural than the approach of the DP framework. We also prove the soundness and completeness of the logic system, such that it is readily usable for performing iterated revision. Finally, we showed that this logic system is powerful enough to represent general epistemic state as a theory, which is more general than the representation of the DP framework. © 2021 IEEE.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

ERC DMSP: Emotion Recognition in Conversation Based on Dynamic Modeling of Speaker Personalities

ERC DMSP: Emotion Recognition in Conversation Based on Dynam...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiaoyang Li Zhenyu Yang Zhijun Li Yiwen Li 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 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

Emotion Recognition in Conversations (ERC) is a widely applicable task, whether in emotional chatbots or recommender systems for dialog scenarios. The ability of systems to accurately identify human emotions is a crucial component in ERC success. In everyday conversations, a speaker’s emotional expression is closely tied to their individual characteristics and personality traits. Furthermore, individuals exhibit significant variations in their expressions of the same emotion. Traditional methods for ERC often overlook these personality differences and dynamic changes, leading to unreliable results. To address this issue, we propose a conversation emotion recognition model based on dynamic modeling of speaker’s personality (ERC DMSP). In our approach, to extract a speaker’s personality profile, we design a personality capture module to model the personalities of individuals based on their historical utterances. Moreover, a bidirectional influence exists between a speaker’s personality tendencies and their linguistic behavior. The speaker’s personality profile is thus continually updated based on the ongoing dialog. Additionally, since the personalities of other speakers in the conversation can also affect the form and intensity of a speaker’s emotional expression, we construct a conversation emotion representation utilizing group personality traits. We then comprehensively incorporate the speaker’s personality into the emotion representation of each utterance at both the group and individual levels through the personality engagement module. Throughout this process, the representation of dialog and the speaker’s personality undergo hierarchical updates, leading to more accurate conversation emotion recognition. We conducted extensive experiments on four commonly used public benchmark datasets for ERC to evaluate the effectiveness of our proposed ERC DMSP model. The results demonstrate its efficacy, as it exhibits a significant improvement over other methods in popular

关键词： Measurement Emotion recognition Accuracy Codes Neural networks Oral communication Color

来源：评论

学校读者我要写书评

暂无评论

STAR NRE: Solving supernova selection effects with set-based truncated auto-regressive neural ratio estimation

arXiv

引用

arXiv 2024年

作者： Karchev, Konstantin Trotta, Roberto via Bonomea 265 Trieste34136 Italy Astrophysics Group Physics Department Blackett Lab Imperial College London Prince Consort Road LondonSW7 2AZ United Kingdom INFN-National Institute for Nuclear Physics Via Valerio 2 Trieste34127 Italy Italian Research Center on High-Performance Computing Big Data and Quantum Computing Italy

Accounting for selection effects in supernova type Ia (SN Ia) cosmology is crucial for unbiased cosmological parameter inference-even more so for the next generation of large, mostly photometric-only surveys. The conventional "bias correction" procedure has a built-in systematic bias towards the fiducial model used to derive it and fails to account for the additional Eddington bias that arises in the presence of significant redshift uncertainty. On the other hand, Bayesian hierarchical models scale poorly with the data set size and require explicit assumptions for the selection function that may be inaccurate or contrived. To address these limitations, we introduce STAR NRE, a simulation-based approach that makes use of a conditioned deep set neural network and combines efficient high-dimensional global inference with subsampling-based truncation in order to scale to very large survey sizes while training on sets with varying cardinality. Applying it to a simplified SN Ia model consisting of standardised brightnesses and redshifts with Gaussian uncertainties and a selection procedure based on the expected LSST sensitivity, we demonstrate precise and unbiased inference of cosmological parameters and the redshift evolution of the volumetric SN Ia rate from ≈100 000 mock SNa Ia. Our inference procedure can incorporate arbitrarily complex selection criteria, including transient classification, in the forward simulator and be applied to complex data like light curves. We outline these and other steps aimed at integrating STAR NRE into an end-to-end simulation-based pipeline for the analysis of future photometric-only SN Ia data. Copyright © 2024, The Authors. All rights reserved.

关键词： Cosmology

来源：评论

学校读者我要写书评

暂无评论

An Efficient Block Validation Mechanism for UTXO-based Blockchains

An Efficient Block Validation Mechanism for UTXO-based Block...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Xiaohai Dai Bin Xiao Jiang Xiao Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computing The Hong Kong Polytechnic University Hong Kong

It has been recognized that one of the bottlenecks in the UTXO-based blockchain systems is the slow block validation - the process of validating a newly-received block by a node before locally storing it and further broadcasting it. As a block contains multiple inputs, the block validation mainly involves checking the inputs against the status data, which is also known as the Unspent Transaction Outputs (UTXO) set. As time goes by, the UTXO set becomes more and more expansive, most of which can only be stored on disks. This considerably slows down the input checking and thus block validation, which can potentially compromise system security. To deal with the above problem, we disassemble the function of input checking into three parts: existence validation (EV), unspent validation (UV), and script validation (SV). Based on the disassembly, we propose EBV, an efficient block validation mechanism to speed up EV, UV, and SV individually. First, EBV changes the representation of status data, from UTXO set to a bit-vector set, which drastically reduces its size. The smaller status data can be entirely maintained in memory, thereby accelerating UV and also block validation. Second, EBV requires each transaction to carry the proof data, which enables EV and SV without accessing the disks. Furthermore, we also cope with two challenges in the design of EBV, namely transaction inflation and fake positions. To evaluate the EBV mechanism, we implement a prototype on top of Bitcoin, the most widely known UTXO-based blockchain, and conduct extensive experiments to compare EBV and Bitcoin. The experimental results demonstrate that EBV successfully reduces the memory requirement by 93.1 % and the block validation time by up to 93.5%.

关键词： Distributed processing Memory management Prototypes Bitcoin Broadcasting Blockchains Delays

来源：评论

学校读者我要写书评

暂无评论

A nearly optimal distributed algorithm for computing the weighted girth

引用

Science China(Information Sciences) 2021年第11期64卷 80-94页

作者： Qiang-Sheng HUA Lixiang QIAN Dongxiao YU Xuanhua SHI Hai JIN National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology School of Computer Science and Technology Shandong University

computing the weighted girth, which is the sum of weights of edges in the minimum weight cycle,is an important problem in network analysis. The problem for distributively computing girth in unweighted graphs has garnered lots of attention, but there are few studies in weighted graphs. In this paper, we propose a distributed randomized algorithm for computing the weighted girth in weighted graphs with integral edge weights in the range [1, nc], where n is the number of vertices and c is a constant. The algorithm is devised under the standard synchronous CON GE S T model, which limits each vertex can only transfer O（log n） bits information along each incident edge in a round. The upper bound of the algorithm is O（n log2n） rounds. We also prove the lower bound for computing the weighted girth is ?（D + n/log n） where D is the hop diameter of the weighted graph. This means our distributed algorithm is optimal within a factor of O（log3n）.

关键词： distributed algorithms weighted girth \({\cal C}{\cal O}{\cal N}{\cal G}{\cal E}{\cal S}{\cal T}\) model communication complexity round complexity

来源：评论

学校读者我要写书评

暂无评论

Outlier detection algorithm based on density and distance

Outlier detection algorithm based on density and distance

引用

2021 3rd International Conference on Applied Machine Learning and data Science, ICAMLDS 2021

作者： Qu, Ying Guo, Fei School of Economics and Management Hebei University of Science and Technology Shijiazhuang Hebei050018 China Data Science and Intelligent Computing Research Center Hebei University of Science and Technology Shijiazhuang Hebei050018 China

In order to solve the problem that the existing outlier detection algorithm is difficult to detect the one-dimensional integer data set with uneven frequency distribution and uniform distance distribution and low accuracy, the advantages of density outlier detection and distance outlier detection can be combined. An outlier detection algorithm DAD (Density and Distance) based on density and distance was proposed. In order to improve the possibility of outlier sample distance, the algorithm can define the weight distance;introduce the global density outlier factor combined with the weight distance as the relative distance, and use the cutting edge strategy to quickly cut the outliers based on the minimum spanning tree. Then, an artificial data set was used to test the algorithm. Experimental results showed that the algorithm had a good outlier detection accuracy in dealing with data sets with uneven frequency distribution and uniform distance distribution. © Published under licence by IOP Publishing Ltd.

关键词： Signal detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：