Graphoidal Tree d - Cover

Acharya and Sampathkumar defined a graphoidal cover as a partition of edges into internally disjoint (not necessarily open) paths. If we consider only open paths in the above definition then we call it as a graphoidal path cover

Reliability Estimation Model for Software Components Using CEP

This paper presents a graphical complexity measure based approach with an illustration for estimating the reliability of software component. This paper also elucidates how the graph-theory concepts are applied in the field of software programming. The control graphs of several actual software components are described and the correlation between intuitive complexity and the graph-theoretic complexity are illustrated. Several properties of the graph theoretic complexity are presented which shows that the software component complexity depends only on the decision structure. A symbolic reliability model for component based software systems from the execution path of software components connected in series, parallel or mixed configuration network structure is presented with a crisp narration of the factors which influence computation of the overall reliability of component based software systems. In this paper, reliability estimation model for software components using Component Execution Paths (CEP) based on graph theory is elucidated

Bulk queueing system with starting failure and single vacation

To analyze an M^([X])/G(a,b)/1 queue with starting failure, repair and single vacation. This type of queueing model has a wide range of applications in production/manufacturing systems. Important performance measures and stability conditions are obtained. Further, we discuss some particular cases. Finally, numerical results of the proposed model have been derived

Permanental Mates: Perturbations and Hwang’s conjecture

AbstractLet Ωn denote the set of all n×n doubly stochastic matrices. Two unequal matrices A and B in Ωn are called permanental mates if the permanent function is constant on the line segment tA+(1−t)B,0≤t≤1, connecting A and B. We study the perturbation matrix A+E of a symmetric matrix A in Ωn as a permanental mate of A. Also we show an example to disprove Hwang’s conjecture, which states that, for n≥4, any matrix in the interior of Ωn has no permanental mate

Adoption of recommended technologies by rubber growers in Kanyakumari district of Tamil Nadu

Rubber being an important plantation crop in our country, an attempt was made to analyse the adoption behaviour of rubber growers and the associated factors. The study was carried out in Thiruvattar block, Kanyakumari district of Tamil Nadu. Around 150 rubber growers were interviewed personally through a well structured and pre-tested interview schedule. Percentage analysis, cumulative frequency, simple correlation coefficient and multiple regressions were used for data analysis. Fourteen independent variables and one dependent variable were studied. Out of fourteen independent variables farming experience and scientific orientation had shown positive and significant association with adoption and mass media exposure had shown negative and significant relationship with the adoption. The results showed that 53.7 per cent of variation in the adoption and the results fit in the regression equation. Twenty five practices were identified to assess the adoption behaviour of rubber growers on rubber cultivation practices. Majority of the rubber growers had medium level of adoption on rubber cultivation practices. Regarding practice wise adoption, majority of the respondents adopted recommended spacing, weeding, first tapping during seventh year, tapping at the appropriate time, using tapping implements, yield stimulant and application of anti-coagulant in latex

PRAMIPEXOLE DIHYDROCHLORIDE LOADED MPEGPCL NANOSUSPENSION BY MODIFIED NANOPRECIPITATION: IN VITRO AND IN VIVO EVALUATION

AbstractAim and Objectives The present study was carried out to show the potential neuroprotective effects in both invitro and invivo pramipexole dihydrochloride nanosuspension for the treatment in Parkinson's disease.Materials and Methods: Nanosuspension of pramipexole dihydrochloride was prepared with MPEG-PCL and Pluronic F68 by the process of modified nanoprecipitation technique with different concentrations of MPEG-PCL. The particle size, zeta potential, SEM, TEM and invitro dug release where performed. The cell viability study was performed by using SH-SY5Y cells. Further the formulation is evaluated for its antioxidant potential against rotenone induced neuronal damage in Wister rats such as enzymatic, non enzymatic antioxidants and histopathological evaluation.Result and Discussion: The nanoformulation shows least particle size of 143 nm and maximum zeta potential value 33.4 mv with 88.53% entrapment efficiency were observed with PMPNP 2 formulation. The SEM, TEM and invitro dug release of PMPNP 2 were shows spherical shape with controlled release when compared to other formulations. Further the MTT assay were performed by using SH-SY5Y cells which shows more than 50 % cell viability with 50 µl of PPMNP 2 nanoformulation. Further the antioxidant potential done in rotenone induced neuronal damage in Wister rats. The results showed elevation in the levels of enzymatic and non enzymatic antioxidants compared with neuronal toxic group. Further nanoformulation group showed decrease in levels of LPO which correlates with histopathological architecture.Conclusion: Our study concluded that nanoformulation showed better protective potential in both invitro and invivo compare to free drug for the treatment in Parkinson's disease.Keywords: Pramipexoledihydrochloride; MPEG-PCL; SH-SY5Y cells; Nanoprecipitation; Parkinson's disease

Pair difference cordial labeling of some union of graphs

Let G = (V, E) be a (p, q) graph. Define ρ = {p/2 if p is even p−1/2 if p is odd and L = {±1, ±2, ±3, · · · , ±ρ} called the set of labels. Consider a mapping f : V → L by assigning different labels in L to the different elements of V when p is even and different labels in L to p-1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair difference cordial labeling if for each edge uv of G there exists a labeling |f(u) − f(v)| such that ∆f1 − ∆fc1 ≤ 1, where ∆f1 and ∆fc1respectively denote the number of edges labeled with 1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate the pair difference cordial labeling behavior of the union of some graphs like path, cycle, star and bistar graph.Publisher's Versio