Vegetation Status in Uttara Kannada District

Uttara Kannada is the only district in Karnataka, which has a forested area of about 80% and falls in the region of the Western Ghats. It is considered to be a very resourceful in terms of abundant natural resources and constitutes an important district in Karnataka. The forest resources of the district are under pressure as a large portion of the forested area has been converted to non-forestry activities since independence owing to the increased demands from human and animal population resulting in degradation of the forest ecosystem. This has led to poor productivity and regenerative capacity which is evident in the form of barren hill tops, etc in Coastal taluks of Uttara Kannada, entailing regular monitoring of the forest resources very essential. The classification of forest is a prerequisite for managing forest resources. Geographical Information System (GIS), allows the spatial and temporal analysis of the features of interest, and helps in solving the problem of deforestation and associated environmental and ecological problems. Spatial and temporal tools such as GIS and remotely sensed data helps the planners and decision makers in evolving the sustainable strategies for management and conservation of natural resources. Uttara Kannada district was classified on the basis of the land-use using supervised hard classifiers. The land use categories identified were urban area, water bodies, agricultural land, forest cover, and waste land. Further classification was carried out on the basis of forest type. The types of forest categorised were semi-evergreen, evergreen, moist deciduous, dry deciduous, plantations and scrub, thorny and non-forested area. The identified classes were correlated with the ground data collected during field visits. The observed results were compared with the historic data and the changes in the forest cover were analysed. From the assessment made it was clear that there has been a considerable degree of forest loss in certain areas of the district. It was also observed that plantations and social forests have increased drastically over the last fifteen years, and natural forests have declined.

Vegetation Analysis in Uttara Kannada District Using GIS and Remote Sensing Techniques

Uttara Kannada is the only district in Karnataka, which has a forested area of about 80% and falls in the region of the Western Ghats. It is considered to be a very resourceful in terms of abundant natural resources and constitutes an important district in Karnataka. The forest resources of the district are under pressure as a large portion of the forested area has been converted to non-forestry activities since independence owing to the increased demands from human and animal population resulting in degradation of the forest ecosystem. This has led to poor productivity and regenerative capacity which is evident in the form of barren hill tops, etc in Coastal taluks of Uttara Kannada, entailing regular monitoring of the forest resources very essential. The classification of forest is a prerequisite for managing forest resources. Geographical Information System (GIS), allows the spatial and temporal analysis of the features of interest, and helps in solving the problem of deforestation and associated environmental and ecological problems. Spatial and temporal tools such as GIS and remotely sensed data helps the planners and decision makers in evolving the sustainable strategies for management and conservation of natural resources. Uttara Kannada district was classified on the basis of the land-use using supervised hard classifiers. The land use categories identified were urban area, water bodies, agricultural land, forest cover, and waste land. Further classification was carried out on the basis of forest type. The types of forest categorised were semi-evergreen, evergreen, moist deciduous, dry deciduous, plantations and scrub, thorny and non-forested area. The identified classes were correlated with the ground data collected during field visits. The observed results were compared with the historic data and the changes in the forest cover were analysed. From the assessment made it was clear that there has been a considerable degree of forest loss in certain areas of the district. It was also observed that plantations and social forests have increased drastically over the last fifteen years,and natural forests have declined.

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

Stochastic Algorithms for Discrete Parameter Simulation Optimization

We present two efficient discrete parameter simulation optimization (DPSO) algorithms for the long-run average cost objective. One of these algorithms uses the smoothed functional approximation (SFA) procedure, while the other is based on simultaneous perturbation stochastic approximation (SPSA). The use of SFA for DPSO had not been proposed previously in the literature. Further, both algorithms adopt an interesting technique of random projections that we present here for the first time. We give a proof of convergence of our algorithms. Next, we present detailed numerical experiments on a problem of admission control with dependent service times. We consider two different settings involving parameter sets that have moderate and large sizes, respectively. On the first setting, we also show performance comparisons with the well-studied optimal computing budget allocation (OCBA) algorithm and also the equal allocation algorithm. Note to Practitioners-Even though SPSA and SFA have been devised in the literature for continuous optimization problems, our results indicate that they can be powerful techniques even when they are adapted to discrete optimization settings. OCBA is widely recognized as one of the most powerful methods for discrete optimization when the parameter sets are of small or moderate size. On a setting involving a parameter set of size 100, we observe that when the computing budget is small, both SPSA and OCBA show similar performance and are better in comparison to SFA, however, as the computing budget is increased, SPSA and SFA show better performance than OCBA. Both our algorithms also show good performance when the parameter set has a size of 10(8). SFA is seen to show the best overall performance. Unlike most other DPSO algorithms in the literature, an advantage with our algorithms is that they are easily implementable regardless of the size of the parameter sets and show good performance in both scenarios.

A relook at Reissner's theory of plates in bending

Shear deformation and higher order theories of plates in bending are (generally) based on plate element equilibrium equations derived either through variational principles or other methods. They involve coupling of flexure with torsion (torsion-type) problem and if applied vertical load is along one face of the plate, coupling even with extension problem. These coupled problems with reference to vertical deflection of plate in flexure result in artificial deflection due to torsion and increased deflection of faces of the plate due to extension. Coupling in the former case is eliminated earlier using an iterative method for analysis of thick plates in bending. The method is extended here for the analysis of associated stretching problem in flexure.

Increased glycosidic bond stabilities in 4-C-hydroxymethyl linked disaccharides

Three new hydroxymethyl-linked non-natural disaccharide analogues, containing an additional methylene group in between the glycosidic linkage, were synthesized by utilizing 4-C-hydroxymethyl-alpha-D-glucopyranoside as the glycosyl donor. A kinetic study was undertaken to assess the hydrolytic stabilities of these new disaccharide analogues toward acid-catalyzed hydrolysis, at 60 degrees C and 70 degrees C. The studies showed that the disaccharide analogues were stable, by an order of magnitude, than naturally-occurring disaccharides, such as, cellobiose, lactose, and maltose. The first order rate constants were lower than that of methyl glycosides and the trend of hydrolysis rate constants followed that of naturally-occurring disaccharides. alpha-Anomer showed faster hydrolysis than the beta-anomer and the presence of axial hydroxyl group also led to faster hydrolysis among the disaccharide analogues. Energy minimized structures, derived through molecular modeling, showed that dihedral angles around the glycosidic bond in disaccharide analogues were nearly similar to that of naturally-occurring disaccharides. (C) 2011 Elsevier Ltd. All rights reserved.

Convergence problems in a class of model reference adaptive control systems

A class of model reference adaptive control system which make use of an augmented error signal has been introduced by Monopoli. Convergence problems in this attractive class of systems have been investigated in this paper using concepts from hyperstability theory. It is shown that the condition on the linear part of the system has to be stronger than the one given earlier. A boundedness condition on the input to the linear part of the system has been taken into account in the analysis - this condition appears to have been missed in the previous applications of hyperstability theory. Sufficient conditions for the convergence of the adaptive gain to the desired value are also given.

Scattering theory and linear optimal control: Regulator and servo problems

In this paper, several known computational solutions are readily obtained in a very natural way for the linear regulator, fixed end-point and servo-mechanism problems using a certain frame-work from scattering theory. The relationships between the solutions to the linear regulator problem with different terminal costs and the interplay between the forward and backward equations have enabled a concise derivation of the partitioned equations, the forward-backward equations, and Chandrasekhar equations for the problem. These methods have been extended to the fixed end-point, servo, and tracking problems.