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

PM$^{2}$2VE: Power Metering Model for Virtualization Environments in Cloud data Centers

学校读者我要写书评

暂无评论

IEEE Transactions on Cloud Computing 2023年第3期11卷 3126-3138页

作者： Ziyu Shen Xusheng Zhang Zheng Liu Yun Li School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory for Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Virtualization technologies provide solutions for cloud computing. Virtual resource scheduling is a crucial task in data centers, and the power consumption of virtual resources is a critical foundation of virtualization scheduling. Containers are the smallest unit of virtual resource scheduling and migration. Although many practical models for estimating the power consumption of virtual machines (VMs) have been proposed, few power estimation models of containers have been put forth. In this article, we propose a fast-training piecewise regression model based on a decision tree for VM power metering and estimate the power of containers configured on the VM by treating the container as a group of processes on the VM. We select appropriate features from the collected metrics of VMs/containers to help our model fit the nonlinear relationship between power and features well. Besides, we optimize the leaf nodes of the regression tree, realizing the effective power metering of virtualization environments. We evaluate the proposed model on 13 tasks in PARSEC and compare it with several commonly used models in data centers. The experimental results prove the effectiveness of the proposed model, and the estimated power of containers is in line with expectations.

关键词： Containers data centers Power demand Estimation data models Virtualization Servers

Implementation and performance op timization of dynamic random forest

学校读者我要写书评

暂无评论

Implementation and performance op timization of dynamic rand...

第九届网络分布式计算与知识发现国际会议( 2017 International Conference on Cyber-enabled distributed computing and knowledge discovery)

作者： Xiaolong Xu Wen Chen School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and

Bernard combines the weight updating of the boosting algorithm with the Random Forest(RF),and proposes a new RF induction algorithm called Dynamic Random Forest(DRF).The idea with DRF is to grow only trees that would fit the sub-forest already built,use the existing forest to update the weight of each randomly selected training instance,force the next tree to pay attention to those samples that can not be classified well by the current forest,thus improving the RF ***,this weight updating method is still flawed,which does not make a good distinction between the samples classified correctly and the samples classified wrongly by the current *** this paper,we implement the DRF algorithm,and propose a new weight update method,that is,giving higher weight to the samples classified wrongly by the current forest,giving lower weight to the samples classified correctly by the current forest,so that the next tree will be more concerned with those misclassified *** results show that our method is better than DRF algorithm and traditional RF algorithm.

关键词： Random forest Boosting Dynamic random forest Weight updating

SCALABLE ATTRIBUTION OF ADVERSARIAL ATTACKS VIA MULTI-TASK LEARNING

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Guo, Zhongyi Han, Keji Ge, Yao Ji, Wei Li, Yun Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

Deep neural networks (DNNs) can be easily fooled by adversarial attacks during inference phase when attackers add imperceptible perturbations to original examples, i.e., adversarial examples. Many works focus on adversarial detection and adversarial training to defend against adversarial attacks. However, few works explore the tool-chains behind adversarial examples, which can help defenders to seize the clues about the originator of the attack, their goals, and provide insight into the most effective defense algorithm against corresponding attacks. With such a gap, it is necessary to develop techniques that can recognize tool-chains that are leveraged to generate the adversarial examples, which is called Adversarial Attribution Problem (AAP). In this paper, AAP is defined as the recognition of three signatures, i.e., attack algorithm, victim model and hyperparameter. Current works transfer AAP into single label classification task and ignore the relationship between these signatures. The former will meet combination explosion problem as the number of signatures is increasing. The latter dictates that we cannot treat AAP simply as a single task problem. We first conduct some experiments to validate the attributability of adversarial examples. Furthermore, we propose a multi-task learning framework named Multi-Task Adversarial Attribution (MTAA) to recognize the three signatures simultaneously. MTAA contains perturbation extraction module, adversarial-only extraction module and classification and regression module. It takes the relationship between attack algorithm and corresponding hyperparameter into account and uses the uncertainty weighted loss to adjust the weights of three recognition tasks. The experimental results on MNIST and ImageNet show the feasibility and scalability of the proposed framework as well as its effectiveness in dealing with false alarms. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

Particle filtering methods for stochastic optimization with application to large-scale empirical risk minimization

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Liu, Bin School of Computer Science Nanjing University of Posts and Telecommunications Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing Jiangsu210023 China

There is a recent interest in developing statistical filtering methods for stochastic optimization (FSO) by leveraging a probabilistic perspective of incremental proximity methods (IPMs). The existent FSO methods are derived based on the Kalman filter (KF) and extended KF (EKF). Different from classical stochastic optimization methods such as the stochastic gradient descent (SGD) and typical IPMs, such KF-type algorithms possess a desirable property, namely they do not require pre-scheduling of the learning rate for convergence. However, on the other side, they have inherent limitations inherited from the nature of KF mechanisms. It is a consensus that the class of particle filters (PFs) outperforms the KF and its variants remarkably for nonlinear and/or non-Gaussian statistical filtering tasks. Hence, it is natural to ask if the FSO methods can benefit from the PF theory to get around of limitations of the KF-type stochastic optimization methods. We provide an affirmative answer to the aforementioned question by developing two PF based stochastic optimizers (PFSOs). For performance evaluation, we apply them to address nonlinear least-square fitting using simulated data sets and empirical risk minimization for binary classification using real data sets. Experimental results demonstrate that PFSOs outperform remarkably existent methods in terms of numerical stability, convergence speed, and flexibility in handling different types of loss functions. Copyright © 2018, The Authors. All rights reserved.

