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

6th International Conference on Artificial Intelligence and Security, ICAIS 2020

作者： Xu, Zi-Xiao Dai, Qin-yun Xu, Gang Huang, He Chen, Xiu-Bo Yang, Yi-Xian Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China School of Information Science and Technology North China University of Technology Beijing100144 China Shanghai Branch Coordination Center of China National Computer Network Emergency Response Technical Team Shanghai201315 China State Key Laboratory of Public Big Data Guizhou University GuiyangGuizhou550025 China

ISBN: (纸本)9783030578831

The boost of 5G technology has brought IoT with enhanced feasibility, it is predictable to have a dramatically increased number of the IoT devices with Internet access. However, there will be certain numbers of devices that are extremely vulnerable, particularly with low level of security coding built in. Hackers might have a greater chance to launch DDoS attack. Therefore, identifiable IoT devices linked to the network security vulnerability database might mitigate the risks contributing to a safer cyberspace. This is of great significance to the security of the entire cyberspace. This paper proposes an IoT device identification technology based on network protocol keyword query. Firstly, the traffic packets sent by the IoT device are collected in real time. Then the traffic data carried by different network protocols is extracted by parsing traffic packets. Secondly, the traffic data is filtered and converted into identifiable information related to the identification attribute of the IoT device. Finally, with the search engine of the major Internet of Things e-commerce website, the information about the IoT device is obtained by inputting the protocol keyword. © 2020, Springer Nature Switzerland AG.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Group-wise Inhibition based Feature Regularization for Robust Classification

Group-wise Inhibition based Feature Regularization for Robus...

引用

International Conference on computer Vision (ICCV)

作者： Haozhe Liu Haoqian Wu Weicheng Xie Feng Liu Linlin Shen Computer Vision Institute College of Computer Science and Software Engineering SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

The convolutional neural network (CNN) is vulnerable to degraded images with even very small variations (e.g. corrupted and adversarial samples). One of the possible reasons is that CNN pays more attention to the most discriminative regions, but ignores the auxiliary features when learning, leading to the lack of feature diversity for final judgment. In our method, we propose to dynamically suppress significant activation values of CNN by group-wise inhibition, but not fixedly or randomly handle them when training. The feature maps with different activation distribution are then processed separately to take the feature independence into account. CNN is finally guided to learn richer discriminative features hierarchically for robust classification according to the proposed regularization. Our method is comprehensively evaluated under multiple settings, including classification against corruptions, adversarial attacks and low data regime. Extensive experimental results show that the proposed method can achieve significant improvements in terms of both robustness and generalization performances, when compared with the state-of-the-art methods. Code is available at https://***/LinusWu/TENET_Training.

关键词： Training computer vision Codes Heuristic algorithms Robustness Classification algorithms Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A parameter adaptive de algorithm on real-parameter optimization

A parameter adaptive de algorithm on real-parameter optimiza...

引用

作者： Pan, Jeng-Shyang Yang, Cheng Meng, Fanjia Chen, Yuxin Meng, Zhenyu College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China Institute of Artificial Intelligence Fujian University of Technology Fuzhou China Guanzhuang Central Primary School of Zhangqiu District Jinan China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China

Differential Evolution (DE) algorithm generates a population of individuals by encoding with a floating point vector, and it is a simple and effective population-based stochastic optimization algorithm for global optimization of continuous space. Because of its excellent performance, DE variants can be applied in a wide range of applications in science and engineering. However, the performance of DE is sensitive to the choice of trial vector generation strategy and the associated control parameters. Therefore, it is necessary to choose appropriate mutation strategy and control parameters when tackling optimization applications. In this paper, an adaptive update mechanism is proposed to update control parameters F and Cr. The experimental results are verified on the CEC 2013 test suite which contains 28 benchmark functions for the evaluation of single objective real parameter optimization. The proposed algorithm is compared with jDE, iwPSO and ccPSO, and experiment results show its good performance. © 2020 - IOS Press and the authors. All rights reserved.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Record High Temperatures in the Ocean in 2024

引用

Advances in Atmospheric sciences 2025年第6期 1092-1109页

