Search

As such, entropy in an economic system is a sum of the entropy production in the system itself and the exchange of entropy with the environment. Entropy economics has also laid the groundwork for new avenues of economic research, such as econophysics, complexity economics, and quantum economics. The Role of Entropy in the Development of Economics [[2]] B Aleksander Jakimowicz b B I Entropy i 2020, 22(4), 452; b https://doi.org/10.3390/e22040452 Graph Economics and physics have been feeding into each other for at least 170 years. A new field of study has also appeared - thermoeconomics - which applies the analogues of thermodynamic entropy in economics, as best exemplified by money entropy. [Extracted from the article]

Vibration monitoring and analysis are important methods in wind turbine gearbox fault diagnosis, and determining how to extract fault characteristics from the vibration signal is of primary importance. This paper presents a fault diagnosis approach based on modified hierarchical fluctuation dispersion entropy of tan-sigmoid mapping (MHFDE_TANSIG) and northern goshawk optimization–support vector machine (NGO–SVM) for wind turbine gearboxes. The tan-sigmoid (TANSIG) mapping function replaces the normal cumulative distribution function (NCDF) of the hierarchical fluctuation dispersion entropy (HFDE) method. Additionally, the hierarchical decomposition of the HFDE method is improved, resulting in the proposed MHFDE_TANSIG method. The vibration signals of wind turbine gearboxes are analyzed using the MHFDE_TANSIG method to extract fault features. The constructed fault feature set is used to intelligently recognize and classify the fault type of the gearboxes with the NGO–SVM classifier. The fault diagnosis methods based on MHFDE_TANSIG and NGO–SVM are applied to the experimental data analysis of gearboxes with different operating conditions. The results show that the fault diagnosis model proposed in this paper has the best performance with an average accuracy rate of 97.25%. [ABSTRACT FROM AUTHOR]

Underwriters play a pivotal role in the IPO process. Information entropy, a tool for measuring the uncertainty and complexity of information, has been widely applied to various issues in complex networks. Information entropy can quantify the uncertainty and complexity of nodes in the network, providing a unique analytical perspective and methodological support for this study. This paper employs a bipartite network analysis method to construct the relationship network between underwriters and accounting firms, using the centrality of underwriters in the network as a measure of their influence to explore the impact of underwriters' influence on the distribution of interests and audit outcomes. The findings indicate that a more pronounced influence of underwriters significantly increases the ratio of underwriting fees to audit fees. Higher influence often accompanies an increase in abnormal underwriting fees. Further research reveals that companies underwritten by more influential underwriters experience a decline in audit quality. Finally, the study reveals that a well-structured audit committee governance and the rationalization of market sentiments can mitigate the negative impacts of underwriters' influence. The innovation of this paper is that it enriches the content related to underwriters by constructing the relationship network between underwriters and accounting firms for the first time using a bipartite network through the lens of information entropy. This conclusion provides new directions for thinking about the motives and possibilities behind financial institutions' cooperation, offering insights for market regulation and policy formulation. [ABSTRACT FROM AUTHOR]

New insights into intractable industrial challenges can be revealed by framing them in terms of natural science. One intractable industrial challenge is that creative production can be much more financially expensive and time consuming than standardized production. Creative products include a wide range of goods that have one or more original characteristics. The scaling up of creative production is hindered by high financial production costs and long production durations. In this paper, creative production is framed in terms of interactions between entropy and complexity during progressions from emergent pragmatics to action semantics. An analysis of interactions between entropy and complexity is provided that relates established practice in creative production to organizational survival in changing environments. The analysis in this paper is related to assembly theory, which is a recent theoretical development in natural science that addresses how open-ended generation of complex physical objects can emerge from selection in biology. Parallels between assembly practice in industrial production and assembly theory in natural science are explained through constructs that are common to both, such as assembly index. Overall, analyses reported in the paper reveal that interactions between entropy and complexity underlie intractable challenges in creative production, from the production of individual products to the survival of companies. [ABSTRACT FROM AUTHOR]

The paper analyzes the probability distribution of the occupancy numbers and the entropy of a system at the equilibrium composed by an arbitrary number of non-interacting bosons. The probability distribution is obtained through two approaches: one involves tracing out the environment from a bosonic eigenstate of the combined environment and system of interest (the empirical approach), while the other involves tracing out the environment from the mixed state of the combined environment and system of interest (the Bayesian approach). In the thermodynamic limit, the two coincide and are equal to the multinomial distribution. Furthermore, the paper proposes to identify the physical entropy of the bosonic system with the Shannon entropy of the occupancy numbers, fixing certain contradictions that arise in the classical analysis of thermodynamic entropy. Finally, by leveraging an information-theoretic inequality between the entropy of the multinomial distribution and the entropy of the multivariate hypergeometric distribution, Bayesianism of information theory and empiricism of statistical mechanics are integrated into a common "infomechanical" framework. [ABSTRACT FROM AUTHOR]

