scholarly journals Real Time Flow Forecasting in a Mountain River Catchment Using Conceptual Models with Simple Error Correction Scheme

Water ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 1484
Author(s):  
Nicolás Montes ◽  
José Ángel Aranda ◽  
Rafael García-Bartual

Methods in operational hydrology for real-time flash-flood forecasting need to be simple enough to match requirements of real-time system management. For this reason, hydrologic routing methods are widely used in river engineering. Among them, the popular Muskingum method is the most extended one, due to its simplicity and parsimonious formulation involving only two parameters. In the present application, two simple conceptual models with an error correction scheme were used. They were applied in practice to a mountain catchment located in the central Pyrenees (North of Spain), where occasional flash flooding events take place. Several relevant historical flood events have been selected for calibration and validation purposes. The models were designed to produce real-time predictions at the downstream gauge station, with variable lead times during a flood event. They generated accurate estimates of forecasted discharges at the downstream end of the river reach. For the validation data set and 2 h lead time, the estimated Nash-Sutcliffe coefficient was 0.970 for both models tested. The quality of the results, together with the simplicity of the formulations proposed, suggests an interesting potential for the practical use of these schemes for operational hydrology purposes.

2020 ◽  
Vol 1 (1) ◽  
pp. 35-42
Author(s):  
Péter Ekler ◽  
Dániel Pásztor

Összefoglalás. A mesterséges intelligencia az elmúlt években hatalmas fejlődésen ment keresztül, melynek köszönhetően ma már rengeteg különböző szakterületen megtalálható valamilyen formában, rengeteg kutatás szerves részévé vált. Ez leginkább az egyre inkább fejlődő tanulóalgoritmusoknak, illetve a Big Data környezetnek köszönhető, mely óriási mennyiségű tanítóadatot képes szolgáltatni. A cikk célja, hogy összefoglalja a technológia jelenlegi állapotát. Ismertetésre kerül a mesterséges intelligencia történelme, az alkalmazási területek egy nagyobb része, melyek központi eleme a mesterséges intelligencia. Ezek mellett rámutat a mesterséges intelligencia különböző biztonsági réseire, illetve a kiberbiztonság területén való felhasználhatóságra. A cikk a jelenlegi mesterséges intelligencia alkalmazások egy szeletét mutatja be, melyek jól illusztrálják a széles felhasználási területet. Summary. In the past years artificial intelligence has seen several improvements, which drove its usage to grow in various different areas and became the focus of many researches. This can be attributed to improvements made in the learning algorithms and Big Data techniques, which can provide tremendous amount of training. The goal of this paper is to summarize the current state of artificial intelligence. We present its history, introduce the terminology used, and show technological areas using artificial intelligence as a core part of their applications. The paper also introduces the security concerns related to artificial intelligence solutions but also highlights how the technology can be used to enhance security in different applications. Finally, we present future opportunities and possible improvements. The paper shows some general artificial intelligence applications that demonstrate the wide range usage of the technology. Many applications are built around artificial intelligence technologies and there are many services that a developer can use to achieve intelligent behavior. The foundation of different approaches is a well-designed learning algorithm, while the key to every learning algorithm is the quality of the data set that is used during the learning phase. There are applications that focus on image processing like face detection or other gesture detection to identify a person. Other solutions compare signatures while others are for object or plate number detection (for example the automatic parking system of an office building). Artificial intelligence and accurate data handling can be also used for anomaly detection in a real time system. For example, there are ongoing researches for anomaly detection at the ZalaZone autonomous car test field based on the collected sensor data. There are also more general applications like user profiling and automatic content recommendation by using behavior analysis techniques. However, the artificial intelligence technology also has security risks needed to be eliminated before applying an application publicly. One concern is the generation of fake contents. These must be detected with other algorithms that focus on small but noticeable differences. It is also essential to protect the data which is used by the learning algorithm and protect the logic flow of the solution. Network security can help to protect these applications. Artificial intelligence can also help strengthen the security of a solution as it is able to detect network anomalies and signs of a security issue. Therefore, the technology is widely used in IT security to prevent different type of attacks. As different BigData technologies, computational power, and storage capacity increase over time, there is space for improved artificial intelligence solution that can learn from large and real time data sets. The advancements in sensors can also help to give more precise data for different solutions. Finally, advanced natural language processing can help with communication between humans and computer based solutions.


