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.

Transient state work fluctuation theorem for a classical harmonic oscillator linearly coupled to a harmonic bath

Based on a Hamiltonian description we present a rigorous derivation of the transient state work fluctuation theorem and the Jarzynski equality for a classical harmonic oscillator linearly coupled to a harmonic heat bath, which is dragged by an external agent. Coupling with the bath makes the dynamics dissipative. Since we do not assume anything about the spectral nature of the harmonic bath the derivation is not restricted only to the Ohmic bath, rather it is more general, for a non-Ohmic bath. We also derive expressions of the average work done and the variance of the work done in terms of the two-time correlation function of the fluctuations of the position of the harmonic oscillator. In the case of an Ohmic bath, we use these relations to evaluate the average work done and the variance of the work done analytically and verify the transient state work fluctuation theorem quantitatively. Actually these relations have far-reaching consequences. They can be used to numerically evaluate the average work done and the variance of the work done in the case of a non-Ohmic bath when analytical evaluation is not possible.

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.

A robust initialization scheme for faster convergence of the dichotomous search algorithm for single frequency estimation

The estimation of the frequency of a sinusoidal signal is a well researched problem. In this work we propose an initialization scheme to the popular dichotomous search of the periodogram peak algorithm(DSPA) that is used to estimate the frequency of a sinusoid in white gaussian noise. Our initialization is computationally low cost and gives the same performance as the DSPA, while reducing the number of iterations needed for the fine search stage. We show that our algorithm remains stable as we reduce the number of iterations in the fine search stage. We also compare the performance of our modification to a previous modification of the DSPA and show that we enhance the performance of the algorithm with our initialization technique.

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.