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

visualizing nonlinear resonance in nanomechanical systems via single-electron tunneling

Nano Research 2021年第4期14卷 1156-1161页

作者： Xinhe Wang Lin Cong Dong Zhu Zi Yuan Xiaoyang Lin Weisheng Zhao Zaiqiao Bai Wenjie Liang Ximing Sun Guang-Wei Deng Kaili Jiang Fert Beijing Research Institute School of Microelectronics&Beijing Advanced Innovation Centre for Big Data and Brain Computing(BDBC)Beihang UniversityBeijing 100191China State Key Laboratory of Low-Dimensional Quantum Physics Department of Physics and Tsinghua-Foxconn Nanotechnology Research CenterTsinghua UniversityBeijing 100084China Key Laboratory of Quantum Information CASUniversity of Science and Technology of ChinaHefei 230026China Department of Physics Beijing Normal UniversityBeijing 100875China Institute of Physics Chinese Academy of SciencesBeijing 100080China Institute of Nuclear and New Energy Technology Collaborative Innovation Center of Advanced Nuclear Energy TechnologyKey Laboratory of Advanced Reactor EngineeringTsinghua UniversityBeijing 100084China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of ChinaChengdu 610054China

Numerous reports have elucidated the importance of mechanical resonators comprising quantum-dot-embedded carbon nanotubes(CNTs)for studying the effects of single-electron ***,there is a need to investigate the single-electron transport that drives a large amplitude into a nonlinear ***,a CNT hybrid device has been investigated,which comprises a gate-defined quantum dot that is embedded into a mechanical resonator under strong actuation *** Coulomb peak positions synchronously oscillate with the mechanical vibrations,enabling a single-electron Chopper*1 ***,the vibration amplitude of the CNT versus its frequency can be directly visualized via detecting the time-averaged single-electron tunneling *** understand this phenomenon,a general formula is derived for this time-averaged single-electron tunneling current,which agrees well with the experimental *** using this visualization method,a variety of nonlinear motions of a CNT mechanical oscillator have been directly recorded,such as Duffing nonlinearity,parametric resonance,and double-,fractional-,mixed-frequency *** approach opens up burgeoning opportunities for investigating and understanding the nonlinear motion of a nanomechanical system and its interactions with electron transport in quantum regimes.

关键词： carbon nanotube mechanical resonator quantum dot nonlinear coupling

来源：评论

学校读者我要写书评

暂无评论

Neural multi-objective combinatorial optimization with diversity enhancement 23

Neural multi-objective combinatorial optimization with diver...

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Jinbiao Chen Zizhen Zhang Zhiguang Cao Yaoxin Wu Yining Ma Te Ye Jiahai Wang School of Computer Science and Engineering Sun Yat-sen University P.R. China School of Computing and Information Systems Singapore Management University Singapore Department of Industrial Engineering & Innovation Sciences Eindhoven University of Technology Netherlands Department of Industrial Systems Engineering & Management National University of Singapore Singapore School of Computer Science and Engineering Sun Yat-sen University P.R. China and Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Sun Yat-sen University P.R. China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou P.R. China

Most of existing neural methods for multi-objective combinatorial optimization (MOCO) problems solely rely on decomposition, which often leads to repetitive solutions for the respective subproblems, thus a limited Pareto set. Beyond decomposition, we propose a novel neural heuristic with diversity enhancement (NHDE) to produce more Pareto solutions from two perspectives. On the one hand, to hinder duplicated solutions for different subproblems, we propose an indicator-enhanced deep reinforcement learning method to guide the model, and design a heterogeneous graph attention mechanism to capture the relations between the instance graph and the Pareto front graph. On the other hand, to excavate more solutions in the neighborhood of each subproblem, we present a multiple Pareto optima strategy to sample and preserve desirable solutions. Experimental results on classic MOCO problems show that our NHDE is able to generate a Pareto front with higher diversity, thereby achieving superior overall performance. Moreover, our NHDE is generic and can be applied to different neural methods for MOCO.

关键词：

来源：评论

学校读者我要写书评

暂无评论

UAV Virtual Antenna Array Deployment for Uplink Interference Mitigation in data Collection Networks

arXiv

引用

arXiv 2024年

作者： Li, Hongjuan Kang, Hui Sun, Geng Li, Jiahui Wang, Jiacheng Wang, Xue Niyato, Dusit Leung, Victor C.M. College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore Department of Communication Engineering Jilin University Changchun130012 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518115 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering The University of British Columbia VancouverV6T 1Z4 Canada

