Regional hydrological impacts of climate change: implications for water management in India

Climate change is most likely to introduce an additional stress to already stressed water systems in developing countries. Climate change is inherently linked with the hydrological cycle and is expected to cause significant alterations in regional water resources systems necessitating measures for adaptation and mitigation. Increasing temperatures, for example, are likely to change precipitation patterns resulting in alterations of regional water availability, evapotranspirative water demand of crops and vegetation, extremes of floods and droughts, and water quality. A comprehensive assessment of regional hydrological impacts of climate change is thus necessary. Global climate model simulations provide future projections of the climate system taking into consideration changes in external forcings, such as atmospheric carbon-dioxide and aerosols, especially those resulting from anthropogenic emissions. However, such simulations are typically run at a coarse scale, and are not equipped to reproduce regional hydrological processes. This paper summarizes recent research on the assessment of climate change impacts on regional hydrology, addressing the scale and physical processes mismatch issues. Particular attention is given to changes in water availability, irrigation demands and water quality. This paper also includes description of the methodologies developed to address uncertainties in the projections resulting from incomplete knowledge about future evolution of the human-induced emissions and from using multiple climate models. Approaches for investigating possible causes of historically observed changes in regional hydrological variables are also discussed. Illustrations of all the above-mentioned methods are provided for Indian regions with a view to specifically aiding water management in India.

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.