Search

In various applications, multiscale entropy (MSE) is often used as a feature to characterize the complexity of the signals in order to classify them. It consists of estimating the sample entropies (SEs) of the signal under study and its coarse-grained (CG) versions, where the CG process amounts to (1) filtering the signal with an average filter whose order is the scale and (2) decimating the filter output by a factor equal to the scale. In this paper, we propose to derive a new variant of the MSE. Its novelty stands in the way to get the sequences at different scales by avoiding distortions during the decimation step. To this end, a linear-phase or null-phase low-pass filter whose cutoff frequency is well suited to the scale is used. Interpretations on how the MSE behaves and illustrations with a sum of sinusoids, as well as white and pink noises, are given. Then, an application to detect attentional tunneling is presented. It shows the benefit of the new approach in terms of p value when one aims at differentiating the set of MSEs obtained in the attentional tunneling state from the set of MSEs obtained in the nominal state. It should be noted that CG versions can be replaced not only for the MSE but also for other variants. [ABSTRACT FROM AUTHOR]

The paper addresses the problem of distinguishing the leading agents in the group. The problem is considered in the framework of classification problems, where the agents in the group select the items with respect to certain properties. The suggested method of distinguishing the leading agents utilizes the connectivity between the agents and the Rokhlin distance between the subgroups of the agents. The method is illustrated by numerical examples. The method can be useful in considering the division of labor in swarm dynamics and in the analysis of the data fusion in the tasks based on the wisdom of the crowd techniques. [ABSTRACT FROM AUTHOR]

In the signal analysis context, the entropy concept can characterize signal properties for detecting anomalies or non-representative behaviors in fiscal systems. In motor fault detection theory, entropy can measure disorder or uncertainty, aiding in detecting and classifying faults or abnormal operation conditions. This is especially relevant in industrial processes, where early motor fault detection can prevent progressive damage, operational interruptions, or potentially dangerous situations. The study of motor fault detection based on entropy theory holds significant academic relevance too, effectively bridging theoretical frameworks with industrial exigencies. As industrial sectors progress, applying entropy-based methodologies becomes indispensable for ensuring machinery integrity based on control and monitoring systems. This academic endeavor enhances the understanding of signal processing methodologies and accelerates progress in artificial intelligence and other modern knowledge areas. A wide variety of entropy-based methods have been employed for motor fault detection. This process involves assessing the complexity of measured signals from electrical motors, such as vibrations or stator currents, to form feature vectors. These vectors are then fed into artificial-intelligence-based classifiers to distinguish between healthy and faulty motor signals. This paper discusses some recent references to entropy methods and a summary of the most relevant results reported for fault detection over the last 10 years. [ABSTRACT FROM AUTHOR]

Ludwig Boltzmann's move in his seminal paper of 1877, introducing a statistical understanding of entropy, was a watershed moment in the history of physics. The work not only introduced quantization and provided a new understanding of entropy, it challenged the understanding of what a law of nature could be. Traditionally, nomological necessity, that is, specifying the way in which a system must develop, was considered an essential element of proposed physical laws. Yet, here was a new understanding of the Second Law of Thermodynamics that no longer possessed this property. While it was a new direction in physics, in other important scientific discourses of that time—specifically Huttonian geology and Darwinian evolution, similar approaches were taken in which a system's development followed principles, but did so in a way that both provided a direction of time and allowed for non-deterministic, though rule-based, time evolution. Boltzmann referred to both of these theories, especially the work of Darwin, frequently. The possibility that Darwin influenced Boltzmann's thought in physics can be seen as being supported by Boltzmann's later writings. [ABSTRACT FROM AUTHOR]

With the deepening of the diversification and openness of financial systems, financial vulnerability, as an endogenous attribute of financial systems, becomes an important measurement of financial security. Based on a network analysis, we introduce a network curvature indicator improved by Copula entropy as an innovative metric of financial vulnerability. Compared with the previous network curvature analysis method, the CE-based curvature proposed in this paper can measure market vulnerability and systematic risk with significant advantages. [ABSTRACT FROM AUTHOR]

