We propose a new way of investigating phase transitions in the context of information theory. We use an information-entropic measure of spatial complexity known as configurational entropy (CE) to quantify both the storage and exchange of information in a lattice simulation of a Ginzburg-Landau model with a scalar order parameter coupled to a heat bath. The CE is built from the Fourier spectrum ...

A method is described for the efficient estimation of small overflow probabilities in nonMarkovian queueing network models. The method uses importance sampling with a state-dependent change of measure, which is determined adaptively using the cross-entropy method, thus avoiding the need for a detailed mathematical analysis. Experiments show that the use of rescheduling is needed in order to get...

Bài viết trình bày một số hạn chế của phương pháp mô phỏng Monte Carlo cơ bản (Monte Naïve - MCN). Phương này được sử dụng để ước lượng xác suất sự kiện hiếm (các có xảy ra rất bé). Trong MCN, thể quan sát những cần phải khởi tạo các mẫu kích thước lớn. Hạn giải quyết bằng cách thuật toán Entropy chéo (Cross CE). Kết quả áp ở phần cuối cùng sẽ làm rõ hơn tính ưu việt này.

We build a general and highly applicable clustering theory, which we call cross-entropy clustering (shortly CEC) which joins advantages of classical kmeans (easy implementation and speed) with those of EM (affine invariance and ability to adapt to clusters of desired shapes). Moreover, contrary to k-means and EM, CEC finds the optimal number of clusters by automatically removing groups which ca...

Intrusion Detection System (IDS) typically generates a huge number of alerts with high false rate, especially in the large scale network, which result in a huge challenge on the efficiency and accuracy of the network attack detection. In this paper, an entropy-based method is proposed to analyze the numerous IDS alerts and detect real network attacks. We use Shannon entropy to examine the distr...

Previous works have extensively studied the transferability of adversarial samples in untargeted black-box scenarios. However, it still remains challenging to craft targeted examples with higher than non-targeted ones. Recent studies reveal that traditional Cross-Entropy (CE) loss function is insufficient learn transferable due issue vanishing gradient. In this work, we provide a comprehensive ...

Replay is an important technique in program analysis, allowing to reproduce bugs, to track changes, and to repeat executions for better understanding of the results. Unfortunately, since re-executing a concurrent program does not necessarily produce the same ordering of events, replay of such programs becomes a dif cult task. The most common approach to replay of concurrent programs is based on...

Weight aggregation is the key process to solve a multiple-attribute group decision-making (MAGDM) problem. This paper is trying to propose a possible approach to objectivize subjective information and to aggregate information from attribute values themselves and decision-makers’ judgment. An MAGDM problem without information about decision-makers’ and attributes’ weight is considered. In order ...