A Comparison of SYN Flood Detection Algorithms

2007 ◽  
Author(s):  
Matt Beaumont-Gay
Keyword(s):  
Detection Algorithms ◽  
Flood Detection

Fuzzy ART Neural Network Model for Automated Detection of Freeway Incidents

1998 ◽  
Vol 1634 (1) ◽  
pp. 56-63 ◽  
Author(s):  
Sherif S. Ishak ◽  
Haitham M. Al-Deek
Keyword(s):  
Neural Networks ◽  
False Alarm ◽  
False Alarm Rate ◽  
Back Propagation ◽  
Incident Detection ◽  
Traffic Patterns ◽  
Traffic Pattern ◽  
Detection Algorithms ◽  
Fuzzy Art ◽  
Freeway Incidents

Pattern recognition techniques such as artificial neural networks continue to offer potential solutions to many of the existing problems associated with freeway incident-detection algorithms. This study focuses on the application of Fuzzy ART neural networks to incident detection on freeways. Unlike back-propagation models, Fuzzy ART is capable of fast, stable learning of recognition categories. It is an incremental approach that has the potential for on-line implementation. Fuzzy ART is trained with traffic patterns that are represented by 30-s loop-detector data of occupancy, speed, or a combination of both. Traffic patterns observed at the incident time and location are mapped to a group of categories. Each incident category maps incidents with similar traffic pattern characteristics, which are affected by the type and severity of the incident and the prevailing traffic conditions. Detection rate and false alarm rate are used to measure the performance of the Fuzzy ART algorithm. To reduce the false alarm rate that results from occasional misclassification of traffic patterns, a persistence time period of 3 min was arbitrarily selected. The algorithm performance improves when the temporal size of traffic patterns increases from one to two 30-s periods for all traffic parameters. An interesting finding is that the speed patterns produced better results than did the occupancy patterns. However, when combined, occupancy–speed patterns produced the best results. When compared with California algorithms 7 and 8, the Fuzzy ART model produced better performance.

Survey on Fast CFAR Detection Algorithms for SAR Image Targets

2012 ◽  
Vol 38 (12) ◽  
pp. 1885 ◽  
Author(s):  
Ming-Bo ZHAO ◽  
Jun HE ◽  
Qiang FU
Keyword(s):  
Sar Image ◽  
Cfar Detection ◽  
Detection Algorithms

Performance analysis of various massive MIMO detection algorithms in 5G Wireless technologies

2019 ◽  
Vol 10 ◽  
Author(s):  
Shihab Jimaa ◽  
Jawahir Al-Ali
Keyword(s):  
Massive Mimo ◽  
Spectrum Efficiency ◽  
System Capacity ◽  
Network Coverage ◽  
Mimo Detection ◽  
Infinity Norm ◽  
Detection Algorithms ◽  
Alternating Direction ◽  
5G Systems ◽  
Efficient Power

Background: The 5G will lead to a great transformation in the mobile telecommunications sector. Objective: The huge challenges being faced by wireless communications such as the increased number of users have given a chance for 5G systems to be developed and considered as an alternative solution. The 5G technology will provide a higher data rate, reduced latency, more efficient power than the previous generations, higher system capacity, and more connected devices. Method: It will offer new different technologies and enhanced versions of the existing ones, as well as new features. 5G systems are going to use massive MIMO (mMIMO), which is a promising technology in the development of these systems. Furthermore, mMIMO will increase the wireless spectrum efficiency and improve the network coverage. Result: In this paper we present a brief survey on 5G and its technologies, discuss the mMIMO technology with its features and advantages, review the mMIMO capacity and energy efficiency and also presents the recent beamforming techniques. Conclusion: Finally, simulation of adopting different mMIMO detection algorithms are presented, which shows the alternating direction method of multipliers (ADMM)-based infinity-norm (ADMIN) detector has the best performance.

scholarly journals On monotonicity and search strategies in face-based copositivity detection algorithms

2021 ◽  
Author(s):  
B. G.-Tóth ◽  
E. M. T. Hendrix ◽  
L. G. Casado
Keyword(s):  
Research Question ◽  
Quadratic Function ◽  
Mixed Integer ◽  
Quadratic Program ◽  
Matrix Methods ◽  
Detection Algorithms ◽  
Standard Simplex ◽  
Mathematical Properties ◽  
The Face ◽  
Spatial Branch And Bound

AbstractOver the last decades, algorithms have been developed for checking copositivity of a matrix. Methods are based on several principles, such as spatial branch and bound, transformation to Mixed Integer Programming, implicit enumeration of KKT points or face-based search. Our research question focuses on exploiting the mathematical properties of the relative interior minima of the standard quadratic program (StQP) and monotonicity. We derive several theoretical properties related to convexity and monotonicity of the standard quadratic function over faces of the standard simplex. We illustrate with numerical instances up to 28 dimensions the use of monotonicity in face-based algorithms. The question is what traversal through the face graph of the standard simplex is more appropriate for which matrix instance; top down or bottom up approaches. This depends on the level of the face graph where the minimum of StQP can be found, which is related to the density of the so-called convexity graph.

Sign in / Sign up

Export Citation Format

Share Document