It is known that Kaniadakis entropy, a generalization of the Shannon–Boltzmann–Gibbs entropic form, is always super-additive for any bipartite statistically independent distributions. In this paper, we show that when imposing a suitable constraint, there exist classes of maximal entropy distributions labeled by a positive real number ℵ > 0 that makes Kaniadakis entropy multi-additive, i.e., S κ [ p A ∪ B ] = (1 + ℵ) S κ [ p A ] + S κ [ p B ] , under the composition of two statistically independent and identically distributed distributions p A ∪ B (x , y) = p A (x) p B (y) , with reduced distributions p A (x) and p B (y) belonging to the same class. [ABSTRACT FROM AUTHOR]

Over the last two decades, topological data analysis (TDA) has emerged as a very powerful data analytic approach that can deal with various data modalities of varying complexities. One of the most commonly used tools in TDA is persistent homology (PH), which can extract topological properties from data at various scales. The aim of this article is to introduce TDA concepts to a statistical audience and provide an approach to analyzing multivariate time series data. The application's focus will be on multivariate brain signals and brain connectivity networks. Finally, this paper concludes with an overview of some open problems and potential application of TDA to modeling directionality in a brain network, as well as the casting of TDA in the context of mixed effect models to capture variations in the topological properties of data collected from multiple subjects. [ABSTRACT FROM AUTHOR]

The real-time diagnostic monitoring of self-priming centrifugal pumps is essential to ensure their safe operation. Nevertheless, owing to the intricate structure and complex operational conditions inherent in such pumps, existing fault diagnosis methods encounter challenges in effectively extracting crucial fault feature information and accurately identifying fault types. Consequently, this paper introduces an intelligent fault diagnosis method tailored for self-priming centrifugal pumps. The approach amalgamates refined time-shift multiscale fluctuation dispersion entropy, cosine pairwise-constrained supervised manifold mapping, and adaptive chaotic Aquila optimization support vector machine techniques. To begin with, refined time-shift multiscale fluctuation dispersion entropy is employed to extract fault-related features, adeptly mitigating concerns related to entropy domain deviations and instability. Subsequently, the application of cosine pairwise-constrained supervised manifold mapping serves to reduce the dimensionality of the extracted fault features, thereby bolstering the efficiency and precision of the ensuing identification process. Ultimately, the utilization of an adaptive chaotic Aquila optimization support vector machine facilitates intelligent fault classification, leading to enhanced accuracy in fault identification. The experimental findings unequivocally affirm the efficacy of the proposed method in accurately discerning among various fault types in self-priming centrifugal pumps, achieving an exceptional recognition rate of 100%. Moreover, it is noteworthy that the average correct recognition rate achieved by the proposed method surpasses that of five existing intelligent fault diagnosis techniques by a significant margin, registering a notable increase of 15.97%. [ABSTRACT FROM AUTHOR]

Seismic data have improved in quality and quantity over the past few decades, enabling better statistical analysis. Statistical physics has proposed new ways to deal with these data to focus the attention on specific matters. The present paper combines these two progressions to find indicators that can help in the definition of areas where seismic risk is developing. Our data comes from the IPOC catalog for 2007 to 2014. It covers the intense seismic activity near Iquique in Northern Chile during March/April 2014. Centered in these hypocenters we concentrate on the rectangle L a t − 22 − 18 and L o n − 68 − 72 and deepness between 5 and 70 km, where the major earthquakes originate. The analysis was performed using two complementary techniques: Tsallis entropy and mutability (dynamical entropy). Two possible forecasting indicators emerge: (1) Tsallis entropy (mutability) increases (decreases) broadly about two years before the main M W 8.1 earthquake. (2) Tsallis entropy (mutability) sharply decreases (increases) a few weeks before the M W 8.1 earthquake. The first one is about energy accumulation, and the second one is because of energy relaxation in the parallelepiped of interest. We discuss the implications of these behaviors and project them for possible future studies. [ABSTRACT FROM AUTHOR]

Simplicial distributions are combinatorial models describing distributions on spaces of measurements and outcomes that generalize nonsignaling distributions on contextuality scenarios. This paper studies simplicial distributions on two-dimensional measurement spaces by introducing new topological methods. Two key ingredients are a geometric interpretation of Fourier–Motzkin elimination and a technique based on the collapsing of measurement spaces. Using the first one, we provide a new proof of Fine's theorem characterizing noncontextual distributions in N-cycle scenarios. Our approach goes beyond these scenarios and can describe noncontextual distributions in scenarios obtained by gluing cycle scenarios of various sizes. The second technique is used for detecting contextual vertices and deriving new Bell inequalities. Combined with these methods, we explore a monoid structure on simplicial distributions. [ABSTRACT FROM AUTHOR]

