Effect of leachate recirculation and extent of degradation on the stability of bioreactor landfill slopes

The stability of a bioreactor landfill slope is influenced by the quantity and method of leachate recirculation as well as on the degree of decomposition. Other factors include properties variation of waste material and geometrical configurations, i.e., height and slope of landfills. Conventionally, the stability of slopes is evaluated using factor of safety approach, in which the variability in the engineering properties of MSW is not considered directly and stability issues are resolved from past experiences and good engineering judgments. On the other hand, probabilistic approach considers variability in mathematical framework and provides stability in a rational manner that helps in decision making. The objective of the present study is to perform a parametric study on the stability of a bioreactor landfill slope in probabilistic framework considering important influencing factors, such as, variation in MSW properties, amount of leachate recirculation, and age of degradation, in a systematic manner. The results are discussed in the light of existing relevant regulations, design and operation issues.

Vertex Cover Gets Faster and Harder on Low Degree Graphs

The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric objects, often turns out to be exactly the vertex cover problem on restricted classes of graphs. In this work we explore a particular instance of such a phenomenon. We consider the problem of hitting all axis-parallel slabs induced by a point set P, and show that it is equivalent to the problem of finding a vertex cover on a graph whose edge set is the union of two Hamiltonian Paths. We show the latter problem to be NP-complete, and also give an algorithm to find a vertex cover of size at most k, on graphs of maximum degree four, whose running time is 1.2637(k) n(O(1)).