Characterisation and bioactivity of oosporein produced by endophytic fungus Cochliobolus kusanoi isolated from Nerium oleander L.

Bioactive compounds comprising secondary metabolites produced by endophytic fungi have wide applications in pharmacology and agriculture. Isolation, characterisation and evaluation of biological activities of secondary metabolites were carried out from Cochliobolus kusanoi an endophytic fungus of Nerium oleander L. The fungus was identified based on 18S rDNA sequence analysis. There are no reports available on the compounds of C. kusanoi hence, antimicrobial metabolite produced by this fungus was extracted and purified by fractionation using hexane, diethyl ether, dichloromethane, ethyl acetate and methanol. Out of all the solvent fractions, the methanol fraction exhibited better antimicrobial activity which was further purified and characterised as oosporein. Oosporein from C. kusanoi exhibited broad spectrum in vitro antimicrobial, antioxidant and cytotoxic activities. The characterisation and antioxidant activity of oosporein from C. kusanoi are reported for the first time.

A Matroidal Framework for Network-Error Correcting Codes

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. A particularly interesting feature of this development is the ability to construct (scalar and vector) linearly solvable networks using certain classes of matroids. Furthermore, it was shown through the connection between network coding and matroid theory that linear network coding is not always sufficient for general network coding scenarios. The current work attempts to establish a connection between matroid theory and network-error correcting and detecting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of linear network-error detecting codes to arrive at the definition of a matroidal error detecting network (and similarly, a matroidal error correcting network abstracting from network-error correcting codes). An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error detecting (correcting) network code if and only if it is a matroidal error detecting (correcting) network associated with a representable matroid. Therefore, constructing such network-error correcting and detecting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa. We then present algorithms that enable the construction of matroidal error detecting and correcting networks with a specified capability of network-error correction. Using these construction algorithms, a large class of hitherto unknown scalar linearly solvable networks with multisource, multicast, and multiple-unicast network-error correcting codes is made available for theoretical use and practical implementation, with parameters, such as number of information symbols, number of sinks, number of coding nodes, error correcting capability, and so on, being arbitrary but for computing power (for the execution of the algorithms). The complexity of the construction of these networks is shown to be comparable with the complexity of existing algorithms that design multicast scalar linear network-error correcting codes. Finally, we also show that linear network coding is not sufficient for the general network-error correction (detection) problem with arbitrary demands. In particular, for the same number of network errors, we show a network for which there is a nonlinear network-error detecting code satisfying the demands at the sinks, whereas there are no linear network-error detecting codes that do the same.

Codes with Locality for Two Erasures

In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated with small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan et al, in which recovery from a single erasure is considered. By studying the generalized Hamming weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Turan graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from 2 erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.

An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes

While the tradeoff between the amount of data stored and the repair bandwidth of an (n, k, d) regenerating code has been characterized under functional repair (FR), the case of exact repair (ER) remains unresolved. It is known that there do not exist ER codes which lie on the FR tradeoff at most of the points. The question as to whether one can asymptotically approach the FR tradeoff was settled recently by Tian who showed that in the (4, 3, 3) case, the ER region is bounded away from the FR region. The FR tradeoff serves as a trivial outer bound on the ER tradeoff. In this paper, we extend Tian's results by establishing an improved outer bound on the ER tradeoff which shows that the ER region is bounded away from the FR region, for any (n; k; d). Our approach is analytical and builds upon the framework introduced earlier by Shah et. al. Interestingly, a recently-constructed, layered regenerating code is shown to achieve a point on this outer bound for the (5, 4, 4) case. This represents the first-known instance of an optimal ER code that does not correspond to a point on the FR tradeoff.

L-p estimates for the wave equation associated to the Grushin operator

We prove that the solution of the wave equation associated to the Grushin operator G = -Delta -vertical bar x vertical bar(2)partial derivative(2)(t) is bounded on L-P (Rn+1), with 1 < p < infinity, when vertical bar 1/p - 1/2 vertical bar < 1/n+2.

Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs

A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the help-by-transfer property where the helper nodes simply transfer part of the stored data directly, without performing any computation. This embedded error correction structure makes the decoding process straightforward, and in some cases the complexity is very low. We show that this construction is able to achieve performance better than space-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes, and it is the first class of codes to achieve this performance. In fact, it is shown that the proposed construction can achieve a nontrivial point on the optimal functional-repair tradeoff, and it is asymptotically optimal at high rate, i.e., it asymptotically approaches the minimum storage and the minimum repair-bandwidth simultaneously.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

Investigations on growth, structure, optical properties and laser damage threshold of organic nonlinear optical crystals of Guanidinium L-Ascorbate

Single crystals of Guanidinium L-Ascorbate (GuLA) were grown and crystal structure was determined by direct methods. GuLA crystallizes in orthorhombic, non-centrosymmetric space group P2(1)2(1)2(1). The UV-cutoff was determined as 325 nm. The morphology was generated and the interplanar angles estimated and compared with experimental values. Second harmonic generation conversion efficiency was measured and compared with other salts of L-Ascorbic acid. Surface laser damage threshold was calculated as 11.3GW/cm(2) for a single shot of laser of 1064 nm wavelength.

Spatial Modulation Aided Zero-Padded Single Carrier Transmission for Dispersive Channels

In this paper, we consider spatial modulation (SM) operating in a frequency-selective single-carrier (SC) communication scenario and propose zero-padding instead of the cyclic-prefix considered in the existing literature. We show that the zero-padded single-carrier (ZP-SC) SM system offers full multipath diversity under maximum-likelihood (ML) detection, unlike the cyclic-prefix based SM system. Furthermore, we show that the order of ML detection complexity in our proposed ZP-SC SM system is independent of the frame length and depends only on the number of multipath links between the transmitter and the receiver. Thus, we show that the zero-padding applied in the SC SM system has two advantages over the cyclic prefix: 1) achieves full multipath diversity, and 2) imposes a relatively low ML detection complexity. Furthermore, we extend the partial interference cancellation receiver (PIC-R) proposed by Guo and Xia for the detection of space-time block codes (STBCs) in order to convert the ZP-SC system into a set of narrowband subsystems experiencing flat-fading. We show that full rank STBC transmissions over these subsystems achieves full transmit, receive as well as multipath diversity for the PIC-R. Furthermore, we show that the ZP-SC SM system achieves receive and multipath diversity for the PIC-R at a detection complexity order which is the same as that of the SM system in flat-fading scenario. Our simulation results demonstrate that the symbol error ratio performance of the proposed linear receiver for the ZP-SC SM system is significantly better than that of the SM in cyclic prefix based orthogonal frequency division multiplexing as well as of the SM in the cyclic-prefixed and zero-padded single carrier systems relying on zero-forcing/minimum mean-squared error equalizer based receivers.

L-infinity norms of holomorphic modular forms in the case of compact quotient

We prove a sub-convex estimate for the sup-norm of L-2-normalized holomorphic modular forms of weight k on the upper half plane, with respect to the unit group of a quaternion division algebra over Q. More precisely we show that when the L-2 norm of an eigenfunction f is one, parallel to f parallel to(infinity) <<(epsilon) k(1/2-1/33+epsilon) for any epsilon > 0 and for all k sufficiently large.

A carboxy terminal domain of the L protein of rinderpest virus possesses RNA triphosphatase activity - The first enzyme in the viral mRNA capping pathway