In the Soft Real-Time System scheduling process with the processor is a critical task. The system schedules the processes on a processor in a time interval, and hence the processes get chance to executes on the processor. Priority-driven scheduling algorithms are sub-categorized into mainly two categories called Static Priority and Dynamic Priority Scheduler. Critical Analysis of more static and dynamic priority scheduling algorithms have been discussed in this paper. This paper has covered the static priority algorithms like Rate Monotonic (RM) and Shortest Job First (SJF) and the dynamic priority algorithms like Earliest Deadline First (EDF) and Least Slack Time First (LST). These all algorithms have been analyzed with preemptive process set and this paper has considered all the process set are periodic. This paper has also proposed a hybrid approach for efficient scheduling. In a critical analysis, it has been observed that while scheduling in underload situation dynamic priority algorithms perform well and even EDF also make sure that all process will meet their deadline. However, in an overload situation, the performance of dynamic priority algorithms reduce quickly, and most of the task will miss its deadline, whereas static priority scheduling algorithms miss a few deadlines, even it is possible to schedule all processes in underload situation, whereas in an overload situation, the static algorithms perform well compared to the dynamic scheduler. This paper is proposing one Hybrid algorithm call S_LST which uses the concept of LST and SJF scheduling algorithm. This algorithm has been applied to the periodic task set, and observations are registered. We have observed the Success Ratio (SR) & Effective CPU Utilization (ECU) and compared all algorithms in the same conditions. It is noted that instead of using LST and SJF as an independent algorithm, Hybrid algorithm S_LST performs well in underload and overload scenario. Practical investigations have been led on a huge dataset. Data Set consists of the 7000+ process set, and each process set has one to nine processes and load varies between 0.5 to 5. It has been tried on 500-time unit to approve the rightness everything being equal.


2014 ◽  
Vol 23 (02) ◽  
pp. 1450029 ◽  
Author(s):  
HUI CHEN

Recently, real-time system was widely applied to diverse environments. In order to meet the demands of those applications, many scheduling strategies were presented to achieve either maximal benefit or minimum miss deadline ratio. However, very little attention has been devoted to simultaneously achieve the two objectives. This paper proposes a dynamic priority assignment (DPA) strategy by analyzing the remainder value density and urgency of task, in which, two parameters p and q are used to adjust the weights of remainder value density and urgency on task's priority. Based on DPA strategy, the condition that can avoid system thrashing is discussed, and a dynamic real-time task scheduling (DRTS) algorithm is also proposed. Finally, experimental results show that the proposed method can improve the integrated performance of real-time system compared with analogous algorithms.


2015 ◽  
Vol 2 (1) ◽  
pp. 35-41
Author(s):  
Rivan Risdaryanto ◽  
Houtman P. Siregar ◽  
Dedy Loebis

The real-time system is now used on many fields, such as telecommunication, military, information system, evenmedical to get information quickly, on time and accurate. Needless to say, a real-time system will always considerthe performance time. In our application, we define the time target/deadline, so that the system should execute thewhole tasks under predefined deadline. However, if the system failed to finish the tasks, it will lead to fatal failure.In other words, if the system cannot be executed on time, it will affect the subsequent tasks. In this paper, wepropose a real-time system for sending data to find effectiveness and efficiency. Sending data process will beconstructed in MATLAB and sending data process has a time target as when data will send.


Vestnik MEI ◽  
2018 ◽  
Vol 5 (5) ◽  
pp. 73-78
Author(s):  
Igor В. Fominykh ◽  
◽  
Sergey V. Romanchuk ◽  
Nikolay Р. Alekseev ◽  
◽  
...  

2006 ◽  
Author(s):  
T. S. Cook ◽  
D. Drusinsky ◽  
J. B. Michael ◽  
T. W. Otani ◽  
M. Shing

Sign in / Sign up

Export Citation Format

Share Document