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

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Haihong Guo Fengxin Li Jiao Li Hongyan Liu School of Information Renmin University of China China Chinese Academy of Medical Sciences / Peking Union Medical College Institute of Medical Information / Medical Library China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Offline Reinforcement Learning (RL) optimizes policy using pre-collected data instead of direct environment interaction, offering a safe and cost-effective solution for sequential decision-making in the real world. However, it faces challenges such as distribution shift issues and vulnerability under perturbations. Researchers have developed various conservative methods to improve the robustness of offline RL. Nevertheless, model-based methods can result in transition distribution shift issues, while model-free value-based uncertainty penalty methods may not be sufficiently robust. To address these problems, we propose a new method called Robust Offline RL via Conservative Smoothing and Dynamics Controlling (RCSD). To achieve reliable value estimation of out-of-distribution (OOD) actions, RCSD uses both model-free uncertainty penalty and model-based simulation methods. It introduces a new one-step simulation method with conservative dynamics controlling to avoid value overestimation caused by transition distribution shifts. Moreover, RCSD considers both current and next states when generating OOD states to ensure cautious value estimation and efficient data utilization. RCSD uses conservative Q-smoothing and policy smoothing to strengthen the policy against sudden changes under perturbations. Experiments on D4RL benchmark demonstrate that RCSD can achieve state-of-the-art performance compared to baselines in either benchmark or adversarial attack tests.

关键词： Uncertainty Smoothing methods Perturbation methods Estimation Reinforcement learning Benchmark testing Signal processing Robustness Speech processing Faces

来源：评论

学校读者我要写书评

暂无评论

A Model Inference Attack Based on Random Sampling in DLaaS 1

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Wu, Feng Sun, Shouyue Yang, Jiaxun Wu, Liwen Cui, Lei Qu, Youyang Yao, Shaowen Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Engineering Research Center of Cyberspace Yunnan University Kunming China School of Information Science and Engineering Yunnan University Kunming China Data61 Commonwealth Scientific and Industrial Research Organization BurwoodVIC3166 Australia

ISBN: (数字)9789819615513

ISBN: (纸本)9789819615506

Deep learning as a service (DLaaS) has become an effective business solution in numerous domains. Nevertheless, its service form has been proven vulnerable to model inference by previous research. Existing work on model inference attack relies on strong assumptions, such as the attacker knows the sample variance and model structure, which may not thoroughly reflect the attack’s potential threats. In this paper, we propose MC-infer, a zero-knowledge, real-data-free, and black-box model inference method inspired by Monte-Carlo sampling. In particular, MC-infer feeds random noises obtained from different distributions to the target model, and sniffs the corresponding target distributions according to its feedback. Then many samples are taken in these distributions to obtain enough robust noises. Finally, the distribution represented by the target model is fitted through these noises to perform model inference. Our extensive evaluations demonstrate that MC-infer can effectively infer the target model with less information, and general noise perturbation on the model’s outputs cannot defend against MC-infer. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

Traditional Chinese Medicine Automated Diagnosis Based on knowledge Graph Reasoning

引用

Computers, Materials & Continua 2022年第4期71卷 159-170页

作者： Dezheng Zhang Qi Jia Shibing Yang Xinliang Han Cong Xu Xin Liu Yonghong Xie School of Computer&Communication Engineering University of Science&Technology BeijingBeijing100083China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing100083China Inspur Electronic Information Industry Co. Ltd.&State Key Laboratory of High-End Server&Storage TechnologyJinan250101China Surgical Simulation Research Lab Department of SurgeryUniversity of AlbertaEdmontonT6G 2E1AlbertaCanada

Syndrome differentiation is the core diagnosis method of Traditional Chinese Medicine(TCM).We propose a method that simulates syndrome differentiation through deductive reasoning on a knowledge graph to achieve automated diagnosis in *** analyze the reasoning path patterns from symptom to syndromes on the knowledge *** are two kinds of path patterns in the knowledge graph:one-hop and *** one-hop path pattern maps the symptom to syndromes *** two-hop path pattern maps the symptom to syndromes through the nature of disease,etiology,and pathomechanism to support the diagnostic *** the different support strengths for the knowledge paths in reasoning,we design a dynamic weight *** utilize Naïve Bayes and TF-IDF to implement the reasoning method and the weighted score *** proposed method reasons the syndrome results by calculating the possibility according to the weighted score of the path in the knowledge graph based on the reasoning path *** evaluate the method with clinical records and clinical practice in *** preliminary results suggest that the method achieves high performance and can help TCM doctors make better diagnosis decisions in ***,the method is robust and explainable under the guide of the knowledge *** could help TCM physicians,especially primary physicians in rural areas,and provide clinical decision support in clinical practice.

