Management of multi-scale forest resource data over time

During the last decades there has been a global shift in forest management from a focus solely on timber management to ecosystem management that endorses all aspects of forest functions: ecological, economic and social. This has resulted in a shift in paradigm from sustained yield to sustained diversity of values, goods and benefits obtained at the same time, introducing new temporal and spatial scales into forest resource management. The purpose of the present dissertation was to develop methods that would enable spatial and temporal scales to be introduced into the storage, processing, access and utilization of forest resource data. The methods developed are based on a conceptual view of a forest as a hierarchically nested collection of objects that can have a dynamically changing set of attributes. The temporal aspect of the methods consists of lifetime management for the objects and their attributes and of a temporal succession linking the objects together. Development of the forest resource data processing method concentrated on the extensibility and configurability of the data content and model calculations, allowing for a diverse set of processing operations to be executed using the same framework. The contribution of this dissertation to the utilisation of multi-scale forest resource data lies in the development of a reference data generation method to support forest inventory methods in approaching single-tree resolution.

CattleTickBase: An integrated Internet-based bioinformatics resource for Rhipicephalus (Boophilus) microplus

The Rhipicephalus micro plus genome is large and complex in structure, making it difficult to assemble a genome sequence and costly to resource the required bioinformatics. In light of this, a consortium of international collaborators was formed to pool resources to begin sequencing this genome. We have acquired and assembled genomic DNA into contigs that represent over 1.8 Gigabase pairs of DNA from gene-enriched regions of the R. micro plus genome. We also have several datasets containing transcript sequences from a number of gene expression experiments conducted by the consortium. A web-based resource was developed to enable the scientific community to access our datasets and conduct analysis through a web-based bioinformatics environment called YABI. The collective bioinformatics resource is termed CattleTickBase. Our consortium has acquired genomic and transcriptomic sequence data at approximately 0.9X coverage of the gene-coding regions of the R. microplus genome. The YABI tool will facilitate access and manipulation of cattle tick genome sequence data as the genome sequencing of R. microplus proceeds. During this process the CattleTickBase resource will continue to be updated. Published by Elsevier Ltd. on behalf of Australian Society for Parasitology Inc.

Theoretical results of QoS-guaranteed resource scaling for cloud-based MapReduce

Quality of Service (QoS) is a new issue in cloud-based MapReduce, which is a popular computation model for parallel and distributed processing of big data. QoS guarantee is challenging in a dynamical computation environment due to the fact that a fixed resource allocation may become under-provisioning, which leads to QoS violation, or over-provisioning, which increases unnecessary resource cost. This requires runtime resource scaling to adapt environmental changes for QoS guarantee. Aiming to guarantee the QoS, which is referred as to hard deadline in this work, this paper develops a theory to determine how and when resource is scaled up/down for cloud-based MapReduce. The theory employs a nonlinear transformation to define the problem in a reverse resource space, simplifying the theoretical analysis significantly. Then, theoretical results are presented in three theorems on sufficient conditions for guaranteeing the QoS of cloud-based MapReduce. The superiority and applications of the theory are demonstrated through case studies.

Multi-user resource-sharing problem for the Internet

In this thesis we study a series of multi-user resource-sharing problems for the Internet, which involve distribution of a common resource among participants of multi-user systems (servers or networks). We study concurrently accessible resources, which for end-users may be exclusively accessible or non-exclusively. For all kinds we suggest a separate algorithm or a modification of common reputation scheme. Every algorithm or method is studied from different perspectives: optimality of protocols, selfishness of end users, fairness of the protocol for end users. On the one hand the multifaceted analysis allows us to select the most suited protocols among a set of various available ones based on trade-offs of optima criteria. On the other hand, the future Internet predictions dictate new rules for the optimality we should take into account and new properties of the networks that cannot be neglected anymore. In this thesis we have studied new protocols for such resource-sharing problems as the backoff protocol, defense mechanisms against Denial-of-Service, fairness and confidentiality for users in overlay networks. For backoff protocol we present analysis of a general backoff scheme, where an optimization is applied to a general-view backoff function. It leads to an optimality condition for backoff protocols in both slot times and continuous time models. Additionally we present an extension for the backoff scheme in order to achieve fairness for the participants in an unfair environment, such as wireless signal strengths. Finally, for the backoff algorithm we suggest a reputation scheme that deals with misbehaving nodes. For the next problem -- denial-of-service attacks, we suggest two schemes that deal with the malicious behavior for two conditions: forged identities and unspoofed identities. For the first one we suggest a novel most-knocked-first-served algorithm, while for the latter we apply a reputation mechanism in order to restrict resource access for misbehaving nodes. Finally, we study the reputation scheme for the overlays and peer-to-peer networks, where resource is not placed on a common station, but spread across the network. The theoretical analysis suggests what behavior will be selected by the end station under such a reputation mechanism.

