Mutual Information Maximization via Joint Power Allocation in Integrated Sensing and Communications System

In this paper, we focus on the power allocation of Integrated Sensing and Communication(ISAC) with orthogonal frequency division multiplexing(OFDM) waveform. In order to improve the spectrum utilization efficiency in ISAC, we propose a design scheme based on spectrum sharing, that is,to maximize the mutual information(MI) of radar sensing while ensuring certain communication rate and transmission power constraints. In the proposed scheme, three cases are considered for the scattering off the target due to the communication signals,as negligible signal, beneficial signal, and interference signal to radar sensing, respectively, thus requiring three power allocation schemes. However,the corresponding power allocation schemes are nonconvex and their closed-form solutions are unavailable as a consequence. Motivated by this, alternating optimization(AO), sequence convex programming(SCP) and Lagrange multiplier are individually combined for three suboptimal solutions corresponding with three power allocation schemes. By combining the three algorithms, we transform the non-convex problem which is difficult to deal with into a convex problem which is easy to solve and obtain the suboptimal solution of the corresponding optimization problem. Numerical results show that, compared with the allocation results of the existing algorithms, the proposed joint design algorithm significantly improves the radar performance.

Quantized Decoders that Maximize Mutual Information for Polar Codes

In this paper,we innovatively associate the mutual information with the frame error rate(FER)performance and propose novel quantized decoders for polar codes.Based on the optimal quantizer of binary-input discrete memoryless channels(BDMCs),the proposed decoders quantize the virtual subchannels of polar codes to maximize mutual information(MMI)between source bits and quantized symbols.The nested structure of polar codes ensures that the MMI quantization can be implemented stage by stage.Simulation results show that the proposed MMI decoders with 4 quantization bits outperform the existing nonuniform quantized decoders that minimize mean-squared error(MMSE)with 4 quantization bits,and yield even better performance than uniform MMI quantized decoders with 5 quantization bits.Furthermore,the proposed 5-bit quantized MMI decoders approach the floating-point decoders with negligible performance loss.

Tuning the diffusion constant to optimize the readout of positional information of spatial concentration patterns

Positional information encoded in spatial concentration patterns is crucial for the development of multicellular organisms.However,it is still unclear how such information is affected by the physically dissipative diffusion process.Here we study one-dimensional patterning systems with analytical derivation and numerical simulations.We find that the diffusion constant of the patterning molecules exhibits a nonmonotonic effect on the readout of the positional information from the concentration patterns.Specifically,there exists an optimal diffusion constant that maximizes the positional information.Moreover,we find that the energy dissipation due to the physical diffusion imposes a fundamental upper limit on the positional information.

Fault monitoring based on mutual information feature engineering modeling in chemical process

A large amount of information is frequently encountered when characterizing the sample model in chemical process.A fault diagnosis method based on dynamic modeling of feature engineering is proposed to effectively remove the nonlinear correlation redundancy of chemical process in this paper.From the whole process point of view,the method makes use of the characteristic of mutual information to select the optimal variable subset.It extracts the correlation among variables in the whitening process without limiting to only linear correlations.Further,PCA(Principal Component Analysis)dimension reduction is used to extract feature subset before fault diagnosis.The application results of the TE(Tennessee Eastman)simulation process show that the dynamic modeling process of MIFE(Mutual Information Feature Engineering)can accurately extract the nonlinear correlation relationship among process variables and can effectively reduce the dimension of feature detection in process monitoring.

New approach to eliminate structural redundancy in case resource pools using α mutual information

Structural redundancy elimination in case resource pools （CRP） is critical for avoiding performance bottlenecks and maintaining robust decision capabilities in cloud computing services. For these purposes, this paper proposes a novel approach to ensure redundancy elimination of a reasoning system in CRP. By using α entropy and mutual information, functional measures to eliminate redundancy of a system are developed with respect to a set of outputs. These measures help to distinguish both the optimal feature and the relations among the nodes in reasoning networks from the redundant ones with the elimination criterion. Based on the optimal feature and its harmonic weight, a model for knowledge reasoning in CRP （CRPKR） is built to complete the task of query matching, and the missing values are estimated with Bayesian networks. Moreover, the robustness of decisions is verified through parameter analyses. This approach is validated by the simulation with benchmark data sets using cloud SQL. Compared with several state-of-the-art techniques, the results show that the proposed approach has a good performance and boosts the robustness of decisions.

ANALYSIS OF THE MUTUAL INFORMATION BETWEEN INPUT AND OUTPUT OF A CLASS OF CLOCK-CONTROLLED SEQUENCES

In this paper, the mutual information between clock-controlled input and output sequences is discussed. It is proved that the mutual information is a strictly monotone increasing function of the length of output sequence, and its divergent rate is gaven.

Dimensionality Reduction by Mutual Information for Text Classification

