Automatic license plate recognition (ALPR) used for many applications especially in security applications, including border control. However, more accurate and language-independent techniques are still needed. This work provides a new approach to identifying Arabic license plates in different formats, colors, and even including English characters. Numbers, characters, and layouts with either 1-line or 2-line layouts are presented. For the test, we intend to use Iraqi license plates as there is a wide range of license plate styles written in Arabic, Kurdish, and English/Arabic languages, each different in style and color. This variety makes it difficult for recent traditional license plate recognition systems and algorithms to recogn

Background: Fast dissolving oral drug delivery system is solid dosage form which disintegrates or dissolves within second when placed in the mouth without need of water or chewing. In present investigation, an attempt has been made to develop oral fast dissolving film of calcium channel blocker lacidipine. Method: Five formulas were prepared by solvent casting method using HPMC (METOLOSE)® as a film forming polymer and evaluated for their physical characteristics such as thickness, weight variation, folding endurance, drug content, disintegration time and in vitro drug release. The compatibility of the drug in the formulation was confirmed by FTIR and DSC studies. Result and Conclusion: The optimized formula F1 showed minimum in vitr

This work implements an Electroencephalogram (EEG) signal classifier. The implemented method uses Orthogonal Polynomials (OP) to convert the EEG signal samples to moments. A Sparse Filter (SF) reduces the number of converted moments to increase the classification accuracy. A Support Vector Machine (SVM) is used to classify the reduced moments between two classes. The proposed method’s performance is tested and compared with two methods by using two datasets. The datasets are divided into 80% for training and 20% for testing, with 5 -fold used for cross-validation. The results show that this method overcomes the accuracy of other methods. The proposed method’s best accuracy is 95.6% and 99.5%, respectively. Finally, from the results, it

In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.

      The goal of this research is to better understand the physical features of starburst galaxies. Radio and X-ray observations are good for exploring the stuff within the central regions of galaxies.  A galaxy that is undergoing a strong star formation, usually in its central area, is known as a starburst galaxy. This paper provides the results of a statistical analysis of a sample of starburst galaxies. The data used in this research have been collected from NASA Extragalactic Database (NED), and HYPERLEDA. Those data have been used to examine possible luminosity correlations of X-ray to a radio of a sample of starburst galaxies. In this research, statistical software, known as statistic-win-program, has been used to inves

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.