By driven the moment estimator of ARMA (1, 1) and by using the simulation some important notice are founded, From the more notice conclusions that the relation between the sign   and moment estimator for ARMA (1, 1) model that is: when the sign is positive means the root      gives invertible model and when the sign is negative means the root      gives invertible model. An alternative method has been suggested for ARMA (0, 1) model can be suitable when

In this paper the definition of fuzzy normed space is recalled and its basic properties. Then the definition of fuzzy compact operator from fuzzy normed space into another fuzzy normed space is introduced after that the proof of an operator is fuzzy compact if and only if the image of any fuzzy bounded sequence contains a convergent subsequence is given. At this point the basic properties of the vector space FC(V,U)of all fuzzy compact linear operators are investigated such as when U is complete and the sequence ( ) of fuzzy compact operators converges to an operator T then T must be fuzzy compact. Furthermore we see that when T is a fuzzy compact operator and S is a fuzzy bounded operator then the composition TS and ST are fuzzy compact

In this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

Biometrics represent the most practical method for swiftly and reliably verifying and identifying individuals based on their unique biological traits. This study addresses the increasing demand for dependable biometric identification systems by introducing an efficient approach to automatically recognize ear patterns using Convolutional Neural Networks (CNNs). Despite the widespread adoption of facial recognition technologies, the distinct features and consistency inherent in ear patterns provide a compelling alternative for biometric applications. Employing CNNs in our research automates the identification process, enhancing accuracy and adaptability across various ear shapes and orientations. The ear, being visible and easily captured in

        In the last years, the self-balancing platform has become one of the most common candidates to use in many applications such as flight, biomedical fields, industry. This paper introduced the simulated model of a proposed self-balancing platform that described the self–balancing attitude in (X-axis, Y-axis, or both axis) under the influence of road disturbance. To simulate the self-balanced platform's performance during the tilt, an integration between Solidworks, Simscape, and Simulink toolboxes in MATLAB was used. The platform's dynamic model was drawn in SolidWorks and exported as a STEP file used in the Simscape Multibody environment. The system is controlled using the proportional-integral-derivative (PID) co