Thermodynamics of ligand (substrate end product) binding to endoxylanase from Chainia sp. (NCL-82-5-1): isothermal calorimetry and fluorescence titration studies

The binding of xylo-oligosaccharides to Chainia endoxylanase resulted in a decrease in fluorescence intensity of the enzyme with the formation of 1:1 complex. Equilibrium and thermodynamic parameters of ligand binding were determined by fluorescence titrations and titration calorimetry. The affinity of xylanase for the oligosaccharides increases in the order X-2 < X-3 < X-4 less than or equal to X-5. Contributions from the enthalpy towards the free energy change decreased with increasing chain length from X-2 to X-4, whereas an increase in entropy was observed, the change in enthalpy and entropy of binding being compensatory. The entropically driven binding process suggested that hydrophobic interactions as well as hydrogen bonds play a predominant role in ligand binding.

Optimal popular matchings

In this paper we consider the problem of computing an “optimal” popular matching. We assume that our input instance View the MathML source admits a popular matching and here we are asked to return not any popular matching but an optimal popular matching, where the definition of optimality is given as a part of the problem statement; for instance, optimality could be fairness in which case we are required to return a fair popular matching. We show an O(n2+m) algorithm for this problem, assuming that the preference lists are strict, where m is the number of edges in G and n is the number of applicants.

Popular Mixed Matchings

We study the problem of matching applicants to jobs under one-sided preferences: that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be rnore popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M,T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based oil the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distributions over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P,Q) >= phi(Q,P) for all mixed matchings Q. We show that popular mixed matchings always exist. and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem.

Detection,amplification and sequence homology of sodC in clinical isolates of Salmonella sp

Background & objectives: Periplasmic copper and zinc superoxide dismutase (Cu,Zn-SOD or SodC) is an important component of the antioxidant shield which protects bacteria from the phagocytic oxidative burst. Cu,Zn-SODs protect Gram-negative bacteria against oxygen damage which have also been shown to contribute to the pathogenicity of these bacterial species. We report the presence of SodC in drug resistant Salmonella sp. isolated from patients suffering from enteric fever. Further sodC was amplified, cloned into Escherichia coli and the nucleotide sequence and amino acid sequence homology were compared with the standard strain Salmonella Typhimurium 14028. Methods: Salmonella enterica serovar Typhi (S. Typhi) and Salmonellaenterica serovar Paratyphi (S. Paratyphi) were isolated and identified from blood samples of the patients. The isolates were screened for the presence of Cu, Zn-SOD by PAGE using KCN as inhibitor of Cu,Zn-SOD. The gene (sodC) was amplified by PCR, cloned and sequenced. The nucleotide and amino acid sequences of sodC were compared using CLUSTAL X.Results: SodC was detected in 35 per cent of the Salmonella isolates. Amplification of the genomic DNA of S. Typhi and S. Paratyphi with sodC specific primers resulted in 519 and 515 bp amplicons respectively. Single mutational difference at position 489 was observed between thesodC of S. Typhi and S. Paratyphi while they differed at 6 positions with the sodC of S. Typhimurium 14028. The SodC amino acid sequences of the two isolates were homologous but 3 amino acid difference was observed with that of standard strain S. Typhimurium 14028.Interpretation & conclusions: The presence of SodC in pathogenic bacteria could be a novel candidate as phylogenetic marker.

Popular Matchings with Variable Job Capacities

We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not adroit popular matchings. This motivates the following extension of the popular rnatchings problem:Given a graph G; = (A boolean OR J, E) where A is the set of people and J is the set of jobs, and a list < c(1), c(vertical bar J vertical bar)) denoting upper bounds on the capacities of each job, does there exist (x(1), ... , x(vertical bar J vertical bar)) such that setting the capacity of i-th, job to x(i) where 1 <= x(i) <= c(i), for each i, enables the resulting graph to admit a popular matching. In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c is 1 or 2.