Unmanned aerial vehicles (UAVs) have gained considerable attention as a platform for establishing aerial wireless networks and communications. However, the line-of-sight dominance in air-to-ground communications often leads to significant interference with terrestrial networks, reducing communication efficiency among terrestrial terminals. This paper explores a novel uplink interference mitigation approach based on the collaborative beamforming (CB) method in multi-UAV network systems. Specifically, the UAV swarm forms a UAV-enabled virtual antenna array (VAA) to achieve the transmissions of gathered data to multiple base stations (BSs) for data backup and distributed processing. However, there is a trade-off between the effectiveness of CB-based interference mitigation and the energy conservation of UAVs. Thus, by jointly optimizing the excitation current weights and hover position of UAVs as well as the sequence of data transmission to various BSs, we formulate an uplink interference mitigation multi-objective optimization problem (MOOP) to decrease interference affection, enhance transmission efficiency, and improve energy efficiency, simultaneously. In response to the computational demands of the formulated problem, we introduce an evolutionary computation method, namely chaotic non-dominated sorting genetic algorithm II (CNSGA-II) with multiple improved operators. The proposed CNSGA-II efficiently addresses the formulated MOOP, outperforming several other comparative algorithms, as evidenced by the outcomes of the simulations. Moreover, the proposed CB-based uplink interference mitigation approach can significantly reduce the interference caused by UAVs to non-receiving BSs. Copyright © 2024, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Robin: A Novel Method to Produce Robust Interpreters for Deep Learning-Based Code Classifiers

arXiv

引用

arXiv 2023年

作者： Li, Zhen Zhang, Ruqian Zou, Deqing Wang, Ning Li, Yating Xu, Shouhuai Chen, Chen Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science University of Colorado Colorado Springs United States Center for Research in Computer Vision University of Central Florida United States School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep learning makes it hard to interpret and understand why a classifier (i.e., classification model) makes a particular prediction on a given example. This lack of interpretability (or explainability) might have hindered their adoption by practitioners because it is not clear when they should or should not trust a classifier's prediction. The lack of interpretability has motivated a number of studies in recent years. However, existing methods are neither robust nor able to cope with out-of-distribution examples. In this paper, we propose a novel method to produce Robust interpreters for a given deep learning-based code classifier;the method is dubbed Robin. The key idea behind Robin is a novel hybrid structure combining an interpreter and two approximators, while leveraging the ideas of adversarial training and data augmentation. Experimental results show that on average the interpreter produced by Robin achieves a 6.11% higher fidelity (evaluated on the classifier), 67.22% higher fidelity (evaluated on the approximator), and 15.87x higher robustness than that of the three existing interpreters we evaluated. Moreover, the interpreter is 47.31% less affected by out-of-distribution examples than that of LEMNA. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Clustering by orthogonal NMF model and non-convex penalty optimization

Clustering by orthogonal NMF model and non-convex penalty op...

引用

作者： Wang, Shuai Chang, Tsung-Hui Cui, Ying Pang, Jong-Shi Shenzhen Research Institute of Big Data and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Guangdong Provincial Key Laboratory of Big Data Computing and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Department of Industrial and Systems Engineering University of Minnesota MinneapolisMN55455 United States Department of Industrial and Systems Engineering University of Southern California Los AngelesCA90089 United States

The non-negative matrix factorization (NMF) model with an additional orthogonality constraint on one of the factor matrices, called the orthogonal NMF (ONMF), has been found a promising clustering model and can outperform the classical K-means. However, solving the ONMF model is a challenging optimization problem because the coupling of the orthogonality and non-negativity constraints introduces a mixed combinatorial aspect into the problem due to the determination of the correct status of the variables (positive or zero). Most of the existing methods directly deal with the orthogonality constraint in its original form via various optimization techniques, but are not scalable for large-scale problems. In this paper, we propose a new ONMF based clustering formulation that equivalently transforms the orthogonality constraint into a set of norm-based non-convex equality constraints. We then apply a non-convex penalty (NCP) approach to add them to the objective as penalty terms, leading to a problem that is efficiently solvable. One smooth penalty formulation and one non-smooth penalty formulation are respectively studied. We build theoretical conditions for the penalized problems to provide feasible stationary solutions to the ONMF based clustering problem, as well as proposing efficient algorithms for solving the penalized problems of the two NCP methods. Experimental results based on both synthetic and real datasets are presented to show that the proposed NCP methods are computationally time efficient, and either match or outperform the existing K-means and ONMF based methods in terms of the clustering performance. © 1991-2012 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

UAV-Aided Covert Federated Learning Networks

引用

IEEE Network 2025年

