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

作者： Zhong, Sheng-Hua Peng, Jianfeng Liu, Peiqi College of Computer Science and Software Engineering Shenzhen University Shenzhen China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

Today, thanks to the major breakthrough of sequences to sequences model in the field of natural language, most of the dialogue generation tasks are focused on generating more effective responses. However, the responses proposed by the chat-bot are only a passive answer or assentation, which does not arouse the desire of people to continue communicating. How to transform the chat robot from a passive reply to an active questioner has become an urgent problem. In this paper, a question generalization method with four types of question proposing schemes are designed, implemented, and tested to automate question generation process. The proposed system is controlled by a probability-triggered multiple conversion mechanism to actively propose different types of questions. We embed our methods in the mainstream dialogue generation model and demonstrate its effectiveness in dialogue response generalization on a standard dataset. In addition, it achieves good performance in subjective conversational assessment. © 2019 John Wiley & Sons, Ltd.

关键词： dialogue response generalization system probability-triggered question generation

来源：评论

学校读者我要写书评

暂无评论

QoE-oriented Soft Caching with Content Recommendation for Edge Computing Networks

QoE-oriented Soft Caching with Content Recommendation for Ed...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Chenyang Wang Yan Chen Chuan Sun Bosen Jia Xiaofei Wang Tarik Taleb Victor C. M. Leung College of Computer Science & Software Engineering Shenzhen University Shenzhen China Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) Shenzhen China Faculty of Electrical Engineering and Information Technology Ruhr University Bochum Bochum Germany College of Computing and Data Science Nanyang Technological University Singapore China Unicom Digital Technology Co. Ltd Beijing China College of Intelligence and Computing Tianjin University Tianjin China University of British Columbia Vancouver Canada

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Mobile Edge Caching (MEC) can potentially alleviate Internet transmission congestion by delivering content at the network edge. However, current MEC solutions suffer from low resource utilization efficiency and often fail to meet user Quality of Experience (QoE), primarily due to dynamic user requests and obsessive pursuit of direct caching hits. Given the prevalence of recommendation systems, users often lack precise requests when using recommendation-based applications like TikTok and Taobao, insted passively enjoying recommended content. In this paper, we introduce a recommendation-enabled MEC architecture to enhance resource utilization and QoE. We develop a recommendation-enabled soft caching model and formulate the optimization problem as maximizing joint system revenue. To address this, we propose an attention-assisted federated learning deep Q-network algorithm. We conduct the simulations by using the real-world MIND dataset. The results demonstrate that our proposed algorithm outperforms existing baselines, demonstrating its effectiveness in improving resource utilization and QoE.

关键词： Video on demand Heuristic algorithms Computational modeling Internet Quality of experience Resource management Web sites Global communication Optimization Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Low-altitude Friendly-Jamming for Satellite-Maritime Communications via Generative AI-enabled Deep Reinforcement Learning

arXiv

引用

arXiv 2025年

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Niyato, Dusit Leung, Victor C.M. College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518115 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering The University of British Columbia VancouverV6T 1Z4 Canada

Low Earth Orbit (LEO) satellites can be used to assist maritime wireless communications for data transmission across wide-ranging areas. However, extensive coverage of LEO satellites, combined with openness of channels, can cause the communication process to suffer from security risks. This paper presents a low-altitude friendly-jamming LEO satellite-maritime communication system enabled by a unmanned aerial vehicle (UAV) to ensure data security at the physical layer. Since such a system requires trade-off policies that balance the secrecy rate and energy consumption of the UAV to meet evolving scenario demands, we formulate a secure satellite-maritime communication multi-objective optimization problem (SSMCMOP). In order to solve the dynamic and long-term optimization problem, we reformulate it into a Markov decision process. We then propose a transformer-enhanced soft actor critic (TransSAC) algorithm, which is a generative artificial intelligence-enable deep reinforcement learning approach to solve the reformulated problem, so that capturing global dependencies and diversely exploring weights. Simulation results demonstrate that the TransSAC outperforms various baselines, and achieves an optimal secrecy rate while effectively minimizing the energy consumption of the UAV. Moreover, the results find more suitable constraint values for the system. Copyright © 2025, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

RSP-Hist: Approximate Histograms for Big data Exploration on Hadoop Clusters

RSP-Hist: Approximate Histograms for Big Data Exploration on...

引用

International Conference on High Performance Computing

作者： Salman Salloum Joshua Zhexue Huang Big Data Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (纸本)9781665410175

