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

arXiv 2024年

作者： Hu, Jinhui Chen, Guo Li, Huaqing Cheng, Huqiang Guo, Xiaoyu Huang, Tingwen School of Automation Central South University Changsha410083 China Department of Biomedical Engineering City University of Hong Kong Kowloon Hong Kong School of Electrical Engineering and Telecommunications University of New South Wales SydneyNSW2052 Australia Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China Key Laboratory of Dependable Services Computing in Cyber Physical Society Ministry of Education College of Computer Science Chongqing University Chongqing400044 China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518055 China

Privacy leakage and Byzantine failures are two adverse factors to the intelligent decision-making process of multiagent systems (MASs). Considering an unsafe MAS with these two issues, this paper targets the resolution of a class of nonconvex optimization problems under the Polyak-Lojasiewicz (P-L) condition. To address this problem, we first identify and construct the unsafe MAS model. Under this kind of unfavorable MASs, we mask the local gradients with Gaussian noises and adopt a resilient aggregation method self-centered clipping (SCC) to design a differentially private (DP) decentralized Byzantine-resilient algorithm, namely DP-SCC-PL, which simultaneously achieves differential privacy and Byzantine resilience. The convergence analysis of DP-SCC-PL is challenging since the convergence error can be contributed jointly by privacy-preserving and Byzantine-resilient mechanisms, as well as the nonconvex relaxation, which is addressed via seeking the contraction relationships among the disagreement measure of reliable agents before and after SCC aggregation, together with the optimal gap. Theoretical results reveal that DP-SCC-PL achieves consensus among all reliable agents and sublinear (inexact) convergence with well-designed step-sizes. It has also been proved that if there are no privacy issues and Byzantine agents, then the asymptotic exact convergence can be recovered. Numerical experiments verify the utility, resilience, and differential privacy of DP-SCC-PL by tackling a nonconvex optimization problem satisfying the P-L condition under various Byzantine attacks. Copyright © 2024, The Authors. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Aggregation of interval numbers in group decision making

引用

ICIC Express Letters 2011年第4 A期5卷 1057-1062页

作者： Deng, Yong Wu, Jiyi Sun, Xiaohong Xu, Peida Zhang, Yajuan College of Computer and Information Sciences Southwest University Tiansheng Road Beibei District Chongqing 400715 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University No. 16 Xuelin Street Xiasha Higher Education Zone Hanzhou 310036 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Xiangtan 411105 China College of Food Science and Technology Shanghai Ocean University Hu Cheng Loop-road Lingang New City Shanghai 201306 China School of Electronics and Information Technology Shanghai Jiao Tong University Dongchuan Rd. Shanghai 200240 China

A group of decision-makers may differ in their choice of alternatives while taking a decision. So, in any decision-making problem concerning decisions made by a group, the question arises how best we can aggregate individual choices into a general consensus choice. Due to the inherent uncertain property of the problems in the ambiguous decision domain, the decision makers may use interval numbers to represent their opinions in some situations. In this paper, a simple method is proposed to aggregate interval numbers. Some desirable properties of this method are also discussed. Finally, a numerical example is given to show the use of the proposed method. ICIC International © 2011.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for ECG signal Classification via One-Dimensional Convolutional Neural Network

arXiv

引用

arXiv 2020年

作者： Hua, Xuan Han, Jungang Zhao, Chen Tang, Haipeng He, Zhuo Tang, Jinshan Chen, Qing-Hui Tang, Shaojie Zhou, Weihua College of Electronic Engineering Xi’an University of Posts and Telecommunications Xi’an710121 China Key Laboratory of Network Data Analysis and Intelligent Processing in Shaanxi Xi’an710121 China College of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China College of Computing Michigan Technological University HoughtonMI49931 United States School of Computing University of Southern Mississippi Long Beach39560 United States Deprtment of Kinesiology and Integrative Physiology Michigan Technological University HoughtonMI49931 United States School of Automation Xi’an University of Posts and Telecommunications Xi’an710121 China

