Factors associated with 2009 pandemic influenza A (H1N1) vaccination acceptance among university students from India during the post-pandemic phase

Background: There was a low adherence to influenza A (H1N1) vaccination program among university students and health care workers during the pandemic influenza in many parts of the world. Vaccination of high risk individuals is one of the recommendations of World Health Organization during the post-pandemic period. It is not documented about the student's knowledge, attitude and willingness to accept H1N1 vaccination during the post-pandemic period. We aimed to analyze the student's knowledge, attitude and willingness to accept H1N1 vaccination during the post-pandemic period in India. Methods: Vaccine against H1N1 was made available to the students of Vellore Institute of Technology, India from September 2010. The data are based on a cross-sectional study conducted during October 2010 to January 2011 using a self-administered questionnaire with a representative sample of the student population (N = 802). Results: Of the 802 respondents, only 102/802 (12.7%) had been vaccinated and 105/802 (13%) planned to do so in the future, while 595/802 (74%) would probably or definitely not get vaccinated in the future. The highest coverage was among the female (65/102, 63.7%) and non-compliance was higher among men in the group (384/595; 64.5%) (p < 0.0001). The representation of students from school of Bio-sciences and Bio-technology among vaccinees is significantly higher than that of other schools. Majority of the study population from the three groups perceived vaccine against H1N1 as the effective preventive measure when compared to other preventive measures. 250/595 (42%) of the responders argued of not being in the risk group. The risk perception was significantly higher among female (p < 0.0001). With in the study group, 453/802 (56.4%) said that they got the information, mostly from media. Conclusions: Our study shows that the vaccination coverage among university students remains very low in the post-pandemic period and doubts about the safety and effectiveness of the vaccine are key elements in their rejection. Our results indicate a need to provide accessible information about the vaccine safety by scientific authorities and fill gaps and confusions in this regard.

Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs

We address the parameterized complexity ofMaxColorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril IPL 1987] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n(O(q)) algorithm on chordal graphs. We first observe that the problem is W2]-hard parameterized by q, even on split graphs. However, when parameterized by l, the number of vertices in the solution, we give two fixed-parameter tractable algorithms. The first algorithm runs in time 5.44(l) (n+#alpha(G))(O(1)) where #alpha(G) is the number of maximal independent sets of the input graph. The second algorithm runs in time q(l+o()l())n(O(1))T(alpha) where T-alpha is the time required to find a maximum independent set in any induced subgraph of G. The first algorithm is efficient when the input graph contains only polynomially many maximal independent sets; for example split graphs and co-chordal graphs. The running time of the second algorithm is FPT in l alone (whenever T-alpha is a polynomial in n), since q <= l for all non-trivial situations. Finally, we show that (under standard complexitytheoretic assumptions) the problem does not admit a polynomial kernel on split and perfect graphs in the following sense: (a) On split graphs, we do not expect a polynomial kernel if q is a part of the input. (b) On perfect graphs, we do not expect a polynomial kernel even for fixed values of q >= 2.

Maximal regularity for second order non-autonomous Cauchy problems

We consider some non-autonomous second order Cauchy problems of the form u + B(t)(u) over dot + A(t)u = f (t is an element of [0, T]), u(0) = (u) over dot(0) = 0. We assume that the first order problem (u) over dot + B(t)u = f (t is an element of [0, T]), u(0) = 0, has L-p-maximal regularity. Then we establish L-p-maximal regularity of the second order problem in situations when the domains of B(t(1)) and A(t(2)) always coincide, or when A(t) = kappa B(t).

Identification of a class of non-linear systems

This paper considers the on-line identification of a non-linear system in terms of a Hammerstein model, with a zero-memory non-linear gain followed by a linear system. The linear part is represented by a Laguerre expansion of its impulse response and the non-linear part by a polynomial. The identification procedure involves determination of the coefficients of the Laguerre expansion of correlation functions and an iterative adjustment of the parameters of the non-linear gain by gradient methods. The method is applicable to situations involving a wide class of input signals. Even in the presence of additive correlated noise, satisfactory performance is achieved with the variance of the error converging to a value close to the variance of the noise. Digital computer simulation establishes the practicability of the scheme in different situations.