The rapid development of Internet of Things (IoT) devices and their increasing numbers have caused a tremendous increase in network traffic and a wider range of cyber-attacks. This growing trend has complicated the detection process for traditional intrusion detection systems and heightened the challenges faced by these devices, such as imbalanced and large training data. This study presents a cohesive methodology of a series of intelligent techniques to prepare clean and balanced data for training the first (core) layer of a robust hierarchical intrusion detection system. The methodology was built by cleaning and compressing the data using an Autoencoder and preparing a strong latent space for balancing using a hybrid method that combines

In this paper, an algorithm is suggested to train a single layer feedforward neural network to function as a heteroassociative memory. This algorithm enhances the ability of the memory to recall the stored patterns when partially described noisy inputs patterns are presented. The algorithm relies on adapting the standard delta rule by introducing new terms, first order term and second order term to it. Results show that the heteroassociative neural network trained with this algorithm perfectly recalls the desired stored pattern when 1.6% and 3.2% special partially described noisy inputs patterns are presented.

In this paper, we proposed to zoom Volterra equations system Altfazlah linear complementarity of the first type in this approximation were first forming functions notch Baschtdam matrix and then we discussed the approach and stability, to notch functions

This study synthesized zeolite 4A, and hierarchical composite structure consisting of zeolite 4A- carbon were successfully prepared. Hydrothermal method was used to grow a layer of zeolite 4A over porous carbon surfaces to enhance mass transfer and increase surface area of zeolite. The products then were used to remove radioactive cesium¹³⁷Cs from liquid wastewater. Iraqi dates leaves midribs (DM) were used as locally available agricultural waste to prepare low- cost porous carbon, using carbonization method in tubular furnace at 900C for two hours. Hierarchical porous structures including zeolite are prepared by mechanically activating the carbon surface via Ultrasonicating nanoparticles suspension of ground zeolite type 4A.F

Here, we synthesized three new blended ligand complexes of chromium (III), iron (III), and lanthanum (III) ions with a Schiff base made from the condensation of [o-aminophenol and 2-hydroxyacetophenone in the presence of concentrated sulphoric acid (HL1)] as a primary ligand and o-nitroaniline (L2) as a secondary. The Schiff base and its dual ligand chelate were characterized using several spectroscopic studies, IR, 1HNMR, electronic and mass spectra, in addition to elemental analyses, molar conductivity measurements, and magnetic moments. The spectroscopic and analytical outcomes confirmed the formation of the chelates in a 1:1:1(L1: M: L2) ratio. Similarly, an octahedral structure became counseled for all chelates.

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the