The 18 September 2011, North Sikkim earthquake

The 18 September 2011, magnitude Mw 6.9 earthquake close to the Nepal-Sikkim border caused significant damage due to ground shaking and caused several landslides. Observations from the post-earthquake surveys in the affected areas within Sikkim suggest that the poorly engineered, multistoried structures were relatively more impacted. Those located on alluvial terraces were also affected. The morphology of the region is prone to landslides and the possibility for their increased intensity during the forthcoming monsoon need to be considered seriously. From the seismotectonic perspective, the mid-crustal focal depth of the North Sikkim earthquake reflects the ongoing deformation of the subducting Indian plate.

Rainbow Connection Number and Connectivity

The rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. Our main result is that rc(G) <= inverted right perpendicularn/2inverted left perpendicular for any 2-connected graph with at least three vertices. We conjecture that rc(G) <= n/kappa + C for a kappa-connected graph G of order n, where C is a constant, and prove the conjecture for certain classes of graphs. We also prove that rc(G) < (2 + epsilon)n/kappa + 23/epsilon(2) for any epsilon > 0.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a(1), b(1)] x [a(2), b(2)] x ... x [a(k), b(k)]. The boxicity of G, box(G), is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes; i.e., each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset, where S is the ground set and P is a reflexive, antisymmetric and transitive binary relation on S. The dimension of P, dim(P), is the minimum integer t such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P; i.e., S is the vertex set and two vertices are adjacent if and only if they are comparable in P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. It immediately follows that if P is a height-2 poset, then box(G(P)) <= dim(P) <= 2box(G(P)) since the underlying comparability graph of a height-2 poset is a bipartite graph. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with the extended double cover of G, denoted as G(c): Note that G(c) is a bipartite graph with partite sets A and B which are copies of V (G) such that, corresponding to every u is an element of V (G), there are two vertices u(A) is an element of A and u(B) is an element of B and {u(A), v(B)} is an edge in G(c) if and only if either u = v or u is adjacent to v in G. Let P(c) be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P(c)) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension such as dim(P) = 2 tree width (G(P)) + 4, since boxicity of any graph is known to be at most its tree width + 2. In the other direction, using the already known bounds for partial order dimension we get the following: (1) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta), which is an improvement over the best-known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-is an element of)) for any is an element of > 0 unless NP = ZPP.

The hazard potential of the western segment of the Makran subduction zone, northern Arabian Sea

Evaluating the hazard potential of the Makran subduction zone requires understanding the previous records of the large earthquakes and tsunamis. We address this problem by searching for earthquake and tectonic proxies along the Makran Coast and linking those observations with the available constraints on historical seismicity and the tell-tale characteristics of sea floor morphology. The earthquake of Mw 8.1 of 1945 and the consequent tsunami that originated on the eastern part of the Makran are the only historically known hazardous events in this region. The seismic status of the western part of the subduction zone outside the rupture area of the 1945 earthquake remains an enigma. The near-shore shallow stratigraphy of the central part of Makran near Chabahar shows evidence of seismically induced liquefaction that we attribute to the distant effects of the 1945 earthquake. The coastal sites further westward around Jask are remarkable for the absence of liquefaction features, at least at the shallow level. Although a negative evidence, this possibly implies that the western part of Makran Coast region may not have been impacted by near-field large earthquakes in the recent past-a fact also supported by the analysis of historical data. On the other hand, the elevated marine terraces on the western Makran and their uplift rates are indicative of comparable degree of long-term tectonic activity, at least around Chabahar. The offshore data suggest occurrences of recently active submarine slumps on the eastern part of the Makran, reflective of shaking events, owing to the great 1945 earthquake. The ocean floor morphologic features on the western segment, on the contrary, are much subdued and the prograding delta lobes on the shelf edge also remain intact. The coast on the western Makran, in general, shows indications of progradation and uplift. The various lines of evidence thus suggest that although the western segment is potentially seismogenic, large earthquakes have not occurred there in the recent past, at least during the last 600 years. The recurrence period of earthquakes may range up to 1,000 years or more, an assessment based on the age of the youngest dated coastal ridge. The long elapsed time points to the fact that the western segment may have accumulated sufficient slip to produce a major earthquake.

Crystal growth and nonlinear optical properties of sodium D-isoascorbate monohydrate

