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

International Conference on Big Data computing and Communications (BIGCOM)

作者： Xiaodong Wu Ronghai Wang Guoxin Lin School of Mathmatics and Computer Science Quanzhou Normal University Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Fujian Provincial Big Data Research Institute of Intelligent Manufacturing Quanzhou China

Virtual Machine Consolidation (VMC) is an effective means to improve the resource utilization and reduce energy consumption of data centers. However, the VMC optimization that only considers energy consumption may lead to SLA (Service-Level Agreements) violations and thus fail to guarantee the QoS (Quality of Service) provided. Therefore, it is necessary to consider both energy saving and SLA violations in the process of VMC. In this paper, we propose an energy and SLA-aware VMC algorithm that considers both energy saving and SLA violation optimization in data centers. The proposed algorithm uses the local regression method to predict the utilization of virtual machines, based on which it determines whether the host will be overloaded, so as to make the decision of virtual machine migrations. The proposed VMC algorithm is evaluated with CloudSim toolkit. Simulation results demonstrate that our algorithm has good energy saving performance and can effectively reduce SLA violation in cloud data center. Considering energy consumption and SLA violation, the ESV can be reduced by 7.57% on average and 16.36% at most compared with other algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A novel dual-stage algorithm for capacitated arc routing problems with time-dependent service costs

arXiv

引用

arXiv 2024年

作者： Li, Qingya Liu, Shengcai Zou, Juan Tang, Ke Guangdong Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China The Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Xiangtan411105 China The Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Xiangtan411105 China

This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most significant innovation in this paper lies in the exploitation of this characteristic information during the vehicle departure time optimization stage. Specifically, we conduct a detailed analysis of this relationship under various scenarios and employ tailored methods to obtain the (approximately) optimal vehicle departure time. Furthermore, we propose an improved initialization strategy that considers time-dependent characteristics to achieve better solution quality. In addition to the modified benchmark test sets, we also experiment on a real-world test set. Experimental results demonstrate that MAENS-GN can obtain high-quality solutions on both small-scale and larger-scale instances of CARPTDSC. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Learning to Learn Transferable Generative Attack for Person Re-Identification

引用

IEEE Transactions on Image processing 2025年 PP卷 PP页

作者： Bian, Yuan Liu, Min Wang, Xueping Ma, Yunfeng Wang, Yaonan Hunan University National Engineering Research Center of Robot Visual Perception and Control Technology College of Electrical and Information Engineering Hunan Changsha China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Changsha China

Deep learning-based person re-identification (reid) models are widely employed in surveillance systems and inevitably inherit the vulnerability of deep networks to adversarial attacks. Existing attacks merely consider cross-dataset and cross-model transferability, ignoring the cross-test capability to perturb models trained in different domains. To powerfully examine the robustness of real-world re-id models, the Meta Transferable Generative Attack (MTGA) method is proposed, which adopts meta-learning optimization to promote the generative attacker producing highly transferable adversarial examples by learning comprehensively simulated transfer-based crossmodel&dataset&test black-box meta attack tasks. Specifically, cross-model&dataset black-box attack tasks are first mimicked by selecting different re-id models and datasets for meta-train and meta-test attack processes. As different models may focus on different feature regions, the Perturbation Random Erasing module is further devised to prevent the attacker from learning to only corrupt model-specific features. To boost the attacker learning to possess cross-test transferability, the Normalization Mix strategy is introduced to imitate diverse feature embedding spaces by mixing multi-domain statistics of target models. Extensive experiments show the superiority of MTGA, especially in cross-model&dataset and cross-model&dataset&test attacks, our MTGA outperforms the SOTA methods by 20.0% and 11.3% on mean mAP drop rate, respectively. © 1992-2012 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

A Novel Dual-Stage Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs

SSRN

引用

SSRN 2024年

This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most signiﬁcant innovation in this paper lies in the exploitation of this characteristic information during the vehicle departure time optimization stage. Speciﬁcally, we conduct a detailed analysis of this relationship under various scenarios and employ tailored methods to obtain the (approximately) optimal vehicle departure time. Furthermore, we propose an improved initialization strategy that considers time-dependent characteristics to achieve better solution quality. In addition to the modiﬁed benchmark test sets, we also experiment on a real-world test set. Experimental results demonstrate that MAENS-GN can obtain high-quality solutions on both small-scale and larger-scale instances of CARPTDSC. © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Matching Algorithm for Data Similarity of Public Dataset of network Intrusion Detection 4

