Demand for Money in the Asian Countries: A Systems GMM Panel Data Approach and Structural Breaks

A systems GMM method is used to estimate the demand for money (M1) for a panel of 11 Asian countries from 1970 to 2007. This method has advantages of which the most important one is its ability to minimise small sample bias with persistence in the variables. This system GMM method of Blundell and Bond (1998) simultaneously estimates specifications with the levels and first differences specifications of the variables. We test for structural stability of the estimated function with a recently developed test, for this approach, by Mancini-Griffoli and Pauwels (2006). Our results show that there is a well defined demand for money for these countries and there are no structural breaks.Systems GMM, Blundell and Bond, Mancini-Griffoli and Pauwels, Asian Countries and Demand for Money and Structural Sta

Formulation and evaluation of a sublingual tablet containing terbutaline sulphate: optimisation and in vivo studies

La finalidad de este trabajo de investigación es la formulación de un comprimido sublingual de sulfatode terbutalina de acción rápida y mejorar la biodisponibilidad y el cumplimiento de las pautas por partedel paciente. Para la preparación de los gránulos se utilizó una técnica de granulación húmeda. Seprepararon formulaciones basadas en el diseño factorial con variables de formulación 32: la cantidad decelulosa microcristalina (MCC) (X1) y la crospovidona como componente bioadhesivo (X2). Comovariables de respuesta se evaluaron la resistencia al aplastamiento, la friabilidad y el tiempo de desintegración(DT). Los principales efectos y términos de interacción se evaluaron cuantitativamente medianteun modelo cuadrático. Los resultados revelaron que la cantidad de MCC y crospovidona afectabansignificativamente a las variables de respuesta. La formulación optimizada de comprimidos contiene 31,5mg de MCC y 4,5 mg de crospovidona, se desintegra en un período corto con un índice DT de 30,2+ 5,5 seg. y tiene una resistencia al aplastamiento suficiente y una friabilidad aceptable. Las concentracionesplasmáticas de terbutalina se obtuvieron a los 5 minutos. Los resultados indican que lacrospovidona, un componente bioadhesivo, impide tragar la terbutalina, sin afectar a su liberación yabsorción. En conclusión, la formulación del comprimido sublingual se puede extrapolar a otros fármacosen los que se desee una absorción rápida.The objective of this research was to formulate a sublingual tablet formulation of terbutaline for rapidaction, and to improve both bioavailability and patient compliance to therapy. A wet granulation techniquewas adapted to prepare the granules. Granule formulations were prepared using an adapted wet granulationtechnique based on a 32 full factorial design. The formulation variables were expressed as follows;quantity of microcrystalline cellulose (MCC), (X1), and bioadhesive component crospovidone, (X2),while crushing strength, friability and disintegration time (DT) were determined as response variables.The main effects and interaction terms were quantitatively evaluated using a quadratic model. The resultsobtained showed that the quantity of MCC and crospovidone significantly affect response variables. Anoptimised tablet formulation, containing 31.5 mg of MCC and 4.5 mg of crospovidone, provides a shortDT of 30.2 + 5.5 sec with sufficient crushing strength and acceptable friability, while DT for serumconcentrations of terbutaline were obtained within 5 min. The results indicate that the inclusion ofcrospovidone, a bioadhesive component, in sublingual tablet formulations, makes the swallowing of tablets unnecessary, because the release and absorption of the terbutaline in such formulations isacceptably effective. In conclusion, the developed sublingual tablet formulations is of interest, becauseit can be extrapolated to other drugs, where rapid absorption is desirable

Beneficiation of Bababudan Low Grade Magnetite ores - A Technical Appraisal

The horse-shoe shaped Bababudan range of low grade magnetite ore deposits in the western part of Karnataka State, India, is distributed over a length of about 25 kms. The deposits have for convenience, been divided into three continuous blocks viz., Rudragiri, Attigundi and Mahal. The huge ore reserves, proximity to the Manglore Port for possible export of iron ore and connection with Bangalore and Manglore cities through national highways, make these deposits prospective for exploration

Parameterised Counting in Logspace