This paper extends the concept of metrics based on the Bayesian information criterion (BIC), to achieve strongly consistent estimation of partition Markov models (PMMs). We introduce a set of metrics drawn from the family of model selection criteria known as efficient determination criteria (EDC). This generalization extends the range of options available in BIC for penalizing the number of model parameters. We formally specify the relationship that determines how EDC works when selecting a model based on a threshold associated with the metric. Furthermore, we improve the penalty options within EDC, identifying the penalty ln (ln (n)) as a viable choice that maintains the strongly consistent estimation of a PMM. To demonstrate the utility of these new metrics, we apply them to the modeling of three DNA sequences of dengue virus type 3, endemic in Brazil in 2023. [ABSTRACT FROM AUTHOR]

The modern textbook analysis of the thermal state of photons inside a three-dimensional reflective cavity is based on the three quantum numbers that characterize photon's energy eigenvalues coming out when the boundary conditions are imposed. The crucial passage from the quantum numbers to the continuous frequency is operated by introducing a three-dimensional continuous version of the three discrete quantum numbers, which leads to the energy spectral density and to the entropy spectral density. This standard analysis obscures the role of the multiplicity of energy eigenvalues associated to the same eigenfrequency. In this paper we review the past derivations of Bose's entropy spectral density and present a new analysis of energy spectral density and entropy spectral density based on the multiplicity of energy eigenvalues. Our analysis explicitly defines the eigenfrequency distribution of energy and entropy and uses it as a starting point for the passage from the discrete eigenfrequencies to the continuous frequency. [ABSTRACT FROM AUTHOR]

Addressing the challenges posed by the complexity of the structure and the multitude of sensor types installed in space application fluid loop systems, this paper proposes a fault diagnosis method based on an improved D-S evidence theory. The method first employs the Gaussian affiliation function to convert the information acquired by sensors into BPA functions. Subsequently, it utilizes a pignistic probability transformation to convert the multiple subset focal elements into single subset focal elements. Finally, it comprehensively evaluates the credibility and uncertainty factors between evidences, introducing Bray–Curtis dissimilarity and belief entropy to achieve the fusion of conflicting evidence. The proposed method is initially validated on the classic Iris dataset, demonstrating its reliability. Furthermore, when applied to fault diagnosis in space application fluid circuit loop pumps, the results indicate that the method can effectively fuse multiple sensors and accurately identify faults. [ABSTRACT FROM AUTHOR]

This paper addresses the critical need for precise thermal modeling in electronics, where temperature significantly impacts system reliability. We emphasize the necessity of accurate temperature measurement and uncertainty quantification in thermal imaging, a vital tool across multiple industries. Current mathematical models and uncertainty measures, such as Rényi and Shannon entropies, are inadequate for the detailed informational content required in thermal images. Our work introduces a novel entropy that effectively captures the informational content of thermal images by combining local and global data, surpassing existing metrics. Validated by rigorous experimentation, this method enhances thermal images' reliability and information preservation. We also present two enhancement frameworks that integrate an optimized genetic algorithm and image fusion techniques, improving image quality by reducing artifacts and enhancing contrast. These advancements offer significant contributions to thermal imaging and uncertainty quantification, with broad applications in various sectors. [ABSTRACT FROM AUTHOR]

This paper presents a comparative study of entropy estimation in a large-alphabet regime. A variety of entropy estimators have been proposed over the years, where each estimator is designed for a different setup with its own strengths and caveats. As a consequence, no estimator is known to be universally better than the others. This work addresses this gap by comparing twenty-one entropy estimators in the studied regime, starting with the simplest plug-in estimator and leading up to the most recent neural network-based and polynomial approximate estimators. Our findings show that the estimators' performance highly depends on the underlying distribution. Specifically, we distinguish between three types of distributions, ranging from uniform to degenerate distributions. For each class of distribution, we recommend the most suitable estimator. Further, we propose a sample-dependent approach, which again considers three classes of distribution, and report the top-performing estimators in each class. This approach provides a data-dependent framework for choosing the desired estimator in practical setups. [ABSTRACT FROM AUTHOR]

Supervised learning methods excel in traditional relation extraction tasks. However, the quality and scale of the training data heavily influence their performance. Few-shot relation extraction is gradually becoming a research hotspot whose objective is to learn and extract semantic relationships between entities with only a limited number of annotated samples. In recent years, numerous studies have employed prototypical networks for few-shot relation extraction. However, these methods often suffer from overfitting of the relation classes, making it challenging to generalize effectively to new relationships. Therefore, this paper seeks to utilize a diffusion model for data augmentation to address the overfitting issue of prototypical networks. We propose a diffusion model-enhanced prototypical network framework. Specifically, we design and train a controllable conditional relation generation diffusion model on the relation extraction dataset, which can generate the corresponding instance representation according to the relation description. Building upon the trained diffusion model, we further present a pseudo-sample-enhanced prototypical network, which is able to provide more accurate representations for prototype classes, thereby alleviating overfitting and better generalizing to unseen relation classes. Additionally, we introduce a pseudo-sample-aware attention mechanism to enhance the model's adaptability to pseudo-sample data through a cross-entropy loss, further improving the model's performance. A series of experiments are conducted to prove our method's effectiveness. The results indicate that our proposed approach significantly outperforms existing methods, particularly in low-resource one-shot environments. Further ablation analyses underscore the necessity of each module in the model. As far as we know, this is the first research to employ a diffusion model for enhancing the prototypical network through data augmentation in few-shot relation extraction. [ABSTRACT FROM AUTHOR]

