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

arXiv 2022年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Li, Guorong Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Shenzhen518107 China University of Chinese Academy of Sciences Beijing100049 China Peng Cheng Laboratory Shenzhen518055 China

Rank aggregation with pairwise comparisons has shown promising results in elections, sports competitions, recommendations, and information retrieval. However, little attention has been paid to the security issue of such algorithms, in contrast to numerous research work on the computational and statistical characteristics. Driven by huge profit, the potential adversary has strong motivation and incentives to manipulate the ranking list. Meanwhile, the intrinsic vulnerability of the rank aggregation methods is not well studied in the literature. To fully understand the possible risks, we focus on the purposeful adversary who desires to designate the aggregated results by modifying the pairwise data in this paper. From the perspective of the dynamical system, the attack behavior with a target ranking list is a fixed point belonging to the composition of the adversary and the victim. To perform the targeted attack, we formulate the interaction between the adversary and the victim as a game-theoretic framework consisting of two continuous operators while Nash equilibrium is established. Then two procedures against HodgeRank and RankCentrality are constructed to produce the modification of the original data. Furthermore, we prove that the victims will produce the target ranking list once the adversary masters the complete information. It is noteworthy that the proposed methods allow the adversary only to hold incomplete information or imperfect feedback and perform the purposeful attack. The effectiveness of the suggested target attack strategies is demonstrated by a series of toy simulations and several real-world data experiments. These experimental results show that the proposed methods could achieve the attacker’s goal in the sense that the leading candidate of the perturbed ranking list is the designated one by the adversary. Copyright © 2022, The Authors. All rights reserved.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

ON THE OPPORTUNITIES OF GREEN computing: A SURVEY

arXiv

引用

arXiv 2023年

作者： Zhou, You Lin, Xiujing Zhang, Xiang Wang, Maolin Jiang, Gangwei Lu, Huakang Wu, Yupeng Zhang, Kai Yang, Zhe Wang, Kehang Sui, Yongduo Jia, Fengwei Tang, Zuoli Zhao, Yao Zhang, Hongxuan Yang, Tiannuo Chen, Weibo Mao, Yunong Li, Yi Bao, De Li, Yu Liao, Hongrui Liu, Ting Liu, Jingwen Guo, Jinchi Zhao, Xiangyu Wei, Ying Qian, Hong Liu, Qi Wang, Xiang Chan, Wai Kin Li, Chenliang Li, Yusen Yang, Shiyu Yan, Jining Mou, Chao Han, Shuai Jin, Wuxia Zhang, Guannan Zeng, Xiaodong Tsinghua University China Shanghai Jiaotong University China University of Science and Technology of China China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University China Huazhong University of Science and Technology China Shanghai Institute of AI for Education School of Computer Science and Technology East China Normal University China Xi’an Jiaotong University China College of Computer Science Nankai University China School of Computer Science China University of Geosciences China School of Information Science and Technology Beijing Forestry University China Engineering Research Center for Forestry-Oriented Intelligent Information Processing National Forestry and Grassland Administration China Guangzhou University China Nanyang Technological University Singapore City University of Hong Kong Hong Kong Wuhan University China State Key Laboratory for Novel Software Technology Nanjing University China Ant Group China

Artificial Intelligence (AI) has achieved significant advancements in technology and research with the development over several decades, and is widely used in many areas including computing vision, natural language processing, time-series analysis, speech synthesis, etc. During the age of deep learning, especially with the arise of Large Language Models, a large majority of researchers’ attention is paid on pursuing new state-of-the-art (SOTA) results, resulting in ever increasing of model size and computational complexity. The needs for high computing power brings higher carbon emission and undermines research fairness by preventing small or medium-sized research institutions and companies with limited funding in participating in research. To tackle the challenges of computing resources and environmental impact of AI, Green computing has become a hot research topic. In this survey, we give a systematic overview of the technologies used in Green computing. We propose the framework of Green computing and devide it into four key components: (1) Measures of Greenness, (2) Energy-Efficient AI, (3) Energy-Efficient computing Systems and (4) AI Use Cases for Sustainability. For each components, we discuss the research progress made and the commonly used techniques to optimize the AI efficiency. We conclude that this new research direction has the potential to address the conflicts between resource constraints and AI development. We encourage more researchers to put attention on this direction and make AI more environmental friendly. Copyright © 2023, The Authors. All rights reserved.

