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

An Aggregate Signature Scheme with Specified Verifier

Chinese Journal of Electronics 2023年第2期20卷 333-336页

作者： Yiling Wen Jianfeng Ma Huawei Huang Ministry of Education Key Laboratory of Computer Networks and Information Security Xidian University Xi'an China College of Mathematical Sciences Guangxi Normal University Guilin China

We propose a new efficient aggregate signature scheme with specified verifier from bilinear pairings. The characteristic, only the designated verifier can verify the correctness of the signature, prevents the disclosure of the signer's any relevant information. Compared to the previous scheme with this characteristic, we use a new method and the new scheme requires less one pairing operation. Presumed the difficulty of Computational Diffie-Hellman Problem, the proposed aggregate signature scheme is secure against existential forgery in the random oracle model.

关键词： Aggregates Computational modeling Forgery

来源：评论

学校读者我要写书评

暂无评论

Residual K-Nearest Neighbors Label Distribution Learning

SSRN

引用

SSRN 2023年

作者： Wang, Jing Geng, Xin School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing210096 China

Label Distribution Learning (LDL) is a novel learning paradigm that assigns label distribution to each instance. It aims to learn the label distribution of training instances and predict unknown ones. Algorithm Adaptation (AA)-kNN is one of the most representative LDL baselines that adapts the kNN algorithm to LDL. Its generalization risk has been proven to approach zero if given infinite training data. Despite its theoretical advantage, AA-kNN generally performs poorly because real-world LDL problems only have finite or small training data. In this paper, we improve AA-kNN and propose a novel method called Residual k-Nearest Neighbors Label Distribution Learning (RkNN-LDL). First, RkNN-LDL introduces residual label distribution learning. Second, RkNN-LDL exploits the neighborhood structure of label distribution. We prove that RkNN-LDL has an O( [[EQUATION]] ) generalization bound. Besides, extensive experiments validate that RkNN-LDL beats several state-of-the-art LDL methods and statistically outperforms AA-NN. © 2023, The Authors. All rights reserved.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

A Robot Pick and Place Skill Learning Method Based on Maximum Entropy and DDQN Algorithm

A Robot Pick and Place Skill Learning Method Based on Maximu...

引用

2021 International Conference on Robotics Automation and Intelligent Control, ICRAIC 2021

作者： Wu, Peiliang Zhang, Yan Li, Yao Mao, Bingyi Chen, Wenbai Gao, Guowei School of Information Science and Engineering Yanshan University Hebei Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Hebei Qinhuangdao066004 China School of Automation Beijing Information Science and Technology University Beijing100192 China

Pick and place (PAP) skill learning is a fundamental ability of intelligent robots, such as home service robot. Due to the NP-hard nature of the PAP problem, it takes a long time for an intelligent robot to learn the PAP skill based on current methods. In order to improve the learning efficiency of robot PAP skills, this paper proposes a Soft-DDQN-based PAP skill learning method. Firstly, the Soft-DDQN is proposed by introducing maximum entropy into robot DDQN framework, and the learning goal of Soft-DDQN is to maximize reward and information entropy. Secondly, PAP problem is modelled as a discrete form and Soft-DDQN is applied to solve the PAP problem. Finally, in order to verify the efficiency of Soft-DDQN-based PAP skill learning, comparisons have been given from two standard perspectives and shown that Soft-DDQN improves efficiency of PAP skill learning evidently. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Intelligent robots

来源：评论

学校读者我要写书评

暂无评论

Adaptive Control Scheme for Clustering of Nodes Based on the Signs of Connections in Dynamical Signed networks 19th

Adaptive Control Scheme for Clustering of Nodes Based on ...

引用

19th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2023

作者： Wang, Qi Wang, Yinhe Gao, Zilin Gao, Peitao Xiong, Jianbin Cen, Jian Gao, Ying School of Automation Guangdong Polytechnic Normal University Guangzhou510665 China School of Automation Guangdong University of Technology Guangzhou510006 China College of Computer Science and Engineering Chongqing Three Gorges University Chongqing404020 China School of Electronics and Information Guangdong Polytechnic Normal University Guangzhou510665 China Guangzhou Intelligent Building Equipment Information Integration and Control Key Laboratory Guangzhou510665 China School of Computer Science and Engineering South China University of Technology Guagnzhou510641 China

ISBN: (纸本)9783031651229

The concept of clustering has garnered significant attention within the field of complex networks. Numerous clustering algorithms have been documented in the extant academic literature. However, most of them consider static signed networks, which are not suitable for dynamical networks. For dynamical signed networks, there is a class of algorithms called cluster dynamics. Nevertheless, they regard the connection to be time-invariant, which is a constraint. In this paper, for a kind of dynamical signed networks with time-varying connections, we discuss the adaptive control scheme for clustering of nodes, such that the network evolves asymptotically into a classifiable network that contains several friends’ groups with clear sign boundaries. In other words, through the careful design of the controller for the nodes and the establishment of coupling relationships between the nodes and their connections, we ensure that the connection of the dynamical signed network can approximate asymptotically the connection of a given classifiable network, as measured by the concept of uniformly ultimately bounded (UUB). Finally, the simulation is used to illustrate the validity of the method proposed in this paper. © ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Adaptive control Classifiable networks Multi-clustering

