Influence of land use changes in river basins on diversity and distribution of amphibians

Land-use changes influence local biodiversity directly, and also cumulatively, contribute to regional and global changes in natural systems and quality of life. Consequent to these, direct impacts on the natural resources that support the health and integrity of living beings are evident in recent times. The Western Ghats being one of the global biodiversity hotspots, is reeling under a tremendous pressure from human induced changes in terms of developmental projects like hydel or thermal power plants, big dams, mining activities, unplanned agricultural practices,monoculture plantations, illegal timber logging, etc. This has led to the once contiguous forest habitats to be fragmented in patches, which in turn has led to the shrinkage of original habitat for the wildlife, change in the hydrological regime of the catchment, decreased inflow in streams,human-animal conflicts, etc. Under such circumstances, a proper management practice is called for requiring suitable biological indicators to show the impact of these changes, set priority regions and in developing models for conservation planning. Amphibians are regarded as one of the best biological indicators due to their sensitivity to even the slightest changes in the environment and hence they could be used as surrogates in conservation and management practices. They are the predominating vertebrates with a high degree of endemism (78%) in Western Ghats. The present study is an attempt to bring in the impacts of various land-uses on anuran distribution in three river basins. Sampling was carried out for amphibians during all seasons of 2003-2006 in basins of Sharavathi, Aghanashini and Bedthi. There are as many as 46 species in the region, one of which is new to science and nearly 59% of them are endemic to the Western Ghats. They belong to nine families, Dicroglossidae being represented by 14 species,followed by Rhacophoridae (9 species) and Ranidae (5 species). Species richness is high in Sharavathi river basin, with 36 species, followed by Bedthi 33 and Aghanashini 27. The impact of land-use changes, was investigated in the upper catchment of Sharavathi river basin. Species diversity indices, relative abundance values, percentage endemics gave clear indication of differences in each sub-catchment. Karl Pearson’s correlation coefficient (r) was calculated between species richness, endemics, environmental descriptors, land-use classes and fragmentation metrics. Principal component analysis was performed to depict the influence of these variables. Results show that sub-catchments with lesser percentage of forest, low canopy cover, higher amount of agricultural area, low rainfall have low species richness, less endemic species and abundant non-endemic species, whereas endemism, species richness and abundance of endemic species are more in the sub-catchments with high tree density, endemic trees, canopy cover, rainfall and lower amount of agriculture fields. This analysis aided in prioritising regions in the Sharavathi river basin for further conservation measures.

A System-C based Micro architectural Exploration Framework for Latency, Power and Performance Trade-offs of On-Chip Interconnection

We describe a System-C based framework we are developing, to explore the impact of various architectural and microarchitectural level parameters of the on-chip interconnection network elements on its power and performance. The framework enables one to choose from a variety of architectural options like topology, routing policy, etc., as well as allows experimentation with various microarchitectural options for the individual links like length, wire width, pitch, pipelining, supply voltage and frequency. The framework also supports a flexible traffic generation and communication model. We provide preliminary results of using this framework to study the power, latency and throughput of a 4x4 multi-core processing array using mesh, torus and folded torus, for two different communication patterns of dense and sparse linear algebra. The traffic consists of both Request-Response messages (mimicing cache accesses)and One-Way messages. We find that the average latency can be reduced by increasing the pipeline depth, as it enables higher link frequencies. We also find that there exists an optimum degree of pipelining which minimizes energy-delay product.

On the Successive Refinability of MIMO channels: DMT and codes

Diversity embedded space time codes are high rate codes that are designed such that they have a high diversity code embedded within them. A recent work by Diggavi and Tse characterizes the performance limits that can be achieved by diversity embedded space-time codes in terms of the achievable Diversity Multiplexing Tradeoff (DMT). In particular, they have shown that the trade off is successively refinable for rayleigh fading channels with one degree of freedom using superposition coding and Successive Interference Cancellation (SIC). However, for Multiple-Input Multiple-Output (MIMO) channels, the questions of successive refinability remains open. We consider MIMO Channels under superposition coding and SIC. We derive an upper bound on the successive refinement characteristics of the DMT. We then construct explicit space time codes that achieve the derived upper bound. These codes, constructed from cyclic division algebras, have minimal delay. Our results establish that when the channel has more than one degree of freedom, the DMT is not successive refinable using superposition coding and SIC. The channels considered in this work can have arbitrary fading statistics.

