Mathematics, nature and cryptography: Insights from philosophy of information

One influential image that is popular among scientists is the view that mathematics is the language of nature. The present article discusses another possible way to approach the relation between mathematics and nature, which is by using the idea of information and the conceptual vocabulary of cryptography. This approach allows us to understand the possibility that secrets of nature need not be written in mathematics and yet mathematics is necessary as a cryptographic key to unlock these secrets. Various advantages of such a view are described in this article.

Boundary value problems for third-order nonlinear ordinary differential equations

In this paper, we describe how to analyze boundary value problems for third-order nonlinear ordinary differential equations over an infinite interval. Several physical problems of interest are governed by such systems. The seminumerical schemes described here offer some advantages over solutions obtained by using traditional methods such as finite differences, shooting method, etc. These techniques also reveal the analytic structure of the solution function. For illustrative purposes, several physical problems, mainly drawn from fluid mechanics, are considered; they clearly demonstrate the efficiency of the techniques presented here.

Boundary value problems for third-order nonlinear ordinary differential equations

In this paper, we describe how to analyze boundary value problems for third-order nonlinear ordinary differential equations over an infinite interval. Several physical problems of interest are governed by such systems. The seminumerical schemes described here offer some advantages over solutions obtained by using traditional methods such as finite differences, shooting method, etc. These techniques also reveal the analytic structure of the solution function. For illustrative purposes, several physical problems, mainly drawn from fluid mechanics, are considered; they clearly demonstrate the efficiency of the techniques presented here.

Transient MHD stagnation flow of a non-Newtonian fluid due to impulsive motion from rest

The transient boundary layer flow and heat transfer of a viscous incompressible electrically conducting non-Newtonian power-law fluid in a stagnation region of a two-dimensional body in the presence of an applied magnetic field have been studied when the motion is induced impulsively from rest. The nonlinear partial differential equations governing the flow and heat transfer have been solved by the homotopy analysis method and by an implicit finite-difference scheme. For some cases, analytical or approximate solutions have also been obtained. The special interest are the effects of the power-law index, magnetic parameter and the generalized Prandtl number on the surface shear stress and heat transfer rate. In all cases, there is a smooth transition from the transient state to steady state. The shear stress and heat transfer rate at the surface are found to be significantly influenced by the power-law index N except for large time and they show opposite behaviour for steady and unsteady flows. The magnetic field strongly affects the surface shear stress, but its effect on the surface heat transfer rate is comparatively weak except for large time. On the other hand, the generalized Prandtl number exerts strong influence on the surface heat transfer. The skin friction coefficient and the Nusselt number decrease rapidly in a small interval 0 < t* < 1 and reach the steady-state values for t* >= 4. (C) 2010 Published by Elsevier Ltd.

The Alfvén Wave Equation for Magnetospheric Plasmas

It is shown that besides the continuous spectrum which damps away as inverse power of time, the coupled Alfvén wave equation, which gives coupling between a shear Alfvén wave and a surface wave, can also admit a well behaved harmonic solution in the closed form for a set of initial conditions. This solution, though valid for finite time intervals, points out that the Alfvén surface waves can have a band of frequency (instead of a monochromatic frequency for a nonsheared magnetic field) within which the local field line resonance frequency can lie, and thus can excite magnetic pulsations with latitude-dependent frequency. By considering magnetic fields not only varying in magnitude but also in direction, it is shown that the time interval for the validity of the harmonic solution depend upon the angle between the magnetic field directions on either side of the magnetopause. For small values of the angle the time interval can become appreciably large.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

Epoch extraction from linear prediction residual for identification of closed glottis interval

