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

arXiv 2025年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wang, Jiacheng Zhang, Ruichen Niyato, Dusit Mao, Shiwen Quek, Tony Q.S. Computer Science and Technology Jilin University Changchun130012 China Singapore University of Technology and Design Singapore487372 Singapore College of Computer Science and Technology Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849 United States Information System Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore

An integration of satellites and terrestrial networks is crucial for enhancing performance of next generation communication systems. However, the networks are hindered by the long-distance path loss and security risks in dense urban environments. In this work, we propose a satellite-terrestrial covert communication system assisted by the aerial active simultaneous transmitting and reflecting reconfigurable intelligent surface (AASTAR-RIS) to improve the channel capacity while ensuring the transmission covertness. Specifically, we first derive the minimal detection error probability (DEP) under the worst condition that the Warden has perfect channel state information (CSI). Then, we formulate an AASTAR-RIS-assisted satellite-terrestrial covert communication optimization problem (ASCCOP) to maximize the sum of the fair channel capacity for all ground users while meeting the strict covert constraint, by jointly optimizing the trajectory and active beamforming of the AASTAR-RIS. Due to the challenges posed by the complex and high-dimensional state-action spaces as well as the need for efficient exploration in dynamic environments, we propose a generative deterministic policy gradient (GDPG) algorithm, which is a generative deep reinforcement learning (DRL) method to solve the ASCCOP. Concretely, the generative diffusion model (GDM) is utilized as the policy representation of the algorithm to enhance the exploration process by generating diverse and high-quality samples through a series of denoising steps. Moreover, we incorporate an action gradient mechanism to accomplish the policy improvement of the algorithm, which refines the better state-action pairs through the gradient ascent. Simulation results demonstrate that the proposed approach significantly outperforms important benchmarks, and also validate the performance and practicality under different algorithm parameters and environment settings. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Research on Object-oriented Exploration Algorithm 2020

Research on Object-oriented Exploration Algorithm

引用

Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies

作者： Xiajiong Shen Peng Zhang Jiyong Yang Wan Chen Lei Zhang Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Henan University Kaifeng PR China Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Institute of Data and Knowledge Engineering Henan University Kaifeng PR China

ISBN: (纸本)9781450387828

In formal concept analysis, attribute exploration is a very important methodology, which can explore the logical laws between attributes in a continuous and interactive way. Object-oriented exploration is very meaningful while it is similar to attribute exploration. It can explore the implication relationship between objects. But for the existing work, almost all are attribute exploration, object-oriented exploration is rare. Research on object-oriented exploration has great practical value, such as object classification, retrieval and excavation. In order to address this problem, this article takes the object as the main research point in formal concept analysis based on related knowledge of traditional attribute exploration, and proposes theories of object-oriented exploration. According to these related theories and the framework of attribute exploration algorithm, an object-oriented exploration algorithm is proposed in this paper. The algorithm can be used to explore and understand the relationship between objects, which facilitates to understand better the relationship between objects and attributes.

关键词： Formal concept analysis Object exploration Attribute exploration Implication Concept lattice

来源：评论

学校读者我要写书评

暂无评论

Plus ça change, plus c'est la même chose – The Australian Records Management Case 18th

Plus ça change, plus c'est la même chose – The Australian...

引用

18th International Conference on Information for a Better World: Normality, Virtuality, Physicality, Inclusivity, iConference 2023

作者： Xie, Sherry L. Gao, Yubao Ma, Linqing School of Information Resource Management Renmin University of China Beijing100872 China Center for Digital Records Management Research Renmin University of China Beijing100872 China Key Laboratory of Data Engineering and Data Knowledge of the Ministry of Education of China Beijing100872 China Center for Archival Undertakings Renmin University of China Beijing100872 China

ISBN: (纸本)9783031280344

Intrigued by the information management replacing records management phenomenon, this study aimed at shedding light on it. Relying on preserved websites, the study examined relevant contents from 2007 to early 2022. It discovered the battle between records and information, and later on information asset. This battle incurred dazzling changes in managerial considerations, yet the challenges to management – either towards records, information, information and records, or information asset – remained the same. So were the unsatisfactory outcomes. A case seemed perfect to tell the plus ça change, plus c'est la même chose story. It is our hope that future studies can gather mighty strengthen and thus settle down the records-information battle once for all. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Search Result Diversification Framework Based on Dual Star-shaped Self-Attention Network 20

Search Result Diversification Framework Based on Dual Star-s...

引用

20th Chinese National Conference on Computational Linguistics, CCL 2021

作者： Qin, Xubo Dou, Zhicheng Zhu, Yutao Wen, Ji-Rong School of Information Renmin University Gaoling School of Artificial Intelligence Renmin University of China Université de Montréal Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE

Research shows that most queries issued by users are short queries. Those queries may be ambiguous or broad for specifying users' actual information need. The same query issued by different users may lead to different information needs. In order to satisfy different users' needs, the search engines need to rank the search result document diversely. This leads to the search result diversification technology. For those previous diversification approaches based on global document interactions, fully-connected self-attention networks are used for capturing the interactions among all the candidate documents, leading to well performance. However, those models only take the document interactions into consideration, ignoring the relevance signals of candidate documents. As the annotated datasets are not enough for model training, the effectiveness of the model will be limited. In this paper we prove a new implicit diversification framework based on self-attention network in the shape of dual-star. A star-shaped topological structure is deployed with an external query node, in order to effectively extract the global interaction signals relevant to the query. Using self-attention to learn the similarity between each document, this model can be trained easily, and perform significantly better than the state-of-the-art implicit approach indicating the potential of implicit methods. © 2021 China National Conference on Computational Linguistics Published under Creative Commons Attribution 4.0 International License

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

knowledge Graph based Mutual Attention for Machine Reading Comprehension over Anti-Terrorism Corpus

引用

data Intelligence 2023年第3期5卷 685-706页

作者： Feng Gao Jin Hou Jinguang Gu Lihua Zhang School of Computer Science and Technology Wuhan University of Science and TechnologyWuhan 430065Hubei The Key Laboratory of Rich-Media Knowledge Organization and Service of Digital Publishing Content Insitute of Scientic and Technical Information of ChinaBeijing 100038China Wuhan University of Science and Technology Big Data Science and Engineering Research Institute Wuhan 430065Hubei Eastchina Jiaotong University Nanchang 330013Jiangxi

Machine reading comprehension has been a research focus in natural language processing and intelligence ***,there is a lack of models and datasets for the MRC tasks in the anti-terrorism ***,current research lacks the ability to embed accurate background knowledge and provide precise *** address these two problems,this paper first builds a text corpus and testbed that focuses on the anti-terrorism domain in a semi-automatic ***,it proposes a knowledge-based machine reading comprehension model that fuses domain-related triples from a large-scale encyclopedic knowledge base to enhance the semantics of the *** eliminate knowledge noise that could lead to semantic deviation,this paper uses a mixed mutual ttention mechanism among questions,passages,and knowledge triples to select the most relevant triples before embedding their semantics into the *** results indicate that the proposed approach can achieve a 70.70%EM value and an 87.91%F1 score,with a 4.23%and 3.35%improvement over existing methods,respectively.

关键词： Machine reading comprehension Anti-terrorism domain knowledge embedding knowledge attention Mutual attention

来源：评论

学校读者我要写书评

暂无评论

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic Constrained Optimization

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic C...

引用

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Bu, Chenyang Liu, Yuxin Zhang, Lizhong Zhu, Tao Luo, Wenjian School of Computer Science and Information Engineering Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Anhui Hefei230027 China School of Computer Science and Information Engineering University of South China Hunan Hengyang421200 China School of Computer Science and Technology Harbin Institute of Technology Guangdong Shenzhen518000 China

ISBN: (纸本)9798350337020

Nature-inspired population-based stochastic search algorithms (SSA) have demonstrated effectiveness in solving many real-world dynamic optimization problems (DOPs), such as dynamic optimal power flow (DOPF) problems. The basic idea of solving DOPs using SSAs is to 'track the moving optima', rather than solving the changed problems from scratch. Its hidden assumption is that the problems are slightly changed in general, and it is expected that the search process can be accelerated by learning from past search experiences. However, the hidden assumption that the current search process can always benefit from previous search experiences might not be true for certain cases. For example, if the current problem is not similar to any of its previous problems, the historical solutions might not be helpful for the current search. To reduce such negative transfer, the following issues are worthy of study: how to choose which historical problems to learn from, and how to determine the degree of learning from historical problems. To solve the above problems, we propose a dynamic processing framework based on fuzzy rules from the perspective of incorporating human knowledge for optima tracking. The experimental results on the DOPF problems show that the SSA with the proposed optima tracking strategy outperforms other comparative algorithms. We open up the code and data of our algorithm44https://***/DMiC-Lab-HFUT/SMDE-Transfer. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Review-aware Graph Contrastive Learning Framework for Recommendation

arXiv

引用

arXiv 2022年

作者： Shuai, Jie Sun, Peijie Zhang, Kun Hong, Richang Li, Yong Wu, Le Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Center China Beijing National Research Center for Information Science and Technology Department of Electronic Engineering Tsinghua University China