We propose a sampling-based method, called RSP-Hist, to construct approximate equi-width histograms and help data scientists explore the probability distribution of big data on Hadoop clusters. In RSP- Hist, the Random Sample Partition (RSP) model is used to store a big data set as ready-to-use random sample data blocks, called RSP blocks, in the Hadoop Distributed File System (HDFS). An approximate histogram is computed by applying a sequential histogram algorithm in parallel to each block in a block-level sample of RSP blocks. Local histograms from individual RSP blocks are combined to produce an approximate histogram for the entire data. We tested RSP-Hist on four data sets using a small computing cluster. In this paper, we demonstrate the effect of the sampling rate and the number of buckets on the histogram accuracy and show that RSP-based approximate histograms are equivalent to the exact histograms computed from the entire data. RSP- Hist can avoid the data correlation issue in HDFS blocks and significantly reduce both computation and communication costs. It enables iterative and interactive exploration of big data sets on small computing clusters and can be used for multivariate data exploration.

关键词： Histograms Costs Correlation High performance computing Distributed databases Big data data models

来源：评论

学校读者我要写书评

暂无评论

Analysis of Virtualization Based Approach for Detecting Computer Network and its Applications

Analysis of Virtualization Based Approach for Detecting Comp...

引用

Signal Processing, Computation, Electronics, Power and Telecommunication (IConSCEPT), International Conference on

作者： Arshadh Ariff Mohamed Abuthahir Riazulhameed Nune Sreenivas S. Usha Gundala Venkata Rama Lakshmi Nithyananthi Subramaniam G. Ramachandran Blackstraw Technologies Pvt Ltd Architect - Data Engineer Chennai Tamil Nadu Department of CSE Adama Science and Technology University Adama Ethiopia Department of MBA S.A. Engineering College Thiruverkadu Chennai Department of CSE CVR College of Engineering Hyderabad Bosch Global Software Technologies Coimbatore Tamilnadu ECE Vinayaka Mission's Kirupananda Variyar Engineering College Vinayaka Mission's Research Foundation Deemed to be University Salem India

ISBN: (数字)9798331540685

ISBN: (纸本)9798331540692

The Research presents a virtualization-based method and system for establishing network security services. It includes the following steps: acquiring host devices and computing node sets. based on the host's equipment, determine the link bandwidth; The set of host devices and computing nodes is used to build the computing resource model. The service function chain is implemented using the computing resource model to create network security services. This paper presents a strategy that leverages the features of container-borne network functions for quick deployment, and it suggests several dynamic function deployment techniques. Based on the concept of integer programming optimization problem modeling, the overall problem is broken down into separate sub problems, the optimization problem's scale is reasonably constrained, and quick container deployment is used to guarantee that service request response times are minimal while, to some extent, retaining the performance advantages of simple optimization methods.

关键词： Integer programming Performance evaluation Service function chaining Computational modeling Signal processing algorithms Network security Containers

来源：评论

学校读者我要写书评

暂无评论

Reversible data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

引用

IEEE Internet of Things Journal 2025年

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： adaptive coding chinese remainder theorem for polynomials encrypted images Reversible data hiding secret sharing

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Multiobjective Feature Selection Assisted by Unselected Features

Evolutionary Multiobjective Feature Selection Assisted by Un...

引用

Congress on Evolutionary Computation

作者： Xuan Duan Songbai Liu Junkai Ji Lingjie Li Qiuzhen Lin Kay Chen Tan College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) Shenzhen University Shenzhen China Department of Computing The Hong Kong Polytechnic University Hong Kong SAR

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

To enhance the generalization of multi-objective feature selection (MOFS) in classification, this paper proposes an evolutionary multitasking algorithm, diverging from previous approaches that exclusively target selected features. The algorithm integrates information from both selected and unselected features, introducing a novel objective to minimize the accuracy of unselected features. This objective, combined with the goal of minimizing classification errors for selected features, forms an auxiliary MOFS task. The paper presents a dual-population evolutionary multitasking framework that synergizes the main MOFS task with the auxiliary task. A knowledge transfer mechanism, based on accuracy preferences, seamlessly shares insights from the auxiliary to the main task, aiming to identify improved Pareto feature subsets. Empirical results demonstrate the superior performance of several state-of-the-art multi-objective algorithms within this framework, highlighting significant improvements across diverse datasets.

关键词： Accuracy Evolutionary computation Multitasking Feature extraction Classification algorithms Task analysis Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

An Energy-Aware UAVs Path Coverage for Critical Infrastructure Inspections

An Energy-Aware UAVs Path Coverage for Critical Infrastructu...

引用

International Conference on Advanced Cloud and Big data (CBD)

作者： Yifan Wang Wei Zeng Guanyu Li Chenglong Xiong Zicheng Wang Yingchi Mao College of Computer Science and Software Engineering Hohai University Nanjing China Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing China Huaneng Lancang River Hydropower Co. CHINA HUANENG Group Kunming China Power China Kunming Engineering Co. Yunnan China

