On Match Lengths, Zero Entropy and Large Deviations - with Application to Sliding Window Lempel-Ziv Algorithm

The Sliding Window Lempel-Ziv (SWLZ) algorithm that makes use of recurrence times and match lengths has been studied from various perspectives in information theory literature. In this paper, we undertake a finer study of these quantities under two different scenarios, i) \emph{zero entropy} sources that are characterized by strong long-term memory, and ii) the processes with weak memory as described through various mixing conditions. For zero entropy sources, a general statement on match length is obtained. It is used in the proof of almost sure optimality of Fixed Shift Variant of Lempel-Ziv (FSLZ) and SWLZ algorithms given in literature. Through an example of stationary and ergodic processes generated by an irrational rotation we establish that for a window of size $n_w$, a compression ratio given by $O(\frac{\log n_w}{{n_w}^a})$ where $a$ depends on $n_w$ and approaches 1 as $n_w \rightarrow \infty$, is obtained under the application of FSLZ and SWLZ algorithms. Also, we give a general expression for the compression ratio for a class of stationary and ergodic processes with zero entropy. Next, we extend the study of Ornstein and Weiss on the asymptotic behavior of the \emph{normalized} version of recurrence times and establish the \emph{large deviation property} (LDP) for a class of mixing processes. Also, an estimator of entropy based on recurrence times is proposed for which large deviation principle is proved for sources satisfying similar mixing conditions.Comment: accepted to appear in IEEE Transactions on Information Theor

Study of effective interaction from single particle transfer reactions on f-p shell nuclei

The present study concentrates on the average effective two-body interaction matrix elements being extracted, using sum-rule techniques, from transfer reactions on target states having single orbital as well as two orbitaloccupancy. This investigation deals with transfer reactions on f-p shell nuclei involving (i) $1f_{7/2}$ and $2p_{3/2}$ transfer on target states using $^{40}$Ca as inert core, and (ii) $2p_{3/2}$ and$1f_{5/2}$ transfer on states using $^{56}$Ni as core.Comment: 12 pages, ptptex Subj-Classes: Nuclear Shell Structure e-mail:[email protected]

Effective two-body interactions in the s-d shell nuclei from sum rules equations in tranfer reactions

Average effective two-body interaction matrix elements in the s-d shell have been extracted, from data on experimentally measured isospin centroids, by combining the recently derived new sum rules equations for pick-up reactions with similar known equations for stripping reactions performed on general multishell target states. Using this combination of stripping and pick-up equations, the average effective matrix elements for the shells, 1d^2_5/2, 2s^2_1/2 and 1d^2_3/2 respectively have been obtained. A new feature of the present work is that the restriction imposed in earlier works on target states, that it be populated only by active neutrons has now been abandoned.Comment: 12 pages, RevTeX, e-mail: [email protected]

Barrier modification in sub-barrier fusion reactions using Wong formula with Skyrme forces in semiclassical formalism

We obtain the nuclear proximity potential by using semiclassical extended Thomas Fermi (ETF) approach in Skyrme energy density formalism (SEDF), and use it in the extended $\ell$-summed Wong formula under frozen density approximation. This method has the advantage of allowing the use of different Skyrme forces, giving different barriers. Thus, for a given reaction, we could choose a Skyrme force with proper barrier characteristics, not-requiring extra ``barrier lowering" or ``barrier narrowing" for a best fit to data. For the $^{64}$Ni+$^{100}$Mo reaction, the $\ell$-summed Wong formula, with effects of deformations and orientations of nuclei included, fits the fusion-evaporation cross section data exactly for the force GSkI, requiring additional barrier modifications for forces SIII and SV. However, the same for other similar reactions, like $^{58,64}$Ni+$^{58,64}$Ni, fits the data best for SIII force. Hence, the barrier modification effects in $\ell$-summed Wong expression depends on the choice of Skyrme force in extended ETF method.Comment: INPC2010, Vancouver, CANAD

Refractometric Determination of Formation Constants of Au(III), Pt(IV), Os(VIII) & Ir(III) Complexes

756-75

Electric power demand forecasting: A case study of Lucknow city

The study of forecasting identifies the urgent need for special attention in evolving effective energy policies to alleviate an energy famine in the near future. Since power demand is increasing day by day in entire world and it is also one of the fundamental infrastructure input for the development, its prospects and availability sets significant constraints on the socio-economic growth of every person as well as every country. A care full long-term power plan is imperative for the development of power sector. This need assumes more importance in the state of Uttar Pradesh where the demand for electrical energy is growing at a rapid pace. This study analyses the requirement of electricity with respect to the future population for the major forms of energy in the Lucknow city in Uttar Pradesh state of India. A model consisting of significant key energy indicators have been used for the estimation. Model wherever required refined in the second stage to remove the effect of auto-correlation. The accuracy of the model has been checked using standard statistical techniques and validated against the past data by testing for 'expost' forecast accuracy

Near-linear Time Algorithm for Approximate Minimum Degree Spanning Trees

Given a graph $G = (V, E)$, we wish to compute a spanning tree whose maximum vertex degree, i.e. tree degree, is as small as possible. Computing the exact optimal solution is known to be NP-hard, since it generalizes the Hamiltonian path problem. For the approximation version of this problem, a $\tilde{O}(mn)$ time algorithm that computes a spanning tree of degree at most $\Delta^* +1$ is previously known [F\"urer \& Raghavachari 1994]; here $\Delta^*$ denotes the minimum tree degree of all the spanning trees. In this paper we give the first near-linear time approximation algorithm for this problem. Specifically speaking, we propose an $\tilde{O}(\frac{1}{\epsilon^7}m)$ time algorithm that computes a spanning tree with tree degree $(1+\epsilon)\Delta^* + O(\frac{1}{\epsilon^2}\log n)$ for any constant $\epsilon \in (0,\frac{1}{6})$. Thus, when $\Delta^*=\omega(\log n)$, we can achieve approximate solutions with constant approximate ratio arbitrarily close to 1 in near-linear time.Comment: 17 page