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

arXiv 2024年

作者： Tao, Wei Zhou, Yucheng Wang, Yanlin Zhang, Hongyu Wang, Haofen Zhang, Wenqiang Shanghai Engineering Research Center of AI and Robotics Academy for Engineering and Technology Fudan University Shanghai China State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China School of Software Engineering Sun Yat-sen University Guangdong Zhuhai519082 China School of Big Data and Software Engineering Chongqing University Chongqing China College of Design and Innovation Tongji University Shanghai China Engineering Research Center of AI and Robotics Ministry of Education Academy for Engineering and Technology Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University 220 Handan Road Shanghai200433 China

Commit messages are natural language descriptions of code changes, which are important for software evolution such as code understanding and maintenance. However, previous methods are trained on the entire dataset without considering the fact that a portion of commit messages adhere to good practice (i.e., good-practice commits), while the rest do not. On the basis of our empirical study, we discover that training on good-practice commits significantly contributes to the commit message generation. Motivated by this finding, we propose a novel knowledge-aware denoising learning method called KADEL. Considering that good-practice commits constitute only a small proportion of the dataset, we align the remaining training samples with these good-practice commits. To achieve this, we propose a model that learns the commit knowledge by training on good-practice commits. This knowledge model enables supplementing more information for training samples that do not conform to good practice. However, since the supplementary information may contain noise or prediction errors, we propose a dynamic denoising training method. This method composes a distribution-aware confidence function and a dynamic distribution list, which enhances the effectiveness of the training process. Experimental results on the whole MCMD dataset demonstrate that our method overall achieves state-of-the-art performance compared with previous methods. © 2024, CC BY.

关键词： Sampling

来源：评论

学校读者我要写书评

暂无评论

Cooperative Game Model of Delegation Computing: Verifier Separated from Calculators

Cooperative Game Model of Delegation Computing: Verifier Sep...

引用

IEEE Conference on computer Communications Workshops, INFOCOM Wksps

作者： Duo Zhang Youliang Tian Linjie Wang Sheng Gao Jianfeng Ma State Key Laboratory of Public Big Data College of Computer Science and Technology College of Mathematics and Statistics Guizhou University Guiyang China State Key Laboratory of Public Big Data College of Computer Science and Technology Institute of Cryptography and Date Security Guizhou University Guiyang China State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China School of Information Central University of Finance and Economics Beijing China School of Cyber Engineering College of Computer Science and Technology Xi'dian University Xi'an China

ISBN: (数字)9781728186955

ISBN: (纸本)9781728186962

In cloud computing, the delegation computation service is required because end users usually are resource-constrained, and at the same time the correctness of computing results needs to be verified. However, all the existing and available technologies have a high cost to verify which is the main problem faced by the delegation computing under the cloud platform. In order to address this issue, based on the game theory and a smart contract, we construct three protocols. The client and the calculator sign the Prisoner's Protocol to incentivize correct computation by asking the calculator to pay a deposit upfront; The client and the verifier sign the Long-acting Mechanism Protocol to ensure the validity of the verification results; The calculator and the verifier sign the Collusion Protocol to make collusion the most profitable strategy for all colluding parties. Through the combination of these protocols, the work is realized by separation the computing task and the verification task, and the heavy verification task is avoided. Finally, the performance analysis of the results shows that the combination of all the protocols not only solves the problem of verification complexity in the traditional delegation computing, but also guarantees the benefit of the honest player.

关键词： Calculators Contracts Protocols Task analysis Computational modeling Cloud computing Security

来源：评论

学校读者我要写书评

暂无评论

A New Optimization Based on Parallelizing Hybrid PSOGSA Algorithm 16th

A New Optimization Based on Parallelizing Hybrid PSOGSA Algo...

引用

16th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2020 in conjunction with the 13th International Conference on Frontiers of Information technology, Applications and Tools, FITAT 2020