Matching Algorithm for Data Similarity of Public Dataset of ...

引用

4th IEEE Eurasia Conference on IoT, Communication and Engineering, ECICE 2022

作者： Hu, Zhihui Liu, Caiming Li, Caixiu Leshan Normal University School of Electronic Information and Artificial Intelligence Leshan China Leshan Normal University Intelligent Network Security Detection and Evaluation Laboratory Leshan China Leshan Normal University Internet Natural Language Intelligent Processing Key Laboratory of Education Department of Sichuan Province Leshan China

ISBN: (纸本)9781665482080

In order to provide the basis for the improvement and optimization of the public network intrusion detection data set, a matching algorithm for data similarity of the KDD CUP ' 99 data set is proposed in this paper. According to the characteristics of the feature record of the network flow of the data set, the structure is defined to save a complete network flow feature record. The sub-algorithm of reading flow feature record, constructing flow feature record queue, calculating flow feature record similarity, and matching data set similarity are designed for the process of data set similarity matching including reading, parsing, similarity calculation, and mutual matching. With the program based on the above matching algorithm, repeated experiments are carried out. The experiment result shows that the matching algorithm can calculate data similarity accurately. © 2022 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

A Fusion Shallow and Deep Features network for Facial StO2 Stress Classification

A Fusion Shallow and Deep Features Network for Facial StO2 S...

引用

IEEE information Technology, networking, Electronic and Automation Control Conference

作者： Haolin Xia Sirui Sun Xinyu Liu Ju Zhou Hanpu Wang Tong Chen School of Electronic and Information Engineering Southwest University Chongqing China Key Laboratory of Non-Linear Circuit and Intelligent Information Processing of Chongqing Chongqing China Institute of Legal Psychology and Intelligent Computing Chongqing China

Stress is an emotional state that affects our lives, so it is vital to detect it accurately. Numerous studies have shown that tissue oxygen saturation (StO2) is an effective physiological signal for identifying different stress states. However, previous StO2 feature extraction methods relied too heavily on baselines to be realized in practice. In this paper, a two-stream network combining shallow and deep features, called CRNet, is proposed for baseline-independent StO2 stress classification. In CRNet, shallow features are extracted using a CNN network and deep features are extracted using a ResNet network. For the extracted high-dimensional deep features, MLP module is employed for dimensionality reduction, which can effectively combine the two levels of features and improve the feature extraction capability of the network. Experimental results show that CRNet can significantly improve the performance of StO2 stress classification to the state-of-the-art (SOTA) even when using only raw imbalanced data.

关键词： Dimensionality reduction Automation Anxiety disorders Feature extraction Physiology Stress

来源：评论

学校读者我要写书评

暂无评论

A Cross-direction Task Decoupling network for Small Logo Detection

A Cross-direction Task Decoupling Network for Small Logo Det...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Sujuan Hou Xingzhuo Li Weiqing Min Jiacheng Li Jing Wang Yuanjie Zheng Shuqiang Jiang School of Information Science and Engineering Shandong Normal University Jinan China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Logo detection plays an integral role in many applications. However, handling small logos is still difficult since they occupy too few pixels in the image, which burdens the extraction of discriminative features. The aggregation of small logos also brings a great challenge to the classification and localization of logos. To solve these problems, we creatively propose Cross-direction Task Decoupling network (CTDNet) for small logo detection. We first introduce Cross-direction Feature Pyramid (CFP) to realize cross-direction feature fusion by adopting horizontal transmission and vertical transmission. In addition, Multi-frequency Task Decoupling Head (MTDH) decouples the classification and localization tasks into two branches. A multi-frequency attention convolution branch is designed to achieve more accurate regression by combining discrete cosine transform and convolution creatively. Comprehensive experiments on four logo datasets demonstrate the effectiveness and efficiency of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fu-W:A Hyperspectral Image Classification Algorithm Combining Mini Graph Convolutional networks and Convolutional neural network 23

Fu-W:A Hyperspectral Image Classification Algorithm Combinin...

引用