In this article, we find some properties of certain types of entropies of a natural number. We are studying a way of measuring the "disorder" of the divisors of a natural number. We compare two of the entropies H and H ¯ defined for a natural number. An useful property of the Shannon entropy is the additivity, H S (pq) = H S (p) + H S (q) , where pq denotes tensor product, so we focus on its study in the case of numbers and ideals. We mention that only one of the two entropy functions discussed in this paper satisfies additivity, whereas the other does not. In addition, regarding the entropy H of a natural number, we generalize this notion for ideals, and we find some of its properties. [ABSTRACT FROM AUTHOR]

Based on the classical dynamical entropy, the channel coding theorem is investigated. Attempts to extend the dynamical entropy to quantum systems have been made by several researchers In 1999, Kossakowski, Ohya and I introduced the quantum dynamical entropy (KOW entropy) for completely positive maps containing an automorphism describing the time evolution. Its formulation used transition expectations and lifting in the sense of Accardi and Ohya and was studied as a measure of the complexity of quantum mechanical systems. This KOW entropy allowed the extension of generalized AF (Alicki and Fannes) entropy and generalized AOW (Accardi, Ohya and Watanabe) entropy. In addition, the S-Mixing entropy and S-mixing mutual-entropy were formulated by Ohya in 1985. Compound states are an important tool for formulating mutual entropy, and the complexity was constructed by the generalized AOW entropy. In this paper, the complexity associated with the entangled compound states in the C* dynamical system based on the generalized AOW entropy based on the KOW entropy is investigated to lay the foundation for the proof of the theorem of channel coding for quantum systems. We show that the fundamental inequalities of the mutual entropy are satisfied when the initial state is transmitted over the channel changes with time. [ABSTRACT FROM AUTHOR]

Optimal transport is a mathematical tool that has been a widely used to measure the distance between two probability distributions. To mitigate the cubic computational complexity of the vanilla formulation of the optimal transport problem, regularized optimal transport has received attention in recent years, which is a convex program to minimize the linear transport cost with an added convex regularizer. Sinkhorn optimal transport is the most prominent one regularized with negative Shannon entropy, leading to densely supported solutions, which are often undesirable in light of the interpretability of transport plans. In this paper, we report that a deformed entropy designed by q-algebra, a popular generalization of the standard algebra studied in Tsallis statistical mechanics, makes optimal transport solutions supported sparsely. This entropy with a deformation parameter q interpolates the negative Shannon entropy ( q = 1 ) and the squared 2-norm ( q = 0 ), and the solution becomes more sparse as q tends to zero. Our theoretical analysis reveals that a larger q leads to a faster convergence when optimized with the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm. In summary, the deformation induces a trade-off between the sparsity and convergence speed. [ABSTRACT FROM AUTHOR]

In this paper, we present the concept of the logical entropy of order m, logical mutual information, and the logical entropy for information sources. We found upper and lower bounds for the logical entropy of a random variable by using convex functions. We show that the logical entropy of the joint distributions X 1 and X 2 is always less than the sum of the logical entropy of the variables X 1 and X 2 . We define the logical Shannon entropy and logical metric permutation entropy to an information system and examine the properties of this kind of entropy. Finally, we examine the amount of the logical metric entropy and permutation logical entropy for maps. [ABSTRACT FROM AUTHOR]

In the paper, we consider local aspects of the entropy of nonautonomous dynamical systems. For this purpose, we introduce the notion of a (asymptotical) focal entropy point. The notion of entropy appeared as a result of practical needs concerning thermodynamics and the problem of information flow, and it is connected with the complexity of a system. The definition adopted in the paper specifies the notions that express the complexity of a system around certain points (the complexity of the system is the same as its complexity around these points), and moreover, the complexity of a system around such points does not depend on the behavior of the system in other parts of its domain. Any periodic system "acting" in the closed unit interval has an asymptotical focal entropy point, which justifies wide interest in these issues. In the paper, we examine the problems of the distortions of a system and the approximation of an autonomous system by a nonautonomous one, in the context of having a (asymptotical) focal entropy point. It is shown that even a slight modification of a system may lead to the arising of the respective focal entropy points. [ABSTRACT FROM AUTHOR]