Optimal Resource Partitioning in a Military Conflict based on Lanchester Attrition Models

This paper develops a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary in two different fronts. The Lanchester attrition model is used to develop the dynamical equations governing the variation in force strength. Three different allocation schemes - Time-Zero-Allocation (TZA), Allocate-Assess-Reallocate (AAR), and Continuous Constant Allocation (CCA) - are considered and the optimal solutions are obtained in each case. Numerical examples are given to support the analytical results.

Optimal Resource Partitioning in a Military Conflict based on Lanchester Attrition Models

This paper develops a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary in two different fronts. The Lanchester attrition model is used to develop the dynamical equations governing the variation in force strength. Three different allocation schemes - Time-Zero-Allocation (TZA), Allocate-Assess-Reallocate (AAR), and Continuous Constant Allocation (CCA) - are considered and the optimal solutions are obtained in each case. Numerical examples are given to support the analytical results.

Optimal resource partitioning in conflicts based on Lanchester (n, 1) attrition model

This paper develops a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary from n different fronts. The problem of optimally partitioning the defending forces against the attacking forces is addressed. The Lanchester square law model is used to develop the dynamical equations governing the variation in force strength. Two different allocation schemes-Time-ZeroAllocation (TZA) and Continuous Constant Allocation (CCA) are considered and the optimal solutions for both are obtained analytically. These results generalize other results available in the literature. Numerical examples are given to support the analytical results.

Community-based Natural Resource Management: Issues and Cases from South Asia