Slope Entropy (SlpEn) is a novel method recently proposed in the field of time series entropy estimation. In addition to the well-known embedded dimension parameter, m, used in other methods, it applies two additional thresholds, denoted as δ and γ , to derive a symbolic representation of a data subsequence. The original paper introducing SlpEn provided some guidelines for recommended specific values of these two parameters, which have been successfully followed in subsequent studies. However, a deeper understanding of the role of these thresholds is necessary to explore the potential for further SlpEn optimisations. Some works have already addressed the role of δ , but in this paper, we extend this investigation to include the role of γ and explore the impact of using an asymmetric scheme to select threshold values. We conduct a comparative analysis between the standard SlpEn method as initially proposed and an optimised version obtained through a grid search to maximise signal classification performance based on SlpEn. The results confirm that the optimised version achieves higher time series classification accuracy, albeit at the cost of significantly increased computational complexity. [ABSTRACT FROM AUTHOR]

Translation of the seminal 1877 paper by Ludwig Boltzmann which for the first time established the probabilistic basis of entropy. Includes a scientific commentary. [ABSTRACT FROM AUTHOR]

In the theory of special relativity, energy can be found in two forms: kinetic energy and rest mass. The potential energy of a body is actually stored in the form of rest mass, the interaction energy too, but temperature is not. Information acquired about a dynamical system can be potentially used to extract useful work from it. Hence, the "mass–energy–information equivalence principle" that has been recently proposed. In this paper, it is first recalled that for a thermodynamic system made of non-interacting entities at constant temperature, the internal energy is also constant. So, the energy involved in a variation in entropy ( T Δ S ) differs from a change in the potential energy stored or released and cannot be associated to a corresponding variation in mass of the system, even if it is expressed in terms of the quantity of information. This debate gives us the opportunity to deepen the notion of entropy seen as a quantity of information, to highlight the difference between logical irreversibility (a state-dependent property) and thermodynamical irreversibility (a path-dependent property), and to return to the nature of the link between energy and information that is dynamical. [ABSTRACT FROM AUTHOR]

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]

Complex systems are prevalent in various disciplines encompassing the natural and social sciences, such as physics, biology, economics, and sociology. Leveraging data science techniques, particularly those rooted in artificial intelligence and machine learning, offers a promising avenue for comprehending the intricacies of complex systems without necessitating detailed knowledge of underlying dynamics. In this paper, we demonstrate that multiscale entropy (MSE) is pivotal in describing the steady state of complex systems. Introducing the multiscale entropy dynamics (MED) methodology, we provide a framework for dissecting system dynamics and uncovering the driving forces behind their evolution. Our investigation reveals that the MED methodology facilitates the expression of complex system dynamics through a Generalized Nonlinear Schrödinger Equation (GNSE) that thus demonstrates its potential applicability across diverse complex systems. By elucidating the entropic underpinnings of complexity, our study paves the way for a deeper understanding of dynamic phenomena. It offers insights into the behavior of complex systems across various domains. [ABSTRACT FROM AUTHOR]

A hot NUT–Kerr–Newman black hole is a general stationary axisymmetric black hole. In this black hole spacetime, the dynamical equations of fermions at the horizon are modified by considering Lorentz breaking. The corrections to the Hawking temperature and Bekenstein–Hawking entropy at the horizon of the black hole are studied in depth. Based on the semiclassical theory correction, the Bekenstein–Hawking entropy of this black hole is quantum-corrected by considering the perturbation effect of the Planck constant ℏ. The latter part of this paper presents a detailed discussion of the obtained results and their physical implications. [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]

In continuum physics the dissipation principle, first proposed by Coleman and Noll in 1963, regards second law of thermodynamics as a unilateral differential constraint on the constitutive equations. In 1996, Muschik and Ehrentraut provided a rigorous proof of such an approach under the assumption that, at an arbitrary instant, t 0 , in an arbitrary point, P 0 , of a continuous system, the entropy production is zero if, and only if, P 0 is in thermodynamic equilibrium. In 2022, Cimmelli and Rogolino incorporated such an assumption in a more general formulation of the second law of thermodynamics. In this paper, we prove that the same conclusions hold if both the fundamental balance laws and their gradients are substituted into the entropy inequality. Such a methodology is applied to analyze the strain-gradient elasticity. [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]

For a family of stochastic differential equations driven by additive Gaussian noise, we study the asymptotic behaviors of its corresponding Euler–Maruyama scheme by deriving its convergence rate in terms of relative entropy. Our results for the convergence rate in terms of relative entropy complement the conventional ones in the strong and weak sense and induce some other properties of the Euler–Maruyama scheme. For example, the convergence in terms of the total variation distance can be implied by Pinsker's inequality directly. Moreover, when the drift is β ( 0 < β < 1 )-Hölder continuous in the spatial variable, the convergence rate in terms of the weighted variation distance is also established. Both of these convergence results do not seem to be directly obtained from any other convergence results of the Euler–Maruyama scheme. The main tool this paper relies on is the Girsanov transform. [ABSTRACT FROM AUTHOR]