In this paper we consider the metric entropies of the maps of an iterated function system deduced from a black hole which are known the Bekenstein-Hawking entropies and its subleading corrections. More precisely, we consider the recent model of a Bohr-like black hole that has been recently analysed in some papers in the literature, obtaining the intriguing result that the metric entropies of a black hole are created by the metric entropies of the functions, created by the black hole principal quantum numbers, i.e., by the black hole quantum levels. We present a new type of topological entropy for general iterated function systems based on a new kind of the inverse of covers. Then the notion of metric entropy for an Iterated Function System (IFS) is considered, and we prove that these definitions for topological entropy of IFS's are equivalent. It is shown that this kind of topological entropy keeps some properties which are hold by the classic definition of topological entropy for a continuous map. We also consider average entropy as another type of topological entropy for an IFS which is based on the topological entropies of its elements and it is also an invariant object under topological conjugacy. The relation between Axiom A and the average entropy is investigated. [ABSTRACT FROM AUTHOR]

This paper considers the consensus problem of nonlinear multi-agent systems under switching directed topologies. Specifically, the dynamics of each agent incorporates an intrinsic nonlinear term and the interaction topology may not contain a spanning tree at any time. By designing a state-controlled switching law, we show that the multi-agent system with the neighbor-based protocol can achieve consensus if the switching topologies jointly contain a spanning tree. Moreover, an easily manageable algebraic criterion is deduced to unravel the underlying mechanisms in reaching consensus. Finally, a numerical example is exploited to illustrate the effectiveness of the developed theoretical results. [ABSTRACT FROM AUTHOR]

This paper introduces a new simple system with a butterfly chaotic attractor. This system has rich and complex dynamics. With some typical parameters, its Lyapunov dimension is greater than other known three dimensional chaotic systems. It exhibits chaotic behavior over a large range of parameters, and the divergence of flow of this system is not a constant. The dynamics of this new system are analyzed via Lyapunov exponent spectrum, bifurcation diagrams, phase portraits and the Poincaré map. The compound structures of this new system are also analyzed. By means of topological horseshoe theory and numerical computation, the Poincaré map defined for the system is proved to be semi-conjugate to 3-shift map, and thus the system has positive topological entropy. [ABSTRACT FROM AUTHOR]

In this paper, we study Amari's natural gradient flows of real functions defined on the densities belonging to an exponential family on a finite sample space. Our main example is the minimization of the expected value of a real function defined on the sample space. In such a case, the natural gradient flow converges to densities with reduced support that belong to the border of the exponential family. We have suggested in previous works to use the natural gradient evaluated in the mixture geometry. Here, we show that in some cases, the differential equation can be extended to a bigger domain in such a way that the densities at the border of the exponential family are actually internal points in the extended problem. The extension is based on the algebraic concept of an exponential variety. We study in full detail a toy example and obtain positive partial results in the important case of a binary sample space. [ABSTRACT FROM AUTHOR]

A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore, it simplifies a previous algorithm, also based on min-max symbols, which was originally proposed for twice differentiable multimodal maps. The new algorithm has been benchmarked against the old one with a number of multimodal maps, the results being reported in the paper. The comparison is favorable to the new algorithm, except in the unimodal case. [ABSTRACT FROM AUTHOR]

Due to their growing number and increasing autonomy, drones and drone swarms are equipped with sophisticated algorithms that help them achieve mission objectives. Such algorithms vary in their quality such that their comparison requires a metric that would allow for their correct assessment. The novelty of this paper lies in analysing, defining and applying the construct of cross-entropy, known from thermodynamics and information theory, to swarms. It can be used as a synthetic measure of the robustness of algorithms that can control swarms in the case of obstacles and unforeseen problems. Based on this, robustness may be an important aspect of the overall quality. This paper presents the necessary formalisation and applies it to a few examples, based on generalised unexpected behaviour and the results of collision avoidance algorithms used to react to obstacles. [ABSTRACT FROM AUTHOR]

Different authors have shown strong relationships between ordinal pattern based entropies and the Kolmogorov–Sinai entropy, including equality of the latter one and the permutation entropy, the whole picture is however far from being complete. This paper is updating the picture by summarizing some results and discussing some mainly combinatorial aspects behind the dependence of Kolmogorov–Sinai entropy from ordinal pattern distributions on a theoretical level. The paper is more than a review paper. A new statement concerning the conditional permutation entropy will be given as well as a new proof for the fact that the permutation entropy is an upper bound for the Kolmogorov–Sinai entropy. As a main result, general conditions for the permutation entropy being a lower bound for the Kolmogorov–Sinai entropy will be stated. Additionally, a previously introduced method to analyze the relationship between permutation and Kolmogorov–Sinai entropies as well as its limitations will be investigated. [ABSTRACT FROM AUTHOR]

