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

On PID control for synchronization of complex dynamical network with delayed nodes

Science China(Technological Sciences) 2019年第8期62卷 1412-1422页

作者： GU HaiBo Lv JinHu LIN ZongLi Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing 100049 China School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment and Beijing Advanced Innovation Center for Big Data and Brain Machine Intelligence Beihang University Beijing 100083 China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia Charlottesville VA 22904-4743 USA

Over the past two decades, synchronization, as an interesting collective behavior of complex dynamical networks, has been attracting much attention. To reveal and analyze the inherent mechanism of synchronization in complex dynamical networks with time delays in nodes, this paper attempts to use PD and PI control protocols to achieve synchronization. Based on a classical network model, we investigate the PD and PI control for synchronization of complex dynamical networks with delayed nodes and obtain some sufficient conditions. By using Lyapunov functions and appropriate state transformations, we prove that global synchronization can be achieved via the above control protocols. Finally, some simulation examples are illustrated to validate the effectiveness of the proposed theoretical results.

关键词： synchronization PID control complex dynamical network networked control system delayed node

来源：评论

学校读者我要写书评

暂无评论

Breaking the Curse of Space Explosion: Towards Efficient NAS with Curriculum Search

arXiv

引用

arXiv 2020年

作者： Guo, Yong Chen, Yaofo Zheng, Yin Zhao, Peilin Chen, Jian Huang, Junzhou Tan, Mingkui School of Software Engineering South China University of Technology China Pazhou Laboratory China Weixin Group Tencent China Tencent AI Lab Tencent China Guangdong Key Laboratory of Big Data Analysis and Processing China

Neural architecture search (NAS) has become an important approach to automatically find effective architectures. To cover all possible good architectures, we need to search in an extremely large search space with billions of candidate architectures. More critically, given a large search space, we may face a very challenging issue of space explosion. However, due to the limitation of computational resources, we can only sample a very small proportion of the architectures, which provides insufficient information for the training. As a result, existing methods may often produce suboptimal architectures. To alleviate this issue, we propose a curriculum search method that starts from a small search space and gradually incorporates the learned knowledge to guide the search in a large space. With the proposed search strategy, our Curriculum Neural Architecture Search (CNAS) method significantly improves the search efficiency and finds better architectures than existing NAS methods. Extensive experiments on CIFAR-10 and ImageNet demonstrate the effectiveness of the proposed method. Copyright © 2020, The Authors. All rights reserved.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Signal approximation with Pascal’s triangle and sampling

Signal approximation with Pascal’s triangle and sampling

引用

Chinese Control and Decision Conference, CCDC

作者： Lei Chen Xinghuo Yu Jinhu Lü School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing China School of Engineering RMIT University Melbourne VIC Australia

ISBN: (数字)9781728158556

ISBN: (纸本)9781728158563

This brief explores the approximation properties of a unique basis expansion based on Pascal's triangle, which realizes a sampled-data driven approach between a continuous-time signal and its discrete-time representation. The roles of certain parameters, such as sampling time interval or model order, and signal characteristics, i.e., its curvature, on the approximation are investigated. Approximate errors in one and multiple-step predictions are analyzed. Furthermore, time-variant approximations under the thresholds of signal curvature are employed to narrow errors and provide flexibilities.

关键词： Shape Electronic mail Analytical models Mathematical analysis data models Upper bound

来源：评论

学校读者我要写书评

暂无评论

Generating High-quality Movie Tags from Social Reviews: A Learning-driven Approach

Generating High-quality Movie Tags from Social Reviews: A Le...

引用

IEEE/ACM Int'l Conference on & Int'l Conference on Cyber, Physical and Social Computing (CPSCom) Green Computing and Communications (GreenCom)