作者： Yu, Jie Wang, Hong-Jiang Pan, Jeng-Shyang Chang, Kuo-Chi Ngo, Truong-Giang Nguyen, Trong-The College of Mechanical and Automotive Engineering Fujian University of Technology Fuzhou350118 China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China College of Computer Science and Engineering Shandong University of Science and Technology Shandong China College of Mechanical and Electrical Engineering National Taipei University of Technology Taipei Taiwan Department of Business Administration North Borneo University College Sabah Malaysia Thuyloi University 175 Tay Son Dong Da Hanoi Viet Nam Haiphong University of Management and Technology Haiphong Viet Nam

ISBN: (纸本)9789813367562

This study suggests a new metaheuristic algorithm for global optimization, based on parallel hybridizing the swarm optimization (PSO) and Gravitational search algorithm (GSA). Subgroups of the population are formed by dividing the swarm’s community. Communication between the subsets can be developed by adding strategies for the mutation. Twenty-three benchmark functions are used to test its performance to verify the feasibility of the proposed algorithm. Compared with the PSO, GSA, and parallel PSO (PPSO), the findings of the proposed algorithm reveal that the proposed PPSOGSA achieves higher precision than other competitor algorithms. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2021.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

G3SR: Global Graph Guided Session-based Recommendation

arXiv

引用

arXiv 2022年

作者： Deng, Zhi-Hong Wang, Chang-Dong Huang, Ling Lai, Jian-Huang Yu, Philip S. School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Information Security Technology Guangzhou China College of Mathematics and Informatics South China Agricultural University Guangzhou China Guangdong Provincial Key Laboratory of Public Finance and Taxation with Big Data Application China University of Illinois at Chicago ChicagoIL United States

Session-based recommendation tries to make use of anonymous session data to deliver high-quality recommendation under the condition that user-profiles and the complete historical behavioral data of a target user are unavailable. Previous works consider each session individually and try to capture user interests within a session. Despite their encouraging results, these models can only perceive intra-session items and cannot draw upon the massive historical relational information. To solve this problem, we propose a novel method named G3SR (Global Graph Guided Session-based Recommendation). G3SR decomposes the session-based recommendation workflow into two steps. First, a global graph is built upon all session data, from which the global item representations are learned in an unsupervised manner. Then, these representations are refined on session graphs under the graph networks, and a readout function is used to generate session representations for each session. Extensive experiments on two real-world benchmark datasets show remarkable and consistent improvements of the G3SR method over the state-of-the-art methods, especially for cold items. Copyright © 2022, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A new class of history-dependent quasi variational-hemivariational inequalities with constraints

arXiv

引用

arXiv 2023年

作者： Migórski, Stanislaw Bai, Yunru Zeng, Shengda College of Applied Mathematics Chengdu University of Information Technology Sichuan Province Chengdu610225 China School of Science Guangxi University of Science and Technology Guangxi Province Liuzhou545006 China Jagiellonian University in Krakow Faculty of Mathematics and Computer Science ul. Lojasiewicza 6 Krakow30348 Poland Guangxi Colleges and Universities Key Laboratory of Complex System Optimization and Big Data Processing Yulin Normal University Guangxi Province Yulin537000 China

In this paper we consider an abstract class of time-dependent quasi variational-hemivariational inequalities which involves history-dependent operators and a set of unilateral constraints. First, we establish the existence and uniqueness of solution by using a recent result for elliptic variational-hemivariational inequalities in reflexive Banach spaces combined with a fixed-point principle for history-dependent operators. Then, we apply the abstract result to show the unique weak solvability to a quasistatic viscoelastic frictional contact problem. The contact law involves a unilateral Signorini-type condition for the normal velocity and the nonmonotone normal damped response condition while the friction condition is a version of the Coulomb law of dry friction in which the friction bound depends on the accumulated *** Codes 35J87, 47J20, 49J40, 49J45, 74G30, 74M15 © 2023, CC BY.

关键词： Friction

来源：评论

学校读者我要写书评