In voiced speech analysis epochal information is useful in accurate estimation of pitch periods and the frequency response of the vocal tract system. Ideally, linear prediction (LP) residual should give impulses at epochs. However, there are often ambiguities in the direct use of LP residual since samples of either polarity occur around epochs. Further, since the digital inverse filter does not compensate the phase response of the vocal tract system exactly, there is an uncertainty in the estimated epoch position. In this paper we present an interpretation of LP residual by considering the effect of the following factors: 1) the shape of glottal pulses, 2) inaccurate estimation of formants and bandwidths, 3) phase angles of formants at the instants of excitation, and 4) zeros in the vocal tract system. A method for the unambiguous identification of epochs from LP residual is then presented. The accuracy of the method is tested by comparing the results with the epochs obtained from the estimated glottal pulse shapes for several vowel segments. The method is used to identify the closed glottis interval for the estimation of the true frequency response of the vocal tract system.

Profiling of late Tertiary-early Quaternary surface in the lower reaches of Narmada valley using microtremors

In this paper, we propose the first approximation for thickness of Quaternary sediment and late Quaternary early Tertiary topography for the part of lower reaches of Narmada valley in a systematic way using the shallow seismic method, that records both horizontal and vertical components of the microtremor (ambient noise) caused by natural processes. The measurements of microtremors were carried out at 31 sites spaced at a grid interval of 5 km s using Lennartz seismometer (5 s period) and City shark-II data acquisition system. The signals recorded were analysed for horizontal to the vertical (H/V) spectral ratio using GEOPSY software. For the present study, we concentrate on frequency range between 0.2 Hz and 10 Hz. The thickness of unconsolidated sediments at various sites is calculated based on non-linear regression equations proposed by Ibs-von Seht and Wohlenberg (1999) and Parolai et al. (2002). The estimated thickness is used to plot digital elevation model and cross profiles correlating with geomorphology and geology of the study area. (C) 2011 Elsevier Ltd. All rights reserved.

Unsteady compressible boundary layer flow in the stagnation region of a sphere with a magnetic field

Abstract: An analysis is performed to study the unsteady compressible laminar boundary layer flow in the forward stagnation-point region of a sphere with a magnetic field applied normal, to the surface. We have considered the case where there is an initial steady state that is perturbed by the step change in the total enthalpy at the wall. The nonlinear coupled parabolic partial differential equations governing the flow and heat transfer have been solved numerically using a finite-difference scheme. The numerical results are presented, which show the temporal development of the boundary layer. The magnetic field in the presence of variable electrical conductivity causes an overshoot in the velocity profile. Also, when the total enthalpy at the wall is suddenly increased, there is a change in the direction of transfer of heat in a small interval of time.

The complexity of certain incremental code generation problems

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.

Nonlinear measures of QT interval series: novel indices of cardiac repolarization lability: MEDqthr and LLEqthr

In this study, we investigated nonlinear measures of chaos of QT interval time series in 28 normal control subjects, 36 patients with panic disorder and 18 patients with major depression in supine and standing postures. We obtained the minimum embedding dimension (MED) and the largest Lyapunov exponent (LLE) of instantaneous heart rate (HR) and QT interval series. MED quantifies the system's complexity and LLE predictability. There was a significantly lower MED and a significantly increased LLE of QT interval time series in patients. Most importantly, nonlinear indices of QT/HR time series, MEDqthr (MED of QT/HR) and LLEqthr (LLE of QT/HR), were highly significantly different between controls and both patient groups in either posture. Results remained the same even after adjusting for age. The increased LLE of QT interval time, series in patients with anxiety and depression is in line with our previous findings of higher QTvi (QT variability index, a log ratio of QT variability corrected for mean QT squared divided by heart rate variability corrected for mean heart rate squared) in these patients, using linear techniques. Increased LLEqthr (LLE of QT/HR) may be a more sensitive tool to study cardiac repolarization and a valuable addition to the time domain measures such as QTvi. This is especially important in light of the finding that LLEqthr correlated poorly and nonsignificantly with QTvi. These findings suggest an increase in relative cardiac sympathetic activity and a decrease in certain aspects of cardiac vagal function in patients with anxiety as well as depression. The lack of correlation between QTvi and LLEqthr suggests that this nonlinear index is a valuable addition to the linear measures. These findings may also help to explain the higher incidence of cardiovascular mortality in patients with anxiety and depressive disorders. (C) 2002 Elsevier Science Ireland Ltd. All rights reserved.