Artificial Neural networks (ANN) are powerful and effective tools in time-series applications. The first aim of this paper is to diagnose better and more efficient ANN models (Back Propagation, Radial Basis Function Neural networks (RBF), and Recurrent neural networks) in solving the linear and nonlinear time-series behavior. The second aim is dealing with finding accurate estimators as the convergence sometimes is stack in the local minima. It is one of the problems that can bias the test of the robustness of the ANN in time series forecasting. To determine the best or the optimal ANN models, forecast Skill (SS) employed to measure the efficiency of the performance of ANN models. The mean square error and

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

Document source identification in printer forensics involves determining the origin of a printed document based on characteristics such as the printer model, serial number, defects, or unique printing artifacts. This process is crucial in forensic investigations, particularly in cases involving counterfeit documents or unauthorized printing. However, consistent pattern identification across various printer types remains challenging, especially when efforts are made to alter printer-generated artifacts. Machine learning models are often used in these tasks, but selecting discriminative features while minimizing noise is essential. Traditional KNN classifiers require a careful selection of distance metrics to capture relevant printing

 A particle swarm optimization algorithm and neural network like self-tuning PID controller for CSTR system is presented. The scheme of the discrete-time PID control structure is based on neural network and tuned the parameters of the PID controller by using a particle swarm optimization PSO technique as a simple and fast training algorithm. The proposed method has advantage that it is not necessary to use a combined structure of identification and decision because it used PSO. Simulation results show the effectiveness of the proposed adaptive PID neural control algorithm in terms of minimum tracking error and smoothness control signal obtained for non-linear dynamical CSTR system.

Internet paths sharing the same congested link can be identified using several shared congestion detection techniques. The new detection technique which is proposed in this paper depends on the previous novel technique (delay correlation with wavelet denoising (DCW) with new denoising method called Discrete Multiwavelet Transform (DMWT) as signal denoising to separate between queuing delay caused by network congestion and delay caused by various other delay variations. The new detection technique provides faster convergence (3 to 5 seconds less than previous novel technique) while using fewer probe packets approximately half numbers than the previous novel technique, so it will reduce the overload on the network caused by probe packets.

Objective(s): This study was conducted to deal with the importance and effect of various variables which might
have influence in hydrocephaly occurrence.
Methodology: A retrospective design was performed and continued for 4 months. It included 89 nonrandomized
consecutive samples collected from the Early Detection of Childhood Disabilities Center (E.D.C.D.C.)
Duhok. The population involved was the entire cases of both sexes that attended the centre during the period from
1
st.Jan, 1998 to 30th. Dec. 2008 with final diagnosis of hydrocephaly. Patients’ records from the centre were used to
collect data.
Results: Hydrocephaly has been recognized as a public health problem in Duhok province, Iraqi Kurdistan region,<

In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the production of the inverted S-box with the S-box. Compared to the methods in the literature, the need to store the S-box is eliminated. Also, the fabr

In this study, a chaotic method is proposed that generates S-boxes similar to AES S-boxes with the help of a private key belonging to

In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the produ

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.