A systematic review of application of multi-criteria decision analysis for aging-dam management

[EN] Decisions for aging-dam management requires a transparent process to prevent the dam failure, thus to avoid severe consequences in socio-economic and environmental terms. Multiple criteria analysis arose to model complex problems like this. This paper reviews specific problems, applications and Multi-Criteria Decision Making techniques for dam management. Multi-Attribute Decision Making techniques had a major presence under the single approach, specially the Analytic Hierarchy Process, and its combination with Technique for Order of Preference by Similarity to Ideal Solution was prominent under the hybrid approach; while a high variety of complementary techniques was identified. A growing hybridization and fuzzification are the two most relevant trends observed. The integration of stakeholders within the decision making process and the inclusion of trade-offs and interactions between components within the evaluation model must receive a deeper exploration. Despite the progressive consolidation of Multi-Criteria Decision Making in dam management, further research is required to differentiate between rational and intuitive decision processes. Additionally, the need to address benefits, opportunities, costs and risks related to repair, upgrading or removal measures in aging dams suggests the Analytic Network Process, not yet explored under this approach, as an interesting path worth investigating.This research was funded by the Spanish Ministry of Economy and Competitiveness along with FEDER funding (Projects BIA201456574-R and ECO2015-66673-R).Zamarrón-Mieza, I.; Yepes, V.; Moreno-Jiménez, JM. (2017). A systematic review of application of multi-criteria decision analysis for aging-dam management. Journal of Cleaner Production. 147:217-230. https://doi.org/10.1016/j.jclepro.2017.01.092S21723014

Fuzzy Logic Controlled Microturbine Generation System for Distributed Generation

AbstractThe microturbine based Distributed Generation (DG) system are becoming the popular source of power industries due to their fuel flexibility, reliability and power quality. The microturbine generation (MTG) system is a complicated thermodynamic electromechanical system with a high speed of rotation, frequency conversion and its control strategy. In spite of several techniques to control high speed of microturbine is not accurate and reliable due to their anti-interference problem. To resolve the anti-interfacing problem, this paper investigates the fuzzy logic based speed governor for a MTG system as an alternative to nominal PI or lead-lag based controller. The development of fuzzy logic based speed governor includes input and output membership function with their respective members. The load variation on MTG system is performed using conventional and fuzzy logic controller, implemented in Matlab/simulink and results are compared with each other. The simulation result shows that, the performance improvement of fuzzy logic governor over a nominal governor based MTG system

Security Assessment Taxonomy

Learning today has shifted from face-to-face curriculum to distance learning. Recent advances in distance learning bring major changes in education and educators take different roles in teaching courses. As technology offers a great potential for distance learning, many schools have been adopting this innovative approach. This paper explores a project undertaken by a large US university. We examine a security course that employs a distance learning environment and investigate how this environment affects learners and educators. Our findings indicate that distance learning is not considered a superior teaching method; on the contrary, in many cases, students reported on technical difficulties working with an on-line system. We conclude that further study and research of this method is warranted in order to determine the long-term benefits of using distance learning and to address its many challenges

Log-Linear Model Based Behavior Selection Method for Artificial Fish Swarm Algorithm

Artificial fish swarm algorithm (AFSA) is a population based optimization technique inspired by social behavior of fishes. In past several years, AFSA has been successfully applied in many research and application areas. The behavior of fishes has a crucial impact on the performance of AFSA, such as global exploration ability and convergence speed. How to construct and select behaviors of fishes are an important task. To solve these problems, an improved artificial fish swarm algorithm based on log-linear model is proposed and implemented in this paper. There are three main works. Firstly, we proposed a new behavior selection algorithm based on log-linear model which can enhance decision making ability of behavior selection. Secondly, adaptive movement behavior based on adaptive weight is presented, which can dynamically adjust according to the diversity of fishes. Finally, some new behaviors are defined and introduced into artificial fish swarm algorithm at the first time to improve global optimization capability. The experiments on high dimensional function optimization showed that the improved algorithm has more powerful global exploration ability and reasonable convergence speed compared with the standard artificial fish swarm algorithm

A generalized laser simulator algorithm for optimal path planning in constraints environment

