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

7th Chinese Conference on Swarm Intelligence and Cooperative Control, CCSICC 2023

作者： Gong, Jiabao Fu, Weiming Kang, Yu Qin, Jiahu Xiao, Feng Department of Automation University of Science and Technology of China Hefei230027 China State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources School of Control and Computer Engineering North China Electric Power University Beijing102206 China

ISBN: (纸本)9789819733279

This paper proposes a multi-agent deep reinforcement learning (MADRL) based algorithm for charging control of multiple electric vehicles (EVs) in an electric vehicle charging station (EVCS) with dynamic operations. By taking the uncertainties of EV users’ behaviors and charging prices into consideration, a Markov game with multiple objectives is first established, where the individual objective of reducing EV charging costs and the collective objective of mitigating charging load fluctuations are both studied. Then, a multi-agent actor-double-critic (MAADC) algorithm with a unified advantage actor-critic framework is proposed, where two advantage functions are designed as the local and global critics, and the integrated actor is employed to balance the learning towards the individual and collective objectives. The simulation results obtained in a delicately built EVCS environment show the effectiveness of MAADC. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities 24

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

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

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai Hubei Key Laboratory of Distributed System Security 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 Hong Kong Jin YinHu Laboratory Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Colorado Colorado Springs Department of Computer Science Colorado Springs Colorado United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798400702174

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability Dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

A Topic-Aware Graph-Based Neural Network for User Interest Summarization and Item Recommendation in Social Media 28th

A Topic-Aware Graph-Based Neural Network for User Interest ...

引用

28th International Conference on Database systems for Advanced Applications, DASFAA 2023

作者： Chen, Junyang Fan, Ge Gong, Zhiguo Li, Xueliang Leung, Victor C. M. Wang, Mengzhu Yang, Ming College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen China Tencent Inc. Shenzhen China State Key Laboratory of Internet of Things for Smart City Department of Computer Information Science University of Macau China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9783031306716

User-generated content is daily produced in social media, as such user interest summarization is critical to distill salient information from massive information. While the interested messages (e.g., tags or posts) from a single user are usually sparse becoming a bottleneck for existing methods, we propose a topic-aware graph-based neural interest summarization method (UGraphNet), enhancing user semantic mining by unearthing potential user relations and jointly learning the latent topic representations of posts that facilitates user interest learning. Experiments on two datasets collected from well-known social media platforms demonstrate the superior performance of our model in the tasks of user interest summarization and item recommendation. Further discussions also show that exploiting the latent topic representations and user relations are conductive to the user automatic language understanding. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

APSeg: Auto-Prompt Network for Cross-Domain Few-Shot Semantic Segmentation

APSeg: Auto-Prompt Network for Cross-Domain Few-Shot Semanti...

引用

Conference on computer vision and Pattern Recognition (CVPR)

作者： Weizhao He Yang Zhang Wei Zhuo Linlin Shen Jiaqi Yang Songhe Deng Liang Sun Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen Institute of Artificial Intelligence and Robotics for Society School of Computer Science University of Nottingham China

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Few-shot semantic segmentation (FSS) endeavors to segment unseen classes with only a few labeled samples. Current FSS methods are commonly built on the assumption that their training and application scenarios share similar domains, and their performances degrade significantly while applied to a distinct domain. To this end, we propose to leverage the cutting-edge foundation model, the segment Anything Model (SAM), for generalization enhancement. The SAM however performs unsatisfactorily on domains that are distinct from its training data, which primarily comprise natural scene images, and it does not support automatic segmentation of specific semantics due to its interactive prompting mechanism. In our work, we introduce APSeg, a novel auto-prompt network for cross-domain few-shot semantic segmentation (CD-FSS), which is designed to be auto-prompted for guiding cross-domain segmentation. Specifically, we propose a Dual Prototype Anchor Transformation (DPAT) module that fuses pseudo query prototypes extracted based on cycle-consistency with support prototypes, allowing features to be transformed into a more stable domain-agnostic space. Additionally, a Meta Prompt (MPG) module is introduced to automatically generate prompt embeddings, eliminating the need for manual visual prompts. We build an efficient model which can be applied directly to target domains without fine-tuning. Extensive experiments on four cross-domain datasets show that our model outperforms the state-of-the-art CD-FSS method by 5.24% and 3.10% in average accuracy on 1-shot and 5-shot settings, respectively.

关键词： Training Metalearning Visualization Semantic segmentation Semantics Prototypes Training data

来源：评论

学校读者我要写书评

暂无评论

Prediction of piRNA-mRNA interactions based on an interactive inference network