An Empirical Evaluation of Novelty-SAPPhIRE Relationship

The research shown in this paper is to check whether a framework for designing: GEMS of SAPPhIRE as req-sol, developed earlier, can support in the designing of novel concepts. This is done by asking the questions: (a) Is there a relationship between the constructs of the framework and novelty? (b) If there is a relationship, what is the degree of this relationship? A hypothesis — an increase in the size and variety of ideas used while designing should enhance the variety of concepts produced, leading to an increase in the novelty of the concept space — is developed to explain the relationship between novelty and the constructs. Eight existing observational studies of designing sessions, each involving an individual designer solving a conceptual design problem by following a think aloud protocol are used for the analysis. The hypothesis is verified empirically using the observational studies. Results also show a strong correlation between novelty and the constructs of the framework; correlation value decreases as the abstraction level of the constructs reduces, signifying the importance of using constructs at higher abstraction levels especially for novelty.

Method of Design Through Structuring of Meanings

This research shows a new approach and development of a design methodology, based on the perspective of meanings. In this study the design process is explored as a development of the structure of meanings. The processes of search and evaluation of meanings form the foundations of developing this structure. In order to facilitate the use and operation of the meanings, the WordNet lexical database and an existing visualization of WordNet — Visuwords — is used for the process of meaning search. The basic tool used for evaluation process is the WordNet::Similarity software, measuring the relatedness of meanings in the database. In this way it is measuring the degree of interconnections between different meanings. This kind of search and evaluation techniques are later on incorporated into our methodology of the structure of meanings to support the design process. The measures of relatedness of meanings are developed as convergence criteria for application in the processes of evaluation. Further on, the methodology for the structure of meanings developed here is used to construct meanings in a verification of product design. The steps of the design methodology, including the search and evaluation processes involved in developing the structure of the meanings, are elucidated. The choices, made by the designer in terms of meanings are supported by consequent searches and evaluations of meanings to be implemented in the designed product. In conclusion, the paper presents directions for developing and further extensions of the proposed design methodology.

Model track studies on fouled ballast using ground penetrating radar and multichannel analysis of surface wave

Ballast fouling is created by the breakdown of aggregates or outside contamination by coal dust from coal trains, or from soil intrusion beneath rail track. Due to ballast fouling, the conditions of rail track can be deteriorated considerably depending on the type of fouling material and the degree of fouling. So far there is no comprehensive guideline available to identify the critical degree of fouling for different types of fouling materials. This paper presents the identification of degree of fouling and types of fouling using non-destructive testing, namely seismic surface-wave and ground penetrating radar (GPR) survey. To understand this, a model rail track with different degree of fouling has been constructed in Civil engineering laboratory, University of Wollongong, Australia. Shear wave velocity obtained from seismic survey has been employed to identify the degree of fouling and types of fouling material. It is found that shear wave velocity of fouled ballast increases initially, reaches optimum fouling point (OFP), and decreases when the fouling increases. The degree of fouling corresponding after which the shear wave velocity of fouled ballast will be smaller than that of clean ballast is called the critical fouling point (CFP). Ground penetrating radar with four different ground coupled antennas (500 MHz, 800 MHz, 1.6 GHz and 2.3 GHz) was also used to identify the ballast fouling condition. It is found that the 800 MHz ground coupled antenna gives a better signal in assessing the ballast fouling condition. Seismic survey is relatively slow when compared to GPR survey however it gives quantifiable results. In contrast, GPR survey is faster and better in estimating the depth of fouling. (C) 2011 Elsevier B.V. All rights reserved.

A Combinatorial Family of Near Regular LDPC Codes

An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes are near regular in the sense that the degree of a left/right vertex is allowed to differ by at most one from the average. The construction yields in quadratic time complexity an asymptotic code family with provable lower bounds on the rate and the girth for a given choice of block length and average degree. The construction gives flexibility in the choice of design parameters of the code like rate, girth and average degree. Performance simulations of iterative decoding algorithm for the AWGN channel on codes designed using the method demonstrate that these codes perform better than regular PEG codes and MacKay codes of similar length for all values of Signal to noise ratio.

