Where and how to conserve: Extending the scope of spatial reserve network design

Ongoing habitat loss and fragmentation threaten much of the biodiversity that we know today. As such, conservation efforts are required if we want to protect biodiversity. Conservation budgets are typically tight, making the cost-effective selection of protected areas difficult. Therefore, reserve design methods have been developed to identify sets of sites, that together represent the species of conservation interest in a cost-effective manner. To be able to select reserve networks, data on species distributions is needed. Such data is often incomplete, but species habitat distribution models (SHDMs) can be used to link the occurrence of the species at the surveyed sites to the environmental conditions at these locations (e.g. climatic, vegetation and soil conditions). The probability of the species occurring at unvisited location is next predicted by the model, based on the environmental conditions of those sites. The spatial configuration of reserve networks is important, because habitat loss around reserves can influence the persistence of species inside the network. Since species differ in their requirements for network configuration, the spatial cohesion of networks needs to be species-specific. A way to account for species-specific requirements is to use spatial variables in SHDMs. Spatial SHDMs allow the evaluation of the effect of reserve network configuration on the probability of occurrence of the species inside the network. Even though reserves are important for conservation, they are not the only option available to conservation planners. To enhance or maintain habitat quality, restoration or maintenance measures are sometimes required. As a result, the number of conservation options per site increases. Currently available reserve selection tools do however not offer the ability to handle multiple, alternative options per site. This thesis extends the existing methodology for reserve design, by offering methods to identify cost-effective conservation planning solutions when multiple, alternative conservation options are available per site. Although restoration and maintenance measures are beneficial to certain species, they can be harmful to other species with different requirements. This introduces trade-offs between species when identifying which conservation action is best applied to which site. The thesis describes how the strength of such trade-offs can be identified, which is useful for assessing consequences of conservation decisions regarding species priorities and budget. Furthermore, the results of the thesis indicate that spatial SHDMs can be successfully used to account for species-specific requirements for spatial cohesion - in the reserve selection (single-option) context as well as in the multi-option context. Accounting for the spatial requirements of multiple species and allowing for several conservation options is however complicated, due to trade-offs in species requirements. It is also shown that spatial SHDMs can be successfully used for gaining information on factors that drive a species spatial distribution. Such information is valuable to conservation planning, as better knowledge on species requirements facilitates the design of networks for species persistence. This methods and results described in this thesis aim to improve species probabilities of persistence, by taking better account of species habitat and spatial requirements. Many real-world conservation planning problems are characterised by a variety of conservation options related to protection, restoration and maintenance of habitat. Planning tools therefore need to be able to incorporate multiple conservation options per site, in order to continue the search for cost-effective conservation planning solutions. Simultaneously, the spatial requirements of species need to be considered. The methods described in this thesis offer a starting point for combining these two relevant aspects of conservation planning.

Formal network behaviour analysis using model checking

In this research we modelled computer network devices to ensure their communication behaviours meet various network standards. By modelling devices as finite-state machines and examining their properties in a range of configurations, we discovered a flaw in a common network protocol and produced a technique to improve organisations' network security against data theft.

Field-Effect and Frequency Dependent Transport in Semiconductor-Enriched Single-Wall Carbon Nanotube Network Device

The electrical and optical response of a field-effect device comprising a network of semiconductor-enriched single-wall carbon nanotubes, gated with sodium chloride solution is investigated. Field-effect is demonstrated in a device that uses facile fabrication techniques along with a small-ion as the gate electrolyte-and this is accomplished as a result of the semiconductor enhancement of the tubes. The optical transparency and electrical resistance of the device are modulated with gate voltage. A time-response study of the modulation of optical transparency and electrical resistance upon application of gate voltage suggests the percolative charge transport in the network. Also the ac response in the network is investigated as a function of frequency and temperature down to 5 K. An empirical relation between onset frequency and temperature is determined.

Fine-tuning of the signalling network controlling morphogenesis and stem cell development in teeth

