OBJECTIVES The first democratic government elected in South Africa in 1994 inherited huge inequities in health status and health provision across all sections of the population. This study set out to assess the impact of the new government's commitment to address these inequities and implement policies to improve population health in general and address inequalities in health care in particular...

Edge detection is a fundamental tool in image processing. Several edge detectors have been proposed in literature for enhancing and detecting edges in images. Image Edge detection significantly reduces the amount of data and filters out useless information, while preserving the important structural properties in an image. In this paper, the application of two-dimensional cellular automata using...

the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...

We investigate the complexity and approximability of network ow improvement problems. In these problems, one incurs costs for increasing the capacity of an edge, while the goal is to achieve a ow of maximum value through the network. We study several improvement strategies. Furthermore, we investigate the relationship of network ow improvement problems to network xed cost ow problems, where one...

Connectivity and edge-connectivity of a graph measure the difficulty of breaking the graph apart, but they are very much affected by local aspects like vertex degree. Average connectivity (and analogously, average edge-connectivity) has been introduced to give a more refined measure of the global “amount” of connectivity. In this paper, we prove a relationship between the average connectivity a...

Calcium fluoride nanoparticles with special amount of cerium ion (%1) were synthesized by coprecipitation. Fourier transforms infrared spectroscopy (FTIR), X-ray diffraction (XRD), absorption and photoluminescence (PL) from CaF2Ce nanoparticles has been investigated. FTIR spectra reveal that there are some amounts of OH, NO3 and other organic functional groups on the parti...

We study the amount of knowledge about the future that an online algorithm needs to color the edges of a graph optimally (i.e. using as few colors as possible). Assume that along with each edge, the online algorithm receives a fixed number of advice bits. For graphs of maximum degree ∆, it follows from Vizing’s Theorem that ⌈log(∆+ 1)⌉ bits per edge suffice to achieve optimality. We show that e...

This letter presents a lossless data hiding scheme for digital images which uses an edge detector to locate plain areas for embedding. The proposed method takes advantage of the well-known gradient adjacent prediction utilized in image coding. In the suggested scheme, prediction errors and edge values are first computed and then, excluding the edge pixels, prediction error values are slightly m...

Edge detection is the first step in many computer vision applications. Edge detection of image significantly reduces the amount of data and filters out unwanted or insignificant information and gives the significant information in an image. This information is used in image processing to detect objects in which there are some problems like false edge detection, missing of low contrast boundarie...