作者： Lijing CHENG John ABRAHAM Kevin E.TRENBERTH James REAGAN Huai-Min ZHANG Andrea STORTO Karina VON SCHUCKMANN Yuying PAN Yujing ZHU Michael E.MANN Jiang ZHU Fan WANG Fujiang YU Ricardo LOCARNINI John FASULLO Boyin HUANG Garrett GRAHAM Xungang YIN Viktor GOURETSKI Fei ZHENG Yuanlong LI Bin ZHANG Liying WAN Xingrong CHEN Dakui WANG Licheng FENG Xiangzhou SONG Yulong LIU Franco RESEGHETTI Simona SIMONCELLI Gengxin CHEN Rongwang ZHANG Alexey MISHONOV Zhetao TAN Wangxu WEI Huifeng YUAN Guancheng LI Qiuping REN Lijuan CAO Yayang LU Juan DU Kewei LYU Albertus SULAIMAN Michael MAYER Huizan WANG Zhanhong MA Senliang BAO Henqian YAN Zenghong LIU Chunxue YANG Xu LIU Zeke HAUSFATHER Tanguy SZEKELY Flora GUES National Key Laboratory of Earth System Numerical Modeling and Application Institute of Atmospheric PhysicsChinese Academy of Sciences University of St. Thomas School of Engineering NSF National Center for Atmospheric Research University of Auckland National Oceanic and Atmospheric Administration National Centers for Environmental Information National Research Council (CNR) Institute of Marine Sciences (ISMAR) Mercator Ocean International Department of Earth and Environmental Science University of Pennsylvania Institute of Oceanology Chinese Academy of Sciences National Marine Environmental Forecasting Center Ministry of Natural Resources of China North Carolina Institute for Climate Studies (NCICS) North Carolina State University Oceanographic Data Center Chinese Academy of Sciences College of Oceanography Hohai University National Marine Data and Information Service Istituto Nazionale di Geofisica eVulcanologia Sede di Bologna South China Sea Institute of Oceanology Chinese Academy of Sciences ESSIC/CISESS-MD University of Maryland Computer Network Information Center Chinese Academy of Sciences Eco-Environmental Monitoring and Research Center Pearl River Valley and South China Sea Ecology and Environment Administration Ministry of Ecology and Environment National Meteorological Information Center China Meteorological Administration International Research Center of Big Data for Sustainable Development Goals Xiamen University Research Center for Climate and Atmosphere National Research and Innovation Agency (BRIN) Research Department European Centre for Medium-Range Weather Forecasts Department of Meteorology and Geophysics University of Vienna College of Meteorology and Oceanography National University of Defense Technology State Key Laboratory of Satellite Ocean Environment Dynamics Second Institute of OceanographyMinistry of Natural Resources Stripe Inc. South San Francisco Ocean Scope CELAD

Heating in the ocean has continued in 2024 in response to increased greenhouse gas concentrations in the atmosphere,despite the transition from an El Ni?o to neutral conditions. In 2024, both global sea surface temperature(SST) and upper2000 m ocean heat content(OHC) reached unprecedented highs in the historical record. The 0–2000 m OHC in 2024exceeded that of 2023 by 16 ± 8 ZJ(1 Zetta Joules = 1021 Joules, with a 95% confidence interval)(IAP/CAS data), which is confirmed by two other data products: 18 ± 7 ZJ(CIGAR-RT reanalysis data) and 40 ± 31 ZJ(Copernicus Marine data,updated to November 2024). The Indian Ocean, tropical Atlantic, Mediterranean Sea, North Atlantic, North Pacific, and Southern Ocean also experienced record-high OHC values in 2024. The global SST continued its record-high values from2023 into the first half of 2024, and declined slightly in the second half of 2024, resulting in an annual mean of 0.61°C ±0.02°C(IAP/CAS data) above the 1981–2010 baseline, slightly higher than the 2023 annual-mean value(by 0.07°C ±0.02°C for IAP/CAS, 0.05°C ± 0.02°C for NOAA/NCEI, and 0.06°C ± 0.11°C for Copernicus Marine). The record-high values of 2024 SST and OHC continue to indicate unabated trends of global heating.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A hybridized parallel bats algorithm for combinatorial problem of traveling salesman

A hybridized parallel bats algorithm for combinatorial probl...

引用

作者： Nguyen, Trong-The Qiao, Yu Pan, Jeng-Shyang Chu, Shu-Chuan Chang, Kuo-Chi Xue, Xingsi Dao, Thi-Kien Intelligent Information Processing Research Center Fujian University of Technology Fujian Fuzhou China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fujian China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China Department of Information Technology University of Manage and Technology Haiphong Viet Nam

