METHOD DEVELOPMENT AND VALIDATION FOR ESTIMATION OF CURCUMIN AND PIPERINE BY RP-HPLC

Objective: To develop a simple, sensitive, specific, accurate reverse phase high performance liquid chromatographic (RP-HPLC) method for the estimation of curcumin and piperine.Methods: The separation was done using a column Inertsil–ODS C18 (250 mm × 4.6 mm, 5µ particle size) and mobile phase composed of methanol: water (45:55 v/v), flow rate at 1 ml/min and detection was carried out at 282 nm with photodiode array (PDA) detector.Results: The separation of curcumin and piperine were found to be at the retention time of 2.433 min and 3.095 min, respectively. The method was found to be linear at a concentration range 20-80 µg/ml for curcumin and piperine. The limit of detection (LOD) and limit of quantification (LOQ) was found to be 0.05µg/ml and 0.17µg/ml for curcumin and 0.18µg/ml and 0.53µg/ml for piperine respectively. The average percentage recoveries of curcumin and piperine were in the range of 98-100.6%.Conclusion: A simple and sensitive reverse phase high performance liquid chromatographic method was developed for the estimation of curcumin and piperine

A Study on Assessment and Management of Diabetic Gastropathy

To assess and manage Diabetic gastropathy. Diabetic gastropathy is least concern in developing countries but many patients receiving oral anti diabetics leads to serious gastric problems. This study involves identification of gastric problems and improves compliance, medication adherence among population and also determine the severity of gastric problems due to oral hypoglycemic drugs. In our study, women are more effected (54%) than men (46%). Most effected age group is 40-60 years age with 58% Mild (male-20.9%, female-22.27%) and moderate (male-37.9%, females-39.7%) conditions are the most effected in terms of severity. This is due to poor glycemic control and not using proper medication, diet. Treatment should be focused on improving gastric symptoms by controlling gastric emptying. Prevention of gastric symptoms by following some dietary changes, nutritional and physiological support is effective to patients

Ownership Pattern of Public Debt in India: A Study

To bridge the inevitable gap between the expenditure and revenue of governments, public debt has been resorted to increasingly by the government all over the world. In India, too, public debt has been reckoned as a device though which governments attempt to garner enough resources for both developmental and non-developmental activities. The present paper looks into the change and pattern in the ownership of public debt in India in recent years. In recent times, there has been a slight decline in the State government securities issued in India. Provident Funds have become dominant and permanent owners of state government securities in Indi, especially in recent times. Commercial banks in India are the main owners of GOI dated securities. Half of the T-Bills have been held by the Commercial Banks in the country. Mutual Funds also have been buying the Treasury Bills on a large scale. Provident Funds (PFs) do not seem to be interested in engaging in Treasury Bills operations in the country

A NOVEL STABILITY-INDICATING REVERSE PHASE LIQUID CHROMATOGRAPHIC METHOD FOR THE SIMULTANEOUS ESTIMATION OF METFORMIN AND TENELIGLIPTIN IN PURE AND PHARMACEUTICAL FORMULATIONS

Objective: The present method was proposed to develop a simple, sensitive, rapid, accurate and stability-indicating reverse phase-high performance liquid chromatographic (RP-HPLC) method for the simultaneous estimation of metformin and teneligliptin in pure and pharmaceutical formulations. Methods: The chromatographic separation was done on Discovery [250 mm X 4.6 mm: 5 μm is particle size] using a mobile phase composed of 0.1% orthophosphoric acid buffer: acetonitrile [65:35, v/v], the flow rate is 1 ml/min and the detection was carried out with a photodiode array (PDA) at 260 nm.Results: The retention time of metformin and teneligliptin were found to be 2.517 min and 3.687 min, respectively. Stability indicating studies were conducted under the guidelines of an international conference on harmonization [ICH] Q1A R2 and the developed method was validated as per the guidelines of ICH Q2 R1. The linearity was found in the range of concentration of 125-750 μg/ml and 5-30 μg/ml for metformin and teneligliptin. The lower limit of detection (LOD) and lower limit of quantification (LOQ) was found to be 0.02μg/ml and 0.07 μg/ml for metformin and 0.19 μg/ml and 0.56 μg/ml for teneligliptin, respectively.Conclusion: A novel stability-indicating reverse phase liquid chromatographic method developed for the simultaneous estimation of metformin and teneligliptin. The proposed method was adopted for the routine estimation of metformin and teneligliptin in bulk and pharmaceutical dosage forms

Sum of Products of Read-Once Formulas

We study limitations of polynomials computed by depth two circuits built over read-once formulas (ROFs). In particular, 1. We prove an exponential lower bound for the sum of ROFs computing the 2n-variate polynomial in VP defined by Raz and Yehudayoff [CC,2009]. 2. We obtain an exponential lower bound on the size of arithmetic circuits computing sum of products of restricted ROFs of unbounded depth computing the permanent of an n by n matrix. The restriction is on the number of variables with + gates as a parent in a proper sub formula of the ROF to be bounded by sqrt(n). Additionally, we restrict the product fan in to be bounded by a sub linear function. This proves an exponential lower bound for a subclass of possibly non-multilinear formulas of unbounded depth computing the permanent polynomial. 3. We also show an exponential lower bound for the above model against a polynomial in VP. 4. Finally we observe that the techniques developed yield an exponential lower bound on the size of sums of products of syntactically multilinear arithmetic circuits computing a product of variable disjoint linear forms where the bottom sum gate and product gates at the second level have fan in bounded by a sub linear function. Our proof techniques are built on the measure developed by Kumar et al.[ICALP 2013] and are based on a non-trivial analysis of ROFs under random partitions. Further, our results exhibit strengths and provide more insight into the lower bound techniques introduced by Raz [STOC 2004]

Lower Bounds for Multilinear Order-Restricted ABPs

Proving super-polynomial lower bounds on the size of syntactic multilinear Algebraic Branching Programs (smABPs) computing an explicit polynomial is a challenging problem in Algebraic Complexity Theory. The order in which variables in {x_1,...,x_n} appear along any source to sink path in an smABP can be viewed as a permutation in S_n. In this article, we consider the following special classes of smABPs where the order of occurrence of variables along a source to sink path is restricted: 1) Strict circular-interval ABPs: For every sub-program the index set of variables occurring in it is contained in some circular interval of {1,..., n}. 2) L-ordered ABPs: There is a set of L permutations (orders) of variables such that every source to sink path in the smABP reads variables in one of these L orders, where L 0. We prove exponential (i.e., 2^{Omega(n^delta)}, delta>0) lower bounds on the size of above models computing an explicit multilinear 2n-variate polynomial in VP. As a main ingredient in our lower bounds, we show that any polynomial that can be computed by an smABP of size S, can be written as a sum of O(S) many multilinear polynomials where each summand is a product of two polynomials in at most 2n/3 variables, computable by smABPs. As a corollary, we show that any size S syntactic multilinear ABP can be transformed into a size S^{O(sqrt{n})} depth four syntactic multilinear Sigma Pi Sigma Pi circuit where the bottom Sigma gates compute polynomials on at most O(sqrt{n}) variables. Finally, we compare the above models with other standard models for computing multilinear polynomials