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

9th IEEE International Conference on data science in Cyberspace, DSC 2024

作者： Liu, Kuan Li, Yumei Qi, Yuanhua Qi, Ning Zhai, Mengran Qilu University of Technology Shandong Academy of Sciences Information Research Institute Shandong Academy of Sciences Jinan China Qilu University of Technology Shandong Academy of Sciences Shandong Institute of Economy and Informatization Development Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Qilu University of Technology Shandong Academy of Sciences Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China SHANDONG SCICOM Information and Economy Research Institute Co. Ltd Jinan China Shandong Institute of Economy and Informatization Development Jinan China

ISBN: (纸本)9798350391367

With the development of the digital economy and the advent of the big data era, the rapid growth of textual information in cyberspace has placed higher demands on information processing technology. This paper proposes an information extraction technique based on the Text-to-Text Transfer Transformer, known as T5, and keyBERT models, aiming to efficiently distill the key content from textual information in cyberspace. This method combines automatic summarization and keyword extraction to form information briefs. The experiments selected representative policy documents related to data elements as input data and employed information entropy and ROUGE scores as metrics to evaluate the automatic summarization model. The results were compared with the outputs of similar models. Experimental results indicate that the T5 model outperforms other models in terms of summarization effectiveness, and the proposed information extraction method shows significant advantages in readability and processing efficiency, demonstrating practical application value. © 2024 IEEE.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

Learning discrete representations via constrained clustering for effective and efficient dense retrieval

arXiv

引用

arXiv 2021年

作者： Zhan, Jingtao Mao, Jiaxin Liu, Yiqun Guo, Jiafeng Zhang, Min Ma, Shaoping Department of Computer Science and Technology Institute for Artificial Intelligence Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China Beijing Key Laboratory of Big Data Management and Analysis Methods Gaoling School of Artificial Intelligence Renmin University of China Beijing100872 China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Dense Retrieval (DR) has achieved state-of-the-art first-stage ranking effectiveness. However, the efficiency of most existing DR models is limited by the large memory cost of storing dense vectors and the time-consuming nearest neighbor search (NNS) in vector space. Therefore, we present RepCONC, a novel retrieval model that learns discrete Representations via CONstrained Clustering. RepCONC jointly trains dual-encoders and the Product Quantization (PQ) method to learn discrete document representations and enables fast approximate NNS with compact indexes. It models quantization as a constrained clustering process, which requires the document embeddings to be uniformly clustered around the quantization centroids and supports end-to-end optimization of the quantization method and dual-encoders. We theoretically demonstrate the importance of the uniform clustering constraint in RepCONC and derive an efficient approximate solution for constrained clustering by reducing it to an instance of the optimal transport problem. Besides constrained clustering, RepCONC further adopts a vector-based inverted file system (IVF) to support highly efficient vector search on CPUs. Extensive experiments on two popular ad-hoc retrieval benchmarks show that RepCONC achieves better ranking effectiveness than competitive vector quantization baselines under different compression ratio settings. It also substantially outperforms a wide range of existing retrieval models in terms of retrieval effectiveness, memory efficiency, and time efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Parallel Optimization of Computational Fluid Dynamics Application code_saturne Based on Next Generation Sunway Supercomputer 14

Parallel Optimization of Computational Fluid Dynamics Applic...

引用

14th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2023

作者： Liu, Anjun Liao, Yin Xu, Xihao Chen, YanYan Zhong, Hongjun Wu, Jianming Kong, Bo Raikov, Alexander Guo, Meng Jinan Institute of Supercomputing Technology Jinan Key Laboratory of High Performance Industrial Software Jinan China Zhejiang Yuansuan Technology Co. Ltd Jinan Supercomputing-Zhejiang Yuansuan Industrial Simulation System Joint Laboratory Hangzhou China Qilu University of Technology Shandong Academy of Sciences Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Key Laboratory of Computing Power Network and Information Security China Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Shandong Jinan China

ISBN: (纸本)9798350371024