6th International Conference on Big Data Technologies, ICBDT 2023

作者： Shi, Jiechuan Liu, Kun Yuan, Hao Wang, Can Yang, Bo School of Information Science and Engineering University of Jinan Jinan250022 China China High-resolution Earth Observation System Shandong Center of Data and Application University of Jinan Jinan250022 China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan250022 China

ISBN: (纸本)9798400707667

Convolutional Neural network (CNN) is a widely used neural network in deep learning, and Graph Convolutional network (GCN) is one of the most effective semi -supervised methods. It spread node information in a conversion way. In this article, we have studied the differences between CNN and GCN in the classification of high -spectrum image. Because the traditional GCN algorithm needs to build an adjacent matrix on all data, the calculation cost is very high, especially in large -scale remote sensing problems. MinigCNS uses a small -batch learning method to solve the problem of CCN calculation costs, and then it has not solved the problem of low efficiency of single model classification. This article studies the advantages of minigcns and CNN, and proposes a weighted fusion network FU-W, which weighs the minigcns and CNN weighted integration to break the bottleneck of single model performance. We experimented with the fusion algorithm on the two high -spectrum data sets, and its overall accuracy can reach 88.8%in Indian Pines. The experiment proves the superiority of the fusion strategy for a single CNN or GCN model. © 2023 ACM.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Speculative Decoding with CTC-based Draft Model for LLM Inference Acceleration

arXiv

引用

arXiv 2024年

作者： Wen, Zhuofan Gui, Shangtong Feng, Yang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences China Key Laboratory of Al Safety Chinese Academy of Sciences China University of Chinese Academy of Sciences Beijing China

Inference acceleration of large language models (LLMs) has been put forward in many application scenarios and speculative decoding has shown its advantage in addressing inference acceleration. Speculative decoding usually introduces a draft model to assist the base LLM where the draft model produces drafts and the base LLM verifies the draft for acceptance or rejection. In this framework, the final inference speed is decided by the decoding speed of the draft model and the acceptance rate of the draft provided by the draft model. Currently the widely used draft models usually generate draft tokens for the next several positions in a non-autoregressive way without considering the correlations between draft tokens. Therefore, it has a high decoding speed but an unsatisfactory acceptance rate. In this paper, we focus on how to improve the performance of the draft model and aim to accelerate inference via a high acceptance rate. To this end, we propose a CTC-based draft model which strengthens the correlations between draft tokens during the draft phase, thereby generating higher-quality draft candidate sequences. Experiment results show that compared to strong baselines, the proposed method can achieve a higher acceptance rate and hence a faster inference speed. Copyright © 2024, The Authors. All rights reserved.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Optically transparent transmissive orbital angular momentum (OAM) metasurface with high transmittance and broadband characteristics

引用

Optics Express 2025年第12期33卷 24385-24395页

作者： Yong Cai Yuying Dai Yue Ma Gang Wang Guanghui Xu Xingang Ren Hui Wang Xiaohu Zhao Xianliang Wu Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei 230039 China Key Laboratory of Electromagnetic Environmental Sensing of Anhui Higher Education Institutes Anhui University Hefei 230039 China wang_toward@*** ghxu86@*** Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Institute of Physical Science and Information Technology Anhui University Hefei 230039 China xgren@*** Hefei Normal University Hefei 230009 China

This work proposes a high-performance broadband orbital angular momentum (OAM) beam-generating metasurface based on optically transparent media. A broadband polarization-converting transmissive metasurface, which operates in the 18 - 24 (28.57% fractional bandwidth) GHz range, has been realized by collaboratively designing dual C-split ring resonator structures and bidirectional lattice-patterned surface networks. The array structure demonstrates typical helical phase distribution features in the K-band, and experimental results verify simulation design. Innovatively employing a composite structure of quartz glass substrate and patterned conductive thin films, the design achieves compatible optimization of 77% visible-light transmittance and microwave broadband performance. This approach breaks through the mutually exclusive limitations of traditional metasurfaces’ optical/electromagnetic properties, providing a highly integrated solution for transparent antenna radomes in satellite communication systems and multi-mode beam multiplexing applications.

关键词： Orbital angular momentum multiplexing Phase plates Ring resonators Spatial light modulators Spiral phase Thin films

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：