Path planning plays a vital role in autonomous mobile robot navigation, and it has thus become one of the most studied areas in robotics. Path planning refers to a robot's search for a collision-free and optimal path from a start point to a predefined goal position in a given environment. This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. This approach allows finding the path for a mobile robot while avoiding obstacles, searching for a goal, considering some constraints and finding an optimal path during the robot movement in both known and unknown environments. The feasible path is determined between the start and goal positions by generating a wave of points in all directions towards the goal point with adhering to constraints. A simulation study employing the proposed approach is applied to the grid map settings to determine a collision-free path from the start to goal positions. First, the grid mapping of the robot's workspace environment is constructed, and then the borders of the workspace environment are detected based on the new proposed function. This function guides the robot to move toward the desired goal. Two concepts have been implemented to find the best candidate point to move next: minimum distance to goal and maximum index distance to the boundary, integrated by negative probability to sort out the most preferred point for the robot trajectory determination. In order to construct an optimal collision-free path, an optimization step was included to find out the minimum distance within the candidate points that have been determined by GLS while adhering to particular constraint's rules and avoiding obstacles. The proposed algorithm will switch its working pattern based on the goal minimum and boundary maximum index distances. For static obstacle avoidance, the boundaries of the obstacle(s) are considered borders of the environment. However, the algorithm detects obstacles as a new border in dynamic obstacles once it occurs in front of the GLS waves. The proposed method has been tested in several test environments with different degrees of complexity. Twenty different arbitrary environments are categorized into four: Simple, complex, narrow, and maze, with five test environments in each. The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. The GLS is 7.8 and 5.5 times faster than A* and LS, respectively, generating a path 1.2 and 1.5 times shorter than A* and LS. The mean value of the path cost achieved by the proposed approach is 4% and 15% lower than PRM and RRT, respectively. The mean path cost generated by the LS algorithm, on the other hand, is 14% higher than that generated by the PRM. Finally, to verify the performance of the developed method for generating a collision-free path, experimental studies were carried out using an existing WMR platform in labs and roads. The experimental work investigates complete autonomous WMR path planning in the lab and road environments using live video streaming. The local maps were built using data from live video streaming s by real-time image processing to detect the segments of the lab and road environments. The image processing includes several operations to apply GLS on the prepared local map. The proposed algorithm generates the path within the prepared local map to find the path between start-to-goal positions to avoid obstacles and adhere to constraints. The experimental test shows that the proposed method can generate the shortest path and best smooth trajectory from start to goal points in comparison with the laser simulator

Temporal - spatial recognizer for multi-label data

Pattern recognition is an important artificial intelligence task with practical applications in many fields such as medical and species distribution. Such application involves overlapping data points which are demonstrated in the multi- label dataset. Hence, there is a need for a recognition algorithm that can separate the overlapping data points in order to recognize the correct pattern. Existing recognition methods suffer from sensitivity to noise and overlapping points as they could not recognize a pattern when there is a shift in the position of the data points. Furthermore, the methods do not implicate temporal information in the process of recognition, which leads to low quality of data clustering. In this study, an improved pattern recognition method based on Hierarchical Temporal Memory (HTM) is proposed to solve the overlapping in data points of multi- label dataset. The imHTM (Improved HTM) method includes improvement in two of its components; feature extraction and data clustering. The first improvement is realized as TS-Layer Neocognitron algorithm which solves the shift in position problem in feature extraction phase. On the other hand, the data clustering step, has two improvements, TFCM and cFCM (TFCM with limit- Chebyshev distance metric) that allows the overlapped data points which occur in patterns to be separated correctly into the relevant clusters by temporal clustering. Experiments on five datasets were conducted to compare the proposed method (imHTM) against statistical, template and structural pattern recognition methods. The results showed that the percentage of success in recognition accuracy is 99% as compared with the template matching method (Featured-Based Approach, Area-Based Approach), statistical method (Principal Component Analysis, Linear Discriminant Analysis, Support Vector Machines and Neural Network) and structural method (original HTM). The findings indicate that the improved HTM can give an optimum pattern recognition accuracy, especially the ones in multi- label dataset