Minimization Problems Based on Relative alpha-Entropy I: Forward Projection

Minimization problems with respect to a one-parameter family of generalized relative entropies are studied. These relative entropies, which we term relative alpha-entropies (denoted I-alpha), arise as redundancies under mismatched compression when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the usual relative entropy (Kullback-Leibler divergence). Just like relative entropy, these relative alpha-entropies behave like squared Euclidean distance and satisfy the Pythagorean property. Minimizers of these relative alpha-entropies on closed and convex sets are shown to exist. Such minimizations generalize the maximum Renyi or Tsallis entropy principle. The minimizing probability distribution (termed forward I-alpha-projection) for a linear family is shown to obey a power-law. Other results in connection with statistical inference, namely subspace transitivity and iterated projections, are also established. In a companion paper, a related minimization problem of interest in robust statistics that leads to a reverse I-alpha-projection is studied.

Efficient use of correlation entropy for analysing time series data

The correlation dimension D 2 and correlation entropy K 2 are both important quantifiers in nonlinear time series analysis. However, use of D 2 has been more common compared to K 2 as a discriminating measure. One reason for this is that D 2 is a static measure and can be easily evaluated from a time series. However, in many cases, especially those involving coloured noise, K 2 is regarded as a more useful measure. Here we present an efficient algorithmic scheme to compute K 2 directly from a time series data and show that K 2 can be used as a more effective measure compared to D 2 for analysing practical time series involving coloured noise.

Information theory and one-dimensional disordered conductors

A novel method is proposed to treat the problem of the random resistance of a strictly one-dimensional conductor with static disorder. It is suggested, for the probability distribution of the transfer matrix of the conductor, the distribution of maximum information-entropy, constrained by the following physical requirements: 1) flux conservation, 2) time-reversal invariance and 3) scaling, with the length of the conductor, of the two lowest cumulants of ζ, where = sh2ζ. The preliminary results discussed in the text are in qualitative agreement with those obtained by sophisticated microscopic theories.

Adsorption isitherms for neutral organic compounds-A hierarchy in modelling: Part IV. Charge of maximum adsorption-Statistical mechanical basis

The charge at which adsorption of orgamc compounds attains a maximum ( \sigma MAX M) at an electrochenucal interface is analysed using several multi-state models in a hierarchical manner The analysis is based on statistical mechamcal results for the following models (A) two-state site parity, (B) two-state muhl-slte, and (C) three-state site parity The coulombic interactions due to permanent and reduced dipole effects (using mean field approximation), electrostatic field effects and specific substrate interactions have been taken into account. The simplest model in the hierarchy (two-state site parity) yields the exphcit dependence of ( \sigma MAX M) on the permanent dipole moment, polarizability of the solvent and the adsorbate, lattice spacing, effective coordination number, etc Other models in the baerarchy bring to hght the influence of the solvent structure and the role of substrate interactions, etc As a result of this approach, the "composition" of oM.x m terms of the fundamental molecular constants becomes clear. With a view to use these molecular results to maxamum advantage, the derived results for ( \sigma MAX M) have been converted into those involving experimentally observable parameters lake Co, C 1, E N, etc Wherever possible, some of the earlier phenomenologlcal relations reported for ( \sigma MAX M), notably by Parsons, Damaskm and Frumkln, and Trasattl, are shown to have a certain molecular basis, vlz a simple two-state sate panty model.As a corollary to the hxerarcbacal modelling, \sigma MAX M and the potential corresponding to at (Emax) are shown to be constants independent of 0max or Corg for all models The lmphcatlon of our analysis f o r OmMa x with respect to that predicted by the generalized surface layer equation (which postulates Om~ and Ema x varlaUon with 0) is discussed in detail Finally we discuss an passing o M. and the electrosorptlon valency an this context.

Acyclic Edge Coloring of Graphs with Maximum Degree 4

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a'(G) <= Delta+2, where Delta=Delta(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Delta(G)<= 4, with the additional restriction that m <= 2n-1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m <= 2n, when Delta(G)<= 4. It follows that for any graph G if Delta(G)<= 4, then a'(G) <= 7.

