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

TERMS: Task management policies to achieve high performance for mixed workloads using surplus resources

Journal of Parallel and Distributed Computing 2022年第0期170卷 74-85页

作者： Yu, Jinyu Tong, Wei Lv, Pengze Feng, Dan Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology School of Computer Science and Technology Huazhong University of Science and Technology Ministry of Education of China Hubei Wuhan China

Resource contentions and performance interferences can lead to workload performance degradation in mixed-workload deployment clusters. Previous work guarantees the resource requirements of latency-sensitive tasks and reduces performance losses to batch jobs by reclaiming surplus resources from over-provisioned tasks. While the fragmentation of resources leads to a mismatch between provisioned resources and task requirements, resulting in high operation overheads and losses of task fairness. This paper proposes TERMS, the task management policies based on task relevance, resource distribution, and task fairness to achieve efficient and low-cost task management. TERMS mainly includes three types of management policies. The task scheduling policy can schedule new tasks according to task relevance. Task selection strategies select tasks for resource provisioning and task resumption based on resource requirements and task fairness. If necessary, the node selection strategy can be used to choose befitting target nodes based on task relevance and node resource information for task migration when eliminating straggler tasks. Evaluation results show that TERMS can further improve the performance of latency-sensitive services and batch jobs, reduce management overheads, and avoid operation failures. © 2022 Elsevier Inc.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Intersecting-Boundary-Sensitive Fingerprinting for Tampering Detection of DNN Models 41

Intersecting-Boundary-Sensitive Fingerprinting for Tampering...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Bai, Xiaofan He, Chaoxiang Ma, Xiaojing Zhu, Bin Benjamin Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China Microsoft United States School of Computer Science and Technology Huazhong University of Science and Technology China Cluster and Grid Computing Lab China

Cloud-based AI services offer numerous benefits but also introduce vulnerabilities, allowing for tampering with deployed DNN models, ranging from injecting malicious behaviors to reducing computing resources. Fingerprint samples are generated to query models to detect such tampering. In this paper, we present Intersecting-Boundary-Sensitive Fingerprinting (IBSF), a novel method for black-box integrity verification of DNN models using only top-1 labels. Recognizing that tampering with a model alters its decision boundary, IBSF crafts fingerprint samples from normal samples by maximizing the partial Shannon entropy of a selected subset of categories to position the fingerprint samples near decision boundaries where the categories in the subset intersect. These fingerprint samples are almost indistinguishable from their source samples. We theoretically establish and confirm experimentally that these fingerprint samples' expected sensitivity to tampering increases with the cardinality of the subset. Extensive evaluation demonstrates that IBSF surpasses existing state-of-the-art fingerprinting methods, particularly with larger subset cardinality, establishing its state-of-the-art performance in black-box tampering detection using only top-1 labels. The IBSF code is available at: https://***/CGCL-codes/IBSF. Copyright 2024 by the author(s)

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

Discrete Geometric Coded Data Layout for Large-scale Object Storage systems 21

Discrete Geometric Coded Data Layout for Large-scale Object ...

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Tian, Yi Xu, Guangping Yang, Hongzhang Ni, Yue Cao, JiaXin Yang, Lei Tianjin University of Technology School of Computer Science and Engineering Tianjin China Novel Software Technology Tianjin Key Laboratory of Intelligence Computing Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China Information Technology Co. Ltd. China

ISBN: (纸本)9798350329223

Regenerating codes are new network codes proposed to reduce the data required for fault repair, which can improve the recovery efficiency of faulty nodes in data storage systems. However, unlike Reed-Solomon code, which repairs at the granularity of bytes, regenerating codes require data stored in large chunks but leads to severe read amplification, which reads out excess data when degraded read objects and increases degraded read time. That reflects a mutual constraint between improving recovery efficiency and degraded read performance, as manifested in the amplification of data reads, a vital issue considered in this *** solve this problem, we propose a new type of data layout - discrete geometric, which splits the object into a series of geometric sequences of data blocks. They are placed discretely into corresponding containers on the disks at different nodes, with containers of the same size made into a strip for encoding. The discrete characteristic ensures lower repair costs for degraded reads. The geometric characteristic ensures the repair performance of regenerating codes by large blocks, and read amplification can be mitigated through small blocks. To reduce IOPS for discrete geometric, we propose Discrete Geometric-Locally Regenerating Codes (DG-LRCs), guaranteeing lower degraded read latency while improving recovery *** results show that the degraded read time of DG-LRCs compared to regenerating codes combined with geometric partitioning is 22.56% lower at 2Gbpsand 60.56% lower at 4Gbps, and the recovery performance is 7.04 times better than that of RS code. © 2023 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Wavelet method optimised by ant colony algorithm used for extracting stable and unstable signals in intelligent substations

引用

CAAI Transactions on Intelligence Technology 2022年第2期7卷 292-300页

