This paper narrates the experience of a Canadian university in reorienting its mining curriculum towards the goal of producing engineers who are sensitive to context. The authors acknowledge industry’s historical association with environmental degradation and imperialism, but counter that mining is necessary to provide the materials of civil infrastructure, particularly that required to reduce ...

Targeted poverty reduction programmes, advocated in contemporary poverty orthodoxy, heighten the importance of poverty information. Two divergent tendencies are discernible: tightened-up targeting through narrowed eligibility criteria; and a new epistemology of poverty based on qualitative and participatory methods. Statistical and qualitative analysis of findings from research in rural Colombi...

We study the provision of an excludable public good to discuss whether the imposition of participation constraints is desirable. It is shown that this question may equivalently be cast as follows: should a firm that produces a public good receive tax revenues, or face a self-financing requirement. The main result is that the desirability of participation constraints is shaped by an equity-effic...

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by χ=(G). It is interesting to note that if a graph G is equitably k-colorable, it does not imply that it is equitab...

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...

A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...