暂无评论

SmartZKCP: Towards practical data exchange marketplace against active attacks

引用

Blockchain: Research and Applications 2025年第2期6卷

作者： Xuanming Liu Jiawen Zhang Yinghao Wang Xinpeng Yang Xiaohu Yang College of Computer Science and Technology Zhejiang University Hangzhou 310027 China The State Key Laboratory of Blockchain and Data Security Hangzhou 310027 China

The trading of data is becoming increasingly important as it holds substantial value. A blockchain-based data marketplace can provide a secure and transparent platform for data exchange. To facilitate this, developing a fair data exchange protocol for digital goods has garnered considerable attention in recent decades. The Zero Knowledge Contingent Payment (ZKCP) protocol enables trustless fair exchanges with the aid of blockchain and zero-knowledge proofs. However, applying this protocol in a practical data marketplace is not trivial. In this paper, several potential attacks are identified when applying the ZKCP protocol in a practical public data marketplace. To address these issues, we propose SmartZKCP, an enhanced solution that offers improved security measures and increased performance. The protocol is formalized to ensure fairness and secure against potential attacks. Moreover, SmartZKCP offers efficiency optimizations and minimized communication costs. Evaluation results show that SmartZKCP is both practical and efficient, making it applicable in a data exchange marketplace.

关键词： Blockchain Fair exchange data marketplace Zero knowledge

来源：评论

学校读者我要写书评

暂无评论

Low-Light Enhancement Effect on Classification and Detection: An Empirical Study

arXiv

引用

arXiv 2024年

作者： Wu, Xu Lai, Zhihui Jie, Zhou Gao, Can Hou, Xianxu Zhang, Ya-Nan Shen, Linlin The Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Shenzhen518060 China

Low-light images are commonly encountered in real-world scenarios, and numerous low-light image enhancement (LLIE) methods have been proposed to improve the visibility of these images. The primary goal of LLIE is to generate clearer images that are more visually pleasing to humans. However, the impact of LLIE methods in high-level vision tasks, such as image classification and object detection, which rely on high-quality image datasets, is not well explored. To explore the impact, we comprehensively evaluate LLIE methods on these high-level vision tasks by utilizing an empirical investigation comprising image classification and object detection experiments. The evaluation reveals a dichotomy: While Low-Light Image Enhancement (LLIE) methods enhance human visual interpretation, their effect on computer vision tasks is inconsistent and can sometimes be harmful. Our findings suggest a disconnect between image enhancement for human visual perception and for machine analysis, indicating a need for LLIE methods tailored to support high-level vision tasks effectively. This insight is crucial for the development of LLIE techniques that align with the needs of both human and machine vision. Copyright © 2024, The Authors. All rights reserved.

关键词： Machine vision

来源：评论

学校读者我要写书评

暂无评论

QoI-aware incentive for multimedia crowdsensing enabled learning system

QoI-aware incentive for multimedia crowdsensing enabled lear...

引用

作者： Gu, Yiren Shen, Hang Bai, Guangwei Wang, Tianjing Liu, Xuejun College of Computer Science and Technology Nanjing Tech University Nanjing211816 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China

While much research has been devoted to algorithm improvement of the machine learning model for multimedia applications, relatively little research has focused on the acquisition of massive multimedia datasets with strict data demands for model training. In this paper, we propose a Quality-of-Information (QoI) aware incentive mechanism in multimedia crowdsensing, with the objective of promoting the growth of an initial training model. We begin with a reverse auction incentive model to maximize social welfare while meeting the requirements in quality, timeliness, correlation, and coverage. Then, we discuss how to achieve the optimal social welfare in the presence of an NP-hard winner determination problem. Lastly, we design an effective incentive mechanism to solve the auction problem, which is shown to be truthful, individually rational and computationally efficient. Our evaluation study is carried out using a real multimedia dataset. Extensive simulation results demonstrate that the proposed incentive mechanism produces close-to-optimal social welfare noticeably, while accompanied by accelerating the growth of the machine learning model with a high-QoI dataset. © 2019, Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Chinese News Text Classification and Its Application Based on Combined-Convolutional Neural Network