Tooth development is regulated by sequential and reciprocal interactions between epithelium and mesenchyme. The molecular mechanisms underlying this regulation are conserved and most of the participating molecules belong to several signalling families. Research focusing on mouse teeth has uncovered many aspects of tooth development, including molecular and evolutionary specifi cs, and in addition offered a valuable system to analyse the regulation of epithelial stem cells. In mice the spatial and temporal regulation of cell differentiation and the mechanisms of patterning during development can be analysed both in vivo and in vitro. Follistatin (Fst), a negative regulator of TGFβ superfamily signalling, is an important inhibitor during embryonic development. We showed the necessity of modulation of TGFβ signalling by Fst in three different regulatory steps during tooth development. First we showed that tinkering with the level of TGFβ signalling by Fst may cause variation in the molar cusp patterning and crown morphogenesis. Second, our results indicated that in the continuously growing mouse incisors asymmetric expression of Fst is responsible for the labial-lingual patterning of ameloblast differentiation and enamel formation. Two TGFβ superfamily signals, BMP and Activin, are required for proper ameloblast differentiation and Fst modulates their effects. Third, we identifi ed a complex signalling network regulating the maintenance and proliferation of epithelial stem cells in the incisor, and showed that Fst is an essential modulator of this regulation. FGF3 in cooperation with FGF10 stimulates proliferation of epithelial stem cells and transit amplifying cells in the labial cervical loop. BMP4 represses Fgf3 expression whereas Activin inhibits the repressive effect of BMP4 on the labial side. Thus, Fst inhibits Activin rather than BMP4 in the cervical loop area and limits the proliferation of lingual epithelium, thereby causing the asymmetric maintenance and proliferation of epithelial stem cells. In addition, we detected Lgr5, a Wnt target gene and an epithelial stem cell marker in the intestine, in the putative epithelial stem cells of the incisor, suggesting that Lgr5 is a marker of incisor stem cells but is not regulated by Wnt/β-catenin signalling in the incisor. Thus the epithelial stem cells in the incisor may not be directly regulated by Wnt/β-catenin signalling. In conclusion, we showed in the mouse incisors that modulating the balance between inductive and inhibitory signals constitutes a key mechanism regulating the epithelial stem cells and ameloblast differentiation. Furthermore, we found additional support for the location of the putative epithelial stem cells and for the stemness of these cells. In the mouse molar we showed the necessity of fi ne-tuning the signalling in the regulation of the crown morphogenesis, and that altering the levels of an inhibitor can cause variation in the crown patterning.

Strategies for efficient disruption of metabolism in Mycobacterium tuberculosis from network analysis

Tuberculosis continues to be a major health challenge, warranting the need for newer strategies for therapeutic intervention and newer approaches to discover them. Here, we report the identification of efficient metabolism disruption strategies by analysis of a reactome network. Protein-protein dependencies at a genome scale are derived from the curated metabolic network, from which insights into the nature and extent of inter-protein and inter-pathway dependencies have been obtained. A functional distance matrix and a subsequent nearness index derived from this information, helps in understanding how the influence of a given protein can pervade to the metabolic network. Thus, the nearness index can be viewed as a metabolic disruptability index, which suggests possible strategies for achieving maximal metabolic disruption by inhibition of the least number of proteins. A greedy approach has been used to identify the most influential singleton, and its combination with the other most pervasive proteins to obtain highly influential pairs, triplets and quadruplets. The effect of deletion of these combinations on cellular metabolism has been studied by flux balance analysis. An obvious outcome of this study is a rational identification of drug targets, to efficiently bring down mycobacterial metabolism.

Relative electrical distance concept for evaluation of network reactive power and loss contributions in a deregulated system

With the liberalisation of electricity market it has become very important to determine the participants making use of the transmission network.Transmission line usage computation requires information of generator to load contributions and the path used by various generators to meet loads and losses. In this study relative electrical distance (RED) concept is used to compute reactive power contributions from various sources like generators, switchable volt-amperes reactive(VAR) sources and line charging susceptances that are scattered throughout the network, to meet the system demands. The transmission line charge susceptances contribution to the system reactive flows and its aid extended in reducing the reactive generation at the generator buses are discussed in this paper. Reactive power transmission cost evaluation is carried out in this study. The proposed approach is also compared with other approaches viz.,proportional sharing and modified Y-bus.Detailed case studies with base case and optimised results are carried out on a sample 8-bus system. IEEE 39-bus system and a practical 72-bus system, an equivalent of Indian Southern grid are also considered for illustration and results are discussed.

Inferring neuronal network connectivity from spike data: A temporal data mining approach

Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent d evelopments in electrophysiology and imaging allow one to simultaneously record activities of hundreds of neurons. Inferring the underlying neuronal connectivity patterns from such multi-neuronal spike train data streams is a challenging statistical and computational problem. This task involves finding significant temporal patterns from vast amounts of symbolic time series data. In this paper we show that the frequent episode mining methods from the field of temporal data mining can be very useful in this context. In the frequent episode discovery framework, the data is viewed as a sequence of events, each of which is characterized by an event type and its time of occurrence and episodes are certain types of temporal patterns in such data. Here we show that, using the set of discovered frequent episodes from multi-neuronal data, one can infer different types of connectivity patterns in the neural system that generated it. For this purpose, we introduce the notion of mining for frequent episodes under certain temporal constraints; the structure of these temporal constraints is motivated by the application. We present algorithms for discovering serial and parallel episodes under these temporal constraints. Through extensive simulation studies we demonstrate that these methods are useful for unearthing patterns of neuronal network connectivity.

Modelling heterogeneity of concrete using 2D lattice network for concrete fracture and comparison with AE study

