LC–UV Assay for Simultaneous Estimation of Aromatic Turmerone, α/β-Turmerone and Curlone: Major Bisabolane Sesquiterpenes of Turmeric Oil in Rabbit Plasma for Application to Pharmacokinetic Studies

The herbal medicament derived from the lipid soluble fraction obtained from Curcuma longa L. (Zingiberaceae) has shown potential neuroprotective activity in disorders like stroke. HM has been standardized with three biomarkers: ar-turmerone, α/β-turmerone and curlone, major bisabolane sesquiterpenes of turmeric oil. Development of a biaonalytical method for these sesquiterpenes was initiated to characterize its preclinical pharmacokinetics in rabbits to accelerate its development as a potential candidate for vascular complications. Since, the compounds are structurally and chemically very similar, gradient elution was utilized on a C-18 reversed phase column with a mobile phase comprising of acetonitrile and deionised water. The UV detector was set at wavelengths 240 and 270 nm. The sample clean-up was performed by protein precipitation with acetonitrile. The method was reasonably sensitive with limits of quantitation (LOQ) of 0.098 μg mL^?1 in plasma for all the analytes. Accuracy and precision were within the acceptable limits, as indicated by relative standard deviation (% RSD) varying from 1.3 to 13.6% and bias values ranging from ?5.5 to 10.3%, respectively. Moreover, the analytes were stable in plasma even after three freeze-thaw cycles. The method was applied to generate preliminary pharmacokinetics of turmeric oil in rabbits after intravenous administration.     

Pulse shapes reconfigured on a pulse-to-pulse time scale by using an array of injection-locked VCSELs

We demonstrate line-by-line pulse shaping of optical comb lines separated by 6.25 GHz. An array of injection-locked VCSELs independently modulate four optical comb lines at frequencies up to 3.125 GHz, updating the pulse shape on the time scale of the pulse period.     

Maintenance of residual activity of Bt toxin by using natural and synthetic dyes: a novel approach for sustainable mosquito vector control

Mosquito control protein from Bacillus thuringiensis gets inactivated with exposure to sunlight. To address this issue, the potential of synthetic and natural dye was investigated as sunlight protectants. Bt SV2 in absence of dyes when exposed to sunlight showed reduced effectiveness against the fourth instars of mosquito larvae. Whereas acriflavin, congo red and violacein were able to maintain 86.4%, 91.6% and 82.2% mosquito larvicidal efficacy of Bt SV2 against IVth instars larvae of Anopheles stephensi Meigen after exposure to sunlight. Similarly, beetroot dye, acriflavin, congo red and violacein maintained 98.4%, 97.1%, 90.8% and 70.7% larvicidal activities against Aedes aegypti Linnaeus after sunlight exposure. Prodigiosin was found to be the best photo-protectant by simultaneously protecting and enhancing Bt activity by 6.16% and 22.16% against A. stephensi and A. aegypti, respectively. Combination of dyes with Bt formulations can be a good strategy for mosquito control programmes in tropical and sub-tropical regions.     

On extendable planes of order ten

It is well known that the only way of extending a projective plane of order n (conceivable orders are 2, 4 and 10) is adjoining a set of hyperovals to the given projective plane. A converse is proved in this note. It is shown as a corollary that the existence of an extendable plane of order 10 is equivalent to the existence of a quasi-symmetric 2-(111, 12, 10)-design.     

A successful algorithm for the undirected Hamiltonian path problem

In this paper a polynomial algorithm called the Minram algorithm is presented which finds a Hamiltonian Path in an undirected graph with high frequency of success for graphs up to 1000 nodes. It first reintroduces the concept described in [13] and then explains the algorithm. Computational comparison with the algorithm by Posa [10] is given.It is shown that a Hamiltonian Path is a spanning arborescence with zero ramification index. Given an undirected graph, the Minram algorithm starts by finding a spanning tree which defines a unique spanning arborescence. By suitable pivots it locates a locally minimal value of the ramification index. If this local minima corresponds to zero ramification index then the algorithm is considered to have ended successfully, else a failure is reported.Computational performance of the algorithm on randomly generated Hamiltonian graphs is given. The random graphs used as test problems were generated using the procedure explained in Section 6.1. Comparison with our version of the Posa algorithm which we call Posa-ran algorithm [10] is also made.     

Classification of (16,6,2)-designs by ovals

Using the triangular graph T(6) it is shown that up to isomorphism any (16,6,2)-design is uniquely determined by the number of ovals in it, which is 12, 28 or 60. It is shown that the (16,6,2)-design with precisely 60 ovals is embeddable in a 3-(22,6,1)-design. As a consequence the uniqueness of the 3-(22,6,1)-design is obtained.     

Auxiliary sets of matrices with new step parameter sequences

Constructions are given for auxiliary sets of matrices which have the previously unknown step parameter sequences (3,11,3), (2,2,8,11), (2,2,8,13), (2,2,9,11). As a consequence one obtains a projective Hjelmslev plane for each of the preceding four step parameter sequences.