Carvedilol is a novel, multiple-action cardiovascular drug that is currently approved in many countries for the treatment of hypertension. The reduction in blood pressure produced by carvedilol results primarily from beta-adrenoceptor blockade and vasodilation, the latter resulting from alpha 1-adrenoceptor blockade. These actions as well as several other carvedilol activities are associated with cardioprotection in animal models that occurs to a degree that is greater than that observed with other drugs. The multiple actions of carvedilol may also provide the underlying rationale for the use of the drug in the treatment of coronary artery disease and congestive heart failure (1).Carvedilol is well absorbed from the gastrointestinal tract but is subject to considerable first-pass metabolism in the liver; its absolute bioavailability is about 25%. It has a half-life of 2.2 ± 0.3 h; longer half-lives of about 6 h have been measured at lower concentrations (2, 3). Transdermal patches of carvedilol with a HPMC-drug reservoir were prepared by the solvent evaporation technique. In this investigation, the membranes of Eudragit RL100 and Eudragit RS100 were cast to achieve controlled release of the drug. The prepared patches possessed satisfactory physicochemical characteristics. Thickness, mass and drug content were uniform in prepared batches. Moisture vapour transmission through the patches followed zero-order kinetics. In vitro permeation studies were performed using a K-C diffusion cell across hairless guinea pig skin and followed the super case II transport mechanism. The effects of non-ionic surfactants Tween 80 and Span 80 on drug permeation were studied. The non--ionic surfactants in the patches increased the permeation rate, Span 80 exhibiting better enhancement relative to Tween 80. The patches were seemingly free of potentially hazardous skin irritation.

The results suggest that AQCE may exert its chemopreventive activity by acting as an antioxidant.

The objective of this study was to evaluate the cytotoxicity of (+)-cyanidan-3-ol (CD-3) in human hepatocellular carcinoma cell line (HepG2) and chemopreventive potential against hepatocellular carcinoma (HCC) in Balb/c mice. The HepG2 cell line was treated with CD-3 at various concentrations and the proliferation of the HepG2 cells was measure by 3-[4,5-dimethylthiazol-2-yl]-2,5-diphenyl-tetrazolium bromide (MTT), sulforhodamine B (SRB) and lactate dehydrogenase (LDH) assays. Cell apoptosis was detected by Hoechst 33258 (HO), Acridine orange/ethylene dibromide (AO/EB) staining, DNA fragmentation analysis and the apoptosis rate was detected by flow cytometry. The HCC tumor model was established in mice by injecting N-nitrosodiethylamine/carbon tetrachloride (NDEA/CCl4) and the effect of CD-3 on tumor growth in-vivo was studied. The levels of liver injury markers, tumor markers, and oxidative stress were measured. The expression levels of apoptosis-related genes in in-vitro and in vivo models were determined by RT-PCR and ELISA. The CD-3 induced cell death was considered to be apoptotic by observing the typical apoptotic morphological changes under fluorescent microscopy and DNA fragmentation analysis. Annexin V/PI assay demonstrated that apoptosis increased with increase in the concentration of CD-3. The expression levels of apoptosis-related genes that belong to bcl-2 and caspase family were increased and AP-1 and NF-κB activities were significantly suppressed by CD-3. Immunohistochemistry data revealed less localization of p53, p65 and c-jun in CD-3 treated tumors as compared to localization in NDEA/CCl4 treated tumors. Taken together, our data demonstrated that CD-3 could significantly inhibit the proliferation of HepG2 cells in-vitro and suppress HCC tumor growth in-vivo by apoptosis induction.

No abstract

The Traveling salesperson problem is one of the problem in mathematics and computer science which haddrown attention as it is easy to understand and difficult to solve. In this paper, we survey the various methods/techniques available to solve traveling salesman problem and analyze it to make critical evaluation of their time complexities. An implementation of the traveling salesman problem using dynamic programming is also presented in this paper which generates optimal answer and tested with 25 cities and it executes in reasonable time.