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

International Conference on Advanced Robotics and Mechatronics (ICARM)

作者： Weiming Du Junmou Lin Binqing Du Uddin Md. Borhan Jianqiang Li Jie Chen College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

With the increasing use of unmanned aerial vehicles (UAVs) in a variety of applications, their safety has become a critical concern. UAVs face numerous emergencies during missions, in these situations, the UAVs need to autonomously find a suitable landing site, plan flight routes, and avoid obstacles in unstructured environments. However, due to the limitations of computing power and sensors, it is challenging to achieve this goal. This research aims to explore the monocular emergency autonomous landing algorithm. Specifically, this work focuses on extracting depth and vision information. A topology information extractor is designed to convert image to graph and assess the connectivity of terrain. Additionally, a depth information extractor is designed to calculate the slope and roughness of the ground. A 3D topology optimizer is designed to optimize the graph by depth information and evaluate the landing suitability by a heuristic strategy. To make the action decision, a hybrid decision network (DGN) based on 3D topology information is proposed. Finally, this work build a simulated scenario based on real scene to verify the efficiency of DGN. The results of the experiment show that DGN outperforms its counterparts in terms of action prediction accuracy and landing success rate.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Defect Screening on Nuclear Power Plant Concrete Structures: A Two-staged Method Based on Contrastive Representation Learning

Defect Screening on Nuclear Power Plant Concrete Structures:...

引用

International Conference on Advanced Robotics and Mechatronics (ICARM)

作者： Wenlian Huang Guanming Zhu Qiang Huang Zhuangzhuang Chen Jie Chen Jianqiang Li College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

Intelligent defect detection methods are important for the surface of the containment of nuclear power plants and face many challenges in the field of computer vision. Due to the irregular shapes and large variation of defects, as well as the similarity of the features between some defects and the background. Most existing deep learning-based defect detection networks suffer from insufficient feature extraction capabilities, making it difficult to detect defects from the background. Inspired by discrete representation learning methods, we propose a two-stage defect detection model called ConVQVAE, which uses a semi-supervised method for representation learning to achieve binary classification for defect detection. In addition, contrastive learning is performed in two stages to enhance the model's diversity representation ability and inter-class disentanglement representation ability. Finally, we experimentally verify that the proposed method can obtain good classification results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PAIR: protein-aptamer interaction prediction based on language models and contrastive learning framework

PAIR: protein-aptamer interaction prediction based on langua...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jun Zhang Zhiqiang Yan Hao Zeng Zexuan Zhu National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Aptamers are single-stranded DNA or RNA oligonucleotides that selectively bind to specific targets, making them valuable for drug design and diagnostic applications. Identifying the interactions between aptamers and target proteins is crucial for these applications. The systematic evolution of ligands by exponential enrichment process, traditionally used for this purpose, is challenging and time-consuming. The resulting aptamers often suffer from limitations in stability and diversity. Computational approaches have shown promise in aiding the discovery of high-performance aptamers, but existing methods are usually constrained by insufficient training data and limited generalizability. Recently, advancements in pre-training large language models have offered a new avenue to mitigate the dependency on large datasets. In this study, we propose a novel method to predict aptamer-protein interactions using large language models within a contrastive learning framework. Experimental results demonstrate that our method exhibits superior generalization and outperforms existing approaches. This method holds promise as a powerful tool for predicting aptamer-protein interactions.

关键词： Proteins Drugs Protein engineering Biological system modeling Large language models Computational modeling Training data Contrastive learning Predictive models Few shot learning

来源：评论

学校读者我要写书评

暂无评论

GHVC-Net: Hypervolume Contribution Approximation Based on Graph Neural Network

GHVC-Net: Hypervolume Contribution Approximation Based on Gr...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Guotong Wu Yang Nan Ke Shang Hisao Ishibuchi Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

This paper proposes a framework called GHVC-Net that uses the graph neural network (GNN) model to approximate each solution's hypervolume contribution (HVC). GHVC-Net is permutation invariant and can handle solution sets of arbitrary size, similar to the properties of GNN. Compared to HVC-Net (i.e., a machine learning model for HVC approximation), GHVC-Net achieves better accuracy with less training time. GHVC-Net is also compared with traditional approximation methods, such as line-based and point-based methods, to demonstrate its ability to identify the solution with the smallest (largest) HVC.

关键词： Training Accuracy Machine learning Approximation algorithms Graph neural networks Approximation methods Cybernetics Testing

来源：评论

学校读者我要写书评

暂无评论

An Autoencoder-Like Nonnegative Matrix Co-Factorization for Improved Student Cognitive Modeling 38

An Autoencoder-Like Nonnegative Matrix Co-Factorization for ...

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Yu, Shenbao Pan, Yinghui Zeng, Yifeng Doshi, Prashant Liu, Guoquan Poh, Kim-Leng Lin, Mingwei College of Computer and Cyber Security Fujian Normal University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer and Information Sciences Northumbria University United Kingdom Intelligent Thought and Action Lab School of Computing University of Georgia United States Financial Technology Research Institute Fudan University China College of Design and Engineering National University of Singapore Singapore

