The security of message information has drawn more attention nowadays, so; cryptography has been used extensively. This research aims to generate secured cipher keys from retina information to increase the level of security. The proposed technique utilizes cryptography based on retina information. The main contribution is the original procedure used to generate three types of keys in one system from the retina vessel's end position and improve the technique of three systems, each with one key. The distances between the center of the diagonals of the retina image and the retina vessel's end (diagonal center-end (DCE)) represent the first key. The distances between the center of the radius of the retina and the retina vessel's end (ra

In this article, a short review on the feature of reality and locality in quantum optics is given.
The Bell inequality and the Bell states are introduced to show their direct use in quantum computer and
quantum teleportation. Moreover, quantum cryptography is discussed in some details regarding basic
ideas and practical considerations. In addition, a case study involving distillation of a quantum key based
on the given fundamentals is presented and discussed.

The integer simulation and development finite impulse response (FIR) filters taking into account the possibilities of their realization on digital integer platforms are considered. The problem statement and solution of multifunctional synthesis of digital FIR filters such a problem on the basis of the numerical methods of integer nonlinear mathematical programming are given. As an several examples, the problem solution of synthesis FIR-filters with short coefficient word length  has been given. The analysis of their characteristics is resulted. The paper discusses issues of modeling and synthesis of digital FIR filters with provision for the possibilities of their implementation on digital platforms with integer computation arithme

This booklet contains the basic data and graphs forCOVID-19 in Iraq during the first three months of thepandemic ( 24 February to 19 May - 2020 ) , It isperformed to help researchers regarding this health problem (PDF) Information Booklet COVID-19 Graphs For Iraq First 3 Months. Available from: https://www.researchgate.net/publication/341655944_Information_Booklet_COVID-19_Graphs_For_Iraq_First_3_Months#fullTextFileContent [accessed Oct 26 2024].

Background. Najaf governorate was recorded as one of the most polluted Iraqi governorates with increased cancer, autoimmune, and abortion cases. Study Groups. A total of 88 adult volunteers from three test groups were divided based on their inhabitance in different geographical regions in Najaf governorate. Group 1 (G1; n, 29) inhabitants of Al‐Ansar, Al‐Abbaseyeh, and Al‐Manathera districts, Group 2 (G2; n, 27) inhabitants of 22 different scattered districts of the governorate, Group 3 (G3; n, 32) inhabitants of Kufa city and center districts in the old Najaf city. According to previous author

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.