来源：评论

学校读者我要写书评

暂无评论

Adiabatic-Passage-Based Parameter Setting for Quantum Approximate Optimization Algorithm

arXiv

引用

arXiv 2023年

作者： Wu, Mingyou Chen, Hanwu School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing211189 China

The Quantum Approximate Optimization Algorithm (QAOA) exhibits significant potential for tackling combinatorial optimization problems. Despite its promise for near-term quantum devices, a major challenge in applying QAOA lies in the cost of circuit runs associated with parameter optimization. Existing methods for parameter setting generally incur at least a superlinear cost concerning the depth p of QAOA. In this study, we propose a novel adiabatic-passage-based parameter setting method that remarkably reduces the optimization cost, specifically when applied to the 3-SAT problem, to a sublinear level. Beginning with an analysis of the random model of the specific problem, this method applies a problem-dependent preprocessing on the problem Hamiltonian analytically, effectively segregating the magnitude of parameters from the scale of the problem. Consequently, a problem-independent initialization is achieved without incurring any optimization cost or pre-computation. Furthermore, the parameter space is adjusted based on the continuity of the optimal adiabatic passage, resulting in a reduction in the disparity of parameters between adjacent layers of QAOA. By leveraging this continuity, the cost to find quasi-optimal parameters is significantly reduced to a sublinear level. © 2023, CC BY.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Depression Scale Dictionary Decomposition Framework for Multimodal Automatic Depression Level Prediction

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年第6期35卷 6195-6210页

作者： Niu, Mingyue Wang, Xu Gong, Jibing Liu, Bin Tao, Jianhua Schuller, Bjorn W. Yanshan University School of Information Science and Engineering Hebei province Qinhuangdao066004 China Hebei Key Laboratory of Computer Virtual Technology and System Integration China Technology Co. Ltd Bejing100022 China Bejing100190 China Tsinghua University Department of Automation Bejing100190 China University of Chinese Academy of Sciences School of Artificial Intelligence Beijing100049 China University of Augsburg ZD.B. Chair of Embedded Intelligence for Health Care and Wellbeing Augsburg Germany Glam - Group on Language Audio and Music United Kingdom

Currently, many researchers aim to achieve automatic depression level prediction via speech and video behavior analysis. However, previous works have struggled to decompose audio and video sequences into the information related to and unrelated to depression scores, hindering the model's perception of depression cues. Besides, previous works implement multimodal fusion using attention mechanisms or linear layers, but failed to simultaneously consider the Euclidean relationship among tokens and the non-Euclidean relationship among channels, which bring limitations in capturing depression cues. In response to the above issues, we propose a depression scale dictionary decomposition framework, which mainly includes a Bidirectional Dictionary Decomposition (BDD) module and a Bidirectional Multimodal Fusion (BMF) module. The BDD module can use the dictionaries generated based on the depression scale to semantically decompose audio and video sequences into the information related to and unrelated to depression scores along token and channel dimensions for promoting depression cue perception. Moreover, considering the respective characteristics of tokens and channels, the BMF module uses linear layers and graph convolution to achieve cross-modal mixing, which is used to aggregate audio and video sequences for predicting depression levels. The validation on AVEC 2013, AVEC 2014 and DAIC-WOZ datasets demonstrates our method's superiority. © 1991-2012 IEEE.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Inaccurate Label Distribution Learning

arXiv

引用

arXiv 2023年

作者： Kou, Zhiqiang Jia, Yuheng Wang, Jing Geng, Xin The School of Computer Science and Engineering Southeast University Nanjing211189 China The Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing211189 China

Label distribution learning (LDL) trains a model to predict the relevance of a set of labels (called label distribution (LD)) to an instance. The previous LDL methods all assumed the LDs of the training instances are accurate. However, annotating highly accurate LDs for training instances is time-consuming and very expensive, and in reality the collected LD is usually inaccurate and disturbed by annotating errors. For the first time, this paper investigates the problem of inaccurate LDL, i.e., developing an LDL model with noisy LDs. We assume that the noisy LD matrix is a linear combination of an ideal LD matrix and a sparse noise matrix. Consequently, the problem of inaccurate LDL becomes an inverse problem, where the objective is to recover the ideal LD and noise matrices from the noisy LDs. We hypothesize that the ideal LD matrix is low-rank due to the correlation of labels and utilize the local geometric structure of instances captured by a graph to assist in recovering the ideal LD. This is based on the premise that similar instances are likely to share the same LD. The proposed model is finally formulated as a graph-regularized low-rank and sparse decomposition problem and numerically solved by the alternating direction method of multipliers. Furthermore, a specialized objective function is utilized to induce a LD predictive model in LDL, taking into account the recovered label distributions. Extensive experiments conducted on multiple datasets from various real-world tasks effectively demonstrate the efficacy of the proposed approach. Copyright © 2023, The Authors. All rights reserved.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

TPMARL-MSS Thought-Perception Multi-Agent Reinforcement Learning Meeting Scheduling System 25