Theoretical Maximum Limits on Power-Handling Capacity of HVDC Cables

In the case of an ac cable, power transmission is limited by the length of the cable due to the capacitive reactive current component. It is well known that high-voltage direct current (HVDC) cables do not have such limitations. However, insulation-related thermal problems pose a limitation on the power capability of HVDC cables. The author presents a viable theoretical development, a logical extension to Whitehead's theory on thermal limitations of the insulation. The computation of the maximum power-carrying capability of HVDC cables subject to limits on the maximum operable temperature of the insulation is presented. The limitation on the power-carrying capability is closely associated with the electrothermal insulation failure. The effect of environmental interaction by way of external thermal resistance, an important aspect, is also considered in the formulations. The Lagrange multiplier method has been used to handle the ensuing optimization problem. The theory is based on an accepted theory of thermal breakdown in insulation and is an important and a coherent extension of great significance.

Information theory and resistance fluctuations in one-dimensional disordered conductors

A novel method is proposed to treat the problem of the random resistance of a strictly one-dimensional conductor with static disorder. For the probability distribution of the transfer matrix R of the conductor we propose a distribution of maximum information entropy, constrained by the following physical requirements: (1) flux conservation, (2) time-reversal invariance, and (3) scaling with the length of the conductor of the two lowest cumulants of ω, where R=exp(iω→⋅Jbhat). The preliminary results discussed in the text are in qualitative agreement with those obtained by sophisticated microscopic theories.

Approximation algorithm for maximum independent set in planar traingle-free graphs

The maximum independent set problem is NP-complete even when restricted to planar graphs, cubic planar graphs or triangle free graphs. The problem of finding an absolute approximation still remains NP-complete. Various polynomial time approximation algorithms, that guarantee a fixed worst case ratio between the independent set size obtained to the maximum independent set size, in planar graphs have been proposed. We present in this paper a simple and efficient, O(|V|) algorithm that guarantees a ratio 1/2, for planar triangle free graphs. The algorithm differs completely from other approaches, in that, it collects groups of independent vertices at a time. Certain bounds we obtain in this paper relate to some interesting questions in the theory of extremal graphs.

Thermodynamic and kinetic studies on saccharide binding to soya-bean agglutinin.

The fluorescence of N-dansylgalactosamine [N-(5-dimethylaminonaphthalene-1-sulphonyl)galactosamine] was enhanced 11-fold with a 25 nm blue-shift in the emission maximum upon binding to soya-bean agglutinin (SBA). This change was used to determine the association constants and thermodynamic parameters for this interaction. The association constant of 1.51 X 10(6) M-1 at 20 degrees C indicated a very strong binding, which is mainly due to a relatively small entropy value, as revealed by the thermodynamic parameters: delta G = -34.7 kJ X mol-1, delta H = -37.9 kJ X mol-1 and delta S = -10.9 J X mol-1 X K-1. The specific binding of this sugar to SBA shows that the lectin can accommodate a large hydrophobic substituent on the C-2 of galactose. Binding of non-fluorescent ligands, studied by monitoring the fluorescence changes when they are added to a mixture of SBA and N-dansylgalactosamine, indicates that a hydrophobic substituent at the anomeric position increases the affinity of the interaction. The C-6 hydroxy group also stabilizes the binding considerably. Kinetics of binding of N-dansylgalactosamine to SBA studied by stopped-flow spectrofluorimetry are consistent with a single-step mechanism and yielded k+1 = 2.4 X 10(5) M-1 X s-1 and k-1 = 0.2 s-1 at 20 degrees C. The activation parameters indicate an enthalpicly controlled association process.

Discussion of enthalpy, entropy and free energy of formation of GaN