作者： Wang, Chao Guo, Shaoyong Xiong, Zehui Xing, Chengwen Zhao, Nan Niyato, Dusit Karagiannidis, George Dalian University of Technology School of Information and Communication Engineering Dalian116024 China Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Singapore University of Technology and Design Information Systems Technology and Design Pillar 487372 Singapore Beijing Institute of Technology School of Information and Electronics Beijing100081 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Aristotle University of Thessaloniki Department of Electrical and Computer Engineering Greece

With the increasing emphasis on data privacy, federated learning (FL) networks show great potential through distributed training without directly sharing the raw data. However, the coverage of FL terrestrial servers is usually limited. Therefore, we propose leveraging the unmanned aerial vehicle (UAV) as a mobile flying server to further improve the wireless coverage and training efficiency of FL. Nevertheless, frequent exchanges of model parameters in UAV-assisted FL can result in serious security risks. In order to achieve this, we propose a covert FL scheme assisted by the UAV, which can protect the transmission key features of local models from being detected by wardens. Furthermore, we discuss the FL network and covert communications, as well as the exceptional features of UAV-assisted covert FL. Finally, we present two case studies, one of which focuses on minimising the network latency, while the other concentrates on reducing the energy consumption of covert FL. The simulation results demonstrate the efficacy of the proposed schemes in addressing future challenges. © 1986-2012 IEEE.

关键词： data privacy

来源：评论

学校读者我要写书评

暂无评论

Attribute-Guided Pedestrian Retrieval: Bridging Person Re-ID with Internal Attribute Variability

Attribute-Guided Pedestrian Retrieval: Bridging Person Re-ID...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yan Huang Zhang Zhang Qiang Wu Yi Zhong Liang Wang Center for Research on Intelligent Perception and Computing (CRIPAC) State Key Laboratory of Multimodal Artificial Intelligence Systems (MAIS) Chinese Academy of Sciences Institute of Automation Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences (UCAS). School of Electrical and Data Engineering University of Technology Sydney Australia School of Information and Electronics Beijing Institute of Technology China

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

In various domains such as surveillance and smart retail, pedestrian retrieval, centering on person re-identification (Re-ID), plays a pivotal role. Existing Re-ID methodologies often overlook subtle internal attribute variations, which are crucial for accurately identifying individuals with changing appearances. In response, our paper introduces the Attribute-Guided Pedestrian Retrieval (AGPR) task, focusing on integrating specified attributes with query images to refine retrieval results. Although there has been progress in attribute-driven image retrieval, there remains a notable gap in effectively blending robust Re-ID models with intra-class attribute variations. To bridge this gap, we present the Attribute-Guided Transformer-based Pedestrian Retrieval (ATPR) framework. ATPR adeptly merges global ID recognition with local attribute learning, ensuring a co-hesive linkage between the two. Furthermore, to effectively handle the complexity of attribute interconnectivity, ATPR organizes attributes into distinct groups and applies both inter-group correlation and intra-group decorrelation regularizations. Our extensive experiments on a newly estab-lished benchmark using the RAP dataset [32] demonstrate the effectiveness of ATPR within the AGPR paradigm.

关键词： Couplings Pedestrians Correlation Surveillance Image retrieval Focusing Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Downstream-agnostic Adversarial Examples

arXiv

引用

arXiv 2023年

作者： Zhou, Ziqi Hu, Shengshan Zhao, Ruizhi Wang, Qian Zhang, Leo Yu Hou, Junhui Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Wuhan University China School of Information and Communication Technology Griffith University Australia Department of Computer Science City University of Hong Kong Hong Kong National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab

Self-supervised learning usually uses a large amount of unlabeled data to pre-train an encoder which can be used as a general-purpose feature extractor, such that downstream users only need to perform fine-tuning operations to enjoy the benefit of "large model". Despite this promising prospect, the security of pre-trained encoder has not been thoroughly investigated yet, especially when the pre-trained encoder is publicly available for commercial use. In this paper, we propose AdvEncoder, the first framework for generating downstream-agnostic universal adversarial examples based on the pre-trained encoder. AdvEncoder aims to construct a universal adversarial perturbation or patch for a set of natural images that can fool all the downstream tasks inheriting the victim pre-trained encoder. Unlike traditional adversarial example works, the pre-trained encoder only outputs feature vectors rather than classification labels. Therefore, we first exploit the high frequency component information of the image to guide the generation of adversarial examples. Then we design a generative attack framework to construct adversarial perturbations/patches by learning the distribution of the attack surrogate dataset to improve their attack success rates and transferability. Our results show that an attacker can successfully attack downstream tasks without knowing either the pre-training dataset or the downstream dataset. We also tailor four defenses for pre-trained encoders, the results of which further prove the attack ability of AdvEncoder. Our codes are available at: https://github. com/CGCL-codes/AdvEncoder. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Large Language Models as Evolutionary Optimizers

