Region of freshwater influence (ROFI) and its impact on sediment transport in the lower Mekong Delta coastal zone of Vietnam.

The delta of the Mekong River is one of the largest in the world, with the Mekong River carrying a large amount of sediments in its Region of Freshwater Influence (ROFI). This study investigates the flow structure and movement of both suspended and bedload sediments in the ROFI of the Lower Mekong Delta (LMD) in order to identify areas prone to sediment accretion and erosion. This is accomplished by applying the three-dimensional Coastal and Regional Ocean COmmunity (CROCO) model and then calculating the sediment budget of different stretches of the coastline. The model outputs, depicting areas experiencing sediment accretion and erosion along the coastline of the LMD, are then compared against observations obtained during the period 1990-2015 and demonstrate the ability of the model to identify areas particularly prone to erosion and where preventive actions against coastal erosion should focus.

Incremental Density-Based Clustering on Multicore Processors.

The density-based clustering algorithm is a fundamental data clustering technique with many real-world applications. However, when the database is frequently changed, how to effectively update clustering results rather than reclustering from scratch remains a challenging task. In this work, we introduce IncAnyDBC, a unique parallel incremental data clustering approach to deal with this problem. First, IncAnyDBC can process changes in bulks rather than batches like state-of-the-art methods for reducing update overheads. Second, it keeps an underlying cluster structure called the object node graph during the clustering process and uses it as a basis for incrementally updating clusters wrt. inserted or deleted objects in the database by propagating changes around affected nodes only. In additional, IncAnyDBC actively and iteratively examines the graph and chooses only a small set of most meaningful objects to produce exact clustering results of DBSCAN or to approximate results under arbitrary time constraints. This makes it more efficient than other existing methods. Third, by processing objects in blocks, IncAnyDBC can be efficiently parallelized on multicore CPUs, thus creating a work-efficient method. It runs much faster than existing techniques using one thread while still scaling well with multiple threads. Experiments are conducted on various large real datasets for demonstrating the performance of IncAnyDBC.