Data assimilation using ensemble transform Kalman filter (ETKF) in ROMS model for Indian Ocean

Study of Oceans dynamics and forecast is crucial as it influences the regional climate and other marine activities. Forecasting oceanographic states like sea surface currents, Sea surface temperature (SST) and mixed layer depth at different time scales is extremely important for these activities. These forecasts are generated by various ocean general circulation models (OGCM). One such model is the Regional Ocean Modelling System (ROMS). Though ROMS can simulate several features of ocean, it cannot reproduce the thermocline of the ocean properly. Solution to this problem is to incorporates data assimilation (DA) in the model. DA system using Ensemble Transform Kalman Filter (ETKF) has been developed for ROMS model to improve the accuracy of the model forecast. To assimilate data temperature and salinity from ARGO data has been used as observation. Assimilated temperature and salinity without localization shows oscillations compared to the model run without assimilation for India Ocean. Same was also found for u and v-velocity fields. With localization we found that the state variables are diverging within the localization scale.

Physics interplay of the LHC and the ILC

Physics at the Large Hadron Collider (LHC) and the International e(+)e(-) Linear Collider (ILC) will be complementary in many respects, as has been demonstrated at previous generations of hadron and lepton colliders. This report addresses the possible interplay between the LHC and ILC in testing the Standard Model and in discovering and determining the origin of new physics. Mutual benefits for the physics programme at both machines can occur both at the level of a combined interpretation of Hadron Collider and Linear Collider data and at the level of combined analyses of the data, where results obtained at one machine can directly influence the way analyses are carried out at the other machine. Topics under study comprise the physics of weak and strong electroweak symmetry breaking, supersymmetric models, new gauge theories, models with extra dimensions, and electroweak and QCD precision physics. The status of the work that has been carried out within the LHC/ILC Study Group so far is summarized in this report. Possible topics for future studies are outlined.

Synthetic aperture radar: A focus on current problems

Synthetic aperture radar (SAR) is a powerful tool for mapping and remote sensing. The theory and operation of SAR have seen a period of intense activity in recent years. This paper attempts to review some of the more advanced topics studied in connection with modern SAR systems based on digital processing. Following a brief review of the principles involved in the operation of SAR, attention is focussed on special topics such as advanced SAR modelling and focussing techniques, in particular clutterlock and autofocus, Doppler centroid (DC) estimation methods involving seismic migration technique, moving target imaging, bistatic radar imaging, effects of system nonlinearities, etc.

Online Handwritten Kannada Word Recognizer with Unrestricted Vocabulary

In this paper, we propose a novel heuristic approach to segment recognizable symbols from online Kannada word data and perform recognition of the entire word. Two different estimates of first derivative are extracted from the preprocessed stroke groups and used as features for classification. Estimate 2 proved better resulting in 88% accuracy, which is 3% more than that achieved with estimate 1. Classification is performed by statistical dynamic space warping (SDSW) classifier which uses X, Y co-ordinates and their first derivatives as features. Classifier is trained with data from 40 writers. 295 classes are handled covering Kannada aksharas, with Kannada numerals, Indo-Arabic numerals, punctuations and other special symbols like $ and #. Classification accuracies obtained are 88% at the akshara level and 80% at the word level, which shows the scope for further improvement in segmentation algorithm

Mode-coupling glass transition in a fluid confined by a periodic potential

We show that a fluid under strong spatially periodic confinement displays a glass transition within mode-coupling theory at a much lower density than the corresponding bulk system. We use fluctuating hydrodynamics, with confinement imposed through a periodic potential whose wavelength plays an important role in our treatment. To make the calculation tractable we implement a detailed calculation in one dimension. Although we do not expect simple 1d fluids to show a glass transition, our results are indicative of the behavior expected in higher dimensions. In a certain region of parameter space we observe a three-step relaxation reported recently in computer simulations [S. H. Krishnan, Ph.D. thesis, Indian Institute of Science (2005); Kim et al., Eur. Phys. J. Special Topics 189, 135 (2010)] and a glass-glass transition. We compare our results to those of Krakoviack [Phys. Rev. E 75, 031503 (2007)] and Lang et al. [Phys. Rev. Lett. 105, 125701 (2010)].

Projecting low and extensive dimensional chaos from spatio-temporal dynamics

We review the spatio-temporal dynamical features of the Ananthakrishna model for the Portevin-Le Chatelier effect, a kind of plastic instability observed under constant strain rate deformation conditions. We then establish a qualitative correspondence between the spatio-temporal structures that evolve continuously in the instability domain and the nature of the irregularity of the scalar stress signal. Rest of the study is on quantifying the dynamical information contained in the stress signals about the spatio-temporal dynamics of the model. We show that at low applied strain rates, there is a one-to-one correspondence with the randomly nucleated isolated bursts of mobile dislocation density and the stress drops. We then show that the model equations are spatio-temporally chaotic by demonstrating the number of positive Lyapunov exponents and Lyapunov dimension scale with the system size at low and high strain rates. Using a modified algorithm for calculating correlation dimension density, we show that the stress-strain signals at low applied strain rates corresponding to spatially uncorrelated dislocation bands exhibit features of low dimensional chaos. This is made quantitative by demonstrating that the model equations can be approximately reduced to space independent model equations for the average dislocation densities, which is known to be low-dimensionally chaotic. However, the scaling regime for the correlation dimension shrinks with increasing applied strain rate due to increasing propensity for propagation of the dislocation bands. The stress signals in the partially propagating to fully propagating bands turn to have features of extensive chaos.