The frame of text classification system was presented. The high dimensionality in feature space for text classification was studied. The mutual information is a widely used information theoretic measure, in a descriptive way, to measure the stochastic dependency of discrete random variables. The measure method was used as a criterion to reduce high dimensionality of feature vectors in text classification on Web. Feature selections or conversions were performed by using maximum mutual information including linear and non-linear feature conversions. Entropy was used and extended to find right features commendably in pattern recognition systems. Favorable foundation would be established for text classification mining.

Multiplex network infomax:Multiplex network embedding via information fusion

For networking of big data applications,an essential issue is how to represent networks in vector space for further mining and analysis tasks,e.g.,node classification,clustering,link prediction,and visualization.Most existing studies on this subject mainly concentrate on monoplex networks considering a single type of relation among nodes.However,numerous real-world networks are naturally composed of multiple layers with different relation types;such a network is called a multiplex network.The majority of existing multiplex network embedding methods either overlook node attributes,resort to node labels for training,or underutilize underlying information shared across multiple layers.In this paper,we propose Multiplex Network Infomax(MNI),an unsupervised embedding framework to represent information of multiple layers into a unified embedding space.To be more specific,we aim to maximize the mutual information between the unified embedding and node embeddings of each layer.On the basis of this framework,we present an unsupervised network embedding method for attributed multiplex networks.Experimental results show that our method achieves competitive performance on not only node-related tasks,such as node classification,clustering,and similarity search,but also a typical edge-related task,i.e.,link prediction,at times even outperforming relevant supervised methods,despite that MNI is fully unsupervised.

Characteristics analysis of acupuncture electroencephalograph based on mutual information Lempel-Ziv complexity

As a convenient approach to the characterization of cerebral cortex electrical information, electroencephalograph （EEG） has potential clinical application in monitoring the acupuncture effects. In this paper, a method composed of the mutual information method and Lempel-Ziv complexity method （MILZC） is proposed to investigate the effects of acupuncture on the complexity of information exchanges between different brain regions based on EEGs. In the experiments, eight subjects are manually acupunctured at ＇Zusanli＇ acupuncture point （ST-36） with different frequencies （i.e., 50, 100, 150, and 200 times/min） and the EEGs are recorded simultaneously. First, MILZC values are compared in general. Then average brain connections are used to quantify the effectiveness of acupuncture under the above four frequencies. Finally, significance index P values are used to study the spatiality of the acupuncture effect on the brain. Three main findings are obtained： （i） MILZC values increase during the acupuncture; （ii） manual acupunctures （MAs） with 100 times/rain and 150 times/min are more effective than with 50 times/min and 200 times/rain; （iii） contralateral hemisphere activation is more prominent than ipsilateral hemisphere＇s. All these findings suggest that acupuncture contributes to the increase of brain information exchange complexity and the MILZC method can successfully describe these changes.

Feature selection algorithm for text classification based on improved mutual information

In order to solve the poor performance in text classification when using traditional formula of mutual information (MI),a feature selection algorithm were proposed based on improved mutual information.The improved mutual information algorithm,which is on the basis of traditional improved mutual information methods that enhance the MI value of negative characteristics and feature's frequency,supports the concept of concentration degree and dispersion degree.In accordance with the concept of concentration degree and dispersion degree,formulas which embody concentration degree and dispersion degree were constructed and the improved mutual information was implemented based on these.In this paper,the feature selection algorithm was applied based on improved mutual information to a text classifier based on Biomimetic Pattern Recognition and it was compared with several other feature selection methods.The experimental results showed that the improved mutual information feature selection method greatly enhances the performance compared with traditional mutual information feature selection methods and the performance is better than that of information gain.Through the introduction of the concept of concentration degree and dispersion degree,the improved mutual information feature selection method greatly improves the performance of text classification system.

Feature selection based on mutual information and redundancy-synergy coefficient

Mutual information is an important information measure for feature subset. In this paper, a hashing mechanism is proposed to calculate the mutual information on the feature subset. Redundancy-synergy coefficient, a novel redundancy and synergy measure of features to express the class feature, is defined by mutual information. The information maximization rule was applied to derive the heuristic feature subset selection method based on mutual information and redundancy-synergy coefficient. Our experiment results showed the good performance of the new feature selection method.

Evaluation Criteria Based on Mutual Information for Classifications Including Rejected Class

与用表演措施的常规评估标准不同，信息理论基于在场的标准在机器学习的应用的一个唯一的有益的特征。然而，我们仍然远非正在拥有熵类型标准的深入的理解，说，在与常规基于表演的标准的关系。这份报纸学习通用分类问题，它包括一拒绝，或未知，班。我们在场基本公式和分类基于信息学习的图解的图理论。一个靠近形式的方程为通用分类问题在规范的相互的信息和扩充混乱矩阵之间被导出。敏感方程的三个定理和定理集合为学习在相互的信息和常规表演索引之间的关系被给。我们也与常规标准比较举与相互的信息标准的优点和限制有关的数字例子和几讨论。

Fuzzy entropy design for non convex fuzzy set and application to mutual information

