Flood Forecasting Using Machine Learning Methods

This book is a printed edition of the Special Issue Flood Forecasting Using Machine Learning Methods that was published in Wate

Spatial Attraction Models Coupled with Elman Neural Networks for Enhancing Sub-Pixel Urban Inundation Mapping

Urban flooding is one of the most costly and destructive natural hazards worldwide. Remote-sensing images with high temporal resolutions have been extensively applied to timely inundation monitoring, assessing and mapping, but are limited by their low spatial resolution. Sub-pixel mapping has drawn great attention among researchers worldwide and has demonstrated a promising potential of high-accuracy mapping of inundation. Aimed to boost sub-pixel urban inundation mapping (SUIM) from remote-sensing imagery, a new algorithm based on spatial attraction models and Elman neural networks (SAMENN) was developed and examined in this paper. The Elman neural networks (ENN)-based SUIM module was developed firstly. Then a normalized edge intensity index of mixed pixels was generated. Finally the algorithm of SAMENN-SUIM was constructed and implemented. Landsat 8 images of two cities of China, which experienced heavy floods, were used in the experiments. Compared to three traditional SUIM methods, SAMENN-SUIM attained higher mapping accuracy according not only to visual evaluations but also quantitative assessments. The effects of normalized edge intensity index threshold and neuron number of the hidden layer on accuracy of the SAMENN-SUIM algorithm were analyzed and discussed. The newly developed algorithm in this study made a positive contribution to advancing urban inundation mapping from remote-sensing images with medium-low spatial resolutions, and hence can favor urban flood monitoring and risk assessment

Modern Telemetry

Telemetry is based on knowledge of various disciplines like Electronics, Measurement, Control and Communication along with their combination. This fact leads to a need of studying and understanding of these principles before the usage of Telemetry on selected problem solving. Spending time is however many times returned in form of obtained data or knowledge which telemetry system can provide. Usage of telemetry can be found in many areas from military through biomedical to real medical applications. Modern way to create a wireless sensors remotely connected to central system with artificial intelligence provide many new, sometimes unusual ways to get a knowledge about remote objects behaviour. This book is intended to present some new up to date accesses to telemetry problems solving by use of new sensors conceptions, new wireless transfer or communication techniques, data collection or processing techniques as well as several real use case scenarios describing model examples. Most of book chapters deals with many real cases of telemetry issues which can be used as a cookbooks for your own telemetry related problems

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words