Symmetric cryptography forms the backbone of secure data communication and storage by relying on the strength and randomness of cryptographic keys. This increases complexity, enhances cryptographic systems' overall robustness, and is immune to various attacks. The present work proposes a hybrid model based on the Latin square matrix (LSM) and subtractive random number generator (SRNG) algorithms for producing random keys. The hybrid model enhances the security of the cipher key against different attacks and increases the degree of diffusion. Different key lengths can also be generated based on the algorithm without compromising security. It comprises two phases. The first phase generates a seed value that depends on producing a rand

In this work 5-methylene-yl - (2-methy –oxazole-4-one) (1H) imidazole (1) were synthesized from the reaction of L-Histidine with acetic anhydride and which converted to the of 5-methylene-yl-(2-methyl 3-amino imidazole-4-one)-1H-imidazole (2) by reaction with hydrazine hydrate. Schiff bases (3-6) were synthesized from the reaction of compound (2) with different aromatic aldehyde. Reaction of compounds (3-6) with chloroacetyl chloride gives azetidinone one derivatives (7-10). These compounds were characterized by FT-IR and some of them with 1H-NMR and 13C-NMR spectroscopy.

new, simple and fast solid-phase extraction method for separation and preconcentration of trace theophylline in aqueous solutions was developed using magnetite nanoparticles (MIONPs) coated with aluminium oxide (AMIONPs) and modified with palmitate (P) as an extractor (P@AMIONPs). It has shown that the developed method has a fast absorbent rate of the theophylline at room temperature. The parameters that affect the absorbent of theophylline in the aqueous solutions have been investigated such as the amount of magnetite nanoparticle, pH, standing time and the volume, concentration of desorption solution. The linear range, limit of quantification (LOQ) and limit of detection (LOD) for the determination of theophylline were 0.05-2.450 μg mL-

Document source identification in printer forensics involves determining the origin of a printed document based on characteristics such as the printer model, serial number, defects, or unique printing artifacts. This process is crucial in forensic investigations, particularly in cases involving counterfeit documents or unauthorized printing. However, consistent pattern identification across various printer types remains challenging, especially when efforts are made to alter printer-generated artifacts. Machine learning models are often used in these tasks, but selecting discriminative features while minimizing noise is essential. Traditional KNN classifiers require a careful selection of distance metrics to capture relevant printing

Background: Morganella morganii is one of the important nosocomial pathogens that may cause urinary tract infection and bacteremia.Methods: The above bacterium was identified from 250 bacterial strains which were isolated from 220 urine samples of patients with urinary tract infection. Antimicrobial susceptibility, by using disk diffusion method, of isolates was tested against some antibiotics.Results: Two M. moganii strains were isolated from female catheterized urinary tract patients, and identified by conventional biochemical tests and API20E system at the first time in Iraq. Both of them produced urease and hemolysin. Antimicrobial susceptibility test showed that these strains are resistant to, amoxicillin-clavulanate, cephalothin, g

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

In this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.

Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.