关键词： Traditional Chinese medicine automated diagnosis knowledge graph Naïve Bayes syndrome differentiation

来源：评论

学校读者我要写书评

暂无评论

Robust twin-field quantum key distribution through sending or not sending

引用

National Science Review 2023年第4期10卷 76-85页

作者： Cong Jiang Zong-Wen Yu Xiao-Long Hu Xiang-Bin Wang Jinan Institute of Quantum Technology State Key Laboratory of Low Dimensional Quantum Physics Department of Physics Tsinghua University Data Communication Science and Technology Research Institute School of Physics State Key Laboratory of Optoelectronic Materials and Technologies Sun Yat-sen University Shanghai Branch CAS Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics University of Science and Technology of China Shenzhen Institute for Quantum Science and Engineering and Physics Department Southern University of Science and Technology Frontier Science Center for Quantum Information

The sending-or-not-sending(SNS) protocol is one of the most major variants of the twin-field(TF)quantum key distribution(QKD) protocol and has been realized in a 511-km field fiber, the farthest field experiment to date. In practice, however, all decoy-state methods have unavoidable source errors, and the source errors may be non-random, which compromises the security condition of the existing TF-QKD protocols. In this study, we present a general approach for efficiently calculating the SNS protocol's secure key rate with source errors, by establishing the equivalent protocols through virtual atenuation and the tagged model. This makes the first result for TF QKD in practice where source intensity cannot be controlled exactly. Our method can be combined with the two-way classical communication method such as active odd-parity pairing to further improve the key rate. The numerical results show that if the intensity error is within a few percent, the key rate and secure distance only decrease marginally. The key rate of the recent SNS experiment in the 511-km field fiber is still positive using our method presented here, even if there is a ±9.5% intensity fluctuation. This shows that the SNS protocol is robust against source errors.

关键词： quantum information quantum key distribution sending or not sending twin field source error

来源：评论

学校读者我要写书评

暂无评论

Imaging Detection and Classification for Near-space Dim Targets 7

Imaging Detection and Classification for Near-space Dim Targ...

引用

7th International Conference on Vision, Image and Signal Processing, ICVISP 2023

作者： Yuan, Yupu Xi, Runping Chen, Qian School of Computer Science Northwestern Polytechnical University Xi'an China Shaanxi Province Key Laboratory of Speech & Image Processing Xi'an China National Engineering Laboratory of Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi'an China

ISBN: (纸本)9781839539848

The motion mode of near-space targets is complex due to their high threat level. The target imaging faces low SNR and susceptibility to background noise. The existing detection and classification algorithms struggle to meet the demands of performance and speed on such targets. To address these issues, a YOLOv5-based target detection algorithm utilizes CARAFE upsampling and the small detection head to extract internal features and edge information of dim target. The algorithm adeptly captures dim target features, enhancing real-time performance and detection accuracy while overcoming subtle feature granularity and extraction difficulties. Aiming at the problem that there is no existing trajectory classification algorithm in the near-space field, we propose an infrared dim target trajectory classification algorithm. The improved attention module is used to enhance the extraction of motion features, and the target category is accurately identified by the prediction module, improving the capacity to extract dependencies between trajectory fragments. We execute comparative experiments on common infrared dim target dataset, near-space infrared dim target dataset and real dataset to confirm the viability of our methods. The outcomes indicate that our proposed method can be applied to the above three types of dim targets and significantly outperforms state-of-the-art methods. © The Institution of engineering & Technology 2023.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Frontiers of Artificial Intelligent and Quantitative Management: Preface for ITQM 2024

引用

Procedia Computer Science 2024年 242卷 1-8页

作者： Filip, Florin Gheorghe Shi, Yong Pocatilu, Paul Ciurea, Cristian-Eugen Li, Jianping Tien, James M. Berg, Daniel Romanian Academy Information Science and Technology Section Bucharest Romania Research Centre on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Lab of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States Bucharest University of Economic Studies Bucharest Romania College of Engineering University of Miami Coral GablesFL33124 United States

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Robust Android Malware Familial Classification

引用

IEEE Transactions on Dependable and Secure Computing 2022年 1-14页

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai China University of Texas at Dallas Dallas USA National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. IEEE

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

CLCoSum: Curriculum Learning-Based Code Summarization for Code Language Models

CLCoSum: Curriculum Learning-Based Code Summarization for Co...

引用

IEEE/ACM International Conference on Program Comprehension (ICPC)

作者： Hongkui He Jiexin Wang Liuwen Cao Yi Cai School of Software Engineering South China University of Technology Key Laboratory of Big Data and Intelligent Robot (SCUT) MOE of China