Aiming at the difficult problem of extracting fault characteristics and the low accuracy of fault diagnosis throughout the full life cycle of rolling bearings, a fault diagnosis method for rolling bearings based on grey relation degree is proposed in this paper. Firstly, the subtraction-average-based optimizer is used to optimize the parameters of the variational mode decomposition algorithm. Secondly, the vibration signals of bearings are decomposed by using the optimized results, and the feature vector of the intrinsic mode function component corresponding to the minimum envelope entropy is extracted. Finally, the grey proximity and similarity relation degree based on standard distance entropy are weighted to calculate the grey comprehensive relation degree between the feature vector of vibration signals and each standard state. By comparing the results, the diagnosis of different fault states and degrees of rolling bearings is realized. The XJTU-SY dataset was used for experimentation, and the results show that the proposed method achieves a diagnostic accuracy of 95.24% and has better diagnosis performance compared to various algorithms. It provides a reference for the fault diagnosis of rolling bearings throughout the full life cycle. [ABSTRACT FROM AUTHOR]

Recent years have seen a rise in interest in document-level relation extraction, which is defined as extracting all relations between entities in multiple sentences of a document. Typically, there are multiple mentions corresponding to a single entity in this context. Previous research predominantly employed a holistic representation for each entity to predict relations, but this approach often overlooks valuable information contained in fine-grained entity mentions. We contend that relation prediction and inference should be grounded in specific entity mentions rather than abstract entity concepts. To address this, our paper proposes a two-stage mention-level framework based on an enhanced heterogeneous graph attention network for document-level relation extraction. Our framework employs two different strategies to model intra-sentential and inter-sentential relations between fine-grained entity mentions, yielding local mention representations for intra-sentential relation prediction and global mention representations for inter-sentential relation prediction. For inter-sentential relation prediction and inference, we propose an enhanced heterogeneous graph attention network to better model the long-distance semantic relationships and design an entity-coreference path-based inference strategy to conduct relation inference. Moreover, we introduce a novel cross-entropy-based multilabel focal loss function to address the class imbalance problem and multilabel prediction simultaneously. Comprehensive experiments have been conducted to verify the effectiveness of our framework. Experimental results show that our approach significantly outperforms the existing methods. [ABSTRACT FROM AUTHOR]

The two-dimensional sample entropy marks a significant advance in evaluating the regularity and predictability of images in the information domain. Unlike the direct computation of sample entropy, which incurs a time complexity of O (N 2) for the series with N length, the Monte Carlo-based algorithm for computing one-dimensional sample entropy (MCSampEn) markedly reduces computational costs by minimizing the dependence on N. This paper extends MCSampEn to two dimensions, referred to as MCSampEn2D. This new approach substantially accelerates the estimation of two-dimensional sample entropy, outperforming the direct method by more than a thousand fold. Despite these advancements, MCSampEn2D encounters challenges with significant errors and slow convergence rates. To counter these issues, we have incorporated an upper confidence bound (UCB) strategy in MCSampEn2D. This strategy involves assigning varied upper confidence bounds in each Monte Carlo experiment iteration to enhance the algorithm's speed and accuracy. Our evaluation of this enhanced approach, dubbed UCBMCSampEn2D, involved the use of medical and natural image data sets. The experiments demonstrate that UCBMCSampEn2D achieves a 40 % reduction in computational time compared to MCSampEn2D. Furthermore, the errors with UCBMCSampEn2D are only 30 % of those observed in MCSampEn2D, highlighting its improved accuracy and efficiency. [ABSTRACT FROM AUTHOR]

We deal with absolutely continuous probability distributions with finite all-positive integer-order moments. It is well known that any such distribution is either uniquely determined by its moments (M-determinate), or it is non-unique (M-indeterminate). In this paper, we follow the maximum entropy approach and establish a new criterion for the M-indeterminacy of distributions on the positive half-line (Stieltjes case). Useful corollaries are derived for M-indeterminate distributions on the whole real line (Hamburger case). We show how the maximum entropy is related to the symmetry property and the M-indeterminacy. [ABSTRACT FROM AUTHOR]

Three-phase asynchronous motors have a wide range of applications in the machinery industry and fault diagnosis aids in the healthy operation of a motor. In order to improve the accuracy and generalization of fault diagnosis in three-phase asynchronous motors, this paper proposes a three-phase asynchronous motor fault diagnosis method based on the combination of multiscale Weibull dispersive entropy (WB-MDE) and particle swarm optimization–support vector machine (PSO-SVM). Firstly, the Weibull distribution (WB) is used to linearize and smooth the vibration signals to obtain sharper information about the motor state. Secondly, the quantitative features of the regularity and orderliness of a given sequence are extracted using multiscale dispersion entropy (MDE). Then, a support vector machine (SVM) is used to construct a classifier, the parameters are optimized via the particle swarm optimization (PSO) algorithm, and the extracted feature vectors are fed into the optimized SVM model for classification and recognition. Finally, the accuracy and generalization of the model proposed in this paper are tested by adding raw data with Gaussian white noise with different signal-to-noise ratios and the CHIST-ERA SOON public dataset. This paper builds a three-phase asynchronous motor vibration signal experimental platform, through a piezoelectric acceleration sensor to discern the four states of the motor data, to verify the effectiveness of the proposed method. The accuracy of the collected data using the WB-MDE method proposed in this paper for feature extraction and the extracted features using the optimization of the PSO-SVM method for fault classification and identification is 100%. Additionally, the proposed model is tested for noise resistance and generalization. Finally, the superiority of the present method is verified through experiments as well as noise immunity and generalization tests. [ABSTRACT FROM AUTHOR]