Most modern recommender systems predict users’ preferences with two components: user and item embedding learning, followed by the user-item interaction modeling. By utilizing the auxiliary review information accompanied with user ratings, many of the existing review-based recommendation models enriched user/item embedding learning ability with historical reviews or better modeled user-item interactions with the help of available user-item target reviews. Though significant progress has been made, we argue that current solutions for review-based recommendation suffer from two drawbacks. First, as review-based recommendation can be naturally formed as a user-item bipartite graph with edge features from corresponding user-item reviews, how to better exploit this unique graph structure for recommendation? Second, while most current models suffer from limited user behaviors, can we exploit the unique self-supervised signals in the review-aware graph to guide two recommendation components better? To this end, in this paper, we propose a novel Review-aware Graph Contrastive Learning (RGCL) framework for review-based recommendation. Specifically, we first construct a review-aware user-item graph with feature-enhanced edges from reviews, where each edge feature is composed of both the user-item rating and the corresponding review semantics. This graph with feature-enhanced edges can help attentively learn each neighbor node weight for user and item representation learning. After that, we design two additional contrastive learning tasks (i.e., Node Discrimination and Edge Discrimination) to provide self-supervised signals for the two components in recommendation process. Finally, extensive experiments over five benchmark datasets demonstrate the superiority of our proposed RGCL compared to the state-of-the-art baselines. Copyright © 2022, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Semantic-Reconstructed Graph Transformer Network for Event Detection

Semantic-Reconstructed Graph Transformer Network for Event D...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zhuochun Miao Xingrui Zhuo Gongqing Wu Chenyang Bu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Anhui China

Event detection (ED) is a key subtask of information extraction to extract key events, such as stock rise and fall and social public opinion, from news or social media. Although current GCN-based event detection methods achieve remarkable success via building graphs with dependency trees, they typically suffer from two challenges: 1) They use sequence models to learn contextual information of sentences, ignoring the longterm dependencies problem of sequence models might learn ineffective information and make it propagate in GCN layers. 2) Most methods do not exploit global dependency label information and grammatical structure information that convey rich linguistic knowledge directly, and only consider local dependency label information. To cope with these challenges, we propose a novel event detection model via semantic-reconstructed graph transformer networks (SRGTNED), which incorporates semantic reconstruction and path information collection methods. Using the semantic reconstruction method, we assign a pruned sequence to each word based on the path information to capture contextual information consistent with sentence semantics. Moreover, to better utilize global dependency label information and grammatical structure information, a Graph Transformer Network (GTN)-based heterogeneous graph embedding framework is introduced to automatically learn path information between important words by converting sentences as heterogeneous graphs. We conduct experiments on the ACE2005 dataset and the Commodity News dataset, and the experimental results demonstrate that our method significantly outperforms 11 state-of-the-art baselines in terms of the F1-score.

关键词：

来源：评论

学校读者我要写书评

暂无评论

knowledge Graph for China’s Genealogy

Knowledge Graph for China’s Genealogy

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Tingting Jiang Yi Zhu Chenyang Bu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education China School of Information Engineering Yangzhou University Yangzhou China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

Genealogical knowledge graphs depict the relationships of family networks and the development of family histories. They can help researchers to analyze and understand genealogical data, search for genealogical roots, and explore the origins of a family more easily. However, the multi-type, multisource dynamic changes and specialized nature of genealogical data bring challenges to the development of contemporary knowledge graph models. Applying existing methods to genealogical data can result in problems of overlooking certain specialized vocabulary and dynamic properties such as personal experiences. In this paper, we propose a genealogical knowledge graph model GKGM that combines HAO intelligence (h uman intelligence + a rtificial intelligence + o rganizational intelligence) and ontology granularity division technology to address the above problems. Furthermore, a method of applying the model to construct genealogical knowledge graphs is demonstrated, and an experiment conducted on a real-world genealogical dataset verifies the feasibility and effectiveness of the model.

关键词： Ontologies data models Blood data mining Biological system modeling History

来源：评论

学校读者我要写书评

暂无评论

Managing Electronic Records in E-government:Current Trends and Future Directions Internationally

Managing Electronic Records in E-government:Current Trends a...

引用

International Conference on Management and Service Science(2011年第五届管理与服务科学国际会议 MASS 2011)

作者： Xiaomi An Wei Zhang Shuyang Sun Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Ministry of School of Information Resources Management Renmin University of China Beijing China

More and more literature has been written on electronic records management (ERM) in e-government in recent three years, however, much is limited to experiences of one country with more focus on electronic records management systems (ERMS). This paper aims to investigate current trends and future directions of ERM including ERMS in e-government with more focus on comprehensive approaches internationally. Representative shows current ERMS have limitations either from IT perspectives or records and archives management perspectives managing records as data. Future research is called for more concerns of e-government and more involvement in efficient civil service. Case studies of representative policies, regulations, best practices guidelines from Australia, Canada, New Zealand, UK and U.S show challenges of ERM in e-government are getting more and more recognized in information risk, data governance and efficient civil service. Current trends of ERM in e-government are toward multidisciplinary and collaborative approaches to ERM managing records as information resources and business asset. Findings indicate that future directions of ERM in e-government would be toward meta-synthesis management at both organizational and national level, with integration concerns of collaboration, optimization and innovation of both ERM and e-government for civil service. The findings may have implications to be of use to both ERM and e-government professions internationally.

关键词： Electronic government Law Information services Collaboration

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：