| 1. |
- Luu, Chinh, et al.
(author)
-
Framework of Spatial Flood Risk Assessment for a Case Study in Quang Binh Province, Vietnam
- 2020
-
In: Sustainability. - Switzerland : MDPI. - 2071-1050. ; 12:7, s. 1-17
-
Journal article (peer-reviewed)abstract
- Vietnam has been extensively affected by floods, suffering heavy losses in human life andproperty. While the Vietnamese government has focused on structural measures of flood defence such as levees and early warning systems, the country still lacks flood risk assessment methodologies and frameworks at local and national levels. In response to this gap, this study developed a flood risk assessment framework that uses historical flood mark data and a high- resolution digital elevation model to create an inundation map, then combined this map with exposure and vulnerability data to develop a holistic flood risk assessment map. The case study is the October 2010 flood event in Quang Binh province, which caused 74 deaths, 210 injuries, 188,628 flooded properties, 9019 ha of submerged and damaged agricultural land, and widespread damages to canals, levees, and roads. The final flood risk map showed a total inundation area of 64348 ha, in which 8.3% area of low risk, 16.3% area of medium risk, 12.0% area of high risk, 37.1% area of very high risk, and 26.2% area of extremely high risk. The holistic flood risk assessment map of QuangBinh province is a valuable tool and source for flood preparedness activities at the local scale.
|
|
| 2. |
|
|
| 3. |
- Schoch, CL, et al.
(author)
-
Nuclear ribosomal internal transcribed spacer (ITS) region as a universal DNA barcode marker for Fungi
- 2012
-
In: Proceedings of the National Academy of Sciences of the United States of America. - : Proceedings of the National Academy of Sciences. - 1091-6490. ; 109:16, s. 6241-6246
-
Journal article (peer-reviewed)abstract
- Six DNA regions were evaluated as potential DNA barcodes for Fungi, the second largest kingdom of eukaryotic life, by a multinational, multilaboratory consortium. The region of the mitochondrial cytochrome c oxidase subunit 1 used as the animal barcode was excluded as a potential marker, because it is difficult to amplify in fungi, often includes large introns, and can be insufficiently variable. Three subunits from the nuclear ribosomal RNA cistron were compared together with regions of three representative protein-coding genes (largest subunit of RNA polymerase II, second largest subunit of RNA polymerase II, and minichromosome maintenance protein). Although the protein-coding gene regions often had a higher percent of correct identification compared with ribosomal markers, low PCR amplification and sequencing success eliminated them as candidates for a universal fungal barcode. Among the regions of the ribosomal cistron, the internal transcribed spacer (ITS) region has the highest probability of successful identification for the broadest range of fungi, with the most clearly defined barcode gap between inter- and intraspecific variation. The nuclear ribosomal large subunit, a popular phylogenetic marker in certain groups, had superior species resolution in some taxonomic groups, such as the early diverging lineages and the ascomycete yeasts, but was otherwise slightly inferior to the ITS. The nuclear ribosomal small subunit has poor species-level resolution in fungi. ITS will be formally proposed for adoption as the primary fungal barcode marker to the Consortium for the Barcode of Life, with the possibility that supplementary barcodes may be developed for particular narrowly circumscribed taxonomic groups.
|
|
| 4. |
- Ta, Duong Nguyen Binh, et al.
(author)
-
Interactivity-Constrained Server Provisioning in Large-Scale Distributed Virtual Environments
- 2012
-
In: IEEE Transactions on Parallel and Distributed Systems. - 1045-9219 .- 1558-2183. ; 23:2, s. 304-312
-
Journal article (peer-reviewed)abstract
- Maintaining interactivity is one of the key challenges in distributed virtual environments (DVEs). In this paper, we consider a new problem, termed the interactivity-constrained server provisioning problem, whose goal is to minimize the number of distributed servers needed to achieve a prespecified level of interactivity. We identify and formulate two variants of this new problem and show that they are both NP-hard via reductions to the set covering problem. We then propose several computationally efficient approximation algorithms for solving the problem. The main algorithms exploit dependencies among distributed servers to make provisioning decisions. We conduct extensive experiments to evaluate the performance of the proposed algorithms. Specifically, we use both static Internet latency data available from prior measurements and topology generators, as well as the most recent, dynamic latency data collected via our own large-scale deployment of a DVE performance monitoring system over PlanetLab. The results show that the newly proposed algorithms that take into account interserver dependencies significantly outperform the well-established set covering algorithm for both problem variants.
|
|
| 5. |
- Ta, Duong Nguyen Binh, et al.
(author)
-
Multi-objective zone mapping in large-scale distributed virtual environments
- 2011
-
In: Journal of Network and Computer Applications. - : Elsevier BV. - 1084-8045 .- 1095-8592. ; 34:2, s. 551-561
-
Journal article (peer-reviewed)abstract
- In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed servers to improve overall interactivity. Previously, this problem has been formulated as a single-objective optimization problem, in which the objective is to minimize the total number of clients that are without QoS. This approach may cause considerable network traffic and processing overhead, as a large number of zones may need to be migrated across servers. In this paper, we introduce a multi-objective approach to the zone mapping problem, in which both the total number of clients without QoS and the migration overhead are considered. To this end, we have proposed several new algorithms based on meta-heuristics such as local search and multi-objective evolutionary optimization techniques. Extensive simulation studies have been conducted with realistic network latency data modeled after actual Internet measurements, and different workload distribution settings. Simulation results demonstrate the effectiveness of the newly proposed algorithms.
|
|