Fuzzy entropy was designed for non convex fuzzy membership function using well known Hamming distance measure.The proposed fuzzy entropy had the same structure as that of convex fuzzy membership case.Design procedure of fuzzy entropy was proposed by considering fuzzy membership through distance measure,and the obtained results contained more flexibility than the general fuzzy membership function.Furthermore,characteristic analyses for non convex function were also illustrated.Analyses on the mutual information were carried out through the proposed fuzzy entropy and similarity measure,which was also dual structure of fuzzy entropy.By the illustrative example,mutual information was discussed.

k-NN Based Bypass Entropy and Mutual Information Estimation for Incremental Remote-Sensing Image Compressibility Evaluation

Incremental image compression techniques using priori information are of significance to deal with the explosively increasing remote-sensing image data. However, the potential benefi ts of priori information are still to be evaluated quantitatively for effi cient compression scheme designing. In this paper, we present a k-nearest neighbor(k-NN) based bypass image entropy estimation scheme, together with the corresponding mutual information estimation method. Firstly, we apply the k-NN entropy estimation theory to split image blocks, describing block-wise intra-frame spatial correlation while avoiding the curse of dimensionality. Secondly, we propose the corresponding mutual information estimator based on feature-based image calibration and straight-forward correlation enhancement. The estimator is designed to evaluate the compression performance gain of using priori information. Numerical results on natural and remote-sensing images show that the proposed scheme obtains an estimation accuracy gain by 10% compared with conventional image entropy estimators. Furthermore, experimental results demonstrate both the effectiveness of the proposed mutual information evaluation scheme, and the quantitative incremental compressibility by using the priori remote-sensing frames.

Exploring the characteristics of acupoints in the treatment of stroke with complex network and point mutual information method

Objective:Explore the characteristics of acupoints in the treatment of stroke with complex network and point mutual information method.Methods:The complex network and point wise mutual information system-developed by Chinese academy of Chinese medical sciences wereused to analyze the specific acupoints,compatibility,frequency etc.Results:174 acumoxibustion prescriptions were collected,including 163 acupoints.among them eighteen acupoints were used more than 30 times such as Hegu(LI4),Zusanli(ST36),Quchi(LI11)and Fengshi(GB31).The combinations of 31 acupoints were used more than 15 times,such as the combination of Quchi(LI11)and Zusanli(ST36),the combination of acupoint Quchi(LI11)and Jianyu(LI15),Hegu and Quchi(LI11).The most commonly used treatment method for stroke treatment is to dredge the Yangming meridian and Shaoyang meridian through acupuncture the multiple acupoints located on these two meridians..The commonly used acupoints are mainly distributed in the limbs,head and face.The most commonly used specific acupoint is intersection acupoint.The usage frequency of specific acupoints are higher than that of non-specific acupoints.Conclusion:Dredging the collaterals,dispelling wind-evil and restoring consciousness are the main principle for the treatment of stroke.Specific acupoints in head,face and climbs maybe the main targeted acupoints.Combination of Yang meridians with other meridians is needed to improve the effects.The Yangming meridian and Shaoyang meridian are most used meridians and Hegu(LI4),Quchi(LI11)and Zusanli(ST36)are the most used acupionts.

Mutual Information and Relative Entropy of Sequential Effect Algebras

In this paper,we introduce and investigate the mutual information and relative entropy on the sequentialeffect algebra,we also give a comparison of these mutual information and relative entropy with the classical ones by thevenn diagrams.Finally,a nice example shows that the entropies of sequential effect algebra depend extremely on theorder of its sequential product.

Registration Method for CT-MR Image Based on Mutual Information

Medical image registration is important in many medical applications. Registration method based on maximization of mutual information of voxel intensities is one of the most popular methods for 3-D multi-modality medical image registration. Generally, the optimization process is easily trapped in local maximum, resulting in wrong registration results. In order to find the correct optimum, a new multi-resolution approach for brain image registration based on normalized mutual information is proposed. In this method, to eliminate the effect of local optima, multi-scale wavelet transformation is adopted to extract the image edge features. Then the feature images are registered, and the result at this level is taken as the initial estimate for the registration of the original images. Three-dimensional volumes are used to test the algorithm. Experimental results show that the registration strategy proposed is a robust and efficient method which can reach sub-voxel accuracy and improve the optimization speed.

Measuring causality by taking the directional symbolic mutual information approach

We propose a novel measure to assess causality through the comparison of symbolic mutual information between the future of one random quantity and the past of the other.This provides a new perspective that is different from the conventional conceptions.Based on this point of view,a new causality index is derived that uses the definition of directional symbolic mutual information.This measure presents properties that are different from the time delayed mutual information since the symbolization captures the dynamic features of the analyzed time series.In addition to characterizing the direction and the amplitude of the information flow,it can also detect coupling delays.This method has the property of robustness,conceptual simplicity,and fast computational speed.

Dependence of Mutual Information of Big Protein Sequence

The mutual information function is used to describe the auto-correlation of amino acids in protein. We find two interesting phenomenon: (1) for any given big protein, the mutual information function I(k) is almost a const, where k is the length of gap. (2) for any two sequence similar proteins, the mutual information are nearly the same. As a consequent, we may use mutual information of protein as a character for sequences comparison.