作者： Tianyan Jiang Xiao Yang Yuan Yang Xi Chen Maoqiang Bi Jianfei Chen School of Electrical and Electronic Engineering Chongqing University of TechnologyChongqingChina DepartmentState Key Laboratory of Power Transmission Equipment&System and New Technology Chongqing UniversityChongqingChina Department of Electrical and Computer Engineering University of MarylandCollege ParkMarylandUSA

Partial discharge(PD)signals are an important index to evaluate the operation state of intelligent *** correct distinction of PD pulse and interference pulse has become a challenging *** of the noise and the low signal-to-noise ratio,the stable signals become *** selection of a wavelet basis,the selection rule of thresholdλand the design of the threshold function are the key factors affecting the final denoising ***,an enhanced ant colony optimisition wavelet(ACOW)algorithm was applied to find the global optimal threshold through the continuous derivative threshold function and the ant colony optimisation(ACO)*** the same time the efficiency of adaptive search calculation,was also significantly *** method of the ACOW algorithm was compared with the soft wavelet method,gradient-based wavelet method and the genetic optimisation wavelet(GOW)*** these four methods to denoise four typical signals,different mean square errors(MSE),magnitude errors(ME)and time costs were ***,the results show that the ACOW method can achieve the minimum MSE and has less time *** generates significantly smaller waveform distortion than the other three threshold estimation *** addition,the high efficiency and good quality of the output signals are beneficial to the diagnosis of local discharge signals in intelligent substations.

关键词： algorithm noise method

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Latency and Energy Consumption for Mobile Edge Computing Based Proximity Detection in Road Networks

引用

China Communications 2022年第4期19卷 274-290页

作者： Tongyu Zhao Yaqiong Liu Guochu Shou Xinwei Yao School of Information and Communication Engineering Beijing University of Posts and TelecommunicationsBeijing 100876China Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and ConvergenceBeijing 100876China School of Computer Science and Technology Zhejiang University of TechnologyChina

In recent years, artificial intelligence and automotive industry have developed rapidly, and autonomous driving has gradually become the focus of the industry. In road networks, the problem of proximity detection refers to detecting whether two moving objects are close to each other or not in real time. However, the battery life and computing capability of mobile devices are limited in the actual scene,which results in high latency and energy consumption. Therefore, it is a tough problem to determine the proximity relationship between mobile users with low latency and energy consumption. In this article, we aim at finding a tradeoff between latency and energy consumption. We formalize the computation offloading problem base on mobile edge computing(MEC)into a constrained multiobjective optimization problem(CMOP) and utilize NSGA-II to solve it. The simulation results demonstrate that NSGA-II can find the Pareto set, which reduces the latency and energy consumption effectively. In addition, a large number of solutions provided by the Pareto set give us more choices of the offloading decision according to the actual situation.

关键词： proximity detection mobile edge computing road networks constrained multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Improved Density Peaking Algorithm for Community Detection Based on Graph Representation Learning

引用

computer systems Science & engineering 2022年第12期43卷 997-1008页

作者： Jiaming Wang Xiaolan Xie Xiaochun Cheng Yuhan Wang Guangxi Key Laboratory of Embedded Technology and Intelligent System Guilin541006GuangxiChina School of Information Science and Engineering Guilin University of TechnologyGuilin541006GuangxiChina Department of Computer Science Middlesex UniversityLondon

There is a large amount of information in the network data that we canexploit. It is difficult for classical community detection algorithms to handle network data with sparse topology. Representation learning of network data is usually paired with clustering algorithms to solve the community detection ***, there is always an unpredictable distribution of class clusters outputby graph representation learning. Therefore, we propose an improved densitypeak clustering algorithm (ILDPC) for the community detection problem, whichimproves the local density mechanism in the original algorithm and can betteraccommodate class clusters of different shapes. And we study the communitydetection in network data. The algorithm is paired with the benchmark modelGraph sample and aggregate (GraphSAGE) to show the adaptability of ILDPCfor community detection. The plotted decision diagram shows that the ILDPCalgorithm is more discriminative in selecting density peak points compared tothe original algorithm. Finally, the performance of K-means and other clusteringalgorithms on this benchmark model is compared, and the algorithm is proved tobe more suitable for community detection in sparse networks with the benchmarkmodel on the evaluation criterion F1-score. The sensitivity of the parameters ofthe ILDPC algorithm to the low-dimensional vector set output by the benchmarkmodel GraphSAGE is also analyzed.

关键词： Representation learning data mining low-dimensional embedding community detection density peaking algorithm

来源：评论

学校读者我要写书评

暂无评论

An Elite Archive-Assisted Multi-Objective Evolutionary Algorithm for mRNA Design 13

An Elite Archive-Assisted Multi-Objective Evolutionary Algor...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Hong, Wenjing Chen, Cheng Zhu, Zexuan Tang, Ke Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen China

ISBN: (纸本)9798350308365