This paper presents an end-to-end ECG signal classification method based on a novel segmentation strategy via 1D Convolutional Neural Networks (CNN) to aid the classification of ECG signals. The ECG segmentation strategy named R-R-R strategy (i.e., retaining ECG data between the R peaks just before and after the current R peak) for segmenting the original ECG data into segments in order to train and test the 1D CNN models. The novel strategy mimics physicians in scanning ECG to a greater extent, and maximizes the inherent information of ECG segments. The performance of the classification models for 5-class and 6-class are verified with ECG signals from 48 records of the MIT-BIH arrhythmia database. As the heartbeat types are divided into 5 classes (i.e., normal beat, left bundle branch block beat, right bundle branch block beat, ventricular ectopic beat, and paced beat) in the MIT-BIH, the best classification accuracy, the area under the curve (AUC), the sensitivity and the F1-score reach 99.24%, 0.9994, 0.99 and 0.99, respectively. As the heartbeat types are divided into 6 classes (i.e., normal beat, left bundle branch block beat, right bundle branch block beat, ventricular ectopic beat, paced beat and other beats) in the MIT-BIH, the beat classification accuracy, the AUC, the sensitivity, and the F1-score reach 97.02%, 0.9966, 0.97, and 0.97, respectively. Meanwhile, according to the recommended practice from the Association for Advancement of Medical Instrumentation (AAMI), the heartbeat types are divided into 5 classes (i.e., normal beat, supraventricular ectopic beats, ventricular ectopic beats, fusion beats, and unclassifiable beats), the beat classification accuracy, the sensitivity, and the F1-score reach 97.45%, 0.97, and 0.97, respectively. The experimental results show that the proposed method achieves better performance than the state-of-the-art methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Global-and-Local Collaborative Learning for Co-Salient Object Detection

arXiv

引用

arXiv 2022年

作者： Cong, Runmin Yang, Ning Li, Chongyi Fu, Huazhu Zhao, Yao Huang, Qingming Kwong, Sam The Institute of Information Science Beijing Jiaotong University Beijing100044 China The Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China The Department of Computer Science City University of Hong Kong Hong Kong The School of Computer Science and Engineering Nanyang Technological University Singapore A*STAR Singapore The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China University of Chinese Academy of Sciences Beijing101408 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518055 China The City University of Hong Kong Shenzhen Research Institute Shenzhen51800 China

The goal of co-salient object detection (CoSOD) is to discover salient objects that commonly appear in a query group containing two or more relevant images. Therefore, how to effectively extract inter-image correspondence is crucial for the CoSOD task. In this paper, we propose a global-and-local collaborative learning architecture, which includes a global correspondence modeling (GCM) and a local correspondence modeling (LCM) to capture comprehensive inter-image corresponding relationship among different images from the global and local perspectives. Firstly, we treat different images as different time slices and use 3D convolution to integrate all intra features intuitively, which can more fully extract the global group semantics. Secondly, we design a pairwise correlation transformation (PCT) to explore similarity correspondence between pairwise images and combine the multiple local pairwise correspondences to generate the local inter-image relationship. Thirdly, the inter-image relationships of the GCM and LCM are integrated through a global-and-local correspondence aggregation (GLA) module to explore more comprehensive inter-image collaboration cues. Finally, the intra- and inter-features are adaptively integrated by an intra-and-inter weighting fusion (AEWF) module to learn co-saliency features and predict the co-saliency map. The proposed GLNet is evaluated on three prevailing CoSOD benchmark datasets, demonstrating that our model trained on a small dataset (about 3k images) still outperforms eleven state-of-the-art competitors trained on some large datasets (about 8k̴200k images). © 2022, CC BY-NC-SA.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Variational quantum eigensolver with linear depth problem-inspired ansatz for solving portfolio optimization in finance

arXiv

引用

arXiv 2024年

作者： Wang, Shengbin Wang, Peng Li, Guihui Zhao, Shubin Zhao, Dongyi Wang, Jing Fang, Yuan Dou, Menghan Gu, Yongjian Wu, Yu-Chun Guo, Guo-Ping Origin Quantum Computing Company Limited Anhui Hefei230026 China CAS Key Laboratory of Quantum Information University of Science and Technology of China Anhui Hefei230026 China Intelligent Information Sensing and Processing Lab College of Electronic Engineering Ocean University of China Shandong Qingdao266000 China College of Physics and Optoelectronic Engineering Ocean University of China Shandong Qingdao266100 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Hefei230088 China