In the last few decades, the number of published papers that include search terms such as thermodynamics, entropy, ecology, and ecosystems has grown rapidly. Recently, background research carried out during the development of a paper on "thermodynamics in ecology" revealed huge variation in the understanding of the meaning and the use of some of the central terms in this field—in particular, entropy. This variation seems to be based primarily on the differing educational and scientific backgrounds of the researchers responsible for contributions to this field. Secondly, some ecological subdisciplines also seem to be better suited and applicable to certain interpretations of the concept than others. The most well-known seems to be the use of the Boltzmann–Gibbs equation in the guise of the Shannon–Weaver/Wiener index when applied to the estimation of biodiversity in ecology. Thirdly, this tendency also revealed that the use of entropy-like functions could be diverted into an area of statistical and distributional analyses as opposed to real thermodynamic approaches, which explicitly aim to describe and account for the energy fluxes and dissipations in the systems. Fourthly, these different ways of usage contribute to an increased confusion in discussions about efficiency and possible telos in nature, whether at the developmental level of the organism, a population, or an entire ecosystem. All the papers, in general, suffer from a lack of clear definitions of the thermodynamic functions used, and we, therefore, recommend that future publications in this area endeavor to achieve a more precise use of language. Only by increasing such efforts it is possible to understand and resolve some of the significant and possibly misleading discussions in this area. [ABSTRACT FROM AUTHOR]

In this paper, we provide geometric insights with visualization into the multivariate Gaussian distribution and its entropy and mutual information. In order to develop the multivariate Gaussian distribution with entropy and mutual information, several significant methodologies are presented through the discussion, supported by illustrations, both technically and statistically. The paper examines broad measurements of structure for the Gaussian distributions, which show that they can be described in terms of the information theory between the given covariance matrix and correlated random variables (in terms of relative entropy). The content obtained allows readers to better perceive concepts, comprehend techniques, and properly execute software programs for future study on the topic's science and implementations. It also helps readers grasp the themes' fundamental concepts to study the application of multivariate sets of data in Gaussian distribution. The simulation results also convey the behavior of different elliptical interpretations based on the multivariate Gaussian distribution with entropy for real-world applications in our daily lives, including information coding, nonlinear signal detection, etc. Involving the relative entropy and mutual information as well as the potential correlated covariance analysis, a wide range of information is addressed, including basic application concerns as well as clinical diagnostics to detect the multi-disease effects. [ABSTRACT FROM AUTHOR]

Entropy quantification approaches have gained considerable attention in engineering applications. However, certain limitations persist, including the strong dependence on parameter selection, limited discriminating power, and low robustness to noise. To alleviate these issues, this paper introduces two novel algorithms for time series analysis: the ensemble improved permutation entropy (EIPE) and multiscale EIPE (MEIPE). Our approaches employ a new symbolization process that considers both permutation relations and amplitude information. Additionally, the ensemble technique is utilized to reduce the dependence on parameter selection. We performed a comprehensive evaluation of the proposed methods using various synthetic and experimental signals. The results illustrate that EIPE is capable of distinguishing white, pink, and brown noise with a smaller number of samples compared to traditional entropy algorithms. Furthermore, EIPE displays the potential to discriminate between regular and non-regular dynamics. Notably, when compared to permutation entropy, weighted permutation entropy, and dispersion entropy, EIPE exhibits superior robustness against noise. In practical applications, such as RR interval data classification, bearing fault diagnosis, marine vessel identification, and electroencephalographic (EEG) signal classification, the proposed methods demonstrate better discriminating power compared to conventional entropy measures. These promising findings validate the effectiveness and potential of the algorithms proposed in this paper. [ABSTRACT FROM AUTHOR]

Managed pressure drilling (MPD) is the most effective means to ensure drilling safety, and MPD is able to avoid further deterioration of complex working conditions through precise control of the wellhead back pressure. The key to the success of MPD is the well control strategy, which currently relies heavily on manual experience, hindering the automation and intelligence process of well control. In response to this issue, an MPD knowledge graph is constructed in this paper that extracts knowledge from published papers and drilling reports to guide well control. In order to improve the performance of entity extraction in the knowledge graph, a few-shot Chinese entity recognition model CEntLM-KL is extended from the EntLM model, in which the KL entropy is built to improve the accuracy of entity recognition. Through experiments on benchmark datasets, it has been shown that the proposed model has a significant improvement compared to the state-of-the-art methods. On the few-shot drilling datasets, the F-1 score of entity recognition reaches 33%. Finally, the knowledge graph is stored in Neo4J and applied for knowledge inference. [ABSTRACT FROM AUTHOR]