The aim of this paper is to show that α -limit sets in Lorenz maps do not have to be completely invariant. This highlights unexpected dynamical behavior in these maps, showing gaps existing in the literature. Similar result is obtained for unimodal maps on [ 0 , 1 ] . On the basis of provided examples, we also present how the performed study on the structure of α -limit sets is closely connected with the calculation of the topological entropy. [ABSTRACT FROM AUTHOR]

The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one way or another on complex analysis. Our proof is based on tools and algorithms previously developed by the authors and collaborators to compute the topological entropy of multimodal maps. Specifically, we use the number of transverse intersections of the map iterations with the so-called critical line. The approach is technically simple and geometrical. The same approach is also used to briefly revisit the superstable cycles of the quadratic maps, since both topics are closely related. [ABSTRACT FROM AUTHOR]

Rényi entropy as a generalization of the Shannon entropy allows for different averaging of probabilities of a control parameter α. This paper gives a new perspective of the Kalman filter from the Rényi entropy. Firstly, the Rényi entropy is employed to measure the uncertainty of the multivariate Gaussian probability density function. Then, we calculate the temporal derivative of the Rényi entropy of the Kalman filter's mean square error matrix, which will be minimized to obtain the Kalman filter's gain. Moreover, the continuous Kalman filter approaches a steady state when the temporal derivative of the Rényi entropy is equal to zero, which means that the Rényi entropy will keep stable. As the temporal derivative of the Rényi entropy is independent of parameter α and is the same as the temporal derivative of the Shannon entropy, the result is the same as for Shannon entropy. Finally, an example of an experiment of falling body tracking by radar using an unscented Kalman filter (UKF) in noisy conditions and a loosely coupled navigation experiment are performed to demonstrate the effectiveness of the conclusion. [ABSTRACT FROM AUTHOR]

The portfolio optimization problem generally refers to creating an investment portfolio or asset allocation that achieves an optimal balance of expected risk and return. These portfolio returns are traditionally assumed to be continuous random variables. In An Entropy-Based Approach to Portfolio Optimization, we introduced a novel non-parametric optimization method based on Shannon entropy, called return-entropy portfolio optimization (REPO), which offers a simple and fast optimization algorithm for assets with continuous returns. Here, in this paper, we would like to extend the REPO approach to the optimization problem for assets with discrete distributed returns, such as those from a Bernoulli distribution like binary options. Under a discrete probability distribution, portfolios of binary options can be viewed as repeated short-term investments with an optimal buy/sell strategy or general betting strategy. Upon the outcome of each contract, the portfolio incurs a profit (success) or loss (failure). This is similar to a series of gambling wagers. Portfolio selection under this setting can be formulated as a new optimization problem called discrete entropic portfolio optimization (DEPO). DEPO creates optimal portfolios for discrete return assets based on expected growth rate and relative entropy. We show how a portfolio of binary options provides an ideal general setting for this kind of portfolio selection. As an example we apply DEPO to a portfolio of short-term foreign exchange currency pair binary options from the NADEX exchange platform and show how it outperforms leading Kelly criterion strategies. We also provide an additional example of a gambling application using a portfolio of sports bets over the course of an NFL season and present the advantages of DEPO over competing Kelly criterion strategies. [ABSTRACT FROM AUTHOR]

This paper studies the representation of a general epidemic model by means of a first-order differential equation with a time-varying log-normal type coefficient. Then the generalization of the first-order differential system to epidemic models with more subpopulations is focused on by introducing the inter-subpopulations dynamics couplings and the control interventions information through the mentioned time-varying coefficient which drives the basic differential equation model. It is considered a relevant tool the control intervention of the infection along its transient to fight more efficiently against a potential initial exploding transmission. The study is based on the fact that the disease-free and endemic equilibrium points and their stability properties depend on the concrete parameterization while they admit a certain design monitoring by the choice of the control and treatment gains and the use of feedback information in the corresponding control interventions. Therefore, special attention is paid to the evolution transients of the infection curve, rather than to the equilibrium points, in terms of the time instants of its first relative maximum towards its previous inflection time instant. Such relevant time instants are evaluated via the calculation of an "ad hoc" Shannon's entropy. Analytical and numerical examples are included in the study in order to evaluate the study and its conclusions. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to elucidate the interrelations between three essentially different concepts: solenoids, topological entropy, and Hausdorff dimension. For this purpose, we describe the dynamics of a solenoid by topological entropy-like quantities and investigate the relations between them. For L-Lipschitz solenoids and locally λ — expanding solenoids, we show that the topological entropy and fractal dimensions are closely related. For a locally λ — expanding solenoid, we prove that its topological entropy is lower estimated by the Hausdorff dimension of X multiplied by the logarithm of λ . [ABSTRACT FROM AUTHOR]