Logarithmic space bounded complexity classes such as L and NL play a central role in space bounded computation. The study of counting versions of these complexity classes have lead to several interesting insights into the structure of computational problems such as computing the determinant and counting paths in directed acyclic graphs. Though parameterised complexity theory was initiated roughly three decades ago by Downey and Fellows, a satisfactory study of parameterised logarithmic space bounded computation was developed only in the last decade by Elberfeld, Stockhusen and Tantau (IPEC 2013, Algorithmica 2015). In this paper, we introduce a new framework for parameterised counting in logspace, inspired by the parameterised space bounded models developed by Elberfeld, Stockhusen and Tantau (IPEC 2013, Algorithmica 2015). They defined the operators para_W and para_? for parameterised space complexity classes by allowing bounded nondeterminism with multiple-read and read-once access, respectively. Using these operators, they characterised the parameterised complexity of natural problems on graphs. In the spirit of the operators para_W and para_? by Stockhusen and Tantau, we introduce variants based on tail-nondeterminism, para_{W[1]} and para_{?tail}. Then, we consider counting versions of all four operators applied to logspace and obtain several natural complete problems for the resulting classes: counting of paths in digraphs, counting first-order models for formulas, and counting graph homomorphisms. Furthermore, we show that the complexity of a parameterised variant of the determinant function for (0,1)-matrices is #para_{?tail} L-hard and can be written as the difference of two functions in #para_{?tail} L. These problems exhibit the richness of the introduced counting classes. Our results further indicate interesting structural characteristics of these classes. For example, we show that the closure of #para_{?tail} L under parameterised logspace parsimonious reductions coincides with #para_? L, that is, modulo parameterised reductions, tail-nondeterminism with read-once access is the same as read-once nondeterminism. Initiating the study of closure properties of these parameterised logspace counting classes, we show that all introduced classes are closed under addition and multiplication, and those without tail-nondeterminism are closed under parameterised logspace parsimonious reductions. Also, we show that the counting classes defined can naturally be characterised by parameterised variants of classes based on branching programs in analogy to the classical counting classes. Finally, we underline the significance of this topic by providing a promising outlook showing several open problems and options for further directions of research

Vegetative vigour, yield and field tolerance to leaf rust in four F1 hybrids of coffee (Coffea arabica L.) in India

Four F1 hybrids of arabica coffee (Coffea arabica L.) developed with the primary objective of pyramiding the SH3 gene for leaf rust resistance in a commercial variety ‘Chandragiri’ for achieving the long-lasting resistance to leaf rust, have been evaluated in field. Two hybrids (S.5083 and S.5084) were derived from a donor heterozygous to SH3, while the other two hybrids (S.5085 and S.5086) were developed from donor homozygous to SH3. Among the hybrids, S.5086 recorded superior yield performance during individual years with a maximum yield of 1611 kg/ha during 2020-21 and the four year mean yield of 1313 kg/ha. The hybrid exhibited maximum heterosis over mid parent (29.10%) and better parent (17.12%) and S.5086 progeny also manifested high field tolerance to leaf rust pathogen as the entire plant population was free from the disease incidence throughout the study period. The findings of the present study established the efficiency of F1 breeding strategy with simultaneous pyramiding of rust resistance genes for development of vigorous, high yielding and durable rust resistant F1 hybrids in arabica. The F1 hybrid, S.5086 with promising performance in terms of crop yield and high field tolerance to leaf rust has potential implications for commercial exploitation

Development of gastro retentive drug delivery system of cephalexin by using factorial design

The objective of this research work was to formulate and optimize the floating drug delivery system containing cephalexin using 23 factorial design. Floating tablets were prepared by direct compression method incorporating HPMC K4M, xanthan gum, guar gum, sodium bicarbonate and tartaric acid as gas generating agent. The influence of independent variables like, polymer: polymer ratio, polymer type and tartaric acid on floating lag time and cephalexin release profile were studied. The diffusion exponent (n) of Krosmeyer Peppas for optimized formulation was found to be 0.635 which indicates the mechanism of drug release was anomalous transport. Floating lag time of optimized formulation was 1.50 min and remained buoyant for 24 hrs. Optimized formulation was checked for stability at 40ºC / 75% RH which was found to be stable. Scanning electron microscopy study revealed gel formation. FT-IR studies revealed that there was no chemical interaction between cephalexin and other excipients

Parameterised Counting in Logspace