Objective: Phase transfer entropy ( T E θ ) methods perform well in animal sensory–spatial associative learning. However, their advantages and disadvantages remain unclear, constraining their usage. Method: This paper proposes the performance baseline of the T E θ methods. Specifically, four T E θ methods are applied to the simulated signals generated by a neural mass model and the actual neural data from ferrets with known interaction properties to investigate the accuracy, stability, and computational complexity of the T E θ methods in identifying the directional coupling. Then, the most suitable method is selected based on the performance baseline and used on the local field potential recorded from pigeons to detect the interaction between the hippocampus (Hp) and nidopallium caudolaterale (NCL) in visual–spatial associative learning. Results: (1) This paper obtains a performance baseline table that contains the most suitable method for different scenarios. (2) The T E θ method identifies an information flow preferentially from Hp to NCL of pigeons at the θ band (4–12 Hz) in visual–spatial associative learning. Significance: These outcomes provide a reference for the T E θ methods in detecting the interactions between brain areas. [ABSTRACT FROM AUTHOR]

Sleep apnea hypopnea syndrome (SAHS) is a common sleep disorder with a high prevalence. The apnea hypopnea index (AHI) is an important indicator used to diagnose the severity of SAHS disorders. The calculation of the AHI is based on the accurate identification of various types of sleep respiratory events. In this paper, we proposed an automatic detection algorithm for respiratory events during sleep. In addition to the accurate recognition of normal breathing, hypopnea and apnea events using heart rate variability (HRV), entropy and other manual features, we also presented a fusion of ribcage and abdomen movement data combined with the long short-term memory (LSTM) framework to achieve the distinction between obstructive and central apnea events. While only using electrocardiogram (ECG) features, the accuracy, precision, sensitivity, and F1 score of the XGBoost model are 0.877, 0.877, 0.876, and 0.876, respectively, demonstrating that it performs better than other models. Moreover, the accuracy, sensitivity, and F1 score of the LSTM model for detecting obstructive and central apnea events were 0.866, 0.867, and 0.866, respectively. The research results of this paper can be used for the automatic recognition of sleep respiratory events as well as AHI calculation of polysomnography (PSG), which provide a theoretical basis and algorithm references for out-of-hospital sleep monitoring. [ABSTRACT FROM AUTHOR]

The ability to learn continuously is crucial for a robot to achieve a high level of intelligence and autonomy. In this paper, we consider continual reinforcement learning (RL) for quadruped robots, which includes the ability to continuously learn sub-sequential tasks (plasticity) and maintain performance on previous tasks (stability). The policy obtained by the proposed method enables robots to learn multiple tasks sequentially, while overcoming both catastrophic forgetting and loss of plasticity. At the same time, it achieves the above goals with as little modification to the original RL learning process as possible. The proposed method uses the Piggyback algorithm to select protected parameters for each task, and reinitializes the unused parameters to increase plasticity. Meanwhile, we encourage the policy network exploring by encouraging the entropy of the soft network of the policy network. Our experiments show that traditional continual learning algorithms cannot perform well on robot locomotion problems, and our algorithm is more stable and less disruptive to the RL training progress. Several robot locomotion experiments validate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

Entropy estimation is a fundamental problem in information theory that has applications in various fields, including physics, biology, and computer science. Estimating the entropy of discrete sequences can be challenging due to limited data and the lack of unbiased estimators. Most existing entropy estimators are designed for sequences of independent events and their performances vary depending on the system being studied and the available data size. In this work, we compare different entropy estimators and their performance when applied to Markovian sequences. Specifically, we analyze both binary Markovian sequences and Markovian systems in the undersampled regime. We calculate the bias, standard deviation, and mean squared error for some of the most widely employed estimators. We discuss the limitations of entropy estimation as a function of the transition probabilities of the Markov processes and the sample size. Overall, this paper provides a comprehensive comparison of entropy estimators and their performance in estimating entropy for systems with memory, which can be useful for researchers and practitioners in various fields. [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]

Visual scanning is achieved via head motion and gaze movement for visual information acquisition and cognitive processing, which plays a critical role in undertaking common sensorimotor tasks such as driving. The coordination of the head and eyes is an important human behavior to make a key contribution to goal-directed visual scanning and sensorimotor driving. In this paper, we basically investigate the two most common patterns in eye–head coordination: "head motion earlier than eye movement" and "eye movement earlier than head motion". We utilize bidirectional transfer entropies between head motion and eye movements to determine the existence of these two eye–head coordination patterns. Furthermore, we propose a unidirectional information difference to assess which pattern predominates in head–eye coordination. Additionally, we have discovered a significant correlation between the normalized unidirectional information difference and driving performance. This result not only indicates the influence of eye–head coordination on driving behavior from a computational perspective but also validates the practical significance of our approach utilizing transfer entropy for quantifying eye–head coordination. [ABSTRACT FROM AUTHOR]

Data anonymization is a technique that safeguards individuals' privacy by modifying attribute values in published data. However, increased modifications enhance privacy but diminish the utility of published data, necessitating a balance between privacy and utility levels. K-Anonymity is a crucial anonymization technique that generates k-anonymous clusters, where the probability of disclosing a record is 1 / k . However, k-anonymity fails to protect against attribute disclosure when the diversity of sensitive values within the anonymous cluster is insufficient. Several techniques have been proposed to address this issue, among which t-closeness is considered one of the most robust privacy techniques. In this paper, we propose a novel approach employing a greedy and information-theoretic clustering-based algorithm to achieve strict privacy protection. The proposed anonymization algorithm commences by clustering the data based on both the similarity of quasi-identifier values and the diversity of sensitive attribute values. In the subsequent adjustment phase, the algorithm splits and merges the clusters to ensure that they each possess at least k members and adhere to the t-closeness requirements. Finally, the algorithm replaces the quasi-identifier values of the records in each cluster with the values of the cluster center to attain k-anonymity and t-closeness. Experimental results on three microdata sets from Facebook, Twitter, and Google+ demonstrate the proposed algorithm's ability to preserve the utility of released data by minimizing the modifications of attribute values while satisfying the k-anonymity and t-closeness constraints. [ABSTRACT FROM AUTHOR]