This paper presents an improved method of applying entropy as a risk in portfolio optimization. A new family of portfolio optimization problems called the return-entropy portfolio optimization (REPO) is introduced that simplifies the computation of portfolio entropy using a combinatorial approach. REPO addresses five main practical concerns with the mean-variance portfolio optimization (MVPO). Pioneered by Harry Markowitz, MVPO revolutionized the financial industry as the first formal mathematical approach to risk-averse investing. REPO uses a mean-entropy objective function instead of the mean-variance objective function used in MVPO. REPO also simplifies the portfolio entropy calculation by utilizing combinatorial generating functions in the optimization objective function. REPO and MVPO were compared by emulating competing portfolios over historical data and REPO significantly outperformed MVPO in a strong majority of cases. [ABSTRACT FROM AUTHOR]

An investigation of diseases using magnetic resonance (MR) imaging requires automatic image quality assessment methods able to exclude low-quality scans. Such methods can be also employed for an optimization of parameters of imaging systems or evaluation of image processing algorithms. Therefore, in this paper, a novel blind image quality assessment (BIQA) method for the evaluation of MR images is introduced. It is observed that the result of filtering using non-maximum suppression (NMS) strongly depends on the perceptual quality of an input image. Hence, in the method, the image is first processed by the NMS with various levels of acceptable local intensity difference. Then, the quality is efficiently expressed by the entropy of a sequence of extrema numbers obtained with the thresholded NMS. The proposed BIQA approach is compared with ten state-of-the-art techniques on a dataset containing MR images and subjective scores provided by 31 experienced radiologists. The Pearson, Spearman, Kendall correlation coefficients and root mean square error for the method assessing images in the dataset were 0.6741, 0.3540, 0.2428, and 0.5375, respectively. The extensive experimental evaluation of the BIQA methods reveals that the introduced measure outperforms related techniques by a large margin as it correlates better with human scores. [ABSTRACT FROM AUTHOR]

In this paper, we propose an intrusion detection system based on the estimation of the Rényi entropy with multiple orders. The Rényi entropy is a generalized notion of entropy that includes the Shannon entropy and the min-entropy as special cases. In 2018, Kim proposed an efficient estimation method for the Rényi entropy with an arbitrary real order α. In this work, we utilize this method to construct a multiple order, Rényi entropy based intrusion detection system (IDS) for vehicular systems with various network connections. The proposed method estimates the Rényi entropies simultaneously with three distinct orders, two, three, and four, based on the controller area network (CAN)-IDs of consecutively generated frames. The collected frames are split into blocks with a fixed number of frames, and the entropies are evaluated based on these blocks. For a more accurate estimation against each type of attack, we also propose a retrospective sliding window method for decision of attacks based on the estimated entropies. For fair comparison, we utilized the CAN-ID attack data set generated by a research team from Korea University. Our results show that the proposed method can show the false negative and positive errors of less than 1% simultaneously. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new general family of distributions obtained by a subtle combination of two well-established families of distributions: the so-called power Topp–Leone-G and inverse exponential-G families. Its definition is centered around an original cumulative distribution function involving exponential and polynomial functions. Some desirable theoretical properties of the new family are discussed in full generality, with comprehensive results on stochastic ordering, quantile function and related measures, general moments and related measures, and the Shannon entropy. Then, a statistical parametric model is constructed from a special member of the family, defined with the use of the inverse Lomax distribution as the baseline distribution. The maximum likelihood method was applied to estimate the unknown model parameters. From the general theory of this method, the asymptotic confidence intervals of these parameters were deduced. A simulation study was conducted to evaluate the numerical behavior of the estimates we obtained. Finally, in order to highlight the practical perspectives of the new family, two real-life data sets were analyzed. All the measures considered are favorable to the new model in comparison to four serious competitors. [ABSTRACT FROM AUTHOR]