Optical quality single crystals of sodium D-isoascorbate monohydrate were grown by a slow cooling technique. The crystal possesses a bulky prismatic morphology. Thermal analyses indicate that the crystals are stable up to 125 degrees C. The optical transmission window ranges from 307 nm to 1450 nm. The principal refractive indices have been measured employing Brewster's angle method. The crystallographic and the principal dielectric axes coincide with each other such that a lies along Z, b along X and c along Y. The optic axis is oriented 58 degrees (at 532 nm) to the crystallographic a axis in the XZ plane and the crystal is negative biaxial. Type 1 and type 2 phase matching curves are generated and experimentally verified. No polarization dependence of the light absorption was observed confirming the validity of Kleinman's symmetry conjecture, leading to a single nonvanishing nonlinear tensor component. According to Hobden's classification the crystal belongs to class 3. The crystal also exhibits second order noncollinear conic sections. The single shot and multiple shot surface laser damage thresholds are determined to be 32.7 GW cm(-2) and 6.5 GW cm(-2) respectively for 1064 nm radiation.

On stellated spheres and a tightness criterion for combinatorial manifolds

We introduce k-stellated spheres and consider the class W-k(d) of triangulated d-manifolds, all of whose vertex links are k-stellated, and its subclass W-k*; (d), consisting of the (k + 1)-neighbourly members of W-k(d). We introduce the mu-vector of any simplicial complex and show that, in the case of 2-neighbourly simplicial complexes, the mu-vector dominates the vector of Betti numbers componentwise; the two vectors are equal precisely for tight simplicial complexes. We are able to estimate/compute certain alternating sums of the components of the mu-vector of any 2-neighbourly member of W-k(d) for d >= 2k. As a consequence of this theory, we prove a lower bound theorem for such triangulated manifolds, and we determine the integral homology type of members of W-k*(d) for d >= 2k + 2. As another application, we prove that, when d not equal 2k + 1, all members of W-k*(d) are tight. We also characterize the tight members of W-k*(2k + 1) in terms of their kth Betti numbers. These results more or less answer a recent question of Effenberger, and also provide a uniform and conceptual tightness proof for all except two of the known tight triangulated manifolds. We also prove a lower bound theorem for homology manifolds in which the members of W-1(d) provide the equality case. This generalizes a result (the d = 4 case) due to Walkup and Kuhnel. As a consequence, it is shown that every tight member of W-1 (d) is strongly minimal, thus providing substantial evidence in favour of a conjecture of Kuhnel and Lutz asserting that tight homology manifolds should be strongly minimal. (C) 2013 Elsevier Ltd. All rights reserved.

Fast-Decodable MIDO Codes With Large Coding Gain

In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of two complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input double output (MIDO) systems. Using this method, rate-2 STBCs for 4 x 2, 6 x 2, 8 x 2, and 12 x 2 systems are constructed and these STBCs are fast ML-decodable, have large coding gains, and STBC-schemes consisting of these STBCs have a non-vanishing determinant (NVD) so that they are DMT-optimal for their respective MIDO systems. It is also shown that the Srinath-Rajan code for the 4 x 2 system, which has the lowest ML-decoding complexity among known rate-2 STBCs for the 4x2 MIDO system with a large coding gain for 4-/16-QAM, has the same algebraic structure as the STBC constructed in this paper for the 4 x 2 system. This also settles in positive a previous conjecture that the STBC-scheme that is based on the Srinath-Rajan code has the NVD property and hence is DMT-optimal for the 4 x 2 system.

Universal power law in crossover from integrability to quantum chaos

We study models of interacting fermions in one dimension to investigate the crossover from integrability to nonintegrability, i.e., quantum chaos, as a function of system size. Using exact diagonalization of finite-sized systems, we study this crossover by obtaining the energy level statistics and Drude weight associated with transport. Our results reinforce the idea that for system size L -> infinity nonintegrability sets in for an arbitrarily small integrability-breaking perturbation. The crossover value of the perturbation scales as a power law similar to L-eta when the integrable system is gapless. The exponent eta approximate to 3 appears to be robust to microscopic details and the precise form of the perturbation. We conjecture that the exponent in the power law is characteristic of the random matrix ensemble describing the nonintegrable system. For systems with a gap, the crossover scaling appears to be faster than a power law.

Finite size scaling in crossover among different random matrix ensembles in microscopic lattice models

