Developing and researching antenna designs are analogous to excavating in an undiscovered mine. This paper proposes a multi-band antenna with a new hexagonal ring shape, theoretically designed, developed, and analyzed using a CST before being manufactured. The antenna has undergone six changes to provide the best performance. The results of the surface current distribution and the electric field distribution on the surface of the hexagonal patch were theoretically analyzed and studied. The sequential approach taken to determine the most effective design is logical, and prevents deviation from the work direction. After comparing the six theoretical results, the fifth model proved to be the best for making a prototype. Measured results rep

   In this work, a novel technique to obtain an accurate solutions to nonlinear form by multi-step combination with Laplace-variational approach (MSLVIM) is introduced. Compared with the  traditional approach for variational it overcome all difficulties and enable to provide us more an accurate solutions with extended of the convergence region as well as covering to larger intervals which providing us a continuous representation of approximate analytic solution and it give more better information of the solution over the whole time interval. This technique is more easier for obtaining the general Lagrange multiplier with reduces the time and calculations. It converges rapidly to exact formula with simply computable terms wit

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us

Some problems want to be solved in image compression to make the process workable and more efficient. Much work had been done in the field of lossy image compression based on wavelet and Discrete Cosine Transform (DCT). In this paper, an efficient image compression scheme is proposed, based on a common encoding transform scheme; It consists of the following steps: 1) bi-orthogonal (tab 9/7) wavelet transform to split the image data into sub-bands, 2) DCT to de-correlate the data, 3) the combined transform stage's output is subjected to scalar quantization before being mapped to positive, 4) and LZW encoding to produce the compressed data. The peak signal-to-noise (PSNR), compression ratio (CR), and compression gain (CG) measures were used t

يقترح هذا البحث طريقة جديدة لتقدير دالة كثافة الرابطة باستخدام تحليل المويجات كطريقة لامعلمية، من أجل الحصول على نتائج أكثر دقة وخالية من مشكلة تاثيرات الحدود التي تعاني منها طرائق التقدير اللامعلمية. اذ تعد طريقة المويجات طريقة اوتماتيكية للتعامل مع تاثيرات الحدود وذلك لانها لا تأخذ بنظر الاعتبار إذا كانت السلسلة الزمنية مستقرة او غير مستقرة. ولتقدير دالة كثافة الرابطة تم استعمال المحاكاة لتوليد البي

This paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six  employees , and it was chosen queuing model is a single-service channel  M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and  it was composed of data collection times (arrival time , service time, departure time)

Software-defined networks (SDN) have a centralized control architecture that makes them a tempting target for cyber attackers. One of the major threats is distributed denial of service (DDoS) attacks. It aims to exhaust network resources to make its services unavailable to legitimate users. DDoS attack detection based on machine learning algorithms is considered one of the most used techniques in SDN security. In this paper, four machine learning techniques (Random Forest, K-nearest neighbors, Naive Bayes, and Logistic Regression) have been tested to detect DDoS attacks. Also, a mitigation technique has been used to eliminate the attack effect on SDN. RF and KNN were selected because of their high accuracy results. Three types of ne