Great efforts have been dedicated in recent years to explore practical applications for noisy intermediate-scale quantum (NISQ) computers, which is a fundamental and challenging problem in quantum computing. As one of the most promising methods, the variational quantum eigensolver (VQE) has been extensively studied. In this paper, VQE is applied to solve portfolio optimization problems in finance by designing two hardware-efficient Dicke state ansatze that reach a maximum of 2n two-qubit 2 gate depth and n2/4 parameters, with n being the number of qubits used. Both ansatze are partitioning-friendly, allowing for the proposal of a highly scalable quantum/classical hybrid distributed computing (HDC) scheme. Combining simultaneous sampling, problem-specific measurement error mitigation, and fragment reuse techniques, we successfully implement the HDC experiments on a superconducting quantum computer with up to 55 qubits. The simulation and experimental results illustrate that the restricted expressibility of the ansatze, induced by the small number of parameters and limited entanglement, is advantageous for solving classical optimization problems with the cost function of the conditional value-at-risk (CVaR) for the NISQ era and beyond. Furthermore, the HDC scheme shows great potential for achieving quantum advantage in the NISQ era. We hope that the heuristic idea presented in this paper can motivate fruitful investigations in current and future quantum computing paradigms. Copyright © 2024, The Authors. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Personality Recognition in Response to Virtual Reality and Two-Dimensional Emotional Stimulus Using ECG signals

引用

ACM Transactions on Interactive intelligent Systems 1000年

作者： Jialan Xie Ping Lan Zhaonian Hu Guangyuan Liu College of Electronic and Information Engineering Southwest University Chongqing China Institute of Affective Computing and Information Processing Southwest University Chongqing China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Southwest University Chongqing China Key Laboratory of Cognition and Personality Ministry of Education Faculty of Psychology Southwest University Chongqing China

Personality primarily refers to the unique and stable way of a person’s thinking and behavior. A few studies have recently been conducted on personality recognition using physiological signals, most of which have used two-dimensional (2D) emotional stimulus materials. Virtual reality (VR) has been utilized in many fields, and its superiority over 2D in emotion recognition has been proven. However, relevant research on VR scenes is lacking in the field of personality recognition. In this study, based on the psychological principle that emotional arousal can expose an individual’s personality, we attempt to explore the feasibility and effect of using electrocardiogram (ECG) signals in response to VR emotional stimuli for personality identification. For this purpose, a VR-2D emotion-induction experiment was conducted in which ECG signals were collected, and physiological datasets of emotional personalities were constructed through preprocessing and feature extraction. Statistical analysis of the emotion scale scores and ECG features of the participants showed that the VR group had a higher number of significantly correlated features. Meanwhile, VR- and 2D-based personality recognition models were constructed using machine learning algorithms. The results showed that the VR-based personality recognition model achieved better results for the four personality dimensions, with a maximum accuracy of 79.76%. These findings indicate that VR not only enhances the physiological correlation between emotion and personality but also improves the classification accuracy of personality recognition.

关键词： Big Five personality Electrocardiogram Emotion Personality recognition Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Improving the trainability of VQE on NISQ computers for solving portfolio optimization using convex interpolation

arXiv

引用

arXiv 2024年

作者： Wang, Shengbin Li, Guihui Chen, Zhaoyun Wang, Peng Dou, Menghan Zheng, Haiyong Wang, Zhimin Gu, Yongjian Wu, Yu-Chun Guo, Guo-Ping Origin Quantum Computing Company Limited Anhui Hefei230026 China CAS Key Laboratory of Quantum Information University of Science and Technology of China Anhui Hefei230026 China Intelligent Information Sensing and Processing Lab College of Electronic Engineering Ocean University of China Shandong Qingdao266000 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Hefei230088 China College of Physics and Optoelectronic Engineering Ocean University of China Shandong Qingdao266100 China