Community-based natural resource management (CBNRM) is the joint management of natural resources by a community based on a community strategy, through a participatory mechanism involving all legitimate stakeholders. The approach is community-based in that the communities managing the resources have the legal rights, the local institutions and the economic incentives to take substantial responsibility for sustained use of these resources. This implies that the community plays an active role in the management of natural resources, not because it asserts sole ownership over them, but because it can claim participation in their management and benefits for practical and technical reasons1–4. This approach emerged as the dominant conservation concept in the late 1970s and early 1980s, of the disillusionment with the developmental state. Governments across South and South East Asia, Africa and Latin America have adopted and implemented CBNRM in various ways, viz. through sectoral programmes such as forestry, irrigation or wildlife management, multisectoral programmes such as watershed development and efforts towards political devolution. In India, the principle of decentralization through ‘gram swaraj’ was introduced by Mahatma Gandhi. The 73rd and 74th constitution amendments in 1992 gave impetus to the decentralized planning at panchayat levels through the creation of a statutory three-level local self-government structure5,6. The strength of this book is that it includes chapters by CBNRM advocates based on six seemingly innovative initiatives being implemented by nongovernmental organizations (NGOs) in ecologically vulnerable regions of South Asia: two in the Himalayas (watershed development programme in Lingmutechhu, Bhuthan and Thalisain tehsil, Paudi Grahwal District, Uttarakhand), three in semi-arid parts of western India (watershed development in Hivre Bazar, Maharashtra and Nathugadh village, Gujarat and water-harvesting structures in Gopalapura, Rajasthan) and one in the flood-plains of the Brahmaputra–Jamuna (Char land, Galibanda and Jamalpur districts, Bangladesh). Watersheds in semi-arid regions fall in the low-rainfall region (500–700 mm) and suffer the vagaries of drought 2–3 years in every five-year cycle. In all these locations, the major occupation is agriculture, most of which is rainfed or dry. The other two cases (in Uttarakhand) fall in the Himalayan region (temperate/sub-temperate climate), which has witnessed extensive deforestation in the last century and is now considered as one of the most vulnerable locations in South Asia. Terraced agriculture is being practised in these locations for a long time. The last case (Gono Chetona) falls in the Brahmaputra–Jamuna charlands which are the most ecologically vulnerable regions in the sub-continent with constantly changing landscape. Agriculture and livestock rearing are the main occupations, and there is substantial seasonal emigration for wage labour by the adult males. River erosion and floods force the people to adopt a semi-migratory lifestyle. The book attempts to analyse the potential as well as limitations of NGOdriven CBNRM endeavours across agroclimatic regions of South Asia with emphasis on four intrinsically linked normative concerns, namely sustainability, livelihood enhancement, equity and demographic decentralization in chapters 2–7. Comparative analysis of these case studies done in chapter 8, highlights the issues that require further research while portraying the strengths and limits of NGO-driven CBNRM. In Hivre Bazar, the post-watershed intervention scenario is such that farmers often grow three crops in a year – kharif bajra, rabi jowar and summer vegetable crops. Productivity has increased in the dry lands due to improvement in soil moisture levels. The revival of johads in Gopalpura has led to the proliferation of wheat and increased productivity. In Lingmuteychhu, productivity gains have also arisen, but more due to the introduction of both local and high-yielding, new varieties as opposed to increased water availability. In the case of Gono Chetona, improvements have come due to diversification of agriculture; for example, the promotion of vegetable gardens. CBNRM interventions in most cases have also led to new avenues of employment and income generation. The synthesis shows that CBNRM efforts have made significant contributions to livelihood enhancement and only limited gains in terms of collective action for sustainable and equitable access to benefits and continuing resource use, and in terms of democratic decentralization, contrary to the objectives of the programme. Livelihood benefits include improvements in availability of livelihood support resources (fuelwood, fodder, drinking water), increased productivity (including diversification of cropping pattern) in agriculture and allied activities, and new sources of livelihood. However, NGO-driven CBNRM has not met its goal of providing ‘alternative’ forms of ‘development’ due to impediments of state policy, short-sighted vision of implementers and confrontation with the socio-ecological reality of the region, which almost always are that of fragmented communities (or communities in flux) with unequal dependence and access to land and other natural resources along with great gender imbalances. Appalling, however, is the general absence of recognition of the importance of and the will to explore practical ways to bring about equitable resource transfer or benefit-sharing and the consequent innovations in this respect that are evident in the pioneering community initiatives such as pani panchayat, etc. Pertaining to the gains on the ecological sustainability front, Hivre Bazar and Thalisain initiatives through active participation of villagers have made significant regeneration of the water table within the village, and mechanisms such as ban on number of bore wells, the regulation of cropping pattern, restrictions on felling of trees and free grazing to ensure that in the future, the groundwater is neither over-exploited nor its recharge capability impaired. Nevertheless, the longterm sustainability of the interventions in the case of Ghoga and Gopalpura initiatives as the focus has been mostly on regeneration of resources, and less on regulating the use of regenerated resources. Further, in Lingmuteychhu and Gono Chetona, the interventions are mainly household-based and the focus has been less explicit on ecological components. The studies demonstrate the livelihood benefits to all of the interventions and significant variation in achievements with reference to sustainability, equity and democratic decentralization depending on the level and extent of community participation apart from the vision of implementers, strategy (or nature of intervention shaped by the question of community formation), the centrality of community formation and also the State policy. Case studies show that the influence of State policy is multi-faceted and often contradictory in nature. This necessitates NGOs to engage with the State in a much more purposeful way than in an ‘autonomous space’. Thus the role of NGOs in CBNRM is complementary, wherein they provide innovative experiments that the State can learn. This helps in achieving the goals of CBNRM through democratic decentralization. The book addresses the vital issues related to natural resource management and interests of the community. Key topics discussed throughout the book are still at the centre of the current debate. This compilation consists of well-written chapters based on rigorous synthesis of CBNRM case studies, which will serve as good references for students, researchers and practitioners in the years to come.

Cooperative Profit Sharing in Coalition-Based Resource Allocation in Wireless Networks

We consider a network in which several service providers offer wireless access to their respective subscribed customers through potentially multihop routes. If providers cooperate by jointly deploying and pooling their resources, such as spectrum and infrastructure (e.g., base stations) and agree to serve each others' customers, their aggregate payoffs, and individual shares, may substantially increase through opportunistic utilization of resources. The potential of such cooperation can, however, be realized only if each provider intelligently determines with whom it would cooperate, when it would cooperate, and how it would deploy and share its resources during such cooperation. Also, developing a rational basis for sharing the aggregate payoffs is imperative for the stability of the coalitions. We model such cooperation using the theory of transferable payoff coalitional games. We show that the optimum cooperation strategy, which involves the acquisition, deployment, and allocation of the channels and base stations (to customers), can be computed as the solution of a concave or an integer optimization. We next show that the grand coalition is stable in many different settings, i.e., if all providers cooperate, there is always an operating point that maximizes the providers' aggregate payoff, while offering each a share that removes any incentive to split from the coalition. The optimal cooperation strategy and the stabilizing payoff shares can be obtained in polynomial time by respectively solving the primals and the duals of the above optimizations, using distributed computations and limited exchange of confidential information among the providers. Numerical evaluations reveal that cooperation substantially enhances individual providers' payoffs under the optimal cooperation strategy and several different payoff sharing rules.