作者： Zhenxiao Luo Guopin Tang Chen Wang Yipeng Zhou Xi Zheng Jessie Hui Wang Gang Liu Di Wu School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Faculty of Science and Engineering Macquarie University Sydney Australia Institute for Network Sciences and Cyberspace Beijing National Research Center for Information Science and Technology Tsinghua University Beijing China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (纸本)9781665417631

As a kind of keywords to describe video contents, tags are extremely beneficial for viewers to locate videos when they search the site. Additionally, tags also help video platform operators to better organize and recommend videos to platform users. Previous approaches are mainly based on manually tagging or tag propagation via video content analysis, which is time-consuming and resource-consuming. Especially, given the high volume of fresh movies generated per year, it is difficult to accurately tag all the movies manually. Moreover, video content analysis is also not easy considering typical features (e.g., long duration, complicated scenarios) of commercial movies. In this paper, we propose an automatic tagging algorithm called TagRec that exploits crowdsourced user reviews to generate accurate movie tags. We observe that user reviews contain rich information about movies (e.g., quality, actors) which can be learned to generate high-quality movie tags. Inspired by the above observation, we choose to transform the movie video tagging problem into a tag recommendation problem, in which tags are recommended to different movies by extracting knowledge from crowdsourced movie reviews. We take latent topics, tag co-occurrence probability and tag semantics into account, and formulate the problem as a recommendation optimization problem. We evaluate the performance of our pro-posed TagRec algorithm with a large-scale real-world dataset. Extensive experiments demonstrate that TagRec achieves 7.1 % and 9.6% improvement compared with other state-of-the-art methods in terms of Hit Ratio and Normalized Discounted Cumulative Gain respectively.

关键词： Social computing Filtering Semantics Transforms Tagging Motion pictures Optimization

来源：评论

学校读者我要写书评

暂无评论

Ready for emerging threats to recommender systems? A graph convolution-based generative shilling attack

arXiv

引用

arXiv 2021年

作者： Wu, Fan Gao, Min Yu, Junliang Wang, Zongwei Liu, Kecheng Wang, Xu Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University Ministry of Education Chongqing401331 China School of Big Data and Software Engineering Chongqing University Chongqing401331 China School of Information Technology and Electrical Engineering The University of Queensland Queensland4072 Australia Informatics Research Centre Henley Business School University of Reading Berkshire ReadingRG6 6UD United Kingdom School of Mechanical Engineering Chongqing University Chongqing400044 China

To explore the robustness of recommender systems, researchers have proposed various shilling attack models and analyzed their adverse effects. Primitive attacks are highly feasible but less effective due to simplistic handcrafted rules, while upgraded attacks are more powerful but costly and difficult to deploy because they require more knowledge from recommendations. In this paper, we explore a novel shilling attack called Graph cOnvolution-based generative shilling ATtack (GOAT) to balance the attacks' feasibility and effectiveness. GOAT adopts the primitive attacks' paradigm that assigns items for fake users by sampling and the upgraded attacks' paradigm that generates fake ratings by a deep learning-based model. It deploys a generative adversarial network (GAN) that learns the real rating distribution to generate fake ratings. Additionally, the generator combines a tailored graph convolution structure that leverages the correlations between co-rated items to smoothen the fake ratings and enhance their authenticity. The extensive experiments on two public datasets evaluate GOAT's performance from multiple perspectives. Our study of the GOAT demonstrates technical feasibility for building a more powerful and intelligent attack model with a much-reduced cost, enables analysis the threat of such an attack and guides for investigating necessary prevention measures. Copyright © 2021, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Matrix Classifier On Dynamic Functional Connectivity For Mci Identification

Matrix Classifier On Dynamic Functional Connectivity For Mci...

引用

IEEE International Conference on Image Processing

作者： Lei Zhou Liang Zhang Xiao Bai Jun Zhou School of Computer Science and Engineering Beijing Advanced Innovation Center for Big Data and Brain Computing State Key Laboratory of Software Development Environment Beihang University Beijing School of Information and Communication Technology Griffith University Nathan

ISBN: (数字)9781728163956

