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.
Numeral recognition is considered an essential preliminary step for optical character recognition, document understanding, and others. Although several handwritten numeral recognition algorithms have been proposed so far, achieving adequate recognition accuracy and execution time remain challenging to date. In particular, recognition accuracy depends on the features extraction mechanism. As such, a fast and robust numeral recognition method is essential, which meets the desired accuracy by extracting the features efficiently while maintaining fast implementation time. Furthermore, to date most of the existing studies are focused on evaluating their methods based on clean environments, thus limiting understanding of their potential a
... Show More
(31)
(30)
An eco-epidemiological system incorporating a vertically transmitted infectious disease is proposed and investigated. Micheal-Mentence type of harvesting is utilized to study the harvesting effort imposed on the predator. All the properties of the solution of the system are discussed. The dynamical behaviour of the system, involving local stability, global stability, and local bifurcation, is investigated. The work is finalized with the numerical simulation to observe the global behaviour of the solution.
(3)
We introduce and discuss recent type of fibrewise topological spaces, namely fibrewise soft bitopological spaces. Also, we introduce the concepts of fibrewise closed soft bitopological spaces, fibrewise open soft bitopological spaces, fibrewise locally sliceable soft bitopological spaces and fibrewise locally sectionable soft bitopological spaces. Furthermore, we state and prove several propositions concerning these concepts.
(6)
(3)
Due to the vast using of digital images and the fast evolution in computer science and especially the using of images in the social network.This lead to focus on securing these images and protect it against attackers, many techniques are proposed to achieve this goal. In this paper we proposed a new chaotic method to enhance AES (Advanced Encryption Standards) by eliminating Mix-Columns transformation to reduce time consuming and using palmprint biometric and Lorenz chaotic system to enhance authentication and security of the image, by using chaotic system that adds more sensitivity to the encryption system and authentication for the system.
Nowadays, 3D content is becoming an essential part of multimedia applications, when the 3D content is not protected, hackers may attack and steal it. This paper introduces a proposed scheme that provides high protection for 3D content by implementing multiple levels of security with preserving the original size using weight factor (w). First level of security is implemented by encrypting the texture map based on a 2D Logistic chaotic map. Second level is implemented by shuffling vertices (confusion) based on a 1D Tent chaotic map. Third level is implemented by modifying the vertices values (diffusion) based on a 3D Lorenz chaotic map. Results illustrate that the proposed scheme is completely deform the entire 3D content accord
... Show More
(2)
(1)
(36)
(36)
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.
MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order
... Show More
Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va
... Show More
(4)
(2)