Purpose: To validate a UV-visible spectrophotometric technique for evaluating niclosamide (NIC) concentration in different media across various values of pH. Methods: NIC was investigated using a UV-visible spectrophotometer in acidic buffer solution (ABS) of pH 1.2, deionized water (DW), and phosphate buffer solution (PBS), pH 7.4. The characterization of NIC was done with differential scanning calorimeter (DSC), powder X-ray diffraction (XRD), and Fourier transform infrared spectroscopy (FTIR). The UV analysis was validated for accuracy, precision, linearity, and robustness. Results: The DSC spectra showed a single endothermic peak at 228.43 °C (corresponding to the melting point of NIC), while XRD and FTIR analysis confirmed the identit

In this paper, a new approach was suggested to the method of Gauss Seidel through the controlling of equations installation before the beginning of the method in the traditional way. New structure of equations occur after the diagnosis of the variable that causes the fluctuation and the slow extract of the results, then eradicating this variable. This procedure leads to a higher accuracy and less number of steps than the old method. By using the this proposed method, there will be a possibility of solving many of divergent values equations which cannot be solved by the old style.

The transmitting and receiving of data consume the most resources in Wireless Sensor Networks (WSNs). The energy supplied by the battery is the most important resource impacting WSN's lifespan in the sensor node. Therefore, because sensor nodes run from their limited battery, energy-saving is necessary. Data aggregation can be defined as a procedure applied for the elimination of redundant transmissions, and it provides fused information to the base stations, which in turn improves the energy effectiveness and increases the lifespan of energy-constrained WSNs. In this paper, a Perceptually Important Points Based Data Aggregation (PIP-DA) method for Wireless Sensor Networks is suggested to reduce redundant data before sending them to the

Due to the high mobility and dynamic topology of the FANET network, maintaining communication links between UAVs is a challenging task. The topology of these networks is more dynamic than traditional mobile networks, which raises challenges for the routing protocol. The existing routing protocols for these networks partly fail to detect network topology changes. Few methods have recently been proposed to overcome this problem due to the rapid changes of network topology. We try to solve this problem by designing a new dynamic routing method for a group of UAVs using Hybrid SDN technology (SDN and a distributed routing protocol) with a highly dynamic topology. Comparison of the proposed method performance and two other algorithms is simula

A particular solution of the two and three dimensional unsteady state thermal or mass diffusion equation is obtained by introducing a combination of variables of the form,
η = (x+y) / √ct , and η = (x+y+z) / √ct, for two and three dimensional equations
respectively. And the corresponding solutions are,
θ (t,x,y) = θ₀ erfc (x+y)/√8ct and θ( t,x,y,z) =θ₀ erfc (x+y+z/√12ct)

This paper is dealing with non-polynomial spline functions "generalized spline" to find the approximate solution of linear Volterra integro-differential equations of the second kind and extension of this work to solve system of linear Volterra integro-differential equations. The performance of generalized spline functions are illustrated in test examples

In this paper we use non-polynomial spline functions to develop numerical methods to approximate the solution of 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of these method, and to compare the computed results with other known methods.

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res