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

29th International Conference on Computational and Experimental engineering and Sciences, ICCES 2023

作者： Wang, Jiaji Chen, Shuwen Zhu, Huisheng School of Physics and Information Engineering Jiangsu Second Normal University Nanjing211200 China Jiangsu Province Engineering Research Center of Basic Education Big Data Application Nanjing211200 China State Key Laboratory of Millimeter Waves Southeast University Nanjing210096 China

ISBN: (纸本)9783031449468

The Coronavirus pandemic has been going on for three years. Undoubtedly, it caused huge damage to people, physically and mentally. The earlier the doctor diagnoses, the sooner the patient will recover In this paper, we review the more advanced applications of deep learning in COVID-19 diagnosis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

REQUIRED NUMBER OF ITERATIONS FOR SPARSE SIGNAL RECOVERY VIA ORTHOGONAL LEAST SQUARES

引用

Journal of Computational Mathematics 2023年第1期41卷 1-17页

作者： Haifeng Li Jing Zhang Jinming Wen Dongfang Li Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control College of Mathematics and Information ScienceHenan Normal UniversityXinxiang 453007China College of Information Science and Technology Jinan UniversityGuangzhou 510632China School of Mathematics and Statistics Huazhong University of Science and TechnologyWuhan 430074China Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and TechnologyWuhan 430074China

In countless applications,we need to reconstruct a K-sparse signal x∈R n from noisy measurements y=Φx+v,whereΦ∈R^(m×n)is a sensing matrix and v∈R m is a noise *** least squares(OLS),which selects at each step the column that results in the most significant decrease in the residual power,is one of the most popular sparse recovery *** this paper,we investigate the number of iterations required for recovering x with the OLS *** show that OLS provides a stable reconstruction of all K-sparse signals x in[2.8K]iterations provided thatΦsatisfies the restricted isometry property(RIP).Our result provides a better recovery bound and fewer number of required iterations than those proposed by Foucart in 2013.

关键词： Sparse signal recovery Orthogonal least squares(OLS) Restricted isometry property(RIP)

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Algorithms with Heuristic Gradient-based Repair for Constrained Optimization

Evolutionary Algorithms with Heuristic Gradient-based Repair...

引用

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

作者： Du, Jiacheng Bu, Chenyang Liu, Yuxin Liu, Fei Luo, Wenjian Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Anhui Hefei230027 China Harbin Institute of Technology School of Computer Science and Technology Guangdong Shenzhen518000 China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Gradient-based repair aims to repair infeasible solutions to feasible ones using the gradient information of the constraints. As an effective constraint handling method, gradientbased repair has received extensive attention and has been applied in various evolutionary algorithms (EAs). Nevertheless, due to the complexity of constraints in practical problems, a single infeasible solution often needs to be repaired multiple times until it becomes a feasible solution or reaches the maximum number of repairs. As far as we know, existing related research on gradient-based repair mainly applies this method directly to EAs, while there is little work in the evolutionary computing community on how to improve gradient-based repair. Currently, the multiple repairs for a single individual are independent. That is, the current repair does not consider the previous repair experience. However, only using gradient information to repair infeasible individuals may result in oscillations in the search process. Therefore, in this paper, we propose a heuristic gradient-based repair method (HGR) which exploits the previous repair information of an individual to alleviate this issue. Experimental results on several benchmarks demonstrate the effectiveness of the proposed method. The source code is available at https://***/DMiC-Lab-HFUT/HGR-SMC2022. © 2022 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Intersecting-Boundary-Sensitive Fingerprinting for Tampering Detection of DNN Models 41

Intersecting-Boundary-Sensitive Fingerprinting for Tampering...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Bai, Xiaofan He, Chaoxiang Ma, Xiaojing Zhu, Bin Benjamin Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China Microsoft United States School of Computer Science and Technology Huazhong University of Science and Technology China Cluster and Grid Computing Lab China