The development of new measures and algorithms to quantify the entropy or related concepts of a data series is a continuous effort that has brought many innovations in this regard in recent years. The ultimate goal is usually to find new methods with a higher discriminating power, more efficient, more robust to noise and artifacts, less dependent on parameters or configurations, or any other possibly desirable feature. Among all these methods, Permutation Entropy (PE) is a complexity estimator for a time series that stands out due to its many strengths, with very few weaknesses. One of these weaknesses is the PE's disregarding of time series amplitude information. Some PE algorithm modifications have been proposed in order to introduce such information into the calculations. We propose in this paper a new method, Slope Entropy (SlopEn), that also addresses this flaw but in a different way, keeping the symbolic representation of subsequences using a novel encoding method based on the slope generated by two consecutive data samples. By means of a thorough and extensive set of comparative experiments with PE and Sample Entropy (SampEn), we demonstrate that SlopEn is a very promising method with clearly a better time series classification performance than those previous methods. [ABSTRACT FROM AUTHOR]

For Dempster–Shafer evidence theory, how to measure the uncertainty of basic probability assignment (BPA) is still an open question. Deng entropy is one of the methods for measuring the uncertainty of Dempster–Shafer evidence. Recently, some limitations of Deng entropy theory are found. For overcoming these limitations, some modified theories are given based on Deng entropy. However, only one special situation is considered in each theory method. In this paper, a unified form of the belief entropy is proposed on the basis of Deng entropy. In the new proposed method, the scale of the frame of discernment (FOD) and the relative scale of a focal element with reference to FOD are considered. Meanwhile, for an example, some properties of the belief entropy are obtained based on a special situation of a unified form. Some numerical examples are illustrated to show the efficiency and accuracy of the proposed belief entropy. [ABSTRACT FROM AUTHOR]

A rigorous dynamical systems-based hierarchy is established for the definitions of entropy of Shannon (information), Kolmogorov–Sinai (metric) and Adler, Konheim & McAndrew (topological). In particular, metric entropy, with the imposition of some additional properties, is proven to be a special case of topological entropy and Shannon entropy is shown to be a particular form of metric entropy. This is the first of two papers aimed at establishing a dynamically grounded hierarchy comprising Clausius, Boltzmann, Gibbs, Shannon, metric and topological entropy in which each element is ideally a special case of its successor or some kind of limit thereof. [ABSTRACT FROM AUTHOR]

It is often the case when studying complex dynamical systems that a statistical formulation can provide the greatest insight into the underlying dynamics. When discussing the behavior of such a system which is evolving in time, it is useful to have the notion of a metric between two given states. A popular measure of information change in a system under perturbation has been the relative entropy of the states, as this notion allows us to quantify the difference between states of a system at different times. In this paper, we investigate the relaxation problem given by a single and coupled Ornstein–Uhlenbeck (O-U) process and compare the information length with entropy-based metrics (relative entropy, Jensen divergence) as well as others. By measuring the total information length in the long time limit, we show that it is only the information length that preserves the linear geometry of the O-U process. In the coupled O-U process, the information length is shown to be capable of detecting changes in both components of the system even when other metrics would detect almost nothing in one of the components. We show in detail that the information length is sensitive to the evolution of subsystems. [ABSTRACT FROM AUTHOR]

In this discussion paper we argue that category theory may play a useful role in formulating, and perhaps proving, results in ergodic theory, topogical dynamics and open systems theory (control theory). As examples, we show how to characterize Kolmogorov–Sinai, Shannon entropy and topological entropy as the unique functors to the nonnegative reals satisfying some natural conditions. We also provide a purely categorical proof of the existence of the maximal equicontinuous factor in topological dynamics. We then show how to define open systems (that can interact with their environment), interconnect them, and define control problems for them in a unified way. [ABSTRACT FROM AUTHOR]

In the context of state estimation under communication constraints, several notions of dynamical entropy play a fundamental role, among them: topological entropy and restoration entropy. In this paper, we present a theorem that demonstrates that for most dynamical systems, restoration entropy strictly exceeds topological entropy. This implies that robust estimation policies in general require a higher rate of data transmission than non-robust ones. The proof of our theorem is quite short, but uses sophisticated tools from the theory of smooth dynamical systems. [ABSTRACT FROM AUTHOR]