Pramod Kumar Singh

Learn More
BACKGROUND In rural India, most births take place in the home, where high-risk care practices are common. We developed an intervention of behaviour change management, with a focus on prevention of hypothermia, aimed at modifying practices and reducing neonatal mortality. METHODS We did a cluster-randomised controlled efficacy trial in Shivgarh, a rural(More)
Interest in the area of Mobile Ad-hoc Network (MANET) is growing since last few years because of its practical applications and requirement of communication in mobile devices. However, in comparison to wired network or infrastructure-based wireless network, MANET is particularly vulnerable to security attacks due to its fundamental characteristics, e.g.,(More)
The 0-1 knapsack problem is a well-studied combinatorial optimization problem and much research has been performed on many variants of the problem [1,28]. There are single and multiobjective versions of the problem involving one and m-dimensional knapsacks [9,15]. Even the single objective case has been proven to be NP-hard. Much research for the single(More)
The problem of computing spanning trees along with specific constraints is mostly NP-hard. Many approximation and stochastic algorithms which yield a single solution, have been proposed. In this paper, we formulate the generic multi-objective spanning tree (MOST) problem and consider edge-cost and diameter as the two objectives. Since the problem is hard,(More)
Although gender-based health disparities are prevalent in India, very little data are available on care-seeking patterns for newborns. In total, 255 mothers were prospectively interviewed about their perceptions and action surrounding the health of their newborns in rural Uttar Pradesh, India. Perception of illness was significantly lower in incidence(More)
In this paper, we consider a biobjective minimum spanning tree problem (MOST) and minimize two objectives - tree cost and diameter - in terms of Pareto-optimality. We assess the quality of obtained MOEA solutions in comparison to well-known diameter-constrained minimum spanning tree (dc-MST) algorithms and further improve MOEA solutions using(More)