In theoretical physics and theoretical neuroscience, increased intelligence is associated with increased entropy, which entails potential access to an increased number of states that could facilitate adaptive behavior. Potential to access a larger number of states is a latent entropy as it refers to the number of states that could possibly be accessed, and it is also recognized that functioning needs to be efficient through minimization of manifest entropy. For example, in theoretical physics, the importance of efficiency is recognized through the observation that nature is thrifty in all its actions and through the principle of least action. In this paper, system intelligence is explained as capability to maintain internal stability while adapting to changing environments by minimizing manifest task entropy while maximizing latent system entropy. In addition, it is explained how automated negotiation relates to balancing adaptability and stability; and a mathematical negotiation model is presented that enables balancing of latent system entropy and manifest task entropy in intelligent systems. Furthermore, this first principles analysis of system intelligence is related to everyday challenges in production systems through multiple simulations of the negotiation model. The results indicate that manifest task entropy is minimized when maximization of latent system entropy is used as the criterion for task allocation in the simulated production scenarios. [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]

Plasmas confined in a dipole magnetic field widely exist in both space and laboratories, and this kind of plasma draws much attention from researchers both in plasma physics and in space science. In this paper, the characteristics of the collisionless electrostatic instability of the entropy mode in a dipole-magnetic-confined plasma are simulated with the linear gyrokinetic model. It is found that the entropy mode can be generated in dipole-magnetic-confined plasmas, and there are two typical stages of the entropy mode, with another transitional stage at different values of η. The main instability changes from the ion diamagnetic drift to the electronic diamagnetic drift as η becomes larger. In addition, the MHD mode predicts that the most stable point is at η~2/3 when k⊥ρi << 1. However, we find that η and k⊥ρi are coupled with each other, and the most stable point of the mode moves gradually to η~1 as k⊥ρi increases. There is a peak value for the entropy mode growth rate around k⊥ρi~1.0, and more complicated modes are induced so that the dispersion relation has been changed when the driving force of the plasma pressure gradient effect is obvious. For example, the characteristics of the interchange-like modes gradually emerge when the driving effect of the plasma pressure becomes stronger. Further investigations should be taken to reveal the characteristics of the entropy mode in magnetospheric plasmas. [ABSTRACT FROM AUTHOR]

Takeuchi's Information Criterion (TIC) was introduced as a generalization of Akaike's Information Criterion (AIC) in 1976. Though TIC avoids many of AIC's strict requirements and assumptions, it is only rarely used. One of the reasons for this is that the trace term introduced in TIC is numerically unstable and computationally expensive to compute. An extension of TIC called ICE was published in 2021, which allows this trace term to be used for model fitting (where it was primarily compared to L2 regularization) instead of just model selection. That paper also examined numerically stable and computationally efficient approximations that could be applied to TIC or ICE, but these approximations were only examined on small synthetic models. This paper applies and extends these approximations to larger models on real datasets for both TIC and ICE. This work shows the practical models may use TIC and ICE in a numerically stable way to achieve superior results at a reasonable computational cost. [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]

Individual subjects' ratings neither are metric nor have homogeneous meanings, consequently digital- labeled collections of subjects' ratings are intrinsically ordinal and categorical. However, in these situations, the literature privileges the use of measures conceived for numerical data. In this paper, we discuss the exploratory theme of employing conditional entropy to measure degrees of uncertainty in responding to self-rating questions and that of displaying the computed entropies along the ordinal axis for visible pattern recognition. We apply this theme to the study of an online dataset, which contains responses to the Rosenberg Self-Esteem Scale. We report three major findings. First, at the fine scale level, the resultant multiple ordinal-display of response-vs-covariate entropy measures reveals that the subjects on both extreme labels (high self-esteem and low self-esteem) show distinct degrees of uncertainty. Secondly, at the global scale level, in responding to positively posed questions, the degree of uncertainty decreases for increasing levels of self-esteem, while, in responding to negative questions, the degree of uncertainty increases. Thirdly, such entropy-based computed patterns are preserved across age groups. We provide a set of tools developed in R that are ready to implement for the analysis of rating data and for exploring pattern-based knowledge in related research. [ABSTRACT FROM AUTHOR]

The extraction of the optimal mode of the bearing signal in the drive system of a corn harvester is a challenging task. In addition, the accuracy and robustness of the fault diagnosis model are low. Therefore, this paper proposes a fault diagnosis method that uses the optimal mode component as the input feature. The vibration signal is first decomposed by variational mode decomposition (VMD) based on the optimal parameters searched by the artificial bee colony (ABC). Moreover, the key components are screened using an evaluation function that is a fusion of the arrangement entropy, the signal-to-noise ratio, and the power spectral density weighting. The Stockwell transform is then used to convert the filtered modal components into time–frequency images. Finally, the MBConv quantity and activation function of the EfficientNet network are optimized, and the time–frequency pictures are imported into the optimized network model for fault diagnosis. The comparative experiments show that the proposed method accurately extracts the optimal modal component and has a fault classification accuracy greater than 98%. [ABSTRACT FROM AUTHOR]

