Authentication is the process of determining whether someone or something is, in fact, who or what it is declared to be. As the dependence upon computers and computer networks grows, the need for user authentication has increased. User’s claimed identity can be verified by one of several methods. One of the most popular of these methods is represented by (something user know), such as password or Personal Identification Number (PIN). Biometrics is the science and technology of authentication by identifying the living individual’s physiological or behavioral attributes. Keystroke authentication is a new behavioral access control system to identify legitimate users via their typing behavior. The objective of this paper is to provide user authentication based on keystroke dynamic in order to avoid un authorized user access to the system. Naive Bayes Classifier (NBC) is applied for keystroke authentication using unigraph and diagraph keystroke features. The unigraph Dwell Time (DT), diagraph Down-Down Time (DDT) features, and combination of (DT and DDT) are used. The results show that the combination of features (DT and DDT) produces better results with low error rate as compared with using DT or DDT alone.
Throughout this work we introduce the notion of Annihilator-closed submodules, and we give some basic properties of this concept. We also introduce a generalization for the Extending modules, namely Annihilator-extending modules. Some fundamental properties are presented as well as we discuss the relation between this concept and some other related concepts.
(1)
Let R be associative ring with identity and M is a non- zero unitary left module over R. M is called M- hollow if every maximal submodule of M is small submodule of M. In this paper we study the properties of this kind of modules.
The soft sets were known since 1999, and because of their wide applications and their great flexibility to solve the problems, we used these concepts to define new types of soft limit points, that we called soft turning points.Finally, we used these points to define new types of soft separation axioms and we study their properties.
(18)
(4)
Let R be associative; ring; with an identity and let D be unitary left R- module; . In this work we present semiannihilator; supplement submodule as a generalization of R-a- supplement submodule, Let U and V be submodules of an R-module D if D=U+V and whenever Y≤ V and D=U+Y, then annY≪R;. We also introduce the the concept of semiannihilator -supplemented ;modules and semiannihilator weak; supplemented modules, and we give some basic properties of this conseptes.
(2)
(3)
Let R be associative; ring; with an identity and let D be unitary left R- module; . In this work we present semiannihilator; supplement submodule as a generalization of R-a- supplement submodule, Let U and V be submodules of an R-module D if D=U+V and whenever Y≤ V and D=U+Y, then annY≪R;. We also introduce the the concept of semiannihilator -supplemented ;modules and semiannihilator weak; supplemented modules, and we give some basic properties of this conseptes
(4)
Most of the Weibull models studied in the literature were appropriate for modelling a continuous random variable which assumes the variable takes on real values over the interval [0,∞]. One of the new studies in statistics is when the variables take on discrete values. The idea was first introduced by Nakagawa and Osaki, as they introduced discrete Weibull distribution with two shape parameters q and β where 0 < q < 1 and b > 0. Weibull models for modelling discrete random variables assume only non-negative integer values. Such models are useful for modelling for example; the number of cycles to failure when components are subjected to cyclical loading. Discrete Weibull models can be obta
... Show More
(1)
Many codiskcyclic operators on infinite-dimensional separable Hilbert space do not satisfy the criterion of codiskcyclic operators. In this paper, a kind of codiskcyclic operators satisfying the criterion has been characterized, the equivalence between them has been discussed and the class of codiskcyclic operators satisfying their direct summand is codiskcyclic. Finally, this kind of operators is used to prove that every codiskcyclic operator satisfies the criterion if the general kernel is dense in the space.
(4)
(2)