In the present paper, the concepts of a quasi-metric space, quasi-Banach space
have been introduced. We prove some facts which are defined on these spaces and
define some polynomials on quasi-Banach spaces and studied their dynamics, such
as, quasi cyclic and quasi hypercyclic. We show the existence of quasi chaotic in the
sense of Devaney (quasi D-chaotic) polynomials on quasi Banach space of qsummable
sequences lq , 0<q<1 such polynomials P is defined by P((xi)i)=(p(xi+m))i
where p:CC, p(0) = 0. In general we also prove that P is quasi chaotic in the sense
of Auslander and Yorke (quasi AY-chaotic) if and only if 0 belong to the Julia set of
p, mN. And then we prove that if the above polynomial P on lq , 0<q<1 is quasi
AY-chaotic then so is P where R+ with 1 and Pn for each n2.
Numerical simulations were carried out to evaluate the effects of different aberrations modes on the performance of optical system, when observing and imaging the solar surface. Karhunen-Loeve aberrations modes were simulated as a wave front error in the aperture function of the optical system. To identify and apply the appropriate rectification that removes or reduces various types of aberration, their attribute must be firstly determined and quantitatively described. Wave aberration function is well suitable for this purpose because it fully characterizes the progressive effect of the optical system on the wave front passing through the aperture. The Karhunen-Loeve polynomials for circular aperture were used to
... Show MoreThe concept of separation axioms constitutes a key role in general topology and all generalized forms of topologies. The present authors continued the study of gpα-closed sets by utilizing this concept, new separation axioms, namely gpα-regular and gpα-normal spaces are studied and established their characterizations. Also, new spaces namely gpα-Tk for k = 0, 1, 2 are studied.
In this paper, we define a new type of pairwise separation axioms called pairwise semi-p- separation axioms in bitopological spaces, also we study some properties of these spaces and relationships of each one with the ordinary separation axioms in the bitopological spaces.
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise Lindelöf and locally Lindelöf topological spaces, which are generalizations of will-known concepts: Lindelöf topological space (1) "A topological space X is called a Lindelöf space if for every open cover of X has a countable subcover" and locally Lindelöf topological space (1) "A topological space X is called a locally Lindelöf space if for every point x in X, there exist a nbd U of x such that the closure of U in X is Lindelöf space". Either the new concepts are: "A fibrewise topological space X over B is called a fibrewise Lindelöf if the projection function p : X→B is Lindelöf" and "The fibrewise topological space X over B
... Show MoreFree-Space Optical (FSO) can provide high-speed communications when the effect of turbulence is not serious. However, Space-Time-Block-Code (STBC) is a good candidate to mitigate this seriousness. This paper proposes a hybrid of an Optical Code Division Multiple Access (OCDMA) and STBC in FSO communication for last mile solutions, where access to remote areas is complicated. The main weakness effecting a FSO link is the atmospheric turbulence. The feasibility of employing STBC in OCDMA is to mitigate these effects. The current work evaluates the Bit-Error-Rate (BER) performance of OCDMA operating under the scintillation effect, where this effect can be described by the gamma-gamma model. The most obvious finding to emerge from the analysis
... Show MoreComputer systems and networks are being used in almost every aspect of our daily life, the security threats to computers and networks have increased significantly. Usually, password-based user authentication is used to authenticate the legitimate user. However, this method has many gaps such as password sharing, brute force attack, dictionary attack and guessing. Keystroke dynamics is one of the famous and inexpensive behavioral biometric technologies, which authenticate a user based on the analysis of his/her typing rhythm. In this way, intrusion becomes more difficult because the password as well as the typing speed must match with the correct keystroke patterns. This thesis considers static keystroke dynamics as a transparent layer of t
... Show MoreComputer systems and networks are increasingly used for many types of applications; as a result the security threats to computers and networks have also increased significantly. Traditionally, password user authentication is widely used to authenticate legitimate user, but this method has many loopholes such as password sharing, brute force attack, dictionary attack and more. The aim of this paper is to improve the password authentication method using Probabilistic Neural Networks (PNNs) with three types of distance include Euclidean Distance, Manhattan Distance and Euclidean Squared Distance and four features of keystroke dynamics including Dwell Time (DT), Flight Time (FT), mixture of (DT) and (FT), and finally Up-Up Time (UUT). The resul
... Show More