Prediction of piRNA-mRNA interactions based on an interactiv...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Liu, Yajun Li, Ru Li, Aimin Fei, Rong Guo, Xie Wu, Fang-Xiang Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an China University of Saskatchewan Division of Biomedical Engineering Department of Computer Science Department of Mechanical Engineering Saskatoon Canada

ISBN: (纸本)9798350337488

As the largest class of small non-coding RNAs, piRNAs primarily present in the reproductive cells of mammals, which influence post-transcriptional processes of mRNAs in multiple ways. Effective methods for predicting piRNA and mRNA target relationships can help identify piRNA functions, investigate the possibility of piRNAs as biomarkers and therapeutic targets. In this study, we propose a computational approach for classifying the relationships of piRNA-mRNA pairs based on an interactive inference network (IIN). First, we gather piRNA-mRNA target data, collect sequence data by position alignment, and construct a benchmark dataset. Furthermore, a reliable negative set is constructed by positive-unlabeled learning. Finally, we view a piRNA and a mRNA sequence as a premise and hypothesis sentence, respectively, and IIN model is used to predict the relationship between them. The experiments demonstrate that our method effectively characterizes piRNA-mRNA interaction and could be beneficial for researchers to investigate piRNA functions. © 2023 IEEE.

关键词： interactive inference network noncoding RNA piRNA-mRNA interactions positive-unlabeled learning

来源：评论

学校读者我要写书评

暂无评论

Quantum K-Means Model based on Optimization Framework

Quantum K-Means Model based on Optimization Framework

引用

2023 Asia-Pacific Conference on Image Processing, Electronics and computers, IPEC 2023

作者： Shao, Zexiang Zhang, Shibin Kumar, Sachin School of Cyberspace Security Chengdu University of Information Technology Chengdu610225 China Sichuan Key Laboratory of Advanced Cryptography and System Security Chengdu610225 China Ajay Kumar Garg Engineering College Department of Computer Science and Engineering India

ISBN: (纸本)9781665457033

The Quantum K-means clustering algorithm offers the advantage of quantum parallel computing, but suffers from issues related to cluster center initialization and sensitivity to noisy data due to its similarity with the K-means clustering algorithm. To address these challenges, we propose a quantum K-means model based on an optimization framework. Specifi-cally, we use a quantum genetic algorithm with pin optimization to adjust the fitness function for the Quantum K-means clustering algorithm. The optimally adapted quantum genetic algorithm reduces the sensitivity of cluster center initialization and improves the noise robustness of the Quantum K-means clus-tering algorithm using a noise reduction self-encoder. As a result, the proposed model achieves better clustering performance even in the presence of noise. Experimental results demonstrate that our proposed quantum K-means model has fewer clustering iterations, lower probability of falling into local optima, and improved noise robustness after optimizing the clustering cen-ters. The model's effectiveness in clustering is also demon-strated experimentally. © 2023 IEEE.

关键词： Noise abatement

来源：评论

学校读者我要写书评

暂无评论

Discounted Iterative Adaptive Critic Designs With Novel Stability Analysis for Tracking Control

引用

IEEE/CAA Journal of Automatica Sinica 2022年第7期9卷 1262-1272页

作者： Mingming Ha Ding Wang Derong Liu School of Automation and Electrical Engineering University of Science and Technology BeijingBeijing 100083China Faculty of Information Technology the Beijing Key Laboratory of Computational Intelligence and Intelligent Systemthe Beijing Laboratory of Smart Environmental Protectionand the Beijing Institute of Artificial IntelligenceBeijing University of TechnologyBeijing 100124China Department of Electrical and Computer Engineering University of Illinois at ChicagoChicago IL 60607 USA IEEE

The core task of tracking control is to make the controlled plant track a desired *** traditional performance index used in previous studies cannot eliminate completely the tracking error as the number of time steps *** this paper,a new cost function is introduced to develop the value-iteration-based adaptive critic framework to solve the tracking control *** the regulator problem,the iterative value function of tracking control problem cannot be regarded as a Lyapunov function.A novel stability analysis method is developed to guarantee that the tracking error converges to *** discounted iterative scheme under the new cost function for the special case of linear systems is ***,the tracking performance of the present scheme is demonstrated by numerical results and compared with those of the traditional approaches.

关键词： Adaptive critic design adaptive dynamic programming(ADP) approximate dynamic programming discrete-time nonlinear systems reinforcement learning stability analysis tracking control value iteration(VI)

来源：评论

学校读者我要写书评

暂无评论

A Survey on Indoor Visible Light Positioning systems: Fundamentals, Applications, and Challenges