Presented in this letter is a critical discussion of a recent paper on experimental investigation of the enthalpy, entropy and free energy of formation of gallium nitride (GaN) published in this journal [T.J. Peshek, J.C. Angus, K. Kash, J. Cryst. Growth 311 (2008) 185-189]. It is shown that the experimental technique employed detects neither the equilibrium partial pressure of N-2 corresponding to the equilibrium between Ga and GaN at fixed temperatures nor the equilibrium temperature at constant pressure of N-2. The results of Peshek et al. are discussed in the light of other information on the Gibbs energy of formation available in the literature. Entropy of GaN is derived from heat-capacity measurements. Based on a critical analysis of all thermodynamic information now available, a set of optimized parameters is identified and a table of thermodynamic data for GaN developed from 298.15 to 1400 K.

On the Maximum Cloud Zone and the ITCZ over Indian, Longitudes during the Southwest Monsoon

An investigation is presented of the daily variation of the maximum cloud zone (MCZ) and the 7W mb trough in the Northern Hemisphere over the Indian longitudes 70–90°E during April–October for 1973–77. It is found that during June–September there are two favorable locations for a MCZ over these longitudes–on a majority of days the MCZ is present in the monsoon zone north of 15°N, and often a secondary MCZ occurs in the equatorial region (0–10°N). The monsoon MCZ gets established by northward movement of the MCZ occurring over the equatorial Indian ocean in April and May. The secondary MCZ appears intermittently, and is characterized by long spells of persistence only when the monsoon MCZ is absent. In each of the seasons studied, the MCZ temporarily disappeared from the mean summer monsoon location (15–28°N) about four weeks after it was established near the beginning of July. It is reestablished by the northward movement of the secondary MCZ, which becomes active during the absence of the monsoon MCZ, in a manner strikingly similar to that observed in the spring to summer transition. A break in monsoon conditions prevails just prior to the temporary disappearance of the monsoon MCZ. Thus we conclude that the monsoon MCZ cannot survive for longer than a month without reestablishment by the secondary MCZ. Possible underlying mechanisms are also discussed.

Optimal simultaneous maximum a posterioriestimation of states, noise statistics and parameters I. Algorithm

The simultaneous state and parameter estimation problem for a linear discrete-time system with unknown noise statistics is treated as a large-scale optimization problem. The a posterioriprobability density function is maximized directly with respect to the states and parameters subject to the constraint of the system dynamics. The resulting optimization problem is too large for any of the standard non-linear programming techniques and hence an hierarchical optimization approach is proposed. It turns out that the states can be computed at the first levelfor given noise and system parameters. These, in turn, are to be modified at the second level.The states are to be computed from a large system of linear equations and two solution methods are considered for solving these equations, limiting the horizon to a suitable length. The resulting algorithm is a filter-smoother, suitable for off-line as well as on-line state estimation for given noise and system parameters. The second level problem is split up into two, one for modifying the noise statistics and the other for modifying the system parameters. An adaptive relaxation technique is proposed for modifying the noise statistics and a modified Gauss-Newton technique is used to adjust the system parameters.

Optimal simultaneous maximum a posterioriestimation of states, noise statistics and parameters II. Numerical performance

A very general and numerically quite robust algorithm has been proposed by Sastry and Gauvrit (1980) for system identification. The present paper takes it up and examines its performance on a real test example. The example considered is the lateral dynamics of an aircraft. This is used as a vehicle for demonstrating the performance of various aspects of the algorithm in several possible modes.

Comments on "Diffuse sound reflection by maximum length sequences"

Some improvements are suggested to Schroeder's scheme [J. Acoust. Soc. Am. 57, 149–150 (1975)] of achieving diffuse sound reflection in concert halls.Subject Classification

Compact AM Signals for Maximum Clutter Rejection

The transmitted signal is assumed to consist of a close succession of rectangular pulses of equal width. A matched filter scheme is employed and a theory is developed for a computer-aided optimization of the envelope of monotone compact signals for maximum rejection of dense clutter of any given distribution in range. Specific results are presented and indeterminate cases are discussed.