The large protein L of negative-sense RNA viruses is a multifunctional protein involved in transcription and replication of genomic RNA. It also possesses enzymatic activities involved in capping and methylation of viral mRNAs. The pathway for mRNA capping followed by the L protein of the viruses in the Morbillivirus genus has not been established, although it has been speculated that these viruses may follow the unconventional capping pathway as has been shown for some viruses of Rhabdoviridae family. We had earlier shown that the large protein L of Rinderpest virus expressed as recombinant L-P complex in insect cells as well as the ribonucleoprotein complex from purified virus possesses RNA triphosphatase (RTPase) and guanylyltransferase activities, in addition to RNA dependent RNA polymerase activity. In the present work, we demonstrate that RTPase as well as nucleoside triphosphatase (NTPase) activities are exhibited by a subdomain of the L protein in the C terminal region (a.a. 1640 1840). The RTPase activity depends absolutely on a divalent cation, either magnesium or manganese. Both the RTPase and NTPase activities of the protein show dual metal specificity. Two mutant proteins having alanine mutations in the glutamic acid residues in motif-A of the RTPase domain did not show RTPase activity, while exhibiting reduced NTPase activity suggesting overlapping active sites for the two enzymatic functions. The RTPase and NTPase activities of the L subdomain resemble those of the Vaccinia capping enzyme D1 and the baculovirus LEF4 proteins. (C) 2015 Elsevier Inc. All rights reserved.

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).

An Alternating l(p) - l(2) Projections Algorithm (ALPA) for Speech Modeling using Sparsity Constraints

We address the problem of separating a speech signal into its excitation and vocal-tract filter components, which falls within the framework of blind deconvolution. Typically, the excitation in case of voiced speech is assumed to be sparse and the vocal-tract filter stable. We develop an alternating l(p) - l(2) projections algorithm (ALPA) to perform deconvolution taking into account these constraints. The algorithm is iterative, and alternates between two solution spaces. The initialization is based on the standard linear prediction decomposition of a speech signal into an autoregressive filter and prediction residue. In every iteration, a sparse excitation is estimated by optimizing an l(p)-norm-based cost and the vocal-tract filter is derived as a solution to a standard least-squares minimization problem. We validate the algorithm on voiced segments of natural speech signals and show applications to epoch estimation. We also present comparisons with state-of-the-art techniques and show that ALPA gives a sparser impulse-like excitation, where the impulses directly denote the epochs or instants of significant excitation.

Simultaneous nonvanishing of Dirichlet L-functions and twists of Hecke-Maass L-functions

We prove that given a Hecke-Maass form f for SL(2, Z) and a sufficiently large prime q, there exists a primitive Dirichlet character chi of conductor q such that the L-values L(1/2, f circle times chi) and L(1/2, chi) do not vanish.

Chronic lung infection by Pseudomonas aeruginosa biofilm is cured by L-Methionine in combination with antibiotic therapy

Bacterial biofilms are associated with 80-90% of infections. Within the biofilm, bacteria are refractile to antibiotics, requiring concentrations >1,000 times the minimum inhibitory concentration. Proteins, carbohydrates and DNA are the major components of biofilm matrix. Pseudomonas aeruginosa (PA) biofilms, which are majorly associated with chronic lung infection, contain extracellular DNA (eDNA) as a major component. Herein, we report for the first time that L-Methionine (L-Met) at 0.5 mu M inhibits Pseudomonas aeruginosa (PA) biofilm formation and disassembles established PA biofilm by inducing DNase expression. Four DNase genes (sbcB, endA, eddB and recJ) were highly up-regulated upon L-Met treatment along with increased DNase activity in the culture supernatant. Since eDNA plays a major role in establishing and maintaining the PA biofilm, DNase activity is effective in disrupting the biofilm. Upon treatment with L-Met, the otherwise recalcitrant PA biofilm now shows susceptibility to ciprofloxacin. This was reflected in vivo, in the murine chronic PA lung infection model. Mice treated with L-Met responded better to antibiotic treatment, leading to enhanced survival as compared to mice treated with ciprofloxacin alone. These results clearly demonstrate that L-Met can be used along with antibiotic as an effective therapeutic against chronic PA biofilm infection.