Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm uses the parallel processing paradigm to leverage the computation cost. This is performed by utilizing the multicore and multithreading features of a CPU. The implementation of multithreaded algorithms for computing TP coefficients segments the computations into sub-tasks. These sub-tasks are executed concurrently on several threads across the available cores. The performance of the multithreaded algorithm is evaluated on various TP sizes, which demonstrates a significant improvement in computation time. Furthermore, a selection for the appropriate number of threads for the proposed algorithm is introduced. The results reveal that the proposed algorithm enhances the computation performance to provide a quick, steady, and accurate computation of the TP coefficients, making it a practical solution for different applications.
There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that
... Show MoreA modern, rapid RP-HPLC-UV method was developed and validated in compliance with FDA and EMA guidelines for simultaneous quantification of 15 βlactam antibiotics) Ampicillin, Amoxicillin, cephalexin, cefotaxime, cefoxitin, cefamandole, cephalothin, piperacillin, penicillin, oxacillin, cloxacillin, nafcillin Carbenicillin, Mezlocillin and Dicloxacillin) in pharmaceutical formulations and pure forms. The method employs Column NEUCLEODUR C-18 (4.0 mm x 100 mm, 5µm particle size), at a temperature of thirty degrees Celsius, and the mobile phase was acetonitrile and KH2PO4 using gradient elution with a total separation time of 13 minutes, a flow rate of 1.3 ml/min, at = pH 4.5 for the buffer solution and the λ max was 220 nm. The met
... Show MoreThere has been a growing interest in the use of chaotic techniques for enabling secure communication in recent years. This need has been motivated by the emergence of a number of wireless services which require the channel to provide very low bit error rates (BER) along with information security. As more and more information is transacted over wireless media, there has been increasing criminal activity directed against such systems. This paper investigates the feasibility of using chaotic communications over Multiple-Input-Multiple-Output (MIMO) channels. We have studied the performance of differential chaos shift keying (DCSK) with 2×2 Alamouti scheme and 2×1 Alamouti scheme for different chaotic maps over additive white Gaussian noise (
... Show MoreIn this work, the performance of the receiver in a quantum cryptography system based on BB84 protocol is scaled by calculating the Quantum Bit Error Rate (QBER) of the receiver. To apply this performance test, an optical setup was arranged and a circuit was designed and implemented to calculate the QBER. This electronic circuit is used to calculate the number of counts per second generated by the avalanche photodiodes set in the receiver. The calculated counts per second are used to calculate the QBER for the receiver that gives an indication for the performance of the receiver. Minimum QBER, 6%, was obtained with avalanche photodiode excess voltage equals to 2V and laser diode power of 3.16 nW at avalanche photodiode temperature of -10
... Show MoreThe electrical and thermal performance of a typical single pass hybrid photovoltaic/thermal (PV/T) air collector is modeled, simulated and analyzed for two selected case studies in Iraq. An improved mathematical thermo-electrical model is derived in terms of design, operating and climatic parameters of the hybrid solar collector to evaluate its important characteristics: collector flow and heat removal factors, PV maximum power point and its temperature coefficient, and overall power and efficiency. Unlike previous PV/T thermal models, the present model is obtained with some additions and corrections in radiation and convection heat coefficients for the top loss and for the air duct with more applicable sky temperature correlation. The well
... Show Moreهدفت الدراسة لالقاء الضوء على وضع المرأة في التعليم العالي في العراق خلال الاعوام الدراسية: 2008 - 2009, 2010 – 2011 و2011- 2012. تتيح القوانين والتعليمات في التعليم العالي في العراق فرص متكافئة للاناث والذكور للتسجيل في الدراسات الاولية والعليا، وكذلك عدم التمييز في الرواتب الشهرية للمنتسبين وفقا لنوع الجنس (الجندر ). بلغ متوسط عدد الاناث في مرحلة الدراسة الاولية في مؤسسات التعليم العالي في العراق لثلا
... Show MoreCredit 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
... Show MoreWireless sensor networks (WSNs) represent one of the key technologies in internet of things (IoTs) networks. Since WSNs have finite energy sources, there is ongoing research work to develop new strategies for minimizing power consumption or enhancing traditional techniques. In this paper, a novel Gaussian mixture models (GMMs) algorithm is proposed for mobile wireless sensor networks (MWSNs) for energy saving. Performance evaluation of the clustering process with the GMM algorithm shows a remarkable energy saving in the network of up to 92%. In addition, a comparison with another clustering strategy that uses the K-means algorithm has been made, and the developed method has outperformed K-means with superior performance, saving ener
... Show More