Limits of Data Level Parallelism

Abstract—A new breed of processors like the Cell Broadband Engine, the Imagine stream processor and the various GPU processors emphasize data-level parallelism (DLP) and threadlevel parallelism (TLP) as opposed to traditional instructionlevel parallelism (ILP). This allows them to achieve order-ofmagnitude improvements over conventional superscalar processors for many workloads. However, it is unclear as to how much parallelism of these types exists in current programs. Most earlier studies have largely concentrated on the amount of ILP in a program, without differentiating DLP or TLP. In this study, we investigate the extent of data-level parallelism available in programs in the MediaBench suite. By packing instructions in a SIMD fashion, we observe reductions of up to 91 % (84 % on average) in the number of dynamic instructions, indicating a very high degree of DLP in several applications. I.

Boxicity of line graphs

The boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R(k). In this paper we show that for a line graph G of a multigraph, box(G) <= 2 Delta (G)(inverted right perpendicularlog(2) log(2) Delta(G)inverted left perpendicular + 3) + 1, where Delta(G) denotes the maximum degree of G. Since G is a line graph, Delta(G) <= 2(chi (G) - 1), where chi (G) denotes the chromatic number of G, and therefore, box(G) = 0(chi (G) log(2) log(2) (chi (G))). For the d-dimensional hypercube Q(d), we prove that box(Q(d)) >= 1/2 (inverted right perpendicularlog(2) log(2) dinverted left perpendicular + 1). The question of finding a nontrivial lower bound for box(Q(d)) was left open by Chandran and Sivadasan in [L. Sunil Chandran, Naveen Sivadasan, The cubicity of Hypercube Graphs. Discrete Mathematics 308 (23) (2008) 5795-5800]. The above results are consequences of bounds that we obtain for the boxicity of a fully subdivided graph (a graph that can be obtained by subdividing every edge of a graph exactly once). (C) 2011 Elsevier B.V. All rights reserved.

Geometric representations of graphs in low dimension

We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in $1.5 (\Delta + 2) \ln n$ dimensions, where $\Delta$ is the maximum degree of G. We also show that $\boxi(G) \le (\Delta + 2) \ln n$ for any graph G. Our bound is tight up to a factor of $\ln n$. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree $\Delta$, we show that for almost all graphs on n vertices, its boxicity is upper bound by $c\cdot(d_{av} + 1) \ln n$ where d_{av} is the average degree and c is a small constant. Also, we show that for any graph G, $\boxi(G) \le \sqrt{8 n d_{av} \ln n}$, which is tight up to a factor of $b \sqrt{\ln n}$ for a constant b.

Methods for Automatic Evaluation of Sentence Extract Summaries

This paper describes three novel techniques to automatically evaluate sentence extract summaries. Two of these techniques called FuSE and DeFuSE evaluate the quality of the generated extract summary based on the degree of similarity to the model summary. They use a fuzzy set theoretic basis to generate a match score. DeFuSE is an enhancement to FuSE and uses WordNet based hypernymy structures to detect similarity between sentences at abstracted levels. The third technique focuses on quantifying the quality of an extract summary based on the difficulty in generating such a summary. Advantages of these techniques are described with examples.

Characterization of Clean and Fouled Rail Track Ballast Subsurface Using Seismic Surface Survey Method: Model and Field Studies