Metaheuristic algorithms have been applied widely for real-world problems in many fields, e.g., engineering, financial, healthcare. Bats algorithm (BA) is a recent metaheuristic algorithm with considering as a robust optimization method that can outperform existing algorithms. However, when dealing with complicated combinatorial problems such as traveling salesman problems (TSP), the BA can be fallen in a local optimum. This paper proposes a new hybridizing Parallel BA (HPBA) with a mutation in local-search to escape such its drawback scenario for TSP. A graph theory mutation method is used to embed for hybridizing BA with exploiting similarities among individuals. The proposed method is extensively evaluated in TSP with series instances of the benchmark from TSPLIB to test its performance. The compared experimental result with the previous method and the best-known solutions (B.K.S) in the literature shows that the proposed approach offers competitive results. © 2020 - IOS Press and the authors. All rights reserved.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Single-path Bit Sharing for Automatic Loss-aware Model Compression

arXiv

引用

arXiv 2021年

作者： Liu, Jing Zhuang, Bohan Chen, Peng Shen, Chunhua Cai, Jianfei Tan, Mingkui The School of Software Engineering South China University of Technology China The Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China The Pazhou Laboratory Guangzhou China The School of Computer Science the University of Adelaide Australia The Faculty of Information Technology Monash University Australia The College of Computer Science and Technology Zhejiang University Hangzhou China

Network pruning and quantization are proven to be effective ways for deep model compression. To obtain a highly compact model, most methods first perform network pruning and then conduct quantization based on the pruned model. However, this strategy may ignore that the pruning and quantization would affect each other and thus performing them separately may lead to sub-optimal performance. To address this, performing pruning and quantization jointly is essential. Nevertheless, how to make a trade-off between pruning and quantization is non-trivial. Moreover, existing compression methods often rely on some pre-defined compression configurations (i.e., pruning rates or bitwidths). Some attempts have been made to search for optimal configurations, which however may take unbearable optimization cost. To address these issues, we devise a simple yet effective method named Single-path Bit Sharing (SBS) for automatic loss-aware model compression. To this end, we consider the network pruning as a special case of quantization and provide a unified view for model pruning and quantization. We then introduce a single-path model to encode all candidate compression configurations, where a high bitwidth value will be decomposed into the sum of a lowest bitwidth value and a series of re-assignment offsets. Relying on the single-path model, we introduce learnable binary gates to encode the choice of configurations and learn the binary gates and model parameters jointly. More importantly, the configuration search problem can be transformed into a subset selection problem, which helps to significantly reduce the optimization difficulty and computation cost. In this way, the compression configurations of each layer and the trade-off between pruning and quantization can be automatically determined. Extensive experiments on CIFAR-100 and ImageNet show that SBS significantly reduces computation cost while achieving promising performance. For example, our SBS compressed MobileNetV2 achieves

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Congestion Relief in Downlink OFDMA Cellular System Using Inter-Cell Relay

引用

China Communications 2019年第4期16卷 35-46页

作者： Weifeng Lu Mingqi Zhu Jia Xu Siguang Chen Lijun Yang Jian Xu School of Computer Science Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications College of Internet of Things Nanjing University of Posts and Telecommunications School of Computer Science and Engineering Nanjing University of Science and Technology

This paper proposes the concept of inter-cell relay for downlink orthogonal frequency division multiple access(OFDMA) cellular systems, which uses multi-hop to relay calls from overloaded cells to light-load neighboring cells. It is shown that when using inter-cell relay, the number of calls in the congestion cell can be significantly increased. The congestion cell is divided into two parts. One is called non-relay area(NRA), in which a call directly communicates with the base station(BS) of a congested cell. The other is called relay area(RA), in which a call communicates with the BS of a neighboring cell through a relay station(RS). The two parts have different user-call densities. By adjusting the densities of two parts, we will maximize the number of supported calls inside a congested cell. The results show the benefits gained from inter-cell relay in congestion relief, which can reduce cell congestion by fully utilizing the available resources in the neighboring cells.

关键词： OFDMA cellular system congestion relief optimization problem inter-cell relay

来源：评论

学校读者我要写书评

暂无评论

A New Anti-Quantum Proxy Blind Signature for Blockchain-Enabled Internet of Things

引用

computers, Materials & Continua 2019年第8期61卷 711-726页