Logarithmic space-bounded complexity classes such as L and NL play a central role in space-bounded computation. The study of counting versions of these complexity classes have lead to several interesting insights into the structure of computational problems such as computing the determinant and counting paths in directed acyclic graphs. Though parameterised complexity theory was initiated roughly three decades ago by Downey and Fellows, a satisfactory study of parameterised logarithmic space-bounded computation was developed only in the last decade by Elberfeld, Stockhusen and Tantau (IPEC 2013, Algorithmica 2015). In this paper, we introduce a new framework for parameterised counting in logspace, inspired by the parameterised space-bounded models developed by Elberfeld, Stockhusen and Tantau. They defined the operators paraW and paraβ for parameterised space complexity classes by allowing bounded nondeterminism with multiple-read and read-once access, respectively. Using these operators, they characterised the parameterised complexity of natural problems on graphs. In the spirit of the operators paraW and paraβ by Stockhusen and Tantau, we introduce variants based on tail-nondeterminism, paraW[1] and paraβtail. Then, we consider counting versions of all four operators and apply them to the class L. We obtain several natural complete problems for the resulting classes: counting of paths in digraphs, counting first-order models for formulas, and counting graph homomorphisms. Furthermore, we show that the complexity of a parameterised variant of the determinant function for (0, 1)-matrices is # paraβtailL-hard and can be written as the difference of two functions in # paraβtailL. These problems exhibit the richness of the introduced counting classes. Our results further indicate interesting structural characteristics of these classes. For example, we show that the closure of # paraβtailL under parameterised logspace parsimonious reductions coincides with # paraβL. In other words, in the setting of read-once access to nondeterministic bits, tail-nondeterminism coincides with unbounded nondeterminism modulo parameterised reductions. Initiating the study of closure properties of these parameterised logspace counting classes, we show that all introduced classes are closed under addition and multiplication, and those without tail-nondeterminism are closed under parameterised logspace parsimonious reductions. Finally, we want to emphasise the significance of this topic by providing a promising outlook highlighting several open problems and directions for further research

PREPARATION AND EVALUATION OF CYCLODEXTRIN COMPLEXES OF ANTI-TUBERCULAR DRUG RIFAMPICIN FOR IMPROVED BIOAVAILABILITY

The aim of the study was to increase the aqueous solubility, dissolution rate, stability, in vitro anti-tubercular activity and bioavailability of rifampicin by the way of inclusion complexation. Methyl B-cyclodextrin in case of rifampicin were used. Based on phase solubility studies that stoichiometry of complex of with respect to B-cyclodextrin for rifampicin was found to be 1:1 molar ratio. Different methods of preparation such as kneading and common solvent were employed to prepare the complexes. Formation of complexes In case of rifampicin, interaction of 4-methyl piperazin-1-ylimino-methyl (side chain) of rifampicin with the cyclodextrin molecule was confirmed by FTIR and 1H-NMR. The complexes prepared by different methods were subjected to solubility and in vitro dissolution studies. In case of rifampicin, in vitro anti-tubercular activity was found to be enhanced for the complexes of rifampicin indicated by a reduction in MIC of rifampicin. The oral bioavailability of rifampicin-MB-CD complex prepared by common solvent method was improved significantly. The results of stability studies revealed that stability of the drugs in solution and solid state were improved significantly due to complexation. Photostability of rifampicin is enhanced significantly by the way of complexation. Thus inclusion complexation of rifampicin with B-cyclodextrin, B-cyclodextrin derivatives and y-cyclodextrin improved its physical properties, bioavailability and in vitro activity

Bacillus cereus KLUVAA Mediated Biocement Production Using Hard Water and Urea

In the present study, a potential bacterial strain with maximum urease activity was isolated from urea-rich paddy field soil for biocement production. The bacterial isolate was screened using Christensen selective agar media and named as KLUVAA. This isolate was found to be tolerant up to 10 % urea. 16S rRNA sequencing analysis identified the isolate KLUVAA as Bacillus cereus. Biocement production was carried out using tap water with 431.7 mg L–1 of hardness as a natural source of calcium. Functional groups present in biocement were analysed using FT-IR spectrum. The morphology and elemental composition of the biocement was studied using SEM with EDS mapping and XRD analyses. Thermogravimetric analysis was used to study the thermal stability of the microbial biocement. Further, process parameters were optimized for enhancing the yield of biocement. This work is licensed under a Creative Commons Attribution 4.0 International License