Cloud-based AI services offer numerous benefits but also introduce vulnerabilities, allowing for tampering with deployed DNN models, ranging from injecting malicious behaviors to reducing computing resources. Fingerprint samples are generated to query models to detect such tampering. In this paper, we present Intersecting-Boundary-Sensitive Fingerprinting (IBSF), a novel method for black-box integrity verification of DNN models using only top-1 labels. Recognizing that tampering with a model alters its decision boundary, IBSF crafts fingerprint samples from normal samples by maximizing the partial Shannon entropy of a selected subset of categories to position the fingerprint samples near decision boundaries where the categories in the subset intersect. These fingerprint samples are almost indistinguishable from their source samples. We theoretically establish and confirm experimentally that these fingerprint samples' expected sensitivity to tampering increases with the cardinality of the subset. Extensive evaluation demonstrates that IBSF surpasses existing state-of-the-art fingerprinting methods, particularly with larger subset cardinality, establishing its state-of-the-art performance in black-box tampering detection using only top-1 labels. The IBSF code is available at: https://***/CGCL-codes/IBSF. Copyright 2024 by the author(s)

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

A Collaborative Heterogeneous Graph Neural Network for Personalized News Recommendation

A Collaborative Heterogeneous Graph Neural Network for Perso...

引用

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

作者： Shi, Chenglong Geng, Haibin Jiang, Wenfeng Li, Jinbao Wu, Chao Liu, Song Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

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. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Intelligent Fast Cell Association Scheme Based on Deep Q-Learning in Ultra-Dense Cellular Networks

引用

China Communications 2021年第2期18卷 259-270页

作者： Jinhua Pan Lusheng Wang Hai Lin Zhiheng Zha Caihong Kai Key Laboratory of Knowledge Engineering with Big Data Ministry of Education.School of Computer Science and Information EngineeringHefei University of TechnologyHefei 230601China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei 230601China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education.School of Cyber Science and EngineeringWuhan UniversityWuhan 430072China

To support dramatically increased traffic loads,communication networks become *** cell association(CA)schemes are timeconsuming,forcing researchers to seek fast *** paper proposes a deep Q-learning based scheme,whose main idea is to train a deep neural network(DNN)to calculate the Q values of all the state-action pairs and the cell holding the maximum Q value is *** the training stage,the intelligent agent continuously generates samples through the trial-anderror method to train the DNN until *** the application stage,state vectors of all the users are inputted to the trained DNN to quickly obtain a satisfied CA result of a scenario with the same BS locations and user *** demonstrate that the proposed scheme provides satisfied CA results in a computational time several orders of magnitudes shorter than traditional ***,performance metrics,such as capacity and fairness,can be guaranteed.

关键词： ultra-dense cellular networks(UDCN) cell association(CA) deep Q-learning proportional fairness Q-learning

来源：评论

学校读者我要写书评

暂无评论

Less is More: Token Context-aware Learning for Object Tracking

arXiv

引用

arXiv 2025年

作者： Xu, Chenlong Zhong, Bineng Liang, Qihua Zheng, Yaozong Li, Guorong Song, Shuxiang Key Laboratory of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin541004 China Key Laboratory of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences China

Recently, several studies have shown that utilizing contextual information to perceive target states is crucial for object tracking. They typically capture context by incorporating multiple video frames. However, these naive frame-context methods fail to consider the importance of each patch within a reference frame, making them susceptible to noise and redundant tokens, which deteriorates tracking performance. To address this challenge, we propose a new token context-aware tracking pipeline named LMTrack, designed to automatically learn high-quality reference tokens for efficient visual tracking. Embracing the principle of Less is More, the core idea of LMTrack is to analyze the importance distribution of all reference tokens, where important tokens are collected, continually attended to, and updated. Specifically, a novel Token Context Memory module is designed to dynamically collect high-quality spatio-temporal information of a target in an autoregressive manner, eliminating redundant background tokens from the reference frames. Furthermore, an effective Unidirectional Token Attention mechanism is designed to establish dependencies between reference tokens and search frame, enabling robust cross-frame association and target localization. Extensive experiments demonstrate the superiority of our tracker, achieving state-of-the-art results on tracking benchmarks such as GOT-10K, TrackingNet, and LaSOT. Code and models are available at https://***/XuChenLong/LMTrack. Copyright © 2025, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Research on water extraction method from remote sensing images of lakes in cold and arid regions based on deep learning 3

Research on water extraction method from remote sensing imag...

引用

3rd International Conference on Artificial Intelligence, Automation, and High-Performance Computing, AIAHPC 2023

作者： Wang, Xin Fu, Xueliang Hu, Hua Li, Honghui College of Computer and Information Engineering Inner Mongolia Agricultural University Hohhot China Inner Mongolia Autonomous Region Key Laboratory of Big Data Research Application of Agriculture and Animal Husbandry Hohhot China

ISBN: (数字)9781510666580

ISBN: (纸本)9781510666573