IR spectroscopy as a probe for C-H center dot center dot center dot X hydrogen bonded supramolecular synthons

Weak hydrogen bonds of the type C-H center dot center dot center dot X (X: N, O, S and halogens) have evoked considerable interest over the years, especially in the context of crystal engineering. However, association patterns of weak hydrogen bonds are generally difficult to characterize, and yet the identification of such patterns is of interest, especially in high throughput work or where single crystal X-ray analysis is difficult or impossible. To obtain structural information on such assemblies, we describe here a five step IR spectroscopic method that identifies supramolecular synthons in weak hydrogen bonded dimer assemblies, bifurcated systems, and p-electron mediated synthons. The synthons studied here contain C-H groups as hydrogen bond donors. The method involves: (i) identifying simple compounds/cocrystals/salts that contain the hydrogen bonded dimer synthon of interest or linear hydrogen bonded assemblies between the same functionalities; (ii) scanning infrared (IR) spectra of the compounds; (iii) identifying characteristic spectral differences between dimer and linear; (iv) assigning identified bands as marker bands for identification of the supramolecular synthon, and finally (v) identifying synthons in compounds whose crystal structures are not known. The method has been effectively implemented for assemblies involving dimer/linear weak hydrogen bonds in nitrobenzenes (C-H center dot center dot center dot O-NO), nitro-dimethylamino compounds (NMe2 center dot center dot center dot O2N), chalcones (C-H center dot center dot center dot O=C), benzonitriles (C-H center dot center dot center dot N C) and fluorobenzoic acids (C-H center dot center dot center dot F-C). Two other special cases of C-H center dot center dot center dot pi and N-H center dot center dot center dot pi synthons were studied in which the band shape of the C-H stretch in hydrocarbons and the N-H deformation in aminobenzenes was examined.

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs

Conditions for the existence of heterochromatic Hamiltonian paths and cycles in edge colored graphs are well investigated in literature. A related problem in this domain is to obtain good lower bounds for the length of a maximum heterochromatic path in an edge colored graph G. This problem is also well explored by now and the lower bounds are often specified as functions of the minimum color degree of G - the minimum number of distinct colors occurring at edges incident to any vertex of G - denoted by v(G). Initially, it was conjectured that the lower bound for the length of a maximum heterochromatic path for an edge colored graph G would be 2v(G)/3]. Chen and Li (2005) showed that the length of a maximum heterochromatic path in an edge colored graph G is at least v(G) - 1, if 1 <= v(G) <= 7, and at least 3v(G)/5] + 1 if v(G) >= 8. They conjectured that the tight lower bound would be v(G) - 1 and demonstrated some examples which achieve this bound. An unpublished manuscript from the same authors (Chen, Li) reported to show that if v(G) >= 8, then G contains a heterochromatic path of length at least 120 + 1. In this paper, we give lower bounds for the length of a maximum heterochromatic path in edge colored graphs without small cycles. We show that if G has no four cycles, then it contains a heterochromatic path of length at least v(G) - o(v(G)) and if the girth of G is at least 4 log(2)(v(G)) + 2, then it contains a heterochromatic path of length at least v(G) - 2, which is only one less than the bound conjectured by Chen and Li (2005). Other special cases considered include lower bounds for the length of a maximum heterochromatic path in edge colored bipartite graphs and triangle-free graphs: for triangle-free graphs we obtain a lower bound of 5v(G)/6] and for bipartite graphs we obtain a lower bound of 6v(G)-3/7]. In this paper, it is also shown that if the coloring is such that G has no heterochromatic triangles, then G contains a heterochromatic path of length at least 13v(G)/17)]. This improves the previously known 3v(G)/4] bound obtained by Chen and Li (2011). We also give a relatively shorter and simpler proof showing that any edge colored graph G contains a heterochromatic path of length at least (C) 2015 Elsevier Ltd. All rights reserved.

An Optimal Mechanism for Sponsored Search Auctions on the Web and Comparison With Other Mechanisms