ISBN: (数字)9798331511074

ISBN: (纸本)9798331511081

Critical infrastructures increasingly rely on unmanned aerial vehicles (UAVs) for inspection tasks. The significance of different components within these infrastructures is subject to variability and can be influenced by external factors. The principal aim of routine UAV inspections is to ensure differentiated coverage of pivotal sections with minimal energy consumption. However, extant research on UAV path coverage fails to fully account for the variability and dynamic shifts in regional significance and their impact on coverage efficacy. This paper presents an energy-aware collaborative coverage policy for UAVs, designated as ***-MATD3 employs a dynamic weight region partitioning method tailored to real-world environments and addresses the action selection challenge for UAVs using a discrete Partially Observable Markov Decision Process (Dec-POMDP). By amalgamating MATD3 with stacked LSTM, this approach mitigates redundant path overlaps and unnecessary action replication across multiple agents, thus optimizing coverage and diminishing energy usage. Simulation outcomes demonstrate that EA-MATD3 reduces energy consumption by an average of 9.65% relative to the Greedy, MADDPG, and MATD3 algorithms while sustaining a superior coverage rate.

关键词： Energy consumption Simulation Markov decision processes Termination of employment Inspection Autonomous aerial vehicles Critical infrastructure Vehicle dynamics Long short term memory Optimization

来源：评论

学校读者我要写书评

暂无评论

Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives

arXiv

引用

arXiv 2024年

作者： Wu, Xuan Wang, Di Wen, Lijie Xiao, Yubin Wu, Chunguo Wu, Yuesong Yu, Chaoyu Maskell, Douglas L. Zhou, You Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin university Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore School of Software Tsinghua University Beijing100084 China College of Computing and Data Science Nanyang Technological University 639798 Singapore

Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically designed to solve Vehicle Routing Problems (VRPs) have been conducted, they did not cover the state-of-the-art (SOTA) NCO solvers emerged recently. More importantly, to establish a comprehensive and up-to-date taxonomy of NCO solvers, we systematically review relevant publications and preprints, categorizing them into four distinct types, namely Learning to Construct, Learning to Improve, Learning to Predict-Once, and Learning to Predict-Multiplicity solvers. Subsequently, we present the inadequacies of the SOTA solvers, including poor generalization, incapability to solve large-scale VRPs, inability to address most types of VRP variants simultaneously, and difficulty in comparing these NCO solvers with the conventional Operations Research algorithms. Simultaneously, we discuss on-going efforts, identify open inadequacies, as well as propose promising and viable directions to overcome these inadequacies. Notably, existing efforts focus on only one or two of these inadequacies, with none attempting to address all of them concurrently. In addition, we compare the performance of representative NCO solvers from the Reinforcement, Supervised, and Unsupervised Learning paradigms across VRPs of varying scales. Finally, following the proposed taxonomy, we provide an accompanying web page as a live repository for NCO solvers. Through this survey and the live repository, we aim to foster further advancements in the NCO community. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Pointsurface: Discriminative Point Cloud Surface Feature Extraction for 3d Face Recognition

SSRN

引用

SSRN 2024年

作者： Yang, Junpeng Li, Qiufu Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Guangdong Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen University Guangdong Shenzhen518172 China

3D face recognition performs better than 2D face recognition, in terms of robustness against lighting and digital attacks. Compared to 2D data, the rich geometric information in 3D data could be very useful to improve the performance of 3D face recognition. This paper introduces PointSurFace, a surface feature extraction integrated model tailored for point cloud based 3D face recognition. PointSurFace adopts a specially designed surface feature extraction module, which explores information about the position and normals of the 3D face surface to explicitly extract local discriminative features from 3D point cloud faces. Subsequently, it alternates between set abstraction (SA) layers and Inverted Residual MLP (InvResMLP) modules to effectively extract features from the point cloud data. To better handle the spatial relationships in the point cloud data, PointSurFace integrates coordinate and feature data within each SA layer and InvResMLP module. It also applies channel fusion operations to align these different types of data, thereby more effectively extracts point cloud features. Experimental results in 3D facial recognition and verification across multiple datasets demonstrate that PointSurFace achieves the best 3D face recognition performance to date. For example, on Lock3DFace, it achieves the state-of-the-art recognition and verification accuracy of 90.03% and 80.01%, respectively, surpassing previous methods by 2.02% and 3.19%. Results on cross-quality datasets also affirm PointSurFace’s strong generalization capabilities. Ablation experiments validate the effectiveness of each module within PointSurFace, which suggests that the proposed surface feature extraction module significantly enhances the point cloud based 3D facial recognition performance. © 2024, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：