This study aimed at some of the criteria used to determine the form of the river basins, and exposed the need to modify some of its limitations. In which, the generalization of the elongation and roundness ratio coefficient criterion was modified, which was set in a range between (0-1). This range goes beyond determining the form of the basin, which gives it an elongated or rounded feature, and the ratio has been modified by making it more detailed and accurate in giving the basin a specific form, not only a general characteristic. So, we reached a standard for each of the basins' forms regarding the results of the elongation and circularity ratios. Thus, circular is (1-0.8), and square is (between 0.8-0.6), the blade or oval form is (0.6-0

A true random TTL pulse generator was implemented and investigated for quantum key distribution systems. The random TTL signals are generated by low cost components available in the local markets. The TTL signals are obtained by using true random binary sequences based on registering photon arrival time difference registered in coincidence windows between two single – photon detectors. The true random TTL pulse generator performance was tested by using time to digital converters which gives accurate readings for photon arrival time. The proposed true random pulse TTL generator can be used in any quantum -key distribution system for random operation of the transmitters for these systems

In this paper, an algorithm through which we can embed more data than the
regular methods under spatial domain is introduced. We compressed the secret data
using Huffman coding and then this compressed data is embedded using laplacian
sharpening method.
We used Laplace filters to determine the effective hiding places, then based on
threshold value we found the places with the highest values acquired from these filters
for embedding the watermark. In this work our aim is increasing the capacity of
information which is to be embedded by using Huffman code and at the same time
increasing the security of the algorithm by hiding data in the places that have highest
values of edges and less noticeable.
The perform

The theory of probabilistic programming  may be conceived in several different ways. As a method of programming it analyses the implications of probabilistic variations in the parameter space of linear or nonlinear programming model. The generating mechanism of such probabilistic variations in the economic models may be due to incomplete information about changes in demand, pro­duction and technology, specification errors about the econometric relations presumed for different economic agents, uncertainty of various sorts and the consequences of imperfect aggregation or disaggregating of economic variables. In this Research we discuss the probabilistic programming problem when the coefficient b_i is random variable

<p>Daftardar Gejji and Hossein Jafari have proposed a new iterative method for solving many of the linear and nonlinear equations namely (DJM). This method proved already the effectiveness in solved many of the ordinary differential equations, partial differential equations and integral equations. The main aim from this paper is to propose the Daftardar-Jafari method (DJM) to solve the Duffing equations and to find the exact solution and numerical solutions. The proposed (DJM) is very effective and reliable, and the solution is obtained in the series form with easily computed components. The software used for the calculations in this study was MATHEMATICA^® 9.0.</p>

The method of operational matrices based on different types of polynomials such as Bernstein, shifted Legendre and Bernoulli polynomials will be presented and implemented to solve the nonlinear Blasius equations approximately. The nonlinear differential equation will be converted into a system of nonlinear algebraic equations that can be solved using Mathematica®12. The efficiency of these methods has been studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as the polynomial degree (n) increases, since the errors decrease. Moreover, the approximate solutions obtained by the proposed methods are compared with the solution of the 4th order Runge-Kutta method (RK4), which gives very

With the growth of mobile phones, short message service (SMS) became an essential text communication service. However, the low cost and ease use of SMS led to an increase in SMS Spam. In this paper, the characteristics of SMS spam has studied and a set of features has introduced to get rid of SMS spam. In addition, the problem of SMS spam detection was addressed as a clustering analysis that requires a metaheuristic algorithm to find the clustering structures. Three differential evolution variants viz DE/rand/1, jDE/rand/1, jDE/best/1, are adopted for solving the SMS spam problem. Experimental results illustrate that the jDE/best/1 produces best results over other variants in terms of accuracy, false-positive rate and false-negative