Messenger RNA (mRNA) vaccines have emerged as highly effective strategies in the prophylaxis and treatment of diseases. mRNA design, a key to the success of mRNA vaccines, in-volves finding optimal codons and increasing secondary structure stability to lengthen mRNA half-life, ultimately enhancing protein expression. Despite receiving widespread attention, most methods primarily rely on manual design, which is time-consuming and labor-intensive. While optimization approaches can alleviate this issue, existing methods still exhibit critical limitations caused by conflicts between codon usage and mRNA structural stability, compounded by the vast design space of mRNA resulting from the presence of synonymous codons. In this paper, a novel multi-objective evolutionary optimization-based mRNA design method is proposed. We first formulate the mRNA design problem as a multi-objective optimization problem and then develop an Elite Archive-Assisted Multi-Objective Evolutionary algorithm for mRNA Design, namely EAA-MOED, by incorporating a novel elite archive-assisted method into a weighted optimization framework to improve search efficiency. Experimental studies, involving two state-of-the-art mRNA design methods and five well-known MOEAs, show the competitiveness of the proposed EAA-MOED in mRNA design. © 2024 IEEE.

关键词： Vaccines

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Robust Android Malware Familial Classification

引用

IEEE Transactions on Dependable and Secure Computing 2022年 1-14页

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai China University of Texas at Dallas Dallas USA National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. IEEE

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Towards Stricter Black-box Integrity Verification of Deep Neural Network Models 24

Towards Stricter Black-box Integrity Verification of Deep Ne...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： He, Chaoxiang Bai, Xiaofan Ma, Xiaojing Zhu, Bin B. Hu, Pingyi Fu, Jiayun Jin, Hai Zhang, Dongmei Huazhong University of Science and Technology Hubei Wuhan China Shanghai Jiao Tong University Shanghai China Microsoft Corporation Beijing China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9798400706868

Cloud-based machine learning services offer significant advantages but also introduce the risk of tampering with cloud-deployed deep neural network (DNN) models. Black-box integrity verification (BIV) allows model owners and end-users to determine if a cloud-deployed DNN model has been tampered with by examining only the top-1 label responses. Fingerprinting generates fingerprint samples to query the model, achieving BIV with no impact on the model's accuracy. In this paper, we present BIVBench, the first comprehensive benchmark for BIV of DNN models. BIVBench covers 16 types of model modifications, providing extensive coverage of practical modification scenarios. Our analysis reveals that existing fingerprinting methods, which are typically focused on significant tampering, lack the sensitivity needed to effectively detect subtle yet common and potentially severe modifications. To address this limitation, we propose MiSentry (Model Integrity Sentry), a novel fingerprinting method that leverages meta-learning. MiSentry strategically incorporates a few subtly modified models into the meta-learning model zoo and maximizes the divergence of output predictions between the target model and the modified models in the model zoo to generate highly sensitive, generalizable, and effective fingerprint samples. Extensive evaluations using BIVBench demonstrate that MiSentry outperforms existing state-of-the-art methods overall and significantly surpasses them in detecting subtle modifications. The BIVBench and supplementary materials are available at: https://***/CGCL-codes/BIVBench. © 2024 ACM.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Revisiting the thermal ageing on the metallised polypropylene film capacitor:from device to dielectric film

引用

High Voltage 2023年第2期8卷 305-314页

作者： Yushuang He Feipeng Wang Guoqiang Du Lei Pan Kaizheng Wang Reimund Gerhard Ronald Plath Pawel Rozga Pavel Trnka State Key Laboratory of Power Transmission Equipment and System Security and New Technology Chongqing UniversityChongqingChina Faculty of Electrical Engineering Kunming University of Science and TechnologyKunmingChina Soft Transducer Materials and Systems Universität PotsdamPotsdamGermany Faculty IV Electrical Engineering and Computer Science Technische Universität BerlinBerlinGermany Institute of Electrical Power Engineering Lodz University of TechnologyLodzPoland Faculty of Electrical Engineering University of West BohemiaPilsenCzech Republic

Metallised polypropylene film capacitors(MPPFCs)are widely used in power electronics and are generally degraded by elevated *** work aims to determine the relationships between the structural changes of MPPFC and the microstructural variations of the PP film during the thermal ageing of MPPFC at 100℃ for 38 *** capacitance of MPPFC has a slight decrease during thermal ***,the breakdown voltage of the MPPFC decreases by 39.4%by the *** partial discharge(PD)number of MPPFC increases linearly with ageing *** tear-down analysis of the MPPFC reveals that the molecular structure of the PP film has not been altered but has led to molecular chain scission and the generation of some polar fragments/***,the relative permittivity of the PP films rises as the ageing time ***,thermal ageing causes the conversion of aluminum to alumina in the metallised electrode,which is hydrophilic for polar groups and leads to an adhesion effect between the metallised electrodes and the PP *** angle measurements prove that the surface hydrophilicity of the PP sample increased after thermal ***,the PD/breakdown voltage in the MPPFC increases/decreases due to the uneven adhesion of the metallised PP film.

关键词： film thermal ageing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：