Solving combinatorial optimization problems using variational quantum algorithms (VQAs) represents one of the most promising applications in the NISQ era. However, the limited trainability of VQAs could hinder their scalability to large problem sizes. In this paper, we improve the trainability of variational quantum eigensolver (VQE) by utilizing convex interpolation to solve portfolio optimization. The idea is inspired by the observation that the Dicke state possesses an inherent clustering property. Consequently, the energy of a state with a larger Hamming distance from the ground state intuitively results in a greater energy gap away from the ground state energy in the overall distribution trend. Based on convex interpolation, the location of the ground state can be evaluated by learning the property of a small subset of basis states in the Hilbert space. This enlightens naturally the proposals of the strategies of close-to-solution initialization, regular cost function landscape, and recursive ansatz equilibrium partition. The successfully implementation of a 40-qubit experiment using only 10 superconducting qubits demonstrates the effectiveness of our proposals. Furthermore, the quantum inspiration has also spurred the development of a prototype greedy algorithm. Extensive numerical simulations indicate that the hybridization of VQE and greedy algorithms achieves a mutual complementarity, combining the advantages of both global and local optimization methods. Our proposals can be extended to improve the trainability for solving other large-scale combinatorial optimization problems that are widely used in real applications, paving the way to unleash quantum advantages of NISQ computers in the near future. Copyright © 2024, The Authors. All rights reserved.

关键词： Ground state

来源：评论

学校读者我要写书评

暂无评论

Corrections to “An Improved Map-Drift Algorithm for Unmanned Aerial Vehicle SAR Imaging”

引用

IEEE Geoscience and Remote Sensing Letters 2022年 19卷

作者： Yan Huang Feiyang Liu Zhanye Chen Jie Li Wei Hong State Key Laboratory of Millimeter Waves Southeast University Nanjing China Purple Mountain Laboratory Nanjing China Satellite Signal Processing The 54th Research Institute of China Electronics Technology Group Corporation Shijiazhuang China School of Microelectronics and Communication Engineering Chongqing University Chongqing China Chongqing Key Laboratory of Space Information Network and Intelligent Information Fusion Chongqing University Chongqing China National Key Laboratory of Radar Signal Processing Xidian University Xi’an China

In the above article [1] , the corresponding authors should be Yan Huang and Jie Li.

关键词： Geoscience and remote sensing Autonomous aerial vehicles Radar polarimetry

来源：评论

学校读者我要写书评

暂无评论

OpenAUC: Towards AUC-Oriented Open-Set Recognition

arXiv

引用

arXiv 2022年

作者： Wang, Zitai Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming SKLOIS Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China BDKM University of Chinese Academy of Sciences China Peng Cheng Laboratory China

Traditional machine learning follows a close-set assumption that the training and test set share the same label space. While in many practical scenarios, it is inevitable that some test samples belong to unknown classes (open-set). To fix this issue, Open-Set Recognition (OSR), whose goal is to make correct predictions on both close-set samples and open-set samples, has attracted rising attention. In this direction, the vast majority of literature focuses on the pattern of open-set samples. However, how to evaluate model performance in this challenging task is still unsolved. In this paper, a systematic analysis reveals that most existing metrics are essentially inconsistent with the aforementioned goal of OSR: (1) For metrics extended from close-set classification, such as Open-set F-score, Youden’s index, and Normalized Accuracy, a poor open-set prediction can escape from a low performance score with a superior close-set prediction. (2) Novelty detection AUC, which measures the ranking performance between close-set and open-set samples, ignores the close-set performance. To fix these issues, we propose a novel metric named OpenAUC. Compared with existing metrics, OpenAUC enjoys a concise pairwise formulation that evaluates open-set performance and close-set performance in a coupling manner. Further analysis shows that OpenAUC is free from the aforementioned inconsistency properties. Finally, an end-to-end learning method is proposed to minimize the OpenAUC risk, and the experimental results on popular benchmark datasets speak to its effectiveness. Project Page: https://***/wang22ti/OpenAUC. © 2022, CC BY.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Research on intelligent recognition and encryption algorithm of network big data image

引用

IOP Conference Series: Earth and Environmental Science 2021年第4期632卷

作者： Jubao Qu School of mathematics and computer Wuyi University Fujian 354300 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions (Wuyi University) Wuyi University Wuyishan Fujian 354300 China

In view of the identification and encryption of massive network information in the era of big data, this paper proposes to use intelligent image recognition technology to analyze the required information, then classify it according to the big data clustering method, and use pseudo pixel encryption algorithm for multiple encryption. The simulation results show that the algorithm has high recognition rate, good encryption effect, strong anti-interference ability and good ability to protect network image information.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：