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

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

来源：评论

学校读者我要写书评

暂无评论

引用

Physical Review Fluids 2024年第5期9卷 054608-054608页

作者： Xue-Lu Xiong (熊雪露) Shujin Laima (赖马树金) Hui Li (李惠) Yi Zhou (周毅) School of Energy and Power Engineering Key Lab of Smart Prevention and Mitigation of Civil Engineering Disasters of the Ministry of Industry and Information Technology Key Lab of Structures Dynamic Behavior and Control of the Ministry of Education Guangdong-Hong Kong-Macao Joint Laboratory for Data-Driven Fluid Mechanics and Engineering Applications

This paper presents a quadrant analysis of turbulent rotor wakes, placing a particular emphasis on the self-similarity in single-point turbulent statistics. The self-similarity analysis reveals that within the wake self-similar region, the distribution of the Reynolds shear stress −u′v′¯ and the turbulent kinetic energy k in different quadrants can also attain a state of self-similarity. The length scaling is the same for −u′v′¯, k, and their different quadrant contributions. However, the velocity scaling of the ejection contribution differs from that of −u′v′¯ and k. Additionally, the analysis of hole filtering and spectrum filtering effects on the self-similarity and scaling of the ejection contribution to −u′v′¯ reveals a strong connection between ejection events and large-scale coherent structures, as well as deceleration extreme events. This finding is further confirmed through quadrant analysis of the time evolution of velocity fluctuations. The present study can be helpful in improving our understanding of the turbulent wake self-similarity.

关键词： Shear flows Wakes & jets

来源：评论

学校读者我要写书评

暂无评论

Anatomical Prior Guided Spatial Contrastive Learning for Few-Shot Medical Image Segmentation 24

Anatomical Prior Guided Spatial Contrastive Learning for Few...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Huang, Wendong Hu, Jinwu Bi, Xiuli Xiao, Bin Chongqing Key Laboratory of Image Cognition Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Post and Telecommunications Chongqing China Pazhou Lab School of Software Engineering South China University of Technology Guangzhou China

ISBN: (纸本)9798400706868

Few-shot semantic segmentation has considerable potential for low-data scenarios, especially for medical images that require expert-level dense annotations. Existing few-shot medical image segmentation methods strive to deal with the task by means of prototype learning. However, this scheme relies on support prototypes to guide the segmentation of query images, ignoring the rich anatomical prior knowledge in medical images, which hinders effective feature enhancement for medical images. In this paper, we propose an anatomical prior guided spatial contrastive learning, called APSCL, which exploits anatomical prior knowledge derived from medical images to construct contrastive learning from a spatial perspective for few-shot medical image segmentation. The new framework forces the model to learn the features in line with the embedded anatomical representations. Besides, to fully exploit the guidance information of the support samples, we design a mutual guidance decoder to predict the label of each pixel in the query image. Furthermore, our APSCL can be trained end-to-end in the form of episodic training. Comprehensive experiments on three challenging medical image datasets, i.e., CHAOS-T2, MS-CMRSeg, and Synapse, prove that our method significantly surpasses state-of-the-art few-shot medical segmentation methods, with a mean improvement of 3.61%, 2.30%, and 6.38% on the Dice score, respectively. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Machine learning-enabled MIMO-FBMC communication channel parameter estimation in IIoT: A distributed CS approach

引用

Digital Communications and Networks 2023年第2期9卷 306-312页

作者： Han Wang Fida Hussain Memon Xianpeng Wang Xingwang Li Ning Zhao Kapal Dev College of Physical Science&Engineering Yichun UniversityYichun336000China State Key Laboratoty of Marine Resource Utilization in South China Sea Hainan UniversityHaikou570228China Faculty of Data Science City University of MacaoMacao999078China Physics and Electronic Information Engineering Henan Polytechnic UniversityJiaozuo454000China Department of Mechatronics AMM Lab Jeju National UniversitySouth Korea Department of Electrical Engineering Sukkur IBA UniversityPakistan Department of Institute of Intellligent Systems University of JohannesburgSouth Africa

Compressed Sensing(CS)is a Machine Learning(ML)method,which can be regarded as a single-layer unsupervised learning *** mainly emphasizes the sparsity of the *** this paper,we study an ML-based CS Channel Estimation(CE)method for wireless communications,which plays an important role in Industrial Internet of Things(IIoT)*** the sparse correlation between channels in Multiple Input Multiple Output Filter Bank MultiCarrier with Offset Quadrature Amplitude Modulation(MIMO-FBMC/OQAM)systems,a Distributed Compressed Sensing(DCS)-based CE approach is studied.A distributed sparse adaptive weak selection threshold method is proposed for ***,the correlation between MIMO channels is utilized to represent a joint sparse model,and CE is transformed into a joint sparse signal reconstruction ***,the number of correlation atoms for inner product operation is optimized by weak selection threshold,and sparse signal reconstruction is realized by sparse *** experiment results show that the proposed DCS-based method not only estimates the multipath channel components accurately but also achieves higher CE performance than classical Orthogonal Matching Pursuit(OMP)method and other traditional DCS methods in the time-frequency dual selective channels.