TPMARL-MSS Thought-Perception Multi-Agent Reinforcement Lear...

引用

25th IEEE International Conferences on High Performance Computing and Communications, 9th International Conference on Data Science and Systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Zhang, Jinsong Mao, Xiaoxuan Li, Lu Wu, Hanqian Joint Graduate School Southeast University Nanjing China College of Software Engineering Southeast University Nanjing China School of Cyber Science and Engineering Southeast University Nanjing China School of Cyber Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration of Ministry of Education Nanjing China

ISBN: (纸本)9798350330014

In today's evolving society, the increasing complexity and frequency of meetings necessitate advanced scheduling systems. Traditional methods are constrained by rigid prede-fined strategies, lack intelligent negotiation mechanisms, and often compromise user privacy. Addressing these challenges, we introduce the Thought-Perception Multi-Agent Reinforcement Learning Meeting Scheduling System (TPMARL-MSS). Unlike conventional systems, TPMARL-MSS autonomously learns and refines its strategies through continuous feedback. It features automated negotiation and adaptive decision-making, offering a more nuanced scheduling approach. Importantly, our Thought-Perception module protect privacy, allowing the agent to deduce preferences from participant behavior without revealing personal data. Evaluations on the real-world dataset shows that TPMARL-MSS surpasses traditional methods in efficiency and schedule quality, highlighting its practical applicability. © 2023 IEEE.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Imperceptible and Sparse Adversarial Attacks via a Dual-Population-Based Constrained Evolutionary Algorithm

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第2期4卷 268-281页

作者： Tian, Ye Pan, Jingwen Yang, Shangshang Zhang, Xingyi He, Shuping Jin, Yaochu Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China Hefei Comprehensive National Science Center Institute of Artificial Intelligence Hefei230088 China Anhui University School of Computer Science and Technology Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Hefei230601 China Anhui University Anhui Engineering Laboratory of Human-Robot Integration System and Intelligent Equipment School of Electrical Engineering and Automation Hefei230601 China Bielefeld University Faculty of Technology Bielefeld33619 Germany

The sparse adversarial attack has attracted increasing attention due to the merit of a low attack cost via changing a small number of pixels. However, the generated adversarial examples are easily detected in vision since the perturbation to each pixel is relatively large. To achieve imperceptible and sparse adversarial attacks, this article formulates a bi-objective constrained optimization problem, simultaneously minimizing the 0 and 2 distances to the original image, and proposes a dual-population-based constrained evolutionary algorithm to solve it. The proposed method solves the optimization problem by evolving two populations, where one population is responsible for finding feasible solutions (i.e., successful attacks) and the other one is to minimize both the 0 and 2 distances. Moreover, a population initialization strategy and two genetic operators are customized to accelerate the convergence speed. Experimental results indicate that the proposed method can achieve high success rates with low attack costs, and strikes a better balance between the 0 and 2 distances than state-of-the-art methods. © 2020 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

CAT: a coarse-to-fine attention tree for semantic change detection

引用

Visual Intelligence 2023年第1期1卷 1-12页

作者： Wei, Xiu-Shen Xu, Yu-Yan Zhang, Chen-Lin Xia, Gui-Song Peng, Yu-Xin School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China State Key Laboratory of Integrated Services Networks Xidian University Xi’an China Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education and Jiangsu Key Lab of Image and Video Understanding for Social Security Nanjing China 4Paradigm Inc Beijing China School of Computer Science and Institute of Artificial Intelligence Wuhan University Wuhan China Wangxuan Institute of Computer Technology Peking University Beijing China

Semantic change detection (SCD) and land cover mapping (LCM) are always treated as a dual task in the field of remote sensing. However, due to diverse real-world scenarios, many SCD categories are not easy to be clearly recognized, such as “water-vegetation” and “water-tree”, which can be regarded as fine-grained differences. In addition, even a single LCM category is usually difficult to define. For instance, some “vegetation” categories with litter vegetation coverage are easily confused with the general “ground” category. SCD/LCM becomes challenging under both challenges of its fine-grained nature and label ambiguity. In this paper, we tackle the SCD and LCM tasks simultaneously by proposing a coarse-to-fine attention tree (CAT) model. Specifically, it consists of an encoder, a decoder and a coarse-to-fine attention tree module. The encoder-decoder structure extracts the high-level features from input multi-temporal images first and then reconstructs them to return SCD and LCM predictions. Our coarse-to-fine attention tree, on the one hand, utilizes the tree structure to better model a hierarchy of categories by predicting the coarse-grained labels first and then predicting the fine-grained labels later. On the other hand, it applies the attention mechanism to capture discriminative pixel regions. Furthermore, to address label ambiguity in SCD/LCM, we also equip a label distribution learning loss upon our model. Experiments on the large-scale SECOND dataset justify that the proposed CAT model outperforms state-of-the-art models. Moreover, various ablation studies have demonstrated the effectiveness of tailored designs in the CAT model for solving semantic change detection problems. © The Author(s) 2023.

关键词： Attention tree Coarse-to-fine Fine-grained recognition Label ambiguity Semantic change detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：