作者： Chaoyang Li Gang Xu Yuling Chen Haseeb Ahmad Jian Li Guizhou University Sate Key Laboratory of Public Big DataGuiyang550025China Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Post and TelecommunicationsBeijing100876China School of Computer Science Beijing University of Post and TelecommunicationsBeijing100876China Department of Computer Science National Textile University Faisalabad37610Pakistan

Blockchain technology has become a research hotspot in recent years with the prominent characteristics as public,distributed and *** blockchain-enabled internet of things(BIoT)has a tendency to make a revolutionary change for the internet of things(IoT)which requires distributed trustless ***,the scalability and security issues become particularly important with the dramatically increasing number of IoT ***,with the development of quantum computing,many extant cryptographic algorithms applied in blockchain or BIoT systems are vulnerable to the quantum *** this paper,an anti-quantum proxy blind signature scheme based on the lattice cryptography has been proposed,which can provide user anonymity and untraceability in the distributed applications of ***,the security proof of the proposed scheme can derive that it is secure in random oracle model,and the efficiency analysis can indicate it is efficient than other similar literatures.

关键词： Blockchain blockchain-enabled internet of things quantum computers proxy blind signature

来源：评论

学校读者我要写书评

暂无评论

Robust and Fast Measure of Information via Low-rank Representation

arXiv

引用

arXiv 2022年

作者： Dong, Yuxin Gong, Tieliang Yu, Shujian Chen, Hong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China Machine Learning Group UiT - The Arctic University of Norway Norway College of Science Huazhong Agriculture University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China

The matrix-based Rényi’s entropy allows us to directly quantify information measures from given data, without explicit estimation of the underlying probability distribution. This intriguing property makes it widely applied in statistical inference and machine learning tasks. However, this information theoretical quantity is not robust against noise in the data, and is computationally prohibitive in large-scale applications. To address these issues, we propose a novel measure of information, termed low-rank matrix-based Rényi’s entropy, based on low-rank representations of infinitely divisible kernel matrices. The proposed entropy functional inherits the specialty of of the original definition to directly quantify information from data, but enjoys additional advantages including robustness and effective calculation. Specifically, our low-rank variant is more sensitive to informative perturbations induced by changes in underlying distributions, while being insensitive to uninformative ones caused by noises. Moreover, low-rank Rényi’s entropy can be efficiently approximated by random projection and Lanczos iteration techniques, reducing the overall complexity from O(n3) to O(n2s) or even O(ns2), where n is the number of data samples and s n. We conduct large-scale experiments to evaluate the effectiveness of this new information measure, demonstrating superior results compared to matrix-based Rényi’s entropy in terms of both performance and computational efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Foster noisy label learning by exploiting noise-induced distortion in foreground localization

引用

Neural Networks 2025年

作者： Ang Chen Feng Xu Xin Lyu Tao Zeng Xin Li College of Computer Science and Software Engineering Hohai University Nanjing 211100 China School of Computer Engineering Jiangsu Ocean University Lianyungang 222005 China Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing 211100 China

Large-scale, well-annotated datasets are crucial for training deep neural networks. However, the prevalence of noisy-labeled samples can cause irreversible impairment to the generalization of models. Existing approaches have attempted to mitigate the impact of noisy labels by exploiting the different loss or confidence distributions between clean and noisy data to detect and correct noisy labels. This paper investigates the noise-induced distorting effect on foreground localization by tracking the model’s spatial attention distribution on visual activation maps. We observe that in clean samples, highly responsive regions usually focus on label-relevant foreground regions, whereas in noisy data, the model accidentally attends to uninformative background regions or cluttered object edges due to interference from label noise. Inspired by the observations, we propose a novel two-stage foreground localization-augmented noisy label learning framework named FLSC to concurrently boost the accuracy of sample selection and label correction for robust training. Specifically, FLSC first quantifies noise-induced distortion in foreground localization to foster conventional loss-based selection criteria by calculating the information reduction when deriving the foreground images from the original images based on the attention distribution. Next, we propose a noise-adaptive adversarial erasing strategy, which suppresses background activation by imposing adaptive erasure regularization, to eliminate overfitting to noisy samples while enhancing the learning of robust representations. To the best of our knowledge, it’s the first attempt to exploit localization quality evaluation based on feature activation to address the label noise problem. Extensive experiments on synthetic and real-world datasets validate the superior performance of FLSC compared to state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：