关键词： IIoT Machine learning Distributed compressed sensing MIMO-FBMC Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Leverage Learning Behaviour data for Students' Learning Performance Prediction and Influence Factor Analysis

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第5期5卷 2422-2433页

作者： Ni, Qin Zhu, Yanjin Zhang, Lingying Lu, Xiaochen Zhang, Lei Shanghai International Studies University Key Laboratory of Multilingual Education with AI Shanghai201620 China Donghua University College of Information Science and Technology Shanghai201620 China Donghua University Engineering Research Center of Digitized Textile and Apparel Technology Ministry of Education Shanghai201620 China Shanghai Normal University Shanghai Engineering Research Center of Intelligent Education and Bigdata and Lab for Educational Big Data and Policymaking Shanghai200234 China

Online education has become increasingly significant for university students and faculty, especially in the context of the modern remote education landscape. However, the inherent space-time separation in online education can create communication delays between teachers and students, making it challenging to monitor students' behaviors effectively. In an effort to understand the connection between students' online engagement and their learning performance, data annotation has been implemented to address the issue of accurately representing students' learning behaviors. Taking the online teaching data of Shanghai Normal University platform as the research object, the primary online education problem is explored through data mining, which includes correlation analysis, Gini importance ranking, and principal component analysis (PCA). Then, constructing the learning performance prediction model using random forest (RF) based on PCA by comparing various machine learning algorithms. As a consequence, the most influential online learning behaviors are course duration time, document learning time, test average score, and video completion rate. The overall classification accuracy of the learning performance prediction model is 87.45%, and the highest prediction accuracy for a single category is 96.52%. © 2020 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: Fooling Segment Anything Model to Segment Nothing 38

DarkSAM: Fooling Segment Anything Model to Segment Nothing

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhou, Ziqi Song, Yufei Li, Minghui Hu, Shengshan Wang, Xianlong Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are available at: https://***/CGCL-codes/DarkSAM. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Machine Learning is All You Need: A Simple Token-Based Approach for Effective Code Clone Detection 24

Machine Learning is All You Need: A Simple Token-Based Appro...

引用

44th ACM/IEEE International Conference on Software engineering, ICSE 2024

作者： Feng, Siyue Suo, Wenqi Wu, Yueming Zou, Deqing Liu, Yang Jin, Hai Huazhong University of Science and Technology China Nanyang Technological University Singapore Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Jinyinhu Laboratory Wuhan430074 China School of Cyber Science and Engineering Hust Wuhan430074 China School of Computer Science and Technology Hust Wuhan430074 China

ISBN: (纸本)9798400702174

As software engineering advances and the code demand rises, the prevalence of code clones has increased. This phenomenon poses risks like vulnerability propagation, underscoring the growing importance of code clone detection techniques. While numerous code clone detection methods have been proposed, they often fall short in real-world code environments. They either struggle to identify code clones effectively or demand substantial time and computational resources to handle complex clones. This paper introduces a code clone detection method namely Toma using tokens and machine learning. Specifically, we extract token type sequences and employ six similarity calculation methods to generate feature vectors. These vectors are then input into a trained machine learning model for classification. To evaluate the effectiveness and scalability of Toma, we conduct experiments on the widely used BigCloneBench dataset. Results show that our tool outperforms token-based code clone detectors and most tree-based clone detectors, demonstrating high effectiveness and significant time savings. © 2024 ACM.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

A Symbolic Rule Integration Framework with Logic Transformer for Inductive Relation Prediction 24

A Symbolic Rule Integration Framework with Logic Transformer...

引用

33rd ACM Web Conference, WWW 2024

作者： Pan, Yudai Liu, Jun Zhao, Tianzhe Zhang, Lingling Lin, Yun Dong, Jin Song School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University Shaanxi Xi'an China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'an China Shanghai Jiao Tong University Shanghai China National University of Singapore Singapore Singapore