The efficiency of track foundation material gradually decreases due to insufficient lateral confinement, ballast fouling, and loss of shear strength of the subsurface soil under cyclic loading. This paper presents characterization of rail track subsurface to identify ballast fouling and subsurface layers shear wave velocity using seismic survey. Seismic surface wave method of multi-channel analysis of surface wave (MASW) has been carried out in the model track and field track for finding out shear wave velocity of the clean and fouled ballast and track subsurface. The shear wave velocity (SWV) of fouled ballast increases with increase in fouling percentage, and reaches a maximum value and then decreases. This character is similar to typical compaction curve of soil, which is used to define optimum and critical fouling percentage (OFP and CFP). Critical fouling percentage of 15 % is noticed for Coal fouled ballast and 25 % is noticed for clayey sand fouled ballast. Coal fouled ballast reaches the OFP and CFP before clayey sand fouled ballast. Fouling of ballast reduces voids in ballast and there by decreases the drainage. Combined plot of permeability and SWV with percentage of fouling shows that after critical fouling point drainage condition of fouled ballast goes below acceptable limit. Shear wave velocities are measured in the selected location in the Wollongong field track by carrying out similar seismic survey. In-situ samples were collected and degrees of fouling were measured. Field SWV values are more than that of the model track SWV values for the same degree of fouling, which might be due to sleeper's confinement. This article also highlights the ballast gradation widely followed in different countries and presents the comparison of Indian ballast gradation with international gradation standards. Indian ballast contains a coarser particle size when compared to other countries. The upper limit of Indian gradation curve matches with lower limit of ballast gradation curves of America and Australia. The ballast gradation followed by Indian railways is poorly graded and more favorable for the drainage conditions. Indian ballast engineering needs extensive research to improve presents track conditions.

Dispersion and vaporization of biofuels and conventional fuels in a crossflow pre-mixer

In lean premixed pre-vaporized (LPP) combustion, controlled atomization, dispersion and vaporization of different types of liquid fuel in the premixer are the key factors required to stabilize the combustion process and improve the efficiency. The dispersion and vaporization process for biofuels and conventional fuels sprayed into a crossflow pre-mixer have been simulated and analyzed with respect to vaporization rate, degree of mixedness and homogeneity. Two major biofuels under investigation are Ethanol and Rapeseed Methyl Esters (RME), while conventional fuels are gasoline and jet-A. First, the numerical code is validated by comparing with the experimental data of single n-heptane and decane droplet evaporating under both moderate and high temperature convective air now. Next, the spray simulations were conducted with monodispersed droplets with an initial diameter of 80 mu m injected into a turbulent crossflow of air with a typical velocity of 10 m/s and temperature of around 800K. Vaporization time scales of different fuels are found to be very different. The droplet diameter reduction and surface temperature rise were found to be strongly dependent on the fuel properties. Gasoline droplet exhibited a much faster vaporization due a combination of higher vapor pressure and smaller latent heat of vaporization compared to other fuels. Mono-dispersed spray was adopted with the expectation of achieving more homogeneous fuel droplet size than poly-dispersed spray. However, the diameter histogram in the zone near the pre-mixer exit shows a large range of droplet diameter distributions for all the fuels. In order to improve the vaporization performance, fuels were pre-heated before injection. Results show that the Sauter mean diameter of ethanol improved from 52.8% of the initial injection size to 48.2%, while jet-A improved from 48.4% to 18.6% and RME improved from 63.5% to 31.3%. The diameter histogram showed improved vaporization performance of jet-A. (C) 2011 Elsevier Ltd. All rights reserved.

Effectiveness of Series Capacitors in Long Distance Transmission Lines

The effectiveness of series capacitors used with long distance transmission lines in improving system stability is analyzed. Compensation efficiency is defined as the effectiveness of series capacitors. The influence of various factors on compensation efficiency such as capacitor location, line length, and degree of series compensation is investigated. Proper use of shunt reactors with series capacitors, in addition to limiting power frequency over- voltages, increases the maximum power transfer. Analytical expressions are included to aid in the calculation of compensation efficiency for a few typical cases. Curves are also presented indicating the critical value of shunt Mvar required for various degrees of series compensation and line lengths.

Acyclic edge coloring of 2-degenerate graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). A graph is called 2-degenerate if any of its induced subgraph has a vertex of degree at most 2. The class of 2-degenerate graphs properly contains seriesparallel graphs, outerplanar graphs, non - regular subcubic graphs, planar graphs of girth at least 6 and circle graphs of girth at least 5 as subclasses. It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a'(G)<=Delta + 2, where Delta = Delta(G) denotes the maximum degree of the graph. We prove the conjecture for 2-degenerate graphs. In fact we prove a stronger bound: we prove that if G is a 2-degenerate graph with maximum degree ?, then a'(G)<=Delta + 1. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 68:1-27, 2011