关键词： Carbon footprint

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Image Denoising Method Based on Deep Residual GAN 4

An Image Denoising Method Based on Deep Residual GAN

引用

2020 4th International Workshop on Advanced Algorithms and Control Engineering, IWAACE 2020

作者： Wang, Ziyuan Wang, Lidan Duan, Shukai Li, Yunfei Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing400715 China Schoolof Electronic and Information Engineering Southwest University Chongqing400715 China College of Artificiall Intelligence Southwest University Chongqing400715 China Braininspired Computing and Intelligent Control of Chongqing Key Lab Chongqing400715 China National and Local Joint Engineering Laboratory of Intelligent Transmission and Control Technology Chongqing400715 China Chongqing Brain Science Collaborative Innovation Center Chongqing400715 China

As people come into contact with image data more often, high quality and clear images attract more attention. Many methods have been proposed to deal with image noise problem including deep learning (DL). However most of them is lack of capability when customers want more perceptual details of the image without information loss. In this paper, a deep residual network based on generative adversarial (GAN) network was proposed to complete the image denoising mission. Firstly, a generative-adversarial network structure based on residual blocks was designed. Secondly, a refined loss function was given to train the GAN network. The well designed loss function can help the generated image to be very close to the clear counterpart (ground truth) while enhancing more details in colours and brightness. Finally, extensive experiments show that our network is not only convincing for images denoising, but also effective for other image process tasks, such as image defogging, medical CT denoising etc., presenting impressive and competitive effects. © Published under licence by IOP Publishing Ltd.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

Iterative network pruning with uncertainty regularization for lifelong sentiment classification

arXiv

引用

arXiv 2021年

作者： Geng, Binzong Yang, Min Yuan, Fajie Wang, Shupeng Ao, Xiang Xu, Ruifeng University of Science and Technology of China China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Westlake University Key Lab of Intelligent Information Processing Chinese Academy of Sciences Institute of Computing Technology CAS Harbin Institute of Technology Shenzhen China Tencent

Lifelong learning capabilities are crucial for sentiment classifiers to process continuous streams of opinioned information on the Web. However, performing lifelong learning is non-trivial for deep neural networks as continually training of incrementally available information inevitably results in catastrophic forgetting or interference. In this paper, we propose a novel iterative network pruning with uncertainty regularization method for lifelong sentiment classification (IPRLS), which leverages the principles of network pruning and weight regularization. By performing network pruning with uncertainty regularization in an iterative manner, IPRLS can adapt a single BERT model to work with continuously arriving data from multiple domains while avoiding catastrophic forgetting and interference. Specifically, we leverage an iterative pruning method to remove redundant parameters in large deep networks so that the freed-up space can then be employed to learn new tasks, tackling the catastrophic forgetting problem. Instead of keeping the old-tasks fixed when learning new tasks, we also use an uncertainty regularization based on the Bayesian online learning framework to constrain the update of old tasks weights in BERT, which enables positive backward transfer, i.e. learning new tasks improves performance on past tasks while protecting old knowledge from being lost. In addition, we propose a task-specific low-dimensional residual function in parallel to each layer of BERT, which makes IPRLS less prone to losing the knowledge saved in the base BERT network when learning a new task. Extensive experiments on 16 popular review corpora demonstrate that the proposed IPRLS method significantly outperforms the strong baselines for lifelong sentiment classification. For reproducibility, we submit the code and data at: https://***/siat-nlp/IPRLS. Copyright © 2021, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Mobile Crowd-Sensing System Based on Participant Selection 15th

Mobile Crowd-Sensing System Based on Participant Selection

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Tu, Chunyu Han, Lei Wang, Leye Yu, Zhiyong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou China Key Lab of High Confidence Software Technologies Peking University Beijing China