In this paper, we first describe a framework to model the sponsored search auction on the web as a mechanism design problem. Using this framework, we describe two well-known mechanisms for sponsored search auction-Generalized Second Price (GSP) and Vickrey-Clarke-Groves (VCG). We then derive a new mechanism for sponsored search auction which we call optimal (OPT) mechanism. The OPT mechanism maximizes the search engine's expected revenue, while achieving Bayesian incentive compatibility and individual rationality of the advertisers. We then undertake a detailed comparative study of the mechanisms GSP, VCG, and OPT. We compute and compare the expected revenue earned by the search engine under the three mechanisms when the advertisers are symmetric and some special conditions are satisfied. We also compare the three mechanisms in terms of incentive compatibility, individual rationality, and computational complexity. Note to Practitioners-The advertiser-supported web site is one of the successful business models in the emerging web landscape. When an Internet user enters a keyword (i.e., a search phrase) into a search engine, the user gets back a page with results, containing the links most relevant to the query and also sponsored links, (also called paid advertisement links). When a sponsored link is clicked, the user is directed to the corresponding advertiser's web page. The advertiser pays the search engine in some appropriate manner for sending the user to its web page. Against every search performed by any user on any keyword, the search engine faces the problem of matching a set of advertisers to the sponsored slots. In addition, the search engine also needs to decide on a price to be charged to each advertiser. Due to increasing demands for Internet advertising space, most search engines currently use auction mechanisms for this purpose. These are called sponsored search auctions. A significant percentage of the revenue of Internet giants such as Google, Yahoo!, MSN, etc., comes from sponsored search auctions. In this paper, we study two auction mechanisms, GSP and VCG, which are quite popular in the sponsored auction context, and pursue the objective of designing a mechanism that is superior to these two mechanisms. In particular, we propose a new mechanism which we call the OPT mechanism. This mechanism maximizes the search engine's expected revenue subject to achieving Bayesian incentive compatibility and individual rationality. Bayesian incentive compatibility guarantees that it is optimal for each advertiser to bid his/her true value provided that all other agents also bid their respective true values. Individual rationality ensures that the agents participate voluntarily in the auction since they are assured of gaining a non-negative payoff by doing so.

Beyond fractional derivatives: local approximation of other convolution integrals

Dynamic systems involving convolution integrals with decaying kernels, of which fractionally damped systems form a special case, are non-local in time and hence infinite dimensional. Straightforward numerical solution of such systems up to time t needs O(t(2)) computations owing to the repeated evaluation of integrals over intervals that grow like t. Finite-dimensional and local approximations are thus desirable. We present here an approximation method which first rewrites the evolution equation as a coupled in finite-dimensional system with no convolution, and then uses Galerkin approximation with finite elements to obtain linear, finite-dimensional, constant coefficient approximations for the convolution. This paper is a broad generalization, based on a new insight, of our prior work with fractional order derivatives (Singh & Chatterjee 2006 Nonlinear Dyn. 45, 183-206). In particular, the decaying kernels we can address are now generalized to the Laplace transforms of known functions; of these, the power law kernel of fractional order differentiation is a special case. The approximation can be refined easily. The local nature of the approximation allows numerical solution up to time t with O(t) computations. Examples with several different kernels show excellent performance. A key feature of our approach is that the dynamic system in which the convolution integral appears is itself approximated using another system, as distinct from numerically approximating just the solution for the given initial values; this allows non-standard uses of the approximation, e. g. in stability analyses.

Soft condensed matter -A special issue of solid state communications -Foreword

It is a policy of Solid State Communications’ Executive Editorial Board to organize special issues from time to time on topics of current interests. The present issue focuses on soft condensed matter, a rapidly developing and diverse area of importance not only for the basic science, but also for its potential applications. The ten articles in this issue are intended to give the readers a snapshot of some latest developments in soft condensed matter, mainly from the point of view of basic science. As the special issues are intended for a broad audience, most articles are short reviews that introduce the readers to the relevant topics. Hence this special issue can be especially helpful to readers who might not be specialists in this area but would like to have a quick grasp on some of the interesting research directions.

CLAP: A web-server for automatic classification of proteins with special reference to multi-domain proteins

Background: The function of a protein can be deciphered with higher accuracy from its structure than from its amino acid sequence. Due to the huge gap in the available protein sequence and structural space, tools that can generate functionally homogeneous clusters using only the sequence information, hold great importance. For this, traditional alignment-based tools work well in most cases and clustering is performed on the basis of sequence similarity. But, in the case of multi-domain proteins, the alignment quality might be poor due to varied lengths of the proteins, domain shuffling or circular permutations. Multi-domain proteins are ubiquitous in nature, hence alignment-free tools, which overcome the shortcomings of alignment-based protein comparison methods, are required. Further, existing tools classify proteins using only domain-level information and hence miss out on the information encoded in the tethered regions or accessory domains. Our method, on the other hand, takes into account the full-length sequence of a protein, consolidating the complete sequence information to understand a given protein better. Results: Our web-server, CLAP (Classification of Proteins), is one such alignment-free software for automatic classification of protein sequences. It utilizes a pattern-matching algorithm that assigns local matching scores (LMS) to residues that are a part of the matched patterns between two sequences being compared. CLAP works on full-length sequences and does not require prior domain definitions. Pilot studies undertaken previously on protein kinases and immunoglobulins have shown that CLAP yields clusters, which have high functional and domain architectural similarity. Moreover, parsing at a statistically determined cut-off resulted in clusters that corroborated with the sub-family level classification of that particular domain family. Conclusions: CLAP is a useful protein-clustering tool, independent of domain assignment, domain order, sequence length and domain diversity. Our method can be used for any set of protein sequences, yielding functionally relevant clusters with high domain architectural homogeneity. The CLAP web server is freely available for academic use at http://nslab.mbu.iisc.ernet.in/clap/.