引用

Journal of computers (Taiwan) 2022年第4期33卷 1-14页

作者： Liu, Kai-Feng Zhang, Yu Zhang, Quan-Xin Wang, Yan-Ge Gao, Kai-Long Jiangsu Vocational College of Finance and Economics Huaian223003 China School of Electrical and Information Engineering Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing University of Civil Engineering and Architecture Beijing100044 China State Key Laboratory in China for GeoMechanics and Deep Underground Engineering China University of Mining & Technology Beijing100083 China School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China

A method based on combined-convolutional neural network (Combined-CNN) for Chinese news text classification is proposed. First of all, in order to solve the problem of a lack of special term set for Chinese news classification, a vocabulary suitable for Chinese long text classification is made by constructing a data index method. The Word2Vec pre-trained model was used to embed the text features word vectors. Second, by optimizing the structure of the classical convolutional neural network (CNN) model, a new idea of Combined-CNN model is proposed, which solves the problem of incomplete feature extraction of local text blocks and improves the accuracy rate of Chinese news text classification. Effective model regularization and RAdam optimization algorithm are designed in the model to enhance the model training effect. The experimental results show that the precision of the Combined-CNN model for Chinese news text classification reaches 93.69%. Compared with traditional machine learning methods and deep learning algorithms, the accuracy rate is improved by a maximum of 11.82% and 1.9%, respectively, and it is better than the comparison model in Recall and F-Measure. Finally, the Chinese news classification algorithm of the Combined-CNN is applied to realize a personalized recommendation system. © 2022 computer Society of the Republic of China. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Diffusion-based Dynamic Contract for Federated AI Agent Construction in Mobile Metaverses

arXiv

引用

arXiv 2025年

作者： Wen, Jinbo Kang, Jiawen Zhang, Yang Zhong, Yue Niyato, Dusit Xu, Jie Tang, Jianhang Yuen, Chau College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics China School of Automation Guangdong University of Technology China College of Computing and Data Science Nanyang Technological University Singapore Guangdong Provincial Key Laboratory of Future Networks of Intelligence The Chinese University of Hong Kong Shenzhen China State Key Laboratory of Public Big Data Guizhou University China School of Electrical and Electronics Engineering Nanyang Technological University Singapore

Mobile metaverses have attracted significant attention from both academia and industry, which are envisioned as the next-generation Internet, providing users with immersive and ubiquitous metaverse services through mobile devices. Driven by Large Language Models (LLMs) and Vision-Language Models (VLMs), Artificial Intelligence (AI) agents hold the potential to empower the creation, maintenance, and evolution of mobile metaverses. Currently, AI agents are primarily constructed using cloud-based LLMs and VLMs. However, several challenges hinder their effective implementation, including high service latency and potential sensitive data leakage during perception and processing. In this paper, we develop an edge-cloud collaboration-based federated AI agent construction framework in mobile metaverses. Specifically, Edge Servers (ESs), acting as agent infrastructures, collaboratively create agent modules in a distributed manner. The cloud server then integrates these modules into AI agents and deploys them at the edge, thereby enabling low-latency AI agent services for users. Considering that ESs may exhibit dynamic levels of willingness to participate in federated AI agent construction, we design a two-period dynamic contract model to continuously motivate ESs to participate in agent module creation, effectively addressing the dynamic information asymmetry between the cloud server and the ESs. Furthermore, we propose an Enhanced Diffusion Model-based Soft Actor-Critic (EDMSAC) algorithm to efficiently generate optimal dynamic contracts, in which dynamic structured pruning is applied to DM-based actor networks to enhance denoising efficiency and policy learning performance. Extensive simulations demonstrate the effectiveness and superiority of the EDMSAC algorithm and the proposed contract model. Copyright © 2025, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：