引用

IEEE Communications Surveys and Tutorials 2024年第3期27卷 1656-1686页

作者： Zhu, Zhiyu Yang, Yang Chen, Mingzhe Guo, Caili Cheng, Julian Cui, Shuguang Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering and Institute for Data Science and Computing Coral GablesFL33146 United States Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China The University of British Columbia Faculty of Applied Science School of Engineering KelownaBCV1V 1V7 Canada 518172 Hong Kong

The growing demand for location-based services in areas like virtual reality, robot control, and navigation has intensified the focus on indoor localization. Visible light positioning (VLP), leveraging visible light communications (VLC), becomes a promising indoor positioning technology due to its high accuracy and low cost. This paper provides a comprehensive survey of VLP systems. In particular, since VLC lays the foundation for VLP, we first present a detailed overview of the principles of VLC. Then, we provide an in-depth overview of VLP algorithms. The performance of each positioning algorithm is also compared in terms of various metrics such as accuracy, coverage, and orientation limitation. Beyond the physical layer studies, the network design for a VLP system is also investigated, including multi-access technologies, resource allocation, and light-emitting diode (LED) placements. Next, the applications of the VLP systems are overviewed. Finally, this paper outlines open issues, challenges, and opportunities for the research field. In a nutshell, this paper constitutes the first holistic survey on VLP from state-of-the-art studies to practical uses. © 1998-2012 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Inverse Kinematics of Robotic Manipulators Using a New Learning-by-Example Method

Inverse Kinematics of Robotic Manipulators Using a New Learn...

引用

IEEE/RSJ International Conference on Intelligent Robots and systems (IROS)

作者： Jacket Demby’s Ramy Farag Guilherme N. DeSouza Department of Electrical Engineering and Computer Science (EECS) Vision-Guided and Intelligent Robotics (ViGIR) Laboratory University of Missouri-Columbia Columbia Missouri

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

Inverse Kinematics (IK) is one of the most fundamental challenges in robotics. It refers to the process of determining the joint configurations required to achieve the desired position and orientation (pose) of a robot end-effector. Although numerous Data-Driven (DD) IK solvers have demonstrated encouraging results, they have not achieved the same accuracy when compared to other IK methods for complex robot configurations (e.g., numerical methods for higher Degrees of Freedom (DoF)). In this work, we propose a new Learning-by-Example method, and show that such a scheme considerably improves the IK learning results when compared to other DD learners. In our approach, the network input incorporates an example of joint-pose pair along with the query pose to predict the desired robot joint configuration. We show that the example joint-pose pair does not need to be too close to the query – i.e. example and query can be as far as 20 degrees apart in the joint configuration space. Furthermore, we investigate the utilization of residual and dense skip connections in Multilayer Perceptron for DDIK solvers and employ the resulting networks for two redundant robotic manipulators: a 7-DoF-7R commensurate robot and a 7DoF-2RP4R incommensurate robot. Our experimental results show that the resulting DDIK solver can reliably predict IK solutions with accuracy better than 1mm in position and 1deg in orientation.

关键词： Hands Accuracy Kinematics Network architecture Multilayer perceptrons Numerical models Reliability Collision avoidance Robots Intelligent robots

来源：评论

学校读者我要写书评

暂无评论

Circular Decomposition and Cross-Modal Recombination for Multimodal Sentiment Analysis

Circular Decomposition and Cross-Modal Recombination for Mul...

引用

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

作者： Haijian Liang Weicheng Xie Xilin He Siyang Song Linlin Shen School of Computer Science & Software Engineering Computer Vision Institue Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University School of Computing and Mathematical Sciences University of Leicester National Engineering Laboratory for Big Data System Computing Technology Shenzhen University

Multimodal Sentiment Analysis is a burgeoning research area, leveraging various modalities to predict the sentiment score. Nevertheless, previous studies have disregarded the impact of noise interference on specific modal sentiments during video recording, thereby compromising the accuracy of sentiment prediction. In this paper, we propose the Guided Circular Decomposition and Cross-Modal Recombination (GCD-CMR) model, which aims to eliminate contaminated sentiment features in a fine-grained way. To achieve this, we utilize tailored global information specific to each modality to guide the circular decomposing process in the GCD module, to produce a set of sentiment prototypes. Subsequently, in the CMR module, we align cross-modal sentiment prototypes and remove the contaminated prototypes for recombination. Experimental results on two publicly available datasets demonstrate that our model surpasses state-of-the-art models, confirming the effectiveness of our proposed method. We release the code at: https://***/nianhua20/GCD-CMR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：