Fisher–Shannon analysis of seismograms of tsunamigenic and non-tsunamigenic earthquakes

Recognizing the tsunamigenic potential of an earthquake presents a challenge in the context of studies devoted to early warnings of tsunami events. In this paper, we show the feasibility of discriminating between tsunamigenic and non-tsunamigenic earthquakes by analyzing seismograms on the basis of the Fisher–Shannon method, which is used to analyze the order/organization structure of a complex and nonstationary time series. The results obtained results show that by combining the measures of the Shannon entropy power and the Fisher information measure, the discrimination between the two groups—tsunamigenic and non-tsunamigenic earthquakes—is very efficiently achieved. These results could contribute to the assessment of tsunami early warning systems.     

Quantum Dynamical Approach to Various Scattering Mechanisms and Their Influences on Thermal Conductivity of Sr- and Zn-Doped La2CuO4 High-Temperature Superconductor Cuprate

JETP Letters - A theoretical investigation of the thermal conductivity of lightly Sr- and Zn-doped La2CuO4 high temperature superconductor cuprates has been analyzed auspiciously. We used a quantum...     

Synthesis of 3-aryl-4-oxothiazolin-2-yl(4-ethoxy-3-methoxy)phenyl hydrazones as possible anticonvulsants

Several 3-aryl-4-oxo-thiazolin-2-yl(4-ethoxy-3-methoxy)phenyl hydrazones were synthesized and evaluated for their anticonvulsant activity. Three of these substituted hydrazones provided 80% protection against pentylenetetrazol-induced convulsions in mice.     

Fixed Point Theorems for Weakly Contractive Mappings in Ordered Metric Spaces with an Application

In this paper, we prove fixed point theorem for weakly contractive mappings using locally $T$-transitivity of binary relation and presenting an analogous version of Harjani and Sadarangani theorem involving more general relation theoretic metrical notions. Our fixed point results under universal relation reduces to Harjani and Sadarangani [Nonlinear Anal., 71 (2009), 3403–3410] fixed point theorems. In this way we also generalize some of the recent fixed point theorems for weak contraction in the existing literature.     

Magnetic properties and Fe NMR studies of U-type hexaferrites

U-type hexaferrites with compositions Ba₄Me₂Fe₃₆O₆₀ (Me=Cu, Fe, Co, Mn and Mg) have been synthesized and characterized by magnetization measurements and zero field ⁵⁷Fe nuclear magnetic resonance (NMR) spectra. The NMR spectra show resonance peaks corresponding to different crystallographic sites of iron (tetrahedral, octahedral and trigonal bipyramidal) with integral intensities according to their site multiplicity. In comparison with the NMR spectrum of M-type barium hexaferrite the intensities of some of the peaks arising due to iron sublattices (f_IV, a and b sites) are different, though there is no difference in peak positions indicating the same local hyperfine field strength at Fe nuclei. The maximum saturation magnetization at room temperature was found in Cu₂U (70 emu/g) and Fe₂U (67 emu/g). The Curie temperatures, saturation magnetizations and coercitivities for the U-type hexaferrites are given.     

An efficient algorithm to clip a 2D-polygon against a rectangular clip window

Polygon clipping is of great importance in computer graphics.One of the popular algorithms to clip a polygon is Cohan–Sutherland Hodgeman algorithm which is based on line clipping.Cohan–Sutherland Hodgeman algorithm clips the polygon against the given rectangular clip window with the help of line clipping method.Cohan–Sutherland algorithm requires traversing the polygon in anti clockwise direction(positive orientation).In this work we propose an efficient polygon clipping algorithm against a rectangular clip window.Proposed algorithm uses parametric representation of polygon edges.Using the concept of point clipping,we can find required intersection points of edges of polygon with clip window boundaries.Well suited numerical illustrations are used to explain the proposed polygon clipping method.The proposed algorithm is computationally less expensive and comprehensive.