Student cognitive modeling (SCM) is a fundamental task in intelligent education, with applications ranging from personalized learning to educational resource allocation. By exploiting students' response logs, SCM aims to predict their exercise performance as well as estimate knowledge proficiency in a subject. data mining approaches such as matrix factorization can obtain high accuracy in predicting student performance on exercises, but the knowledge proficiency is unknown or poorly estimated. The situation is further exacerbated if only sparse interactions exist between exercises and students (or knowledge concepts). To solve this dilemma, we root monotonicity (a fundamental psychometric theory on educational assessments) in a co-factorization framework and present an autoencoder-like nonnegative matrix co-factorization (AE-NMCF), which improves the accuracy of estimating the student's knowledge proficiency via an encoder-decoder learning pipeline. The resulting estimation problem is nonconvex with nonnegative constraints. We introduce a projected gradient method based on block coordinate descent with Lipschitz constants and guarantee the method's theoretical convergence. Experiments on several real-world data sets demonstrate the efficacy of our approach in terms of both performance prediction accuracy and knowledge estimation ability, when compared with existing student cognitive models. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Stage Transfer Learning Evolutionary Algorithm for Dynamic Multiobjective Optimization

Multi-Stage Transfer Learning Evolutionary Algorithm for Dyn...

引用

Congress on Evolutionary Computation

作者： Qianhui Wang Qingling Zhu Junkai Ji College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen PR China

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Recently, the application of transfer learning within dynamic multiobjective evolutionary algorithms (DMOEAs) has shown significant potential to solve dynamic multiobjective optimization problems (DMOPs). This approach utilizes the transfer learning technique which reuses information from previous environments to accelerate the search process in the new environment. However, the risk of negative transfer can lead to an erroneous search direction and inefficient use of computational resources. To address this issue, this paper proposes a novel multistage transfer learning DMOEA, named MSTL. The algorithm is designed to enhance the convergence and diversity of the population through the combination of the pre-transfer learning stage and the transfer learning and validation stage when environmental changes occur. In the pre-transfer learning stage, a suitable target domain, source domain, and validation classifier sample sets are generated guided by historical information. In the transfer learning and validation stage, the TrAdaboost technique to transfer knowledge from the target to the source domain, with the results verified by two validation classifiers to mitigate negative transfer. Experimental results demonstrate that our proposed algorithm outperforms four competing algorithms in terms of diversity and convergence on a widely recognized benchmark suite.

关键词： Accuracy Heuristic algorithms Transfer learning Sociology Evolutionary computation Benchmark testing Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

N-Docker: A NVM-HDD Hybrid Docker Storage Framework to Improve Docker Performance 16th

N-Docker: A NVM-HDD Hybrid Docker Storage Framework to Impro...

引用

16th IFIP WG 10.3 International Conference on Network and Parallel computing, NPC 2019

作者： Gu, Lin Tang, Qizhi Wu, Song Jin, Hai Zhang, Yingxi Shi, Guoqiang Lin, Tingyu Rao, Jia 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 Wuhan430074 China State Key Laboratory of Intelligent Manufacturing System Technology Beijing100854 China The University of Texas at Arlington ArlingtonTX76019 United States

ISBN: (纸本)9783030307080

Docker has been widely adopted in production environment, but unfortunately deployment and cold-start of container are limited by the low speed of disk. The emerging non-volatile memory (NVM) technology, which has high speed and can store data permanently, brings a new chance to accelerate the deployment and cold-start of container. However, it is expensive to replace the whole hard disk driver (HDD) with NVM. To achieve the fastest deployment and cold-start with lowest cost, we conduct in-depth analysis on the Top-134 images in Docker Hub and obtain two main insights as: (1) the storing latency of layered image has become the bottleneck of container deployment;(2) only a few image layers are required for container cold-start. Based on these two findings, we propose a NVM-HDD hybrid docker storage framework as N-Docker. It can effectively accelerate container cold-start by detecting the bottleneck layers as well as cold-start required layers and storing them into NVM for faster container startup with limited NVM capacity. Experimental results show that N-Docker can accelerate the container deployment by 1.21X and cold-start by 2.96X. Compared to NVM-Docker, which stores all images into NVM, N-Docker achieves the same performance improvements while reducing the usage of NVM by 88.22%. © 2019, IFIP International Federation for Information Processing.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization 13

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Li, Yongfeng Zhang, Yuze Ma, Lijia Ji, Junkai Liu, Dugang Leung, Victor C. M. Li, Jianqiang Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen518123 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518172 China The University of British Columbia Department of Electrical and Computer Engineering VancouverV6T 1Z4 Canada

ISBN: (纸本)9798350308365

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Targeted Pareto Optimization for Subset Selection With Monotone Objective Function and Cardinality Constraint

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Shang, Ke Wu, Guotong Pang, Lie Meng Ishibuchi, Hisao National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China

Subset selection, a fundamental problem in various domains, is to choose a subset of elements from a large candidate set under a given objective or multiple objectives. Pareto optimization for subset selection (POSS) has emerged as a powerful paradigm for addressing subset selection problems. Recently, some POSS variants have been proposed to further improve its performance. In this paper, we propose a new POSS variant, named Targeted Pareto Optimization for Subset Selection (TPOSS). TPOSS differs from POSS in four aspects: problem formulation, population initialization, mutation, and environmental selection. The main idea of TPOSS is to focus the search on the target region of subset selection with respect to the subset cardinality in order to improve the search efficiency. We conduct comprehensive experiments to compare TPOSS with six state-of-the-art algorithms on three subset selection tasks (i.e., sparse regression, unsupervised feature selection, and hypervolume subset selection) where the size of the candidate sets ranges from 20 to 400. Experimental results show that with respect to the objective value of the best feasible subset, TPOSS outperforms the other algorithms on all the three tasks, which suggests the potential of TPOSS to enhance subset selection in various domains. IEEE

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：