A simple, rapid and sensitive spectrophotometric method has been developed for the determination of captopril in aqueous solution. The method is based on reaction of captopril with 2,3-dichloro 1,4- naphthoquinon(Dichlone) in neutral medium to form a stable yellow colored product which shows maximum absorption at 347 nm with molar absorptivity of 5.6 ×103 L.mole-1. cm-1. The proposed method is applied successfully for determination of captopril in commercial pharmaceutical tablets.

A sensitive spectrofluorimetric method for the determination of glibenclamide in its tablet formulations has been proposed. The method is based on the dissolving of glibenclamide in absolute ethanol and measuring the native fluorescence at 354 nm after excitation at 302 nm. Beers law is obeyed in the concentration of 1.4 to 10 µg.ml-1 of glibenclamide with a limit of detection (LD) of 0.067 µg.ml-1 and a standard deviation of 0.614. The range percent recoveries (N=3) is 94 - 103.

A UV-Vis spectrophotometry method was developed for the determination of metoclopramide hydrochloride in pure and several pharmaceutical preparations, such as Permosan tablets, Meclodin syrups, and Plasil ampoules. The method is based on the diazotization reaction of metoclopramide hydrochloride with sodium nitrate and hydrochloric acid to yield the diazonium salt, which is then reacted with 3,5-dimethyl phenol in the presence of sodium hydroxide to form a yellow azo dye. Calibration curves were linear in the range from 0.3 to 6.5 µg/mL, with a correlation coefficient of 0.9993. The limits of detection and quantification were determined and found to be 0.18 and 0.61 µg/mL, respectively. Accuracy and precision were also determined b

The prevalence of using the applications for the internet of things (IoT) in many human life fields such as economy, social life, and healthcare made IoT devices targets for many cyber-attacks. Besides, the resource limitation of IoT devices such as tiny battery power, small storage capacity, and low calculation speed made its security a big challenge for the researchers. Therefore, in this study, a new technique is proposed called intrusion detection system based on spike neural network and decision tree (IDS-SNNDT). In this method, the DT is used to select the optimal samples that will be hired as input to the SNN, while SNN utilized the non-leaky integrate neurons fire (NLIF) model in order to reduce latency and minimize devices

The prevalence of using the applications for the internet of things (IoT) in many human life fields such as economy, social life, and healthcare made IoT devices targets for many cyber-attacks. Besides, the resource limitation of IoT devices such as tiny battery power, small storage capacity, and low calculation speed made its security a big challenge for the researchers. Therefore, in this study, a new technique is proposed called intrusion detection system based on spike neural network and decision tree (IDS-SNNDT). In this method, the DT is used to select the optimal samples that will be hired as input to the SNN, while SNN utilized the non-leaky integrate neurons fire (NLIF) model in order to reduce latency and minimize devices

 The aim of this paper is to present a semi - analytic technique for solving singular initial value problems of ordinary differential equations with a singularity of different kinds to construct polynomial solution using two point  osculatory  interpolation.           The efficiency and accuracy of suggested method is assessed by comparisons with exact and other approximate solutions for a wide classes of non–homogeneous, non–linear singular initial value problems.             A new, efficient estimate of the global error is used for adaptive mesh selection. Also, analyze some of the numerical aspects

     Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a

Metaheuristic is one of the most well-known fields of research used to find optimum solutions for non-deterministic polynomial hard (NP-hard) problems, for which it is difficult to find an optimal solution in a polynomial time. This paper introduces the metaheuristic-based algorithms and their classifications and non-deterministic polynomial hard problems. It also compares the performance of two metaheuristic-based algorithms (Elephant Herding Optimization algorithm and Tabu Search) to solve the Traveling Salesman Problem (TSP), which is one of the most known non-deterministic polynomial hard problems and widely used in the performance evaluations for different metaheuristics-based optimization algorithms. The experimental results of Ele

In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H