The study of gene-based genetic associations has gained conceptual popularity recently. Biologic insight into the etiology of a complex disease can be gained by focusing on genes as testing units. Several gene-based methods (e.g., minimum p-value (or maximum test statistic) or entropy-based method) have been developed and have more power than a single nucleotide polymorphism (SNP)-based analysi...

1 Introduction Kolmogorov-Sinai entropy (K-S entropy) is used to analyze radio wave intensity time series of quasars. K-S entropy measures the rate of change of probability with the change of dimension that trajectory points in the embedding space stay within a distance r [1]. The K-S entropy analysis method is a powerful formalism for describing dynamics of time series [1]. m-dimensional K-S e...

The paper provides a numerical investigation of the entropy generation analysis due to natural convection in an inclined square porous cavity. The coupled equations of mass, momentum, energy and species conservation are solved using the Control Volume Finite-Element Method. Effect of medium permeability and inclination angle on entropy generation is analysed. It was found that according to the ...

This paper reviews the existing definitions and formulas of entropy for interval-valued intuitionistic fuzzy sets (IVIFSs) and demonstrates that they cannot fully capture the uncertainty of IVIFSs. Then considering both fuzziness and intuitionism of IVIFSs, we introduce a novel axiomatic definition of entropy for IVIFSs and develop several entropy formulas. Example analyses show that the develo...

Hidden Markov Processes (HMP) is one of the basic tools of the modern probabilistic modeling. The characterization of their entropy remains however an open problem. Here the entropy of HMP is calculated via the cycle expansion of the zeta-function, a method adopted from the theory of dynamical systems. For a class of HMP this method produces exact results both for the entropy and the moment-gen...

Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these sub-problem share some common variables, it is not sufficient to simply solve each sub-problem in isolation. We develop a technology for such problems, and use it to address the challenge of finding the concentrations ...

Consider a network of unreliable links, each of which comes with a certain price and reliability. Given a fixed budget, which links should be bought in order to maximize the system’s reliability? We introduce a Cross-Entropy approach to this problem, which can deal effectively with the noise and constraints in this difficult combinatorial optimization problem. Numerical results demonstrate the ...

We apply the Cross-entropy method to the N persons Iterated Prisoners Dilemma and show that cooperation is more readily achieved than with existing methods such as genetic algorithms or reinforcement learning.

This paper studies the performance of cache-enabled dense small cell networks consisting of multi-antenna sub-6 GHz and millimeter-wave base stations. Different from the existing works which only consider a single antenna at each base station, the optimal content placement is unknown when the base stations have multiple antennas. We first derive the successful content delivery probability by ac...

We consider the problem of estimating a probability distribution that maximizes the entropy while satisfying a finite number of moment constraints, possibly corrupted by noise. Based on duality of convex programming, we present a novel approximation scheme using a smoothed fast gradient method that is equipped with explicit bounds on the approximation error. We further demonstrate how the prese...