Search Results

The false nearest neighbors (FNN) method estimates the variables of a system by sequentially embedding a time series into a higher-dimensional delay coordinate system and finding an embedding dimension in which the neighborhood of the delay coordinate vector in the lower dimension does not extend into the higher, that is, a dimension in which no…

In this paper are shown some new results on fixed point related to a φ – ψ contractive map in JS – generalized metric spaces X. It proves that there exists a unique fixed point for a nonlinear map f:X→X, using two altering distance functions. Furthermore, it gives some results which related to a couple…

We consider the estimation of empirical probability distributions, both discrete and continuous. We focus on deriving formulas to estimate number of categories for the discrete distribution, when the number of categories is hidden, and the means and methods to estimate the number of components in the Gaussian mixture model representing a probability density function given…

In this paper, we present a new method to deduce minimal cut sets depending on the minimal path sets of the complex systems (networks) to generate the Incidence Matrix, and then compared it with the truth table of the system. This comparison, based on some algebraic properties, gives minimal-cut sets of the complex network with…

In Banach spaces an iteration algorithm for two finite families of total asymptotically quasi-nonexpansive maps is introduced. Weak and strong convergence theorems of this algorithm to approximation common fixed points are proved by using suitable conditions. As well as, numerical example by using Mat-lab is given.

The distribution of bit patterns is an important measure to check the randomness of a sequence. The authors of this paper observed this crucial property in a binary sequence which generated by using a primitive polynomial, trace function, and Legendre symbol defined over the sub extension field. The authors create a new dimension in the…

In this paper, Constant False Alarm Rate (CFAR) detection of spatially distributed targets embedded in compound Gaussian clutter with Inverse Gamma texture is addressed. By taking into account the fact that clutter parameters are unknown in practical situations, we propose mean level based on Lookup Tables detectors, that operate as a two-step approach, which consists…

In classical cryptography, the Hill cipher is a polygraphic substitution cipher based on linear algebra. In this work, we proposed a new problem applicable to the public key cryptography, based on the Matrices, called “Matrix discrete logarithm problem”, it uses certain elements formed by matrices whose coefficients are elements in a finite field. We have…

The aim of this paper is to continue our study of information in the setting of Pseudo-Analysis. We shall present, by axiomatic way, the definition of measures of general conditional information and we shall study particular measure by using a system of functional equations in which it is present a pseudo-operation. We know that J.Aczel…