Hypergraphs have become an accurate and natural expression of high-order coupling relationships in complex systems. However, applying high-order information from networks to vital node identification tasks still poses significant challenges. This paper proposes a von Neumann entropy-based hypergraph vital node identification method (HVC) that integrates high-order information as well as its optimized version (semi-SAVC). HVC is based on the high-order line graph structure of hypergraphs and measures changes in network complexity using von Neumann entropy. It integrates s -line graph information to quantify node importance in the hypergraph by mapping hyperedges to nodes. In contrast, semi-SAVC uses a quadratic approximation of von Neumann entropy to measure network complexity and considers only half of the maximum order of the hypergraph's s -line graph to balance accuracy and efficiency. Compared to the baseline methods of hyperdegree centrality, closeness centrality, vector centrality, and sub-hypergraph centrality, the new methods demonstrated superior identification of vital nodes that promote the maximum influence and maintain network connectivity in empirical hypergraph data, considering the influence and robustness factors. The correlation and monotonicity of the identification results were quantitatively analyzed and comprehensive experimental results demonstrate the superiority of the new methods. At the same time, a key non-trivial phenomenon was discovered: influence does not increase linearly as the s -line graph orders increase. We call this the saturation effect of high-order line graph information in hypergraph node identification. When the order reaches its saturation value, the addition of high-order information often acts as noise and affects propagation. [ABSTRACT FROM AUTHOR]

We consider open non-twist Hamiltonian systems represented by an area-preserving two-dimensional map describing incompressible planar flows in the reference frame of a propagating wave, and possessing exits through which map orbits can escape. The corresponding escape basins have a fractal nature that can be revealed by the so-called basin entropy, a novel concept developed to quantify final-state uncertainty in dynamical systems. Since the map considered violates locally the twist condition, there is a shearless barrier that prevents global chaotic transport. In this paper, we show that it is possible to determine the shearless barrier breakup by considering the variation in the escape basin entropy with a tunable parameter. [ABSTRACT FROM AUTHOR]

Market uncertainty has a significant impact on market performance. Previous studies have dedicated much effort towards investigations into market uncertainty related to information asymmetry and risk. However, they have neglected the uncertainty inherent in market transactions, which is also an important aspect of market performance, besides the quantity of transactions and market efficiency. In this paper, we put forward a concept of transaction entropy to measure market uncertainty and see how it changes with price. Transaction entropy is defined as the ratio of the total information entropy of all traders to the quantity of transactions, reflecting the level of uncertainty in making successful transactions. Based on the computational and simulated results, our main finding is that transaction entropy is the lowest at equilibrium, it will decrease in a shortage market, and increase in a surplus market. Additionally, we make a comparison of the total entropy of the centralized market with that of the decentralized market, revealing that the price-filtering mechanism could effectively reduce market uncertainty. Overall, the introduction of transaction entropy enriches our understanding of market uncertainty and facilitates a more comprehensive assessment of market performance. [ABSTRACT FROM AUTHOR]

Because of the influence of harsh and variable working environments, the vibration signals of rolling bearings for combine harvesters usually show obvious characteristics of strong non-stationarity and nonlinearity. Accomplishing accurate fault diagnosis using these signals for rolling bearings is a challenging subject. In this paper, a novel fault diagnosis method based on composite-scale-variable dispersion entropy (CSvDE) and self-optimization variational mode decomposition (SoVMD) is proposed, systematically combining the nonstationary signal analysis approach and machine learning technology. Firstly, an improved SoVMD algorithm is developed to realize adaptive parameter optimization and to further extract multiscale frequency components from original signals. Subsequently, a CSvDE-based feature learning model is established to generate the multiscale fault feature space (MsFFS) of frequency components for the improvement of fault feature learning ability. Finally, the generated MsFFS can serve as the inputs of the Softmax classifier for fault category identification. Extensive experiments on the vibration datasets collected from rolling bearings of combine harvesters are conducted, and the experimental results demonstrate the more superior and robust fault diagnosis performance of the proposed method compared to other existing approaches. [ABSTRACT FROM AUTHOR]

Product variety complexity assessment plays a vital role in system design, as it has tremendous negative effects on manufacturing complexity in assembly systems and supply chains. On the other hand, practitioners and researchers frequently consider the number of product variants as a sufficient measure to be used to manage this kind of complexity. However, as shown in this study, such a measure does not reflect all pertinent features of complexity. Therefore, the main goal of the paper is to develop a measurement method for product variety complexity that adequately reflects relevant relations between the portfolio of optional components and the number of product variants. As presented in the paper, the concept of information theory can be effectively applied to measure product variety complexity. Moreover, such a measure can also be useful to better understand this system's properties in order to reduce the level of variety-induced complexity. As such, the proposed method can be viewed as a complementary tool for reducing manufacturing complexity in terms of mass customization. The developed complexity metric was successfully tested on a realistic design example. [ABSTRACT FROM AUTHOR]