Antipyretic and antibacterial activity of Chloranthus erectus (Buch.-Ham.) Verdcourt leaf extract: A popular folk medicine of Arunachal Pradesh

Objective : The main objective of this work was to study the antipyretic and antibacterial activity of C. erectus (Buch.-Ham.) Verdcourt leaf extract in an experimental albino rat model. Materials and Methods : The methanol extract of C. erectus leaf (MECEL) was evaluated for its antipyretic potential on normal body temperature and Brewers yeast-induced pyrexia in albino rats model. While the antibacterial activity of MECEL against five Gram (-) and three Gram () bacterial strains and antimycotic activity was investigated against four fungi using agar disk diffusion and microdilution methods. Result : Yeast suspension (10 mL/kg b.w.) elevated rectal temperature after 19 h of subcutaneous injection. Oral administration of MECEL at 100 and 200 mg/kg b.w. showed significant reduction of normal rectal body temperature and yeast-provoked elevated temperature (38.8 0.2 and 37.6 0.4, respectively, at 2-3 h) in a dose-dependent manner, and the effect was comparable to that of the standard antipyretic drug-paracetamol (150 mg/kg b.w.). MECEL at 2 mg/disk showed broad spectrum of growth inhibition activity against both groups of bacteria. However, MECEL was not effective against the yeast strains tested in this study. Conclusion : This study revealed that the methanol extract of C. erectus exhibited significant antipyretic activity in the tested models and antibacterial activity as well, and may provide the scientific rationale for its popular use as antipyretic agent in Khamptiss folk medicines.

Electron field emission from sp (2)-induced insulating to metallic behaviour of amorphous carbon (a-C) films

The influence of concentration and size of sp (2) cluster on the transport properties and electron field emissions of amorphous carbon films have been investigated. The observed insulating to metallic behaviour from reduced activation energy derived from transport measurement and threshold field for electron emission of a-C films can be explained in terms of improvements in the connectivity between sp (2) clusters. The connectivity is resulted by the cluster concentration and size. The concentration and size of sp (2) content cluster is regulated by the coalescence of carbon globules into clusters, which evolves with deposition conditions.

Popular matchings with variable item copies

We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(i), enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.

Popular mixed matchings

We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be more popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M, T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based on the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distribution over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P, Q) >= phi(Q, P) for all mixed matchings Q. We show that popular mixed matchings always exist and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem. (C) 2010 Elsevier B.V. All rights reserved.

Transformations of morphine, codeine and their analogues by Bacillus sp

A bacterial strain belonging to the genus Bacillus isolated by enrichment culture technique using morphine as a sole source of carbon transforms morphine and codeine into 14-hydroxymorphinone and 14-hydroxycodeinone as major and 14-hydroxymorphine and 14-hydroxycodeine as minor metabolites, respectively. When the N-methyl group in morphine and codeine are replaced by higher alkyl groups, the organism still retains its ability to carry out 14-hydroxylation as well as oxidation of the C-6-hydroxyl group in these N-variants, although the level of metabolites formed are considerably low. The organism readily transforms dihydromorphine and dihydrocodeine into only dihydromorphinone and dihydrocodeinone, respectively; suggesting that the 7,8-double bond is a necessary structural feature to carry out 14-hydroxylation reaction. The cell free extract (20,000 x g supernatant), prepared from morphine grown cells, transforms morphine into 14-hydroxymorphinone in the presence of NAD(+), but fails to show activity against testosterone. However, the cell free extract prepared from testosterone grown cells contains significant levels of 17 beta- hydroxysteroid dehydrogenase but shows no activity against morphine.

Molybdenum trioxide catalyzed oxidative cross-dehydrogenative coupling of benzylic sp(3) C-H bonds: synthesis of alpha-aminophosphonates under aerobic conditions

