When optimizing the performance of neural network-based chatbots, determining the optimizer is one of the most important aspects. Optimizers primarily control the adjustment of model parameters such as weight and bias to minimize a loss function during training. Adaptive optimizers such as ADAM have become a standard choice and are widely used for their invariant parameter updates' magnitudes concerning gradient scale variations, but often pose generalization problems. Alternatively, Stochastic Gradient Descent (SGD) with Momentum and the extension of ADAM, the ADAMW, offers several advantages. This study aims to compare and examine the effects of these optimizers on the chatbot CST dataset. The effectiveness of each optimizer is evaluat

The first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o

The first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o

This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.

Quantum channels enable the achievement of communication tasks inaccessible to their
classical counterparts. The most famous example is the distribution of secret keys. Unfortunately, the rate
of generation of the secret key by direct transmission is fundamentally limited by the distance. This limit
can be overcome by the implementation of a quantum repeater. In order to boost the performance of the
repeater, a quantum repeater based on cut-off with two different types of quantum memories is suggestd,
which reduces the effect of decoherence during the storage of a quantum state.

The simulation of passively Q-switching is four non – linear first order differential equations. The optimization of passively Q-switching simulation was carried out using the constrained Rosenbrock technique. The maximization option in this technique was utilized to the fourth equation as an objective function; the parameters, γa, γc and β as were dealt with as decision variables. A FORTRAN program was written to determine the optimum values of the decision variables through the simulation of the four coupled equations, for ruby laser Q–switched by Dy +2: CaF2.For different Dy +2:CaF2 molecules number, the values of decision variables was predicted using our written program. The relaxation time of Dy +2: CaF2, used with ruby was

An optical spectroscopic study is reported in this article to study the correlation between the supermassive black hole (SMBH) and the star formation rate (SFR) for a sample of Seyfert galaxies type (I and II). The study focused on 45 galaxy of Seyfert 1, in addition to 45 galaxy of Seyfert 2, where these samples have been selected form different survey of Salon Digital Sky Survey (SDSS). The redshift (z) of these objects were between (0.02 – 0.26). The results of Seyfert 1 galaxies shows that there good correlation between the SMBH and the SFR depending on statistical analysis parameter named Spearman’s Rank Correlation in a factor of (ρ=0.609), as well as the Seyfert 2 galaxies results show a good correlation between the SMBH

An optical spectroscopic study is reported in this article to study the correlation between the supermassive black hole (SMBH) and the star formation rate (SFR) for a sample of Seyfert galaxies type (I and II). The study focused on 45 galaxy of Seyfert 1, in addition to 45 galaxy of Seyfert 2, where these samples have been selected form different survey of Salon Digital Sky Survey (SDSS). The redshift (z) of these objects were between (0.02 – 0.26). The results of Seyfert 1 galaxies shows that there good correlation between the SMBH and the SFR depending on statistical analysis parameter named Spearman’s Rank Correlation in a factor of (ρ=0.609), as well as the Seyfert 2 galaxies results show a good correlation between the SMBH and