Iris research is focused on developing techniques for identifying and locating relevant biometric features, accurate segmentation and efficient computation while lending themselves to compression methods. Most iris segmentation methods are based on complex modelling of traits and characteristics which, in turn, reduce the effectiveness of the system being used as a real time system. This paper introduces a novel parameterized technique for iris segmentation. The method is based on a number of steps starting from converting grayscale eye image to a bit plane representation, selection of the most significant bit planes followed by a parameterization of the iris location resulting in an accurate segmentation of the iris from the original image. A lossless Hexadata encoding method is then applied to the data, which is based on reducing each set of six data items to a single encoded value. The tested results achieved acceptable saving bytes performance for the 21 iris square images of sizes 256x256 pixels which is about 22.4 KB on average with 0.79 sec decompression average time, with high saving bytes performance for 2 iris non-square images of sizes 640x480/2048x1536 that reached 76KB/2.2 sec, 1630 KB/4.71 sec respectively, Finally, the proposed promising techniques standard lossless JPEG2000 compression techniques with reduction about 1.2 and more in KB saving that implicitly demonstrating the power and efficiency of the suggested lossless biometric techniques.
Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef
... Show MoreThis study investigates self-perception and self-branding on Instagram among young Arab women in the UAE, focusing on how they curate, negotiate and perform their digital identities and whether their digital self-presentation in any way compromises their sense of authenticity. The study is based on 11 interviews with young women in the UAE, between the ages of 20 and 30, in addition to online observation to follow the participants’ activities on Instagram. The study demonstrates that while social and digital media platforms may play a role in “empowering” Arab women, women tend to set their boundaries of authenticity shaped according to their audience’s expectations and their in-groups. This confirms the r
... Show MoreIn this paper is to introduce the concept of hyper AT-algebras is a generalization of AT-algebras and study a hyper structure AT-algebra and investigate some of its properties. “Also, hyper AT-subalgebras and hyper AT-ideal of hyper AT-algebras are studied. We study on the fuzzy theory of hyper AT-ideal of hyper AT-algebras hyper AT-algebra”. “We study homomorphism of hyper AT-algebras which are a common generalization of AT-algebras.
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show MoreMan has a great role in the development of society in all fields, and therefore the human thought played a great role in its continuous pursuit and insight into the social classes that differ in their privileges, which makes the members of society not reconcile because of that disparity that is not based on human principles, so one class exploits another, and this is what stopped me Rather, it prompted me to choose the topic (class and its impact on society) in order to show the impact of classes on each other negatively and positively, so I work to avoid the first with the recommendations I put forward and offer guidance, and strengthen the second, and after this topic of necessity in a place because of the imbalance and promise of appr
... Show MoreIn this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.
As computers become part of our everyday life, more and more people are experiencing a
variety of ocular symptoms related to computer use. These include eyestrain, tired eyes, irritation,
redness, blurred vision, and double vision, collectively referred to as computer vision syndrome.
The effect of CVS to the body such as back and shoulder pain, wrist problem and neck pain.
Many risk factors are identified in this paper.
Primary prevention strategies have largely been confined to addressing environmental
exposure to ergonomic risk factors, since to date, no clear cause for this work-related neck pain
has been acknowledged. Today, millions of children use computers on a daily basis. Extensive
viewing of the compute