A comparison of classification techniques for monitoring and mapping land cover and land use changes in the subtropical region of Thai Nguyen, Vietnam : a thesis presented in partial fulfilment of the requirements for the degree of Master of Environmental Management at Massey University, Palmerston North, New Zealand

Deriving land cover/land-use information from earth observation satellite data is one of the most common applications for environmental monitoring, evaluation and management. Many parametric and non-parametric classification algorithms have been developed and applied to such applications. This study looks at the classification accuracies of three algorithms for different spatial and spectral resolution data. The performance of Random Forest (RF) was compared to Maximum Likelihood (MLC) and Artificial Neural Network (ANN) algorithms for the separation of subtropical land cover/land-use categories using Sentinel-2 and Landsat 8 data. The overall, producers’ and users’ accuracies were derived from the confusion matrix, while local land use statistics were also collected to evaluate the accuracy of classified images. The accuracy assessment showed the RF algorithm regularly outperformed the MLC and ANN in both types of imagery data (>90%). This approach also exhibited potential in dealing with the challenge of separating similar man-made features such as urban/built-up and mining extraction classes. The ANN algorithm had the lowest accuracy among the three classification algorithms, while Landsat 8 imagery was most suitable for the classification of subtropical mixed and complex landscapes. As the RF algorithm demonstrated a robustness and potential for mapping subtropical land cover/land-use, this study chose it to monitor and map temporal land cover/land-use changes in Thai Nguyen, Vietnam between 2000 and 2016. The results of this temporal monitoring revealed that there were substantial changes in land cover/land use over the course of 16 years. Agricultural and forest land decreased, while urban and mining extraction land expanded significantly, and water increased slightly. Changes in land cover/land-use are strongly associated with geographic locations. The conversion of agriculture and forest into urban/builtup and mining extraction land was detected largely in the Thai Nguyen central city and southern regions. In addition, further GIS analysis revealed that approximately 69.6% (100.2km2) of new built-up areas had occurred within 2km of primary roads, and nearly 96% (137.6km2) of new built-up expansion was detected within a 5-km buffer of the main roads. This study also demonstrates the potential of multi-temporal Landsat data and the combination of remote sensing, GIS and R programming to provide a timely, accurate and economical means to map and analyse temporal changes for long-term local land use development planning. Keywords: Random forest; Land cover mapping; Remote Sensing; Vietna

Architecture for Cooperative Prefetching in P2P Video-on- Demand System

Most P2P VoD schemes focused on service architectures and overlays optimization without considering segments rarity and the performance of prefetching strategies. As a result, they cannot better support VCRoriented service in heterogeneous environment having clients using free VCR controls. Despite the remarkable popularity in VoD systems, there exist no prior work that studies the performance gap between different prefetching strategies. In this paper, we analyze and understand the performance of different prefetching strategies. Our analytical characterization brings us not only a better understanding of several fundamental tradeoffs in prefetching strategies, but also important insights on the design of P2P VoD system. On the basis of this analysis, we finally proposed a cooperative prefetching strategy called "cooching". In this strategy, the requested segments in VCR interactivities are prefetched into session beforehand using the information collected through gossips. We evaluate our strategy through extensive simulations. The results indicate that the proposed strategy outperforms the existing prefetching mechanisms.Comment: 13 Pages, IJCN

Finding and tracking multi-density clusters in an online dynamic data stream

The file attached to this record is the author's final peer reviewed version.Change is one of the biggest challenges in dynamic stream mining. From a data-mining perspective, adapting and tracking change is desirable in order to understand how and why change has occurred. Clustering, a form of unsupervised learning, can be used to identify the underlying patterns in a stream. Density-based clustering identifies clusters as areas of high density separated by areas of low density. This paper proposes a Multi-Density Stream Clustering (MDSC) algorithm to address these two problems; the multi-density problem and the problem of discovering and tracking changes in a dynamic stream. MDSC consists of two on-line components; discovered, labelled clusters and an outlier buffer. Incoming points are assigned to a live cluster or passed to the outlier buffer. New clusters are discovered in the buffer using an ant-inspired swarm intelligence approach. The newly discovered cluster is uniquely labelled and added to the set of live clusters. Processed data is subject to an ageing function and will disappear when it is no longer relevant. MDSC is shown to perform favourably to state-of-the-art peer stream-clustering algorithms on a range of real and synthetic data-streams. Experimental results suggest that MDSC can discover qualitatively useful patterns while being scalable and robust to noise

User guide for the BGS Methane and Carbon Dioxide from Natural Sources and Coal Mining Dataset for Great Britain

This report presents a description and review of the methodology developed by the British Geological Survey (BGS) to produce an assessment of the potential hazard from Methane and Carbon Dioxide from Natural Sources and Coal Mining in Great Britain. The methodology is briefly described in this report. The purpose of the user guide is to enable those licensing this dataset to have a better appreciation of how the dataset has been created and therefore a better understanding of the potential applications and limitations that the dataset may have

CloudJet4BigData: Streamlining Big Data via an Accelerated Socket Interface

Big data needs to feed users with fresh processing results and cloud platforms can be used to speed up big data applications. This paper describes a new data communication protocol (CloudJet) for long distance and large volume big data accessing operations to alleviate the large latencies encountered in sharing big data resources in the clouds. It encapsulates a dynamic multi-stream/multi-path engine at the socket level, which conforms to Portable Operating System Interface (POSIX) and thereby can accelerate any POSIX-compatible applications across IP based networks. It was demonstrated that CloudJet accelerates typical big data applications such as very large database (VLDB), data mining, media streaming and office applications by up to tenfold in real-world tests

Algorithms for Extracting Frequent Episodes in the Process of Temporal Data Mining

An important aspect in the data mining process is the discovery of patterns having a great influence on the studied problem. The purpose of this paper is to study the frequent episodes data mining through the use of parallel pattern discovery algorithms. Parallel pattern discovery algorithms offer better performance and scalability, so they are of a great interest for the data mining research community. In the following, there will be highlighted some parallel and distributed frequent pattern mining algorithms on various platforms and it will also be presented a comparative study of their main features. The study takes into account the new possibilities that arise along with the emerging novel Compute Unified Device Architecture from the latest generation of graphics processing units. Based on their high performance, low cost and the increasing number of features offered, GPU processors are viable solutions for an optimal implementation of frequent pattern mining algorithmsFrequent Pattern Mining, Parallel Computing, Dynamic Load Balancing, Temporal Data Mining, CUDA, GPU, Fermi, Thread