ISBN: (纸本)9798400701719

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant paradigm by KG embeddings has a limitation to predict the relation between unseen entities. This situation is called an inductive setting, which is more common in the real-world scenario. To handle this issue, implicit symbolic rules have shown great potential in capturing the inductive capability. However, it is still challenging to obtain precise representations of logic rules from KGs. The argument variability and predicate non-commutativity in symbolic rule integration make the modeling of component symbols difficult. To this end, we propose a novel inductive relation prediction model named SymRITa with a logic transformer integrating rules. SymRITa firstly extracts the subgraph, whose embeddings are captured by a graph network. Meanwhile, symbolic rule graphs in the subgraph can be generated. Then, the symbolic rules are modeled by a proposed logic transformer. Specifically, the input format based on the subgraph-based embeddings is to focus on the argument variability in symbolic rules. In addition, a conjunction attention mechanism in the logic transformer can resolve predicate non-commutativity in the symbolic rule integration process. Finally, the subgraph-based and symbol-based embeddings obtained from the previous steps are combined for the training regime, and prediction results as well as rules explaining the reasoning process are explicitly output. Extensive experiments on twelve inductive datasets show that SymRITa achieves outstanding effectiveness compared to state-of-the-art inductive baselines. Moreover, the logic rules with corresponding confidences provide an interpretable paradigm. © 2024 ACM.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Hybrid Parallel Inference for Large Model on Heterogeneous Clusters for High Throughput 29

Hybrid Parallel Inference for Large Model on Heterogeneous C...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Xu, Chaonong Kong, Weiming Liu, Min Zhang, Mingming Li, Chao Gong, Luqi Beijing Key Lab of Petroleum Data Mining Beijing China Institute of Intelligent Computing Zhejiang Lab Hangzhou China Bupt School of Computer Science National Pilot Software Engineering School Beijing China

ISBN: (纸本)9798350330717

In high-throughput intelligent computing scenarios, multi-device parallelism strategies based on data parallelism or pipeline parallelism have been extensively utilized to accelerate large deep neural network model inference. data parallelism offers nearly linear improvement in inference speed, but it is limited by the memory capacity of a single device which constrains the model size. On the other hand, pipeline parallelism can support larger models, but the total communication of the activations among devices is high, which limits the improvement of the inference speed. To address the demand for efficient model inference in high-throughput heterogeneous scenarios, we proposes a hybrid parallelism strategy that combines data parallelism and pipeline parallelism. The strategy involves grouping heterogeneous device clusters and then employing inter-group data parallelism along with intra-group pipeline parallelism. Moreover, we propose an algorithm to find an optimal hybrid parallel inference strategy with maximum throughput. The control variables of the strategy includes the number of groups, group-device assignments and model partition ratios. Our experimental evaluation demonstrates that compared to PipeEdge, a pipeline parallel inference framework for heterogeneous cluster, our strategy can achieve 1.7× -3.4× acceleration in an 8-device heterogeneous cluster without loss of accuracy. © 2023 IEEE.

关键词： data parallelism heterogeneous cluster hybrid parallelism model inference pipeline parallelism

来源：评论

学校读者我要写书评

暂无评论

Learning to Communicate Among Agents for Large-Scale Dynamic Path Planning With Genetic Programming Hyperheuristic

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1269-1283页

作者： Liao, Xiao-Cheng Hu, Xiao-Min Chen, Xiang-Ling Mei, Yi Jia, Ya-Hui Chen, Wei-Neng Victoria University of Wellington Centre for Data Science and Artificial Intelligence School of Engineering and Computer Science Wellington6140 New Zealand Guangdong University of Technology School of Computer Science and Technology Guangzhou510006 China Hanyang University Department of Electrical and Electronic Engineering Ansan15588 Korea Republic of South China University of Technology School of Future Technology Guangzhou510006 China Pazhou Lab Guangzhou510005 China South China University of Technology School of Computer Science and Engineering State Key Laboratory of Subtropical Building and Urban Science Guangzhou510006 China

Genetic programming hyperheuristic (GPHH) has recently become a promising methodology for large-scale dynamic path planning (LDPP) since it can produce reusable heuristics rather than disposable solutions. However, in this methodology, the extracted local and decentralized heuristic for agents that lack a global systemic view sometimes may be problematic. Therefore, a new challenge is to strike a balance between conciseness to improve generalization ability and incorporation of more global information to obtain better performance. In this work, we target the LDPP problem and propose a communication learning mechanism (ComLGP) for GPHH to address the above difficulties. In ComLGP, a communication function is introduced to serve as a communication protocol and exist in the form of an extra terminal in GPHH. Compared to the classic terminals which are fixed in genetic programing, this communication function undergoes optimization along with the evolutionary process of GPHH. In this way, the communication function can be learned which enables agents to communicate without a predefined communication protocol. Then, a caching and lazy updating mechanism for ComLGP is presented to accelerate the calculation of communication content. Last, we verified our method on 22 scenarios including two real world road networks. The experimental results demonstrate that the proposed ComLGP can successfully learn to communicate. Although in the absence of any manually designed communication features, ComLGP is capable of achieving performance competitive to the state-of-the-art method that employs a predefined communication protocol and outperforms the remaining compared methods in most scenarios. © 2020 IEEE.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：