关键词： Monte Carlo methods

Robust Particle Filtering via Bayesian Nonparametric Outlier Modeling

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Liu, Bin School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

This paper is concerned with the online estimation of a nonlinear dynamic system from a series of noisy measurements. The focus is on cases wherein outliers are present in-between normal noises. We assume that the outliers follow an unknown generating mechanism which deviates from that of normal noises, and then model the outliers using a Bayesian nonparametric model called Dirichlet process mixture (DPM). A sequential particle-based algorithm is derived for posterior inference for the outlier model as well as the state of the system to be estimated. The resulting algorithm is termed DPM based robust PF (DPM-RPF). The nonparametric feature makes this algorithm allow the data to "speak for itself" to determine the complexity and structure of the outlier model. Simulation results show that it performs remarkably better than two state-of-the-art methods especially when outliers appear frequently along time. Copyright © 2018, The Authors. All rights reserved.

关键词： Statistics

Harnessing Low-Fidelity data to Accelerate Bayesian Optimization via Posterior Regularization

学校读者我要写书评

暂无评论

Harnessing Low-Fidelity Data to Accelerate Bayesian Optimiza...

International Conference on big data and Smart Computing (bigCOMP)

作者： Bin Liu School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9781728160344

ISBN: (纸本)9781728160351

Bayesian optimization (BO) is a powerful paradigm for derivative-free global optimization of a black-box objective function (BOF) that is expensive to evaluate. However, the overhead of BO can still be prohibitive for problems with highly expensive function evaluations. In this paper, we investigate how to reduce the required number of function evaluations for BO without compromise in solution quality. We explore the idea of posterior regularization to harness low fidelity (LF) data within the Gaussian process upper confidence bound (GP-UCB) framework. The LF data can arise from previous evaluations of an LF approximation of the BOF or a related optimization task. An extra GP model called LF-GP is trained to fit the LF data. We develop an operator termed dynamic weighted product of experts (DW-POE) fusion. The regularization is induced by this operator on the posterior of the BOF. The impact of the LF GP model on the resulting regularized posterior is adaptively adjusted via Bayesian formalism. Extensive experimental results on benchmark BOF optimization tasks demonstrate the superior performance of the proposed algorithm over state-of-the-art.

关键词： Optimization Hafnium Adaptation models Bayes methods Heuristic algorithms data models Acceleration

Harnessing low-fidelity data to accelerate Bayesian optimization via posterior regularization

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liu, Bin School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

关键词： Function evaluation

Robust Particle Filtering via Bayesian Nonparametric Outlier Modeling (Poster)

学校读者我要写书评

暂无评论

Robust Particle Filtering via Bayesian Nonparametric Outlier...

International Conference on Information Fusion

作者： Bin Liu School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9780996452786

ISBN: (纸本)9781728118406

This paper is concerned with the online estimation of a nonlinear dynamic system from a series of noisy measurements. The focus is on cases wherein outliers are present in-between normal noises. We assume that the outliers follow an unknown generating mechanism which deviates from that of normal noises, and then model the outliers using a Bayesian nonparametric model called Dirichlet process mixture (DPM). A sequential particle-based algorithm is derived for posterior inference for the outlier model as well as the state of the system to be estimated. The resulting algorithm is termed DPM based robust PF (DPM-RPF). The nonparametric feature makes this algorithm allow the data to “speak for itself” to determine the complexity and structure of the outlier model. Simulation results show that it performs remarkably better than two state-of-the-art methods especially when outliers appear frequently along time.

关键词： Noise measurement Inference algorithms Bayes methods Computational modeling Atmospheric measurements Particle measurements Pollution measurement

LogPal: A Generic Anomaly Detection Scheme of Heterogeneous Logs for Network Systems

学校读者我要写书评

暂无评论

security and Communication Networks 2023年第1期2023卷

作者： Sun, Lei Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China

As a key resource for diagnosing and identifying problems, network syslog contains vast quantities of information. And it is the main source of data for anomaly detection of systems. Syslog presents the characteristics of large scale, diverse types and sources, data noise, and quick evolvement, which makes the detection methods not generic enough. To effectively address problem of log anomaly labelling caused by massive heterogeneous logs, we propose LogPal, a generic anomaly detection scheme of heterogeneous logs for network systems, which innovatively combines template sequences and raw log sequences to construct and generate log pattern events. By improving the self-attention mechanism of transformer, LogPal proactively synthesizes self-attention and handles log pattern events in a unique way. The model can make full use of log template and sequence semantic information, by automatically becoming aware of the pattern of logs. We implemented experiments to evaluate the performance of LogPal on publicly available datasets, and the outcome of the experiments shows that LogPal automatically adapts to log type changes and improves precision, recall, and F1 score to 99% on publicly available datasets. © 2023 Lei Sun and Xiaolong Xu.

关键词： Anomaly detection