ISBN: (纸本)9783030642426

Mobile Crowdsensing (MCS) is often accompanied by various adverse objectives when performing data collection, which makes it difficult to collect accurate data of the entire target area with low cost. Therefore, how to collect a small part of the data to accurately infer the other data of the entire target area is a crucial issue. People’s daily trajectories usually follow a certain pattern, for example, students go to school, company employees go to work. This pattern allows us to find participants who often pass through fixed areas within a certain time span, leading their collected partial data are near optimal for the entire data collection task. This paper models the problem and develops multiple methods to improve the participant selection and the data recovery. Particularly, we use a random method, reinforcement learning, and greedy algorithm to handle this problem and compare the differences among these methods by experiments. © 2020, Springer Nature Switzerland AG.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Clustering and Independent Competing Based Evolutionary Algorithm for Multimodal Multi-Objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2025年

作者： Zhong, Keyu Xiao, Fen Gao, Xieping Hunan Normal University School of Mathematics and Statistics Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Changsha410081 China Xiangtan University School of Computer Science Xiangtan411105 China Hunan Normal University Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

The multimodal multi-objective optimization problem (MMOP) involves multiple distinct components of the Pareto set (PS), which correspond to the same Pareto front (PF). Most existing multimodal multi-objective evolutionary algorithms (MMOEAs) face challenges in achieving both accuracy and timeliness in solving MMOPs. In this article, a two-stage clustering and independent competing based evolutionary algorithm (TSCICEA) is proposed for solving MMOPs. Firstly, in the early stage of population evolution, the K-means technique is used to coarsely cluster the population into multiple independent subpopulations, which aims to rapidly ascertain the approximate distribution structure of modalities and preliminarily locate their spatial positions. In the later stage, the DBSCAN technique is utilized to conduct fine clustering of the population, which aims to re-cluster misclustered individuals in the coarse clustering into new subpopulations, thus achieving a precise distinction between different modalities. Subsequently, to accurately identify the corresponding modality for each subpopulation, an independent competing strategy is proposed. This strategy can automatically assign different identification approaches for each modality based on their differences, and it simultaneously manages different modalities through parallel execution, thus significantly enhancing both the accuracy and timeliness of modality identification. To evaluate the effectiveness of TSCICEA, we compare it against state-of-the-art algorithms on benchmark test problems with 2–15 objectives and 4–15 variables. Experimental results demonstrate that TSCICEA achieves superior performance in terms of the IEDRX, IMST, and HV indicators © 1997-2012 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Cavity-Quantum Electrodynamics with Moiré Flatband Photonic Crystals

arXiv

引用

arXiv 2024年

作者： Wang, Yu-Tong Ye, Qi-Hang Yan, Jun-Yong Qiao, Yufei Chen, Chen Cheng, Xiao-Tian Li, Chen-Hui Zhang, Zi-Jian Huang, Cheng-Nian Meng, Yun Zou, Kai Zhan, Wen-Kang Zhao, Chao Hu, Xiaolong Tee, Clarence Augustine T.H. Sha, Wei E.I. Huang, Zhixiang Liu, Huiyun Jin, Chao-Yuan Ying, Lei Liu, Feng State Key Laboratory of Extreme Photonics and Instrumentation College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China School of Physics Zhejiang Key Laboratory of Micro-nano Quantum Chips and Quantum Control Zhejiang University Hangzhou310027 China School of Precision Instrument and Optoelectronic Engineering Tianjin University Tianjin300072 China Key Laboratory of Optoelectronic Information Science and Technology Ministry of Education Tianjin300072 China Laboratory of Solid State Optoelectronics Information Technology Institute of Semiconductors Chinese Academy of Sciences Beijing100083 China College of Materials Science and Opto-Electronic Technology University of Chinese Academy of Science Beijing101804 China College of Physics and Electrical Information Engineering Zhejiang Normal University Hangzhou310058 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230039 China Department of Electronic and Electrical Engineering University College London LondonWC1E 7JE United Kingdom International Joint Innovation Center Zhejiang University Haining314400 China