ISBN: (数字)9798331502232

ISBN: (纸本)9798331502249

The code summarization task aims to automatically generate natural language descriptions for code snippets. Recently, pre-trained code language models (CLMs) have demonstrated outstanding performance on code summarization. Additionally, researchers have shown that there is a strong correlation between code function names and summaries, and poorly defined function names lead to worse summaries generated by models. To mitigate this issue, in this paper, we propose CLCoSum, a curriculum learning-based code summarization method for CLMs that improves their performance in poorly named function scenarios. CLCoSum helps CLMs avoid overreliance on function names when they are poorly defined. First, CLCoSum employs data augmentation operators on function names to generate semantically equivalent poorly named codes, which are considered harder data and assist in reducing the model's reliance on unclear function names. Subsequently, CLCoSum uses a curriculum learning paradigm to allow the model to learn these harder codes in an organized way during finetuning. This approach enables CLMs to progress from easier to more difficult training data, similar to the human learning process. Extensive experiments on two existing datasets for Java and Python demonstrate that CLCoSum boosts the performance of various CLMs in code summarization. Specifically, the improvements in BLEU-4 score range from approximately 5% to $\mathbf{2 0. 8 \%}$ . The fine-tuning speed of CLCoSum on the augmented dataset is also competitive. Our code and data are available at https://***/KuiH/CLCoSum.

关键词： Java Codes Correlation Natural languages Training data data augmentation data models Python

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Multi-Granular Decision Networks for Hierarchical Classification

SSRN

引用

SSRN 2024年

作者： Liu, Haoyang Hu, Xue gang Bai, Shengxing Lin, Yaojin Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education China School of Computer Science and Information Engineering Hefei University of Technology Anhui Hefei230009 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Anhui Hefei230009 China School of Computer Science Minnan Normal University Fujian Zhangzhou363000 China Key Laboratory of Data Science and Intelligence Application Minnan Normal University Fujian Zhangzhou363000 China

Hierarchical classification learning is an effective means of solving large-scale classification problems, which models classification problems at different levels of granularity according to a hierarchical structure. In hierarchical classification tasks, classification results at different levels of granularity are mutually beneficial, where coarse-grained results can reduce the number of fine-grained candidate categories, and fine-grained results can provide a basis for coarse-grained classification. However, for the final decision, the contribution of the granularity levels in the different hierarchies is different and unknown. Feedback from different granularity levels should be flexibly integrated. In addition, errors in hierarchical classification are not equivalent, and some errors can have serious results for practical applications. In order to address the above challenges, we propose a new hierarchical network to integrate multi-granularity knowledge for decision making. On the one hand, the network computes the decision scores of instances at each granularity level and learns a set of weights to combine all scores. Based on the learnable weights, the model can effectively utilize the multi-granularity classification results to obtain the final decision. On the other hand, we design local and global classification losses to guide model optimization, which allows the model to gain a hierarchical perspective and the ability to understand the degree of hierarchical misclassification. As a result, the extent to which the method results in misclassification consequences is limited. Experimental results on five benchmark datasets show that our method arises as a state-of-the-art hierarchical classification method. © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Multimodal Brain Tumor Segmentation Method: Parallel Fusion of Transformer and CNN

A Multimodal Brain Tumor Segmentation Method: Parallel Fusio...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Zheng, Fang Zhou, Hang Li, Guoliang Ni, Fuchuan Huazhong Agricultural University Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Key Laboratory of Smart Farming Technology for Agricultural Animals Ministry of Agriculture and Rural Affairs College of Informatics Wuhan China Huazhong Agricultural University College of Informatics Wuhan China Hubei Engineering Technology Research Center of Agricultural Big Data Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan China

ISBN: (纸本)9798350386226

While convolutional neural network(CNN) have historically achieved significant success in 3D medical image segmentation, recent advancements in Vision Transformer (ViT) have led to increased popularity of Transformer architectures in this field. Leveraging the global information extraction capabilities of Transformers, we propose a novel parallel structure combining CNN and Transformer for multimodal brain tumor segmentation, named PTCNet. We introduce two key improvements to enhance multimodal segmentation:1) Introducing a novel channel attention module that replaces spatial self-attention in the Transformer to improve cross-modal information extraction.2) Enhancing the reversible feature extraction module based on residual structures to better detect small lesions. We evaluated our method on the BraTS 2023 brain metastasis dataset, achieving an average DSC of 61.42%, which is 1.12% higher than the second place. The innovative structure and improved modules of PTCNet significantly enhance performance in multimodal brain tumor segmentation tasks. Code and models are available at https://***/naiqizh/PTCNet. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：