code_saturne is an open-source general large-scale computational fluid dynamics software independently developed by Electricite de France since 1997. Due to its high computing performance, code_saturne has been widely used in the nuclear industry, heavy fuel and biomass combustion, particle tracking and other computational fluid dynamics fields. In this work, we implemented code_saturne on the new generation Sunway supercomputer (SW26010pro) at the first time. By applying the data value-taking technology of double cache, combined with Sunway shared memory technology, we have adapted the data structure and Modular programming of code_saturne conducively to the new generation Sunway supercomputer (SW26010pro) and accelerated the software hotspots the software hotspots by 1-2 times. After optimizing and porting, this software has successfully served in the numerical simulation of the lateral flow of fuel assemblies in the nuclear industry. © 2023 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

XRL-SHAP-Cache:an explainable reinforcement learning approach for intelligent edge service caching in content delivery networks

引用

science China(Information sciences) 2024年第7期67卷 46-71页

作者： Xiaolong XU Fan WU Muhammad BILAL Xiaoyu XIA Wanchun DOU Lina YAO Weiyi ZHONG School of Software Nanjing University of Information Science and Technology School of Computing and Communications Lancaster University School of Computing Technologies Royal Melbourne Institute of Technology State Key Laboratory for Novel Software Technology Nanjing University School of Computer Science and Engineering University of New South Wales Data 61 Commonwealth Scientific and Industrial Research Organization School of Computer Science Qufu Normal University

Content delivery networks(CDNs) play a pivotal role in the modern internet infrastructure by enabling efficient content delivery across diverse geographical regions. As an essential component of CDNs, the edge caching scheme directly influences the user experience by determining the caching and eviction of content on edge servers. With the emergence of 5G technology, traditional caching schemes have faced challenges in adapting to increasingly complex and dynamic network environments. Consequently, deep reinforcement learning(DRL) offers a promising solution for intelligent zero-touch network governance. However, the blackbox nature of DRL models poses challenges in understanding and making trusting decisions. In this paper,we propose an explainable reinforcement learning(XRL)-based intelligent edge service caching approach,namely XRL-SHAP-Cache, which combines DRL with an explainable artificial intelligence(XAI) technique for cache management in CDNs. Instead of focusing solely on achieving performance gains, this study introduces a novel paradigm for providing interpretable caching strategies, thereby establishing a foundation for future transparent and trustworthy edge caching solutions. Specifically, a multi-level cache scheduling framework for CDNs was formulated theoretically, with the D3QN-based caching scheme serving as the targeted interpretable model. Subsequently, by integrating Deep-SHAP into our framework, the contribution of each state input feature to the agent's Q-value output was calculated, thereby providing valuable insights into the decision-making process. The proposed XRL-SHAP-Cache approach was evaluated through extensive experiments to demonstrate the behavior of the scheduling agent in the face of different environmental *** results demonstrate its strong explainability under various real-life scenarios while maintaining superior performance compared to traditional caching schemes in terms of cache hit ratio, quality of service(QoS),a

关键词： deep reinforcement learning (DRL) explainable artificial intelligence (XAI) multi-level cache content delivery network (CDN) D3QN algorithm Deep-SHAP

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Power of Large Language Models for Entity Alignment

arXiv

引用

arXiv 2024年

作者： Jiang, Xuhui Shen, Yinghan Shi, Zhichao Xu, Chengjin Li, Wei Li, Zixuan Guo, Jian Shen, Huawei Wang, Yuanzhuo CAS Key Laboratory of AI Safety Institute of Computing Technology CAS China School of Computer Science and Technology University of Chinese Academy of Science China IDEA Research International Digital Economy Academy China