Large Language Models as Evolutionary Optimizers

引用

Congress on Evolutionary Computation

作者： Shengcai Liu Caishun Chen Xinghua Qu Ke Tang Yew-Soon Ong A*STAR Department of Computer Science and Engineering Centre for Frontier AI Research Southern University of Science and Technology Centre for Frontier AI Research A*STAR Tianqiao & Chrissy Chen Institute Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Southern University of Science and Technology Centre for Frontier AI Research A*STAR College of Computing and Data Science Nanyang Technological University

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Evolutionary algorithms (EAs) have achieved remarkable success in tackling complex combinatorial optimization problems. However, EAs often demand carefully-designed operators with the aid of domain expertise to achieve satisfactory performance. In this work, we present the first study on large language models (LLMs) as evolutionary combinatorial optimizers. The main advantage is that it requires minimal domain knowledge and human efforts, as well as no additional training of the model. This approach is referred to as LLM-driven EA (LMEA). Specifically, in each generation of the evolutionary search, LMEA instructs the LLM to select parent solutions from current population, and perform crossover and mutation to generate offspring solutions. Then, LMEA evaluates these new solutions and include them into the population for the next generation. LMEA is equipped with a self-adaptation mechanism that controls the temperature of the LLM. This enables it to balance between exploration and exploitation and prevents the search from getting stuck in local optima. We investigate the power of LMEA on the classical traveling salesman problems (TSPs) widely used in combinatorial optimization research. Notably, the results show that LMEA performs competitively to traditional heuristics in finding high-quality solutions on TSP instances with up to 20 nodes. Additionally, we also study the effectiveness of LLM-driven crossover/mutation and the self- adaptation mechanism in evolutionary search. In summary, our results reveal the great potentials of LLMs as evolutionary optimizers for solving combinatorial problems. We hope our research shall inspire future explorations on LLM-driven EAs for complex optimization challenges.

关键词： Training Large language models Computational modeling Sociology Evolutionary computation Traveling salesman problems Temperature control

来源：评论

学校读者我要写书评

暂无评论

Hi-SAM: Marrying Segment Anything Model for Hierarchical Text Segmentation

arXiv

引用

arXiv 2024年

作者： Ye, Maoyuan Zhang, Jing Liu, Juhua Liu, Chenyu Yin, Baocai Liu, Cong Du, Bo Tao, Dacheng School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China IFLYTEK Research IFLYTEK CO. LTD. China College of Computing & Data Science Nanyang Technological University #32 Block N4 #02a-014 50 Nanyang Avenue 639798 Singapore

The Segment Anything Model (SAM), a profound vision foundation model pretrained on a large-scale dataset, breaks the boundaries of general segmentation and sparks various downstream applications. This paper introduces Hi-SAM, a unified model leveraging SAM for hierarchical text segmentation. Hi-SAM excels in segmentation across four hierarchies, including pixel-level text, word, text-line, and paragraph, while realizing layout analysis as well. Specifically, we first turn SAM into a high-quality pixel-level text segmentation (TS) model through a parameter-efficient fine-tuning approach. We use this TS model to iteratively generate the pixel-level text labels in a semi-automatical manner, unifying labels across the four text hierarchies in the HierText dataset. Subsequently, with these complete labels, we launch the end-to-end trainable Hi-SAM based on the TS architecture with a customized hierarchical mask decoder. During inference, Hi-SAM offers both automatic mask generation (AMG) mode and promptable segmentation (PS) mode. In the AMG mode, Hi-SAM segments pixel-level text foreground masks initially, then samples foreground points for hierarchical text mask generation and achieves layout analysis in passing. As for the PS mode, Hi-SAM provides word, text-line, and paragraph masks with a single point click. Experimental results show the state-of-the-art performance of our TS model: 84.86% fgIOU on Total-Text and 88.96% fgIOU on TextSeg for pixel-level text segmentation. Moreover, compared to the previous specialist for joint hierarchical detection and layout analysis on HierText, Hi-SAM achieves significant improvements: 4.73% PQ and 5.39% F1 on the text-line level, 5.49% PQ and 7.39% F1 on the paragraph level layout analysis, requiring 20× fewer training epochs. The code is available at Hi-SAM. Copyright © 2024, The Authors. All rights reserved.

关键词： Masks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：