Semantic segmentation technology is an important research direction in the field of computer vision, with the continuous improvement of computer GPU and other hardware arithmetic power, as well as the more clear and accurate remote sensing images. In recent years, deep learning technology has developed rapidly in the field of semantic segmentation, and the level of semantic segmentation technology has improved significantly. Based on unsupervised, automated, end-to-end deep learning networks have gradually become the object of research in scene object segmentation, pre-person background segmentation, face recognition and other related fields. In this paper, we conduct research on deep learning semantic segmentation algorithms for water body extraction, focusing on specific analysis of typical problems such as long freezing period of lakes in cold and arid regions, low precipitation, complex seasonal changes of lakes, and fragile water bodies. The cold and arid zone lakes distributed in Inner Mongolia region of China are selected as the research objects, and the water body extraction experiments are conducted on the remote sensing images of Hulun Lake and Wuoliangsuhai Lake. Propose a SER34AUnet model, the model was improved based on the Unet network model of Encode-Decode architecture, and finally achieved good results in the water extraction experiments. The main work of this paper is as follows: (1) Establishing image segmentation dataset: remote sensing images of several lakes in cold and arid regions in different seasons, different satellites and various remote sensing images with specific representative features typical of cold and arid regions are used to enhance the generalization ability of the dataset. (2) Improving the Unet model: Firstly, the Resnet34 network, which is more capable of extracting image features, is used in the Encode part. Secondly, the SE (Queeze and-Excitation) module based on the channel attention mechanism is added to the BasicBlock mo

关键词： Lakes

来源：评论

学校读者我要写书评

暂无评论

CoT-based Synthesizer: Enhancing LLM Performance through Answer Synthesis

arXiv

引用

arXiv 2025年

作者： Zhang, Bohan Zhang, Xiaokang Zhang, Jing Yu, Jifan Luo, Sijia Tang, Jie School of Information Renmin University of China China Tsinghua University China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

Current inference scaling methods, such as Self-consistency and Best-of-N, have proven effective in improving the accuracy of LLMs on complex reasoning tasks. However, these methods rely heavily on the quality of candidate responses and are unable to produce correct answers when all candidates are incorrect. In this paper, we propose a novel inference scaling strategy, CoT-based Synthesizer, which leverages CoT reasoning to synthesize superior answers by analyzing complementary information from multiple candidate responses, even when all candidate responses are flawed. To enable a lightweight and cost-effective implementation, we introduce an automated data generation pipeline that creates diverse training data. This allows smaller LLMs trained on this data to improve the inference accuracy of larger models, including API-based LLMs. Experimental results across four benchmark datasets with seven policy models demonstrate that our method significantly enhances performance, with gains of 11.8% for Llama3-8B and 10.3% for GPT-4o on the MATH dataset. The corresponding training data and code are publicly available on the repository. Copyright © 2025, The Authors. All rights reserved.

关键词： data accuracy

来源：评论

学校读者我要写书评

暂无评论

Marginal Value-Based Edge Resource Pricing and Allocation for Deadline-Sensitive Tasks 42

Marginal Value-Based Edge Resource Pricing and Allocation fo...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Wang, Puwei Sun, Zhouxing Zhan, Ying Li, Haoran Du, Xiaoyong Renmin University of China School of Information China Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Beijing100872 China Guizhou University of Finance and Economics Guiyang City550025 China

ISBN: (纸本)9798350334142

In edge computing (EC), resource allocation is to allocate computing, storage and networking resources on the edge nodes (ENs) efficiently and reasonably to tasks generated by users. Due to the resource-limitation of ENs, the tasks often need to compete for the resources. Pricing mechanisms are widely used to deal with the resource allocation problem, and the valuations of tasks play a critical role in the price mechanisms. However, users naturally are not willing to expose the valuations of their tasks due to conflicts of interests. Current research works usually adopt truthful auctions to motivate the users to report honestly the valuations of their tasks. In this paper, we introduce the marginal value to estimate the valuations of tasks, and propose a marginal value-based pricing mechanism using the incentive theory, which motivates the tasks with higher marginal values to actively request more resources. The EC platform sets the resource prices using the price mechanism, and then the users determine their resource requests relying on the resource prices and the valuations of their tasks. After receiving the deadline-sensitive tasks from the users, the resource allocation can be modeled as a knapsack problem with the deadline constraints. Extensive experimental results demonstrate that our approach is computationally efficient and is promising in enhancing the utility of the EC platform and the tasks. © 2023 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：