Entity Alignment (EA) is vital for integrating diverse knowledge graph (KG) data, playing a crucial role in data-driven AI applications. Traditional EA methods primarily rely on comparing entity embeddings, but their effectiveness is constrained by the limited input KG data and the capabilities of the representation learning techniques. Against this backdrop, we introduce ChatEA, an innovative framework that incorporates large language models (LLMs) to improve EA. To address the constraints of limited input KG data, ChatEA introduces a KG-code translation module that translates KG structures into a format understandable by LLMs, thereby allowing LLMs to utilize their extensive background knowledge to improve EA accuracy. To overcome the over-reliance on entity embedding comparisons, ChatEA implements a two-stage EA strategy that capitalizes on LLMs’ capability for multi-step reasoning in a dialogue format, thereby enhancing accuracy while preserving efficiency. Our experimental results verify ChatEA’s superior performance, highlighting LLMs’ potential in facilitating EA tasks. The source code is available at https://***/IDEA-FinAI/ChatEA. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Modeling Diverse Relevance Patterns in Ad-hoc Retrieval

arXiv

引用

arXiv 2018年

作者： Fan, Yixing Guo, Jiafeng Lan, Yanyan Xu, Jun Zhai, Chengxiang Cheng, Xueqi University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Department of Computer Science University of Illinois at Urbana-Champaign IL United States

Assessing relevance between a query and a document is challenging in ad-hoc retrieval due to its diverse patterns, i.e., a document could be relevant to a query as a whole or partially as long as it provides sufficient information for users’ need. Such diverse relevance patterns require an ideal retrieval model to be able to assess relevance in the right granularity adaptively. Unfortunately, most existing retrieval models compute relevance at a single granularity, either document-wide or passage-level, or use fixed combination strategy, restricting their ability in capturing diverse relevance patterns. In this work, we propose a data-driven method to allow relevance signals at different granularities to compete with each other for final relevance assessment. Specifically, we propose a HIerarchical Neural maTching model (HiNT) which consists of two stacked components, namely local matching layer and global decision layer. The local matching layer focuses on producing a set of local relevance signals by modeling the semantic matching between a query and each passage of a document. The global decision layer accumulates local signals into different granularities and allows them to compete with each other to decide the final relevance score. Experimental results demonstrate that our HiNT model outperforms existing state-of-the-art retrieval models significantly on benchmark ad-hoc retrieval datasets. Copyright © 2018, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: Boosting Can Achieve Modality Reconcilement 41

ReconBoost: Boosting Can Achieve Modality Reconcilement

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A fine-grained perspective on the robustness of global cargo ship transportation networks

引用

Journal of Geographical sciences 2018年第7期28卷 881-899页

作者：彭澎程诗奋陈金海廖梦迪吴琳刘希亮陆锋 State Key Laboratory of Resources and Environmental Information System Institute of Geographic Sciences and Natural Resources Research CAS University of Chinese Academy of Sciences Navigation Aids Technology Research Center of Jimei University National & Local Joint Engineering Research Center for Marine Navigation Aids Services College of Geomatics Shandong University of Science and Technology Institute of Computing Technology CAS Fujian Collaborative Innovation Center for Big Data Applications in Governments Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application

The robustness of cargo ship transportation networks is essential to the stability of the world trade system. The current research mainly focuses on the coarse-grained, holistic cargo ship transportation network while ignoring the structural diversity of different sub-networks. In this paper, we evaluate the robustness of the global cargo ship transportation network based on the most recent Automatic Identification System（AIS） data available. First, we subdivide three typical cargo ship transportation networks（i.e., oil tanker, container ship and bulk carrier） from the original cargo ship transportation network. Then, we design statistical indices based on complex network theory and employ four attack strategies, including random attack and three intentional attacks（i.e., degree-based attack, betweenness-based attack and flux-based attack） to evaluate the robustness of the three typical cargo ship transportation networks. Finally, we compare the integrity of the remaining ports of the network when a small proportion of ports lose their function. The results show that 1） compared with the holistic cargo ship transportation network, the fine-grain-based cargo ship transportation networks can fully reflect the pattern and process of global cargo transportation; 2） different cargo ship networks behave heterogeneously in terms of their robustness, with the container network being the weakest and the bulk carrier network being the strongest; and 3） small-scale intentional attacks may have significant influence on the integrity of the container network but a minor impact on the bulk carrier and oil tanker transportation networks. These conclusions can help improve the decision support capabilities in maritime transportation planning and emergency response and facilitate the establishment of a more reliable maritime transportation ***： The robustness of cargo ship transportation networks is essential to the stability of the world trade system. The current resear