ISBN: (纸本)9781728163963

One of the most popular method for Alzheimer's disease (AD) diagnosis is exploring the Brain functional connectivity (FC) from resting-state functional magnetic resonance imaging (RS-fMRI). To early prevent AD, it is crucial to distinguish AD and and its preclinical stage, mild cognitive impairment (MCI) and early MCI (eMCI). In many existing works, dynamic functional connectivity (dFC) which contains rich spatiotemporal information has been exploited for the MCI and eMCI identification. However, most of these dFC based methods only consider the correlation between discrete brain status while ignore the valuable spatiotemporal information contained in dFC. To overcome this limitation, we propose a matrix classifier based method on the dFC signal for MCI and eMCI identification. Specifically, we first represent the dFC correlations by matrix features which contain rich spatiotemporal information and then learn the support matrix machines (SMM) to classify AD and its preclinical stage. Experiments on 600 real people data provide by the Alzheimer's Disease Neuroimaging Initiative (ADNI) demonstrate that our proposed matrix classifier based method outperforms other FC and dFC based methods for both normal controls (NC)/MCI identification and NC/eMCI identification.

关键词： Feature extraction Correlation Dementia Microsoft Windows Spatiotemporal phenomena Training

来源：评论

学校读者我要写书评

暂无评论

Cross-domain Object Detection through Coarse-to-Fine Feature Adaptation

Cross-domain Object Detection through Coarse-to-Fine Feature...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yangtao Zheng Di Huang Songtao Liu Yunhong Wang Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University State Key Laboratory of Software Development Environment Beihang University School of Computer Science and Engineering Beihang University Beijing China

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

Recent years have witnessed great progress in deep learning based object detection. However, due to the domain shift problem, applying off-the-shelf detectors to an unseen domain leads to significant performance drop. To address such an issue, this paper proposes a novel coarse-to-fine feature adaptation approach to cross-domain object detection. At the coarse-grained stage, different from the rough image-level or instance-level feature alignment used in the literature, foreground regions are extracted by adopting the attention mechanism, and aligned according to their marginal distributions via multi-layer adversarial learning in the common feature space. At the fine-grained stage, we conduct conditional distribution alignment of foregrounds by minimizing the distance of global prototypes with the same category but from different domains. Thanks to this coarse-to-fine feature adaptation, domain knowledge in foreground regions can be effectively transferred. Extensive experiments are carried out in various cross-domain detection scenarios. The results are state-of-the-art, which demonstrate the broad applicability and effectiveness of the proposed approach.

关键词： Feature extraction Subspace constraints Object detection Detectors Task analysis Semantics Prototypes

来源：评论

学校读者我要写书评

暂无评论

Budgeted Persuasion on User Opinions via Varying Susceptibility

Budgeted Persuasion on User Opinions via Varying Susceptibil...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Wenyi Tang Xinrui Xu Guangchun Luo Zaobo He Kaiming Zhan School of Computer Science and Engineering University of Electronic Science and Technology of China School of Information and Software Engineering University of Electronic Science and Technology of China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Miami University Sichuan Jiuyuan Yinhai Software Co. Ltd

ISBN: (数字)9781728198293

ISBN: (纸本)9781728198309

Nowadays, the social network becomes an indispensable part of people's daily life, meanwhile offers an unprecedentedly convenient access for purposive individuals to influence the opinions of network users. Current studies present a subtle persuasion approach that finds a number of key users meanwhile varies their susceptibility extent to impact the public opinion. Such persuasion is significantly critical for public security, as it could facilitate both the spreading and dispelling of malicious rumors. However, the major body of these studies enclose impractical assumptions, such that persuaders have an unlimited budget, or the costs of varying different users' susceptibilities are the same, thus rendering these works unsuitable for realistic scenarios. Therefore, this work originally proposes a more practical and generalized problem of persuasion, where varying the susceptibilities of different users holds different costs. The analysis of its non-convexity, non-submodularity and complexity shows that solving the proposed problem is nontrivial, thus inspiring us to provide an intuitive greedy algorithm. Furthermore, we design an accelerated algorithm based on the community property, which reduces the time consumption more than one order of magnitude. The acceleration is based on the intuition that the impact of a user within a proper community could be a good estimation of the impact in the whole network, while the computation of the former one is much more efficient. The relationship between two algorithms is fully analyzed, which shows the community-based algorithm can degenerate to the intuitive greedy algorithm under a specific setting. Finally, comprehensive evaluations on real-world datasets show the superiority of proposed algorithms on both effectiveness and efficiency.