Quantum emitters are a key component in photonic quantum technologies. Enhancing their single-photon emission by engineering the photonic environment using cavities can improve the overall efficiency in quantum information processing. However, this enhancement is often limited by the need for precise nanoscale control over emitter’s position within micro/nano-cavities. Inspired by the fascinated physics of moiré pattern, we present an approach to strongly modify the spontaneous emission rate of a quantum emitter using fine-designed multilayer moiré photonic crystal with a robust isolate-flatband dispersion. Theoretical analysis reveals that due to its nearly infinite photonic density of states, the moiré cavity can simultaneously possess high Purcell factor and large tolerance over emitter’s position. We experimentally demonstrate the coupling between this moiré cavity and a quantum dot via the cavity-determined polarization of the dot’s emission. The radiative lifetime of the quantum dot can be tuned by a factor of 40 from 42 ps to 1692 ps, attributed to strong Purcell enhancement and Purcell inhibition effects. Our findings pave the way for moiré flatband cavity-enhanced quantum light sources, quantum optical switches and quantum nodes for quantum internet. Copyright © 2024, The Authors. All rights reserved.

关键词： Particle beams

来源：评论

学校读者我要写书评

暂无评论

Sample hardness based gradient loss for long-tailed cervical cell detection

arXiv

引用

arXiv 2022年

作者： Liu, Minmin Li, Xuechen Gao, Xiangbo Chen, Junliang Shen, Linlin Wu, Huisi Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence of Robotics of Society Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China University of California Irvine United States

Due to the difficulty of cancer samples collection and annotation, cervical cancer datasets usually exhibit a long-tailed data distribution. When training a detector to detect the cancer cells in a WSI (Whole Slice Image) image captured from the TCT (Thinprep Cytology Test) specimen, head categories (e.g. normal cells and inflammatory cells) typically have a much larger number of samples than tail categories (e.g. cancer cells). Most existing state-of-the-art long-tailed learning methods in object detection focus on category distribution statistics to solve the problem in the long-tailed scenario, without considering the "hardness" of each sample. To address this problem, in this work we propose a Grad-Libra Loss that leverages the gradients to dynamically calibrate the degree of hardness of each sample for different categories, and re-balance the gradients of positive and negative samples. Our loss can thus help the detector to put more emphasis on those hard samples in both head and tail categories. Extensive experiments on a long-tailed TCT WSI image dataset show that the mainstream detectors, e.g. RepPoints, FCOS, ATSS, YOLOF, etc. trained using our proposed Gradient-Libra Loss, achieved much higher (7.8%) mAP than that trained using cross-entropy classification loss. Copyright © 2022, The Authors. All rights reserved.

关键词： Cytology

来源：评论

学校读者我要写书评

暂无评论

A New Network Intrusion Detection based on Semi-supervised Dimensionality Reduction and Tri-LightGBM

A New Network Intrusion Detection based on Semi-supervised D...

引用

Pervasive Artificial Intelligence (ICPAI), International Conference on

作者： Hao Zhang Jieling Li College of Mathematics and Computer Science Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (数字)9781665404839

ISBN: (纸本)9781665404846

With the development of technology and threat forms, network intrusion detection has become a challenging task. The intrusion detection algorithm based on supervised learning requires a lot of manpower and material resources to obtain a large amount of labeled data. Besides, the accuracy of unsupervised learning can not meet the requirements of intrusion detection systems. We propose a semi-supervised network intrusion detection method in this paper. information Gain is employed to filter redundancy features. Then, we combine labeled samples with unlabeled samples and adopt Principal Component Analysis (PCA) to convert multiple features into comprehensive features. Finally, an Tri-Training strategy is adopted to integrate the basic LightGBM classifier, and make full use of unlabeled data to generate pseudo labels, thereby optimizing the basic LightGBM classifier. To verify the effectiveness of the proposed approach, a large number of experiments are performed on the UNSW-NB15 dataset. The experimental results fully show that the method is superior in improving detection efficiency and reducing label dependence, and has a lower false alarm rate and a higher detection rate.

关键词： Manganese Graphics processing units Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：