In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

The implementation of technology in the provision of public services and communication to citizens, which is commonly referred to as e-government, has brought multitude of benefits, including enhanced efficiency, accessibility, and transparency. Nevertheless, this approach also presents particular security concerns, such as cyber threats, data breaches, and access control. One technology that can aid in mitigating the effects of security vulnerabilities within e-government is permissioned blockchain. This work examines the performance of the hyperledger fabric private blockchain under high transaction loads by analyzing two scenarios that involve six organizations as case studies. Several parameters, such as transaction send ra

Let  be an n-Banach space, M be a nonempty closed convex subset of , and S:M→M be a mapping that belongs to the class  mapping. The purpose of this paper is to study the stability and data dependence results of a Mann iteration scheme on n-Banach space

Data security is a significant requirement in our time. As a result of the rapid development of unsecured computer networks, the personal data should be protected from unauthorized persons and as a result of exposure AES algorithm is subjected to theoretical attacks such as linear attacks, differential attacks, and practical attacks such as brute force attack these types of attacks are mainly directed at the S-BOX and since the S-BOX table in the algorithm is static and no dynamic so this is a major weakness for the S-BOX table, the algorithm should be improved to be impervious to future dialects that attempt to analyse and break the algorithm  in order to remove these weakness points, Will be generated dynamic substitution box (S-B

Offline Arabic handwritten recognition lies in a major field of challenge due to the changing styles of writing from one individual to another. It is difficult to recognize the Arabic handwritten because of the same appearance of the different characters.  In this paper a proposed method for Offline Arabic handwritten recognition. The   proposed method for recognition hand-written Arabic word without segmentation to sub letters based on feature extraction scale invariant feature transform (SIFT) and   support vector machines (SVMs) to enhance the recognition accuracy. The proposed method  experimented using (AHDB) database. The experiment result  show  (99.08) recognition  rate.

Seventy exudative lymphocytic pleural fluid specimens of patients with suspected tuberculous pleural effusion submitted to the National Reference Laboratory of tuberculosis/Baghdad from October 2012 to February 2013. These effusions were due to tuberculosis pleuritis (n=12) and non-tuberculosis pleuritis (n=58). The following parameters were analyzed: protein concentration, glucose concentration, lactate dehydrogenase (LDH) concentration and adenosine deaminase activity (ADA). As a result, the protein concentration was higher in TPE patients (8.80 ± 0.89 g/dl) than it's concentration in non-TPE patients (7.61 ± 0.54 g/dl), as well as LDH concentration was (3366.58 ± 284.28 U/L) in TPE patients and (3024.12 ± 116.84 U/L) in non-TPE pa

In computer vision, visual object tracking is a significant task for monitoring
applications. Tracking of object type is a matching trouble. In object tracking, one
main difficulty is to select features and build models which are convenient for
distinguishing and tracing the target. The suggested system for continuous features
descriptor and matching in video has three steps. Firstly, apply wavelet transform on
image using Haar filter. Secondly interest points were detected from wavelet image
using features from accelerated segment test (FAST) corner detection. Thirdly those
points were descripted using Speeded Up Robust Features (SURF). The algorithm
of Speeded Up Robust Features (SURF) has been employed and impl

A proposed feature extraction algorithm for handwriting Arabic words. The proposed method uses a 4 levels discrete wavelet transform (DWT) on binary image. sliding window on wavelet space and computes the stander derivation for each window. The extracted features were classified with multiple Support Vector Machine (SVM) classifiers. The proposed method simulated with a proposed data set from different writers. The experimental results of the simulation show 94.44% recognition rate.

     This article introduces the concept of finitely null-additive set function relative to the σ– ring and many properties of this concept have been discussed. Furthermore, to introduce and study the notion of finitely weakly null-additive set function relative to the σ– ring as a generalization of some concepts such as measure, countably additive, finitely additive, countably null-additive, countably weakly null-additive and finitely null-additive. As the first result, it has been proved that every finitely null-additive is a finitely weakly null-additive. Finally, the paper introduces a study of the concept of outer measure as a stronger form of finitely weakly null-additive.

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.