关键词： complex network fine-grained cargo ship transportation network robustness automatic identification system

来源：评论

学校读者我要写书评

暂无评论

UJN-Traffic: A Benchmark dataset for Performance Evaluation of Traffic Element Classification 7th

UJN-Traffic: A Benchmark Dataset for Performance Evaluation ...

引用

7th International Conference on Life System Modeling and Simulation, LSMS 2021, and the 7th International Conference on Intelligent computing for Sustainable Energy and Environment, ICSEE 2021

作者： Li, Yan Han, Shi-Yuan Shen, Yuan Liu, Zhen Dong, Ji-Wen Xu, Tao University of Jinan Jinan250022 China China High-Resolution Earth Observation System Shandong Center of Data and Application University of Jinan Jinan250022 China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan250022 China Land Spatial Data and Remote Sensing Technology Institute of Shandong Province Jinan250002 China

ISBN: (纸本)9789811672125

The detection of traffic element in remote sensing imagesplays an important role in the construction of traffic infrastructure, and can provide dynamic monitoring and quality evaluation for traffic construction projects. The convolutional neural network (CNN)-based method has achieved good performance in object detection in computer vision, which benefits from the popularity of large-scale datasets. However, the existing dataset can only be used for object detection, and the sample size and diversity need to be improved. These problems have brought challenges to the improvement and application of existing traffic element detection methods. This paper proposes a large-scale highresolution traffic element dataset based on multi-method detection analysis, and validates it based on the CNN-based object detection method. We screened more than 100 satellite images from high-resolution satellite images with a spatial resolution of 0.8 m. Manually labeled 5 categories and 100,000 traffic element samples. In the experiment, three CNN-based detection methods were used as the experimental baseline method. The experimental results proved effectiveness of the UJN-traffic traffic element dataset and provided a useful reference for traffic construction engineering and management. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Remote sensing

来源：评论

学校读者我要写书评

暂无评论

Self-Supervised Teaching and Learning of Representations on Graphs 23

Self-Supervised Teaching and Learning of Representations on ...

引用

2023 World Wide Web Conference, WWW 2023

作者： Wan, Liangtian Fu, Zhenqiang Sun, Lu Wang, Xianpeng Xu, Gang Yan, Xiaoran Xia, Feng Key Laboratory for Ubiquitous Network Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian China State Key Laboratory of Marine Resource Utilization in South China Sea School of Information and Communication Engineering Hainan University Haikou China State Key Laboratory of Millimeter Waves School of Information Science and Engineering Southeast University Nanjing China Research Center of Big Data Intelligence Research Institute of Artificial Intelligence Zhejiang Lab Hangzhou China School of Computing Technologies Rmit University Melbourne Australia

ISBN: (纸本)9781450394161

Recent years have witnessed significant advances in graph contrastive learning (GCL), while most GCL models use graph neural networks as encoders based on supervised learning. In this work, we propose a novel graph learning model called GraphTL, which explores self-supervised teaching and learning of representations on graphs. One critical objective of GCL is to retain original graph information. For this purpose, we design an encoder based on the idea of unsupervised dimensionality reduction of locally linear embedding (LLE). Specifically, we map one iteration of the LLE to one layer of the network. To guide the encoder to better retain the original graph information, we propose an unbalanced contrastive model consisting of two views, which are the learning view and the teaching view, respectively. Furthermore, we consider the nodes that are identical in muti-views as positive node pairs, and design the node similarity scorer so that the model can select positive samples of a target node. Extensive experiments have been conducted over multiple datasets to evaluate the performance of GraphTL in comparison with baseline models. Results demonstrate that GraphTL can reduce distances between similar nodes while preserving network topological and feature information, yielding better performance in node classification. © 2023 ACM.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：