In this paper, numerical modelling of fracture in concrete using two-dimensional lattice model is presented and also a few issues related to lattice modelling technique applicable to concrete fracture are reviewed. A comparison is made with acoustic emission (AE) events with the number of fractured elements. To implement the heterogeneity of the plain concrete, two methods namely, by generating grain structure of the concrete using Fuller's distribution and the concrete material properties are randomly distributed following Gaussian distribution are used. In the first method, the modelling of the concrete at meso level is carried out following the existing methods available in literature. The shape of the aggregates present in the concrete are assumed as perfect spheres and shape of the same in two-dimensional lattice network is circular. A three-point bend (TPB) specimen is tested in the experiment under crack mouth opening displacement (CMOD) control at a rate of 0.0004 mm/sec and the fracture process in the same TPB specimen is modelled using regular triangular 2D lattice network. Load versus crack mouth opening isplacement (CMOD) plots thus obtained by using both the methods are compared with experimental results. It was observed that the number of fractured elements increases near the peak load and beyond the peak load. That is once the crack starts to propagate. AE hits also increase rapidly beyond the peak load. It is compulsory here to mention that although the lattice modelling of concrete fracture used in this present study is very similar to those already available in literature, the present work brings out certain finer details which are not available explicitly in the earlier works.

Random network behaviour of protein structures

Geometric and structural constraints greatly restrict the selection of folds adapted by protein backbones, and yet, folded proteins show an astounding diversity in functionality. For structure to have any bearing on function, it is thus imperative that, apart from the protein backbone, other tunable degrees of freedom be accountable. Here, we focus on side-chain interactions, which non-covalently link amino acids in folded proteins to form a network structure. At a coarse-grained level, we show that the network conforms remarkably well to realizations of random graphs and displays associated percolation behavior. Thus, within the rigid framework of the protein backbone that restricts the structure space, the side-chain interactions exhibit an element of randomness, which account for the functional flexibility and diversity shown by proteins. However, at a finer level, the network exhibits deviations from these random graphs which, as we demonstrate for a few specific examples, reflect the intrinsic uniqueness in the structure and stability, and perhaps specificity in the functioning of biological proteins.

Delay Optimal Scheduling in a Two-Hop Vehicular Relay Network

We study a scheduling problem in a wireless network where vehicles are used as store-and-forward relays, a situation that might arise, for example, in practical rural communication networks. A fixed source node wants to transfer a file to a fixed destination node, located beyond its communication range. In the absence of any infrastructure connecting the two nodes, we consider the possibility of communication using vehicles passing by. Vehicles arrive at the source node at renewal instants and are known to travel towards the destination node with average speed v sampled from a given probability distribution. Th source node communicates data packets (or fragments) of the file to the destination node using these vehicles as relays. We assume that the vehicles communicate with the source node and the destination node only, and hence, every packet communication involves two hops. In this setup, we study the source node's sequential decision problem of transferring packets of the file to vehicles as they pass by, with the objective of minimizing delay in the network. We study both the finite file size case and the infinite file size case. In the finite file size case, we aim to minimize the expected file transfer delay, i.e. expected value of the maximum of the packet sojourn times. In the infinite file size case, we study the average packet delay minimization problem as well as the optimal tradeoff achievable between the average queueing delay at the source node buffer and the average transit delay in the relay vehicle.

A Slotted Aloha joint MAC-cum-Routing protocol for data gathering sensor network applications

In this paper we have proposed and implemented a joint Medium Access Control (MAC) -cum- Routing scheme for environment data gathering sensor networks. The design principle uses node 'battery lifetime' maximization to be traded against a network that is capable of tolerating: A known percentage of combined packet losses due to packet collisions, network synchronization mismatch and channel impairments Significant end-to-end delay of an order of few seconds We have achieved this with a loosely synchronized network of sensor nodes that implement Slotted-Aloha MAC state machine together with route information. The scheme has given encouraging results in terms of energy savings compared to other popular implementations. The overall packet loss is about 12%. The battery life time increase compared to B-MAC varies from a minimum of 30% to about 90% depending on the duty cycle.

A Petri net model for evaluating packet buffering strategies in a network processor

Previous studies have shown that buffering packets in DRAM is a performance bottleneck. In order to understand the impediments in accessing the DRAM, we developed a detailed Petri net model of IP forwarding application on IXP2400 that models the different levels of the memory hierarchy. The cell based interface used to receive and transmit packets in a network processor leads to some small size DRAM accesses. Such narrow accesses to the DRAM expose the bank access latency, reducing the bandwidth that can be realized. With real traces up to 30% of the accesses are smaller than the cell size, resulting in 7.7% reduction in DRAM bandwidth. To overcome this problem, we propose buffering these small chunks of data in the on chip scratchpad memory. This scheme also exploits greater degree of parallelism between different levels of the memory hierarchy. Using real traces from the internet, we show that the transmit rate can be improved by an average of 21% over the base scheme without the use of additional hardware. Further, the impact of different traffic patterns on the network processor resources is studied. Under real traffic conditions, we show that the data bus which connects the off-chip packet buffer to the micro-engines, is the obstacle in achieving higher throughput.

Green Falcon IV: An Unmanned Aerial System and an integrated Wireless Sensor Network for remote sensing tasks

This report summarises the development of an Unmanned Aerial System and an integrated Wireless Sensor Network (WSN), suitable for the real world application in remote sensing tasks. Several aspects are discussed and analysed to provide improvements in flight duration, performance and mobility of the UAV, while ensuring the accuracy and range of data from the wireless sensor system.