Climatic variability in Central Indian Himalaya during the last similar to 1800 years: Evidence from a high resolution speleothem record

Stable isotopes from a U/Th dated aragonite stalagmite from the Central Kumaun Himalaya provide evidence of variation in climatic conditions in the last similar to 1800 years. The delta O-18 and delta C-13 values vary from -4.3 parts per thousand to -7.6 parts per thousand and -3.4 parts per thousand to -9.1 parts per thousand respectively, although the stalagmite was not grown in isotopic equilibrium with cave drip water, a clear palaeoclimatic signal in stalagmite delta O-18 values is evident based on the regional climate data. The stalagmite showed a rapid growth rate during 830-910 AD, most likely the lower part of Medieval Warm Period (MWP), and 1600-1640 AD, the middle part of Little Ice Age (LIA). Two distinct phases of reduced precipitation are marked by a 2 parts per thousand shift in 8180 values towards the end of MWP (similar to 1080-1160 AD) and after its termination from similar to 1210 to 1440 AD. The LIA (similar to 1440-1880 AD) is represented by sub-tropical climate similar to modern conditions, whereas the post-LIA was comparatively drier. The Inter Tropical Convergence Zone (ITCZ) was located over the cave location during wetter/warmer conditions. When it shifted southward, precipitation over the study area decreased. A prominent drop in delta O-18 and delta C-13 values during the post-LIA period may also have been additionally influenced by anthropogenic activity in the area. (C) 2013 Elsevier Ltd and INQUA. All rights reserved.

An Algorithm to Decide Feasibility of Linear Integer Constraints Occurrng in Decision Tables

Abstract-To detect errors in decision tables one needs to decide whether a given set of constraints is feasible or not. This paper describes an algorithm to do so when the constraints are linear in variables that take only integer values. Decision tables with such constraints occur frequently in business data processing and in nonnumeric applications. The aim of the algorithm is to exploit. the abundance of very simple constraints that occur in typical decision table contexts. Essentially, the algorithm is a backtrack procedure where the the solution space is pruned by using the set of simple constrains. After some simplications, the simple constraints are captured in an acyclic directed graph with weighted edges. Further, only those partial vectors are considered from extension which can be extended to assignments that will at least satisfy the simple constraints. This is how pruning of the solution space is achieved. For every partial assignment considered, the graph representation of the simple constraints provides a lower bound for each variable which is not yet assigned a value. These lower bounds play a vital role in the algorithm and they are obtained in an efficient manner by updating older lower bounds. Our present algorithm also incorporates an idea by which it can be checked whether or not an (m - 2)-ary vector can be extended to a solution vector of m components, thereby backtracking is reduced by one component.