关键词： Greedy algorithms Social networking (online) Heuristic algorithms Search problems Rendering (computer graphics) Acceleration Security

来源：评论

学校读者我要写书评

暂无评论

Reversible adversarial information hiding based on the interpretation of neural network

引用

Digital Signal Processing: A Review Journal 2025年 165卷

作者： Li, Ruiping Wang, Xi Cui, Qingchen Li, Ming Information Construction and Management Office Henan Normal University Xinxiang453007 China School of Artificial Intelligence and Software Engineering Nanyang Normal University Nanyang473061 China Henan Engineering Research Center of Intelligent Processing for Big Data of Digital Image Henan Nanyang473000 China College of Information Engineering Zhoukou Vocational College of Arts and Science Zhoukou466000 China College of Computer and Information Engineering Henan Normal University Xinxiang453007 China Key Laboratory of Artificial Intelligence and Personalized Learning in Education of Henan Province Xinxiang453007 China

The emerging technology of adversarial information hiding can generate adversarial example by embedding useful information instead of meaningless noise into the host image. The obtained image can deceive classification models and therefore equip the function of privacy protection. However, existing research mainly focuses on the effectiveness of attack rather than preserving the integrity of the protected image. It cannot meet the requirements in the fields such as medical imaging, financial transactions, and copyright protection where users' raw data should not be damaged. Therefore, we propose a novel reversible adversarial information hiding based on interpretability of neural networks. The Grad-CAM-generated heatmap is employed to identify a minimal set of high-impact pixels for embedding, ensuring that minor modifications can induce significant misclassification. Then, the user-defined secret bits are embedded into the identified pixels by using difference expansion. After extraction, the original image can be perfectly restored. The technologies of adversarial example and reversible information hiding are combined to accommodate wider applications. The proposed method is tested on CIFAR-10 with three different neural architectures (NiN, AlexNet, ResNet). Experimental results show that the proposed method can completely restore the cover image while ensuring the extraction of the embedded data and misleading the neural network. © 2025 Elsevier Inc.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cross-domain object detection through coarse-to-fine feature adaptation

arXiv

引用

arXiv 2020年

作者： Zheng, Yangtao Huang, Di Liu, Songtao Wang, Yunhong Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University State Key Laboratory of Software Development Environment Beihang University School of Computer Science and Engineering Beihang University Beijing100191 China

Recent years have witnessed great progress in deep learning based object detection. However, due to the domain shift problem, applying off-the-shelf detectors to an unseen domain leads to significant performance drop. To address such an issue, this paper proposes a novel coarseto-fine feature adaptation approach to cross-domain object detection. At the coarse-grained stage, different from the rough image-level or instance-level feature alignment used in the literature, foreground regions are extracted by adopting the attention mechanism, and aligned according to their marginal distributions via multi-layer adversarial learning in the common feature space. At the fine-grained stage, we conduct conditional distribution alignment of foregrounds by minimizing the distance of global prototypes with the same category but from different domains. Thanks to this coarse-to-fine feature adaptation, domain knowledge in foreground regions can be effectively transferred. Extensive experiments are carried out in various cross-domain detection scenarios. The results are state-of-the-art, which demonstrate the broad applicability and effectiveness of the proposed approach. Copyright © 2020, The Authors. All rights reserved.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：