A unified view of the Apriori-based algorithms for frequent episode discovery

Frequent episode discovery framework is a popular framework in temporal data mining with many applications. Over the years, many different notions of frequencies of episodes have been proposed along with different algorithms for episode discovery. In this paper, we present a unified view of all the apriori-based discoverymethods for serial episodes under these different notions of frequencies. Specifically, we present a unified view of the various frequency counting algorithms. We propose a generic counting algorithm such that all current algorithms are special cases of it. This unified view allows one to gain insights into different frequencies, and we present quantitative relationships among different frequencies.Our unified view also helps in obtaining correctness proofs for various counting algorithms as we show here. It also aids in understanding and obtaining the anti-monotonicity properties satisfied by the various frequencies, the properties exploited by the candidate generation step of any apriori-based method. We also point out how our unified view of counting helps to consider generalization of the algorithm to count episodes with general partial orders.

A unified view of the apriori-based algorithms for frequent episode discovery

Frequent episode discovery framework is a popular framework in temporal data mining with many applications. Over the years, many different notions of frequencies of episodes have been proposed along with different algorithms for episode discovery. In this paper, we present a unified view of all the apriori-based discovery methods for serial episodes under these different notions of frequencies. Specifically, we present a unified view of the various frequency counting algorithms. We propose a generic counting algorithm such that all current algorithms are special cases of it. This unified view allows one to gain insights into different frequencies, and we present quantitative relationships among different frequencies. Our unified view also helps in obtaining correctness proofs for various counting algorithms as we show here. It also aids in understanding and obtaining the anti-monotonicity properties satisfied by the various frequencies, the properties exploited by the candidate generation step of any apriori-based method. We also point out how our unified view of counting helps to consider generalization of the algorithm to count episodes with general partial orders.

Boosting-based transfer learning for multi-view head-pose classification from surveillance videos

This work proposes a boosting-based transfer learning approach for head-pose classification from multiple, low-resolution views. Head-pose classification performance is adversely affected when the source (training) and target (test) data arise from different distributions (due to change in face appearance, lighting, etc). Under such conditions, we employ Xferboost, a Logitboost-based transfer learning framework that integrates knowledge from a few labeled target samples with the source model to effectively minimize misclassifications on the target data. Experiments confirm that the Xferboost framework can improve classification performance by up to 6%, when knowledge is transferred between the CLEAR and FBK four-view headpose datasets.

Resource usage monitoring for KVM based virtual machines

Realization of cloud computing has been possible due to availability of virtualization technologies on commodity platforms. Measuring resource usage on the virtualized servers is difficult because of the fact that the performance counters used for resource accounting are not virtualized. Hence, many of the prevalent virtualization technologies like Xen, VMware, KVM etc., use host specific CPU usage monitoring, which is coarse grained. In this paper, we present a performance monitoring tool for KVM based virtualized machines, which measures the CPU overhead incurred by the hypervisor on behalf of the virtual machine along-with the CPU usage of virtual machine itself. This fine-grained resource usage information, provided by the above tool, can be used for diverse situations like resource provisioning to support performance associated QoS requirements, identification of bottlenecks during VM placements, resource profiling of applications in cloud environments, etc. We demonstrate a use case of this tool by measuring the performance of web-servers hosted on a KVM based virtualized server.

Performance evaluation of mobile agent based resource management protocol for MANETs

The nodes with dynamicity, and management without administrator are key features of mobile ad hoc networks (1VIANETs). Increasing resource requirements of nodes running different applications, scarcity of resources, and node mobility in MANETs are the important issues to be considered in allocation of resources. Moreover, management of limited resources for optimal allocation is a crucial task. In our proposed work we discuss a design of resource allocation protocol and its performance evaluation. The proposed protocol uses both static and mobile agents. The protocol does the distribution and parallelization of message propagation (mobile agent with information) in an efficient way to achieve scalability and speed up message delivery to the nodes in the sectors of the zones of a MANET. The protocol functionality has been simulated using Java Agent Development Environment (JADE) Framework for agent generation, migration and communication. A mobile agent migrates from central resource rich node with message and navigate autonomously in the zone of network until the boundary node. With the performance evaluation, it has been concluded that the proposed protocol consumes much less time to allocate the required resources to the nodes under requirement, utilize less network resources and increase the network scalability. (C) 2015 Elsevier B.V. All rights reserved.