This article analyzes the completion time of a job running on a virtualized server subject to software aging and rejuvenation in a virtual machine monitor (VMM). A job running on the server may be interrupted by virtu...
详细信息
Anomaly detection algorithms face several challenges including computational complexity and resiliency to noise in input data. In this paper, we propose a fast and noise-resilient cluster-based anomaly detection metho...
详细信息
Anomaly detection algorithms face several challenges including computational complexity and resiliency to noise in input data. In this paper, we propose a fast and noise-resilient cluster-based anomaly detection method using collective labelling approach. In the proposed Collective Probabilistic Anomaly Detection method, first instead of labelling each new sample (as normal or anomaly) individually, the new samples are clustered, then labelled. This collective labelling mitigates the negative impact of noise by relying on group behaviour rather than individual characteristics of incoming samples. Second, since grouping and labelling new samples may be time-consuming, we summarize clusters using Gaussian Mixture Model (GMM). Not only does GMM offer faster processing speed; it also facilitates summarizing clusters with arbitrary shape, and consequently, reducing the memory space requirement. Finally, a modified distance measure, based on Kullback-Liebner method, is proposed to calculate the similarity among clusters represented by GMMs. We evaluate the proposed method on various datasets by measuring its false alarm rate, detection rate and memory requirement. We also add different levels of noise to the input datasets to demonstrate the performance of the proposed collective anomaly detection method in the presence of noise. The experimental results confirm superior performance of the proposed method compared to individually-based labelling techniques in terms of memory usage, detection rate and false alarm rate.
The finger print recognition, face recognition, hand geometry, iris recognition, voice scan, signature, retina scan and several other biometric patterns are being used for recognition of an individual. Human footprint...
详细信息
The finger print recognition, face recognition, hand geometry, iris recognition, voice scan, signature, retina scan and several other biometric patterns are being used for recognition of an individual. Human footprint is one of the relatively new physiological biometrics due to its stable and unique characteristics. The texture and foot shape information of footprint offers one of the powerful means in personal recognition. This work proposes a footprint based biometric identification of an individual by extracting texture and shape based features using Principal Component Analysis (PCA) and Independent Component Analysis (ICA) linear projection techniques. PCA is a commonly used technique for data classification and dimensionality reduction and ICA is one of the most widely used blind source separation technique for revealing hidden factors that underlie sets of random variables, measurements, or signals. In this study PCA and ICA have been compared for footprint recognition using distance classification techniques such as Euclidean distance, city block, cosine and correlation. Experimental results show that ICA performs better than PCA for footprint recognition.
In this work we address the Ev-SVM model proposed by Pérez-Cruz et al. as an extension of the traditional v support vector classification model (v-SVM). Through an enhancement of the range of admissible values fo...
详细信息
In this work we address the Ev-SVM model proposed by Pérez-Cruz et al. as an extension of the traditional v support vector classification model (v-SVM). Through an enhancement of the range of admissible values for the regularization parameter v, the Ev-SVM has been shown to be able to produce a wider variety of decision functions, giving rise to a better adaptability to the data. However, while a clear and intuitive geometric interpretation can be given for the v-SVM model as a nearest-point problem in reduced convex hulls (RCH-NPP), no previous work has been made in developing such intuition for the Ev-SVM model. In this paper we show how Ev-SVM can be reformulated as a geometrical problem that generalizes RCH-NPP, providing new insights into this model. Under this novel point of view, we propose the RapMinos algorithm, able to solve Ev-SVM more efficiently than the current methods. Furthermore, we show how RapMinos is able to address the Ev-SVM model for any choice of regularization norm lp ≥1 seamlessly, which further extends the SVM model flexibility beyond the usual Ev-SVM models.
Underpinning the above vision is the ability to target service content to users’ current context, e.g., their location, intent, environment, in real time. The contribution of this work is that it uses a pervasive com...
详细信息
Cloud attenuation is calculated from cloud liquid water content (LWC). Cloud liquid water content (LWC) is derived from the radiosonde data using the Salonen model, show a prominent linear variation with the attenuati...
详细信息
Monte Carlo Tree Search (MCTS) has improved the performance of game engines in domains such as Go, Hex, and general game playing. MCTS has been shown to outperform classic αβ search in games where good heuristic eva...
详细信息
Monte Carlo Tree Search (MCTS) has improved the performance of game engines in domains such as Go, Hex, and general game playing. MCTS has been shown to outperform classic αβ search in games where good heuristic evaluations are difficult to obtain. In recent years, combining ideas from traditional minimax search in MCTS has been shown to be advantageous in some domains, such as Lines of Action, Amazons, and Breakthrough. In this paper, we propose a new way to use heuristic evaluations to guide the MCTS search by storing the two sources of information, estimated win rates and heuristic evaluations, separately. Rather than using the heuristic evaluations to replace the playouts, our technique backs them up implicitly during the MCTS simulations. These minimax values are then used to guide future simulations. We show that using implicit minimax backups leads to stronger play performance in Kalah, Breakthrough, and Lines of Action.
暂无评论