Molybdenum trioxide (MoO3) catalyzed efficient oxidative cross-dehydrogenative-coupling (CDC) method for C-H functionalization of N-aryl tetrahydroisoquinolines has been explored. This user-friendly method of synthesizing alpha-aminophosphonates employs 1.1 equiv of dialkyl-H-phosphonate under aerobic condition. Formation of new C-P bonds from unfunctionalized starting materials under environmentally benign conditions provides an excellent avenue for the synthesis of biologically active alpha-aminophosphonates. (C) 2012 Elsevier Ltd. All rights reserved.

Strategies for the Synthesis of Graphene, Graphene Nanoribbons, Nanoscrolls and Related Materials

Single-layer graphene (SLG), the 3.4 angstrom thick two-dimensional sheet of sp(2) carbon atoms, was first prepared in 2004 by mechanical exfoliation of graphite crystals using the scotch tape technique. Since then, SLG has been prepared by other physical methods such as laser irradiation or ultrasonication of graphite in liquid media. Chemical methods of synthesis of SLG are more commonly used; the most popular involves preparation of single-layer graphene oxide followed by reduction with a stable reagent, often assisted by microwave heating. This method yields single-layer reduced graphene oxide. Other methods for preparing SLG include chemical vapour deposition over surfaces of transition metals such as Ni and Cu. Large-area SLG has also been prepared by epitaxial growth over SIC. Few-layer graphene (FLG) is prepared by several methods; arc discharge of graphite in hydrogen atmosphere being the most convenient. Several other methods for preparing FLG include exfoliation of graphite oxide by rapid heating, ultrasonication or laser irradiation of graphite in liquid media, reduction of few-layer graphene oxide, alkali metal intercalation followed by exfoliation. Graphene nanoribbons, which are rectangular strips of graphene, are best prepared by the unzipping of carbon nanotubes by chemical oxidation or laser irradiation. Many graphene analogues of inorganic materials such as MoS2, MoSe2 and BN have been prepared by mechanical exfoliation, ultrasonication and by chemical methods involving high-temperature or hydrothermal reactions and intercalation of alkali metals followed by exfoliation. Scrolls of graphene are prepared by potassium intercalation in graphite or by microwave irradiation of graphite immersed in liquid nitrogen.

Review of Geohazard Warning Systems toward Development of a Popular Usage Geohazard Warning Communication System

The advent and evolution of geohazard warning systems is a very interesting study. The two broad fields that are immediately visible are that of geohazard evaluation and subsequent warning dissemination. Evidently, the latter field lacks any systematic study or standards. Arbitrarily organized and vague data and information on warning techniques create confusion and indecision. The purpose of this review is to try and systematize the available bulk of information on warning systems so that meaningful insights can be derived through decidable flowcharts, and a developmental process can be undertaken. Hence, the methods and technologies for numerous geohazard warning systems have been assessed by putting them into suitable categories for better understanding of possible ways to analyze their efficacy as well as shortcomings. By establishing a classification scheme based on extent, control, time period, and advancements in technology, the geohazard warning systems available in any literature could be comprehensively analyzed and evaluated. Although major advancements have taken place in geohazard warning systems in recent times, they have been lacking a complete purpose. Some systems just assess the hazard and wait for other means to communicate, and some are designed only for communication and wait for the hazard information to be provided, which usually is after the mishap. Primarily, systems are left at the mercy of administrators and service providers and are not in real time. An integrated hazard evaluation and warning dissemination system could solve this problem. Warning systems have also suffered from complexity of nature, requirement of expert-level monitoring, extensive and dedicated infrastructural setups, and so on. The user community, which would greatly appreciate having a convenient, fast, and generalized warning methodology, is surveyed in this review. The review concludes with the future scope of research in the field of hazard warning systems and some suggestions for developing an efficient mechanism toward the development of an automated integrated geohazard warning system. DOI: 10.1061/(ASCE)NH.1527-6996.0000078. (C) 2012 American Society of Civil Engineers.