Using numerical diagonalization we study the crossover among different random matrix ensembles (Poissonian, Gaussian orthogonal ensemble (GOE), Gaussian unitary ensemble (GUE) and Gaussian symplectic ensemble (GSE)) realized in two different microscopic models. The specific diagnostic tool used to study the crossovers is the level spacing distribution. The first model is a one-dimensional lattice model of interacting hard-core bosons (or equivalently spin 1/2 objects) and the other a higher dimensional model of non-interacting particles with disorder and spin-orbit coupling. We find that the perturbation causing the crossover among the different ensembles scales to zero with system size as a power law with an exponent that depends on the ensembles between which the crossover takes place. This exponent is independent of microscopic details of the perturbation. We also find that the crossover from the Poissonian ensemble to the other three is dominated by the Poissonian to GOE crossover which introduces level repulsion while the crossover from GOE to GUE or GOE to GSE associated with symmetry breaking introduces a subdominant contribution. We also conjecture that the exponent is dependent on whether the system contains interactions among the elementary degrees of freedom or not and is independent of the dimensionality of the system.

Formation of Prestellar Cores via Non-Isothermal Gas Fragmentation

Sheet-like clouds are common in turbulent gas and perhaps form via collisions between turbulent gas flows. Having examined the evolution of an isothermal shocked slab in an earlier contribution, in this work we follow the evolution of a sheet-like cloud confined by (thermal) pressure and gas in it is allowed to cool. The extant purpose of this endeavour is to study the early phases of core-formation. The observed evolution of this cloud supports the conjecture that molecular clouds themselves are three-phase media (comprising viz. a stable cold and warm medium, and a third thermally unstable medium), though it appears, clouds may evolve in this manner irrespective of whether they are gravitationally bound. We report, this sheet fragments initially due to the growth of the thermal instability (TI) and some fragments are elongated, filament-like. Subsequently, relatively large fragments become gravitationally unstable and sub-fragment into smaller cores. The formation of cores appears to be a three stage process: first, growth of the TI leads to rapid fragmentation of the slab; second, relatively small fragments acquire mass via gas-accretion and/or merger and third, sufficiently massive fragments become susceptible to the gravitational instability and sub-fragment to form smaller cores. We investigate typical properties of clumps (and smaller cores) resulting from this fragmentation process. Findings of this work support the suggestion that the weak velocity field usually observed in dense clumps and smaller cores is likely seeded by the growth of dynamic instabilities. Simulations were performed using the smooth particle hydrodynamics algorithm.

MRT Letter: A Unified Accelerated Maximum Likelihood Technique for Widefield, Confocal, and Super-Resolution 4Pi Microscopy

We propose an algorithmic technique for accelerating maximum likelihood (ML) algorithm for image reconstruction in fluorescence microscopy. This is made possible by integrating Biggs-Andrews (BA) method with ML approach. The results on widefield, confocal, and super-resolution 4Pi microscopy reveal substantial improvement in the speed of 3D image reconstruction (the number of iterations has reduced by approximately one-half). Moreover, the quality of reconstruction obtained using accelerated ML closely resembles with nonaccelerated ML method. The proposed technique is a step closer to realize real-time reconstruction in 3D fluorescence microscopy. Microsc. Res. Tech. 78:331-335, 2015. (c) 2015 Wiley Periodicals, Inc.

Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks

In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has ``custody'' of a packet and has to choose one among a set of next-hop relay nodes to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local relay selection problem consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to probe a relay to learn its reward value, based on which the forwarder can then decide whether to stop (and forward its packet to the chosen relay) or to continue to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of stopping sets and probing sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.

On the Bounds of Certain Maximal Linear Codes in a Projective Space

The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) + dim(Y)-2dim(X boolean AND Y) defined on P-q(n) turns it into a natural coding space for error correction in random network coding. A subset of P-q(n) is called a code and the subspaces that belong to the code are called codewords. Motivated by classical coding theory, a linear coding structure can be imposed on a subset of P-q(n). Braun et al. conjectured that the largest cardinality of a linear code, that contains F-q(n), is 2(n). In this paper, we prove this conjecture and characterize the maximal linear codes that contain F-q(n).

Separation index of graphs and stacked 2-spheres

In 1987, Kalai proved that stacked spheres of dimension d >= 3 are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result does not extend to dimension d = 2. In this article, we give a characterisation of stacked 2-spheres using what we call the separation index. Namely, we show that the separation index of a triangulated 2-sphere is maximal if and only if it is stacked. In addition, we prove that, amongst all n-vertex triangulated 2-spheres, the separation index is minimised by some n-vertex flag sphere for n >= 6. Furthermore, we apply this characterisation of stacked 2-spheres to settle the outstanding 3-dimensional case of the Lutz-Sulanke-Swartz conjecture that ``tight-neighbourly triangulated manifolds are tight''. For dimension d >= 4, the conjecture has already been proved by Effenberger following a result of Novik and Swartz. (C) 2015 Elsevier Inc. All rights reserved.