Recent studies have demonstrated that correntropy is an efficient tool for analyzing higher-order statistical moments in nonGaussian noise environments. Although correntropy has been used with complex data, no theoretical study was pursued to elucidate its properties, nor how to best use it for optimization . This paper presents a probabilistic interpretation for correntropy using complex-value...

We study the Newton method and a fixed-point method for solving the system of nonlinear equations arising from the Sinc-Galerkin discretization of the Burgers equations. In each step of the Newton method or the fixedpoint method, a structured subsystem of linear equations is obtained and needs to be solved numerically. In this paper, preconditioning techniques are applied to solve such linear s...

In Dynamic Programming, convergence of algorithms such as Value Iteration or Policy Iteration results -in discounted problemsfrom a contraction property of the back-up operator, guaranteeing convergence to its fixedpoint. When approximation is considered, known results in Approximate Policy Iteration provide bounds on the closeness to optimality of the approximate value function obtained by suc...

The recent rapid increase in applications of DSP has generated a need for technical personnel with a DSP background. Until recently, most DSP education has been at the graduate level, so many practicing engineers are developing a need for additional DSP education. At Georgia Tech we are delivering an online continuing education course that is targeted at these engineers. The 12-week course is c...

For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point unfolding. Two solutions of this problem are proposed: The first one is a system with equi-recursive nonstrictly positive type constructors of arbitrary finite kinds, where fixedpoint unfolding is computationally invisible due to...

At PEPM’91 Sahlin presented a determinacy analysis for Prolog with cut. The analysis was, however, not justified in any kind of semantics for Prolog, so correctness was argued with respect to an intuitive idea of the behaviour of Prolog programs. We now start with a denotational semantics of Prolog and derive a variant of Sahlins analysis as an abstraction of this. We observe that we avoid some...

In this paper, we give a fixed point theorem for $(psi,varphi)$-weakly contractive mappings in complete $b$-metric spaces. We also give a common fixed point theorem for such mappings in complete $b$-metric spaces via altering functions. The given results generalize two known results in the setting of metric spaces. Two examples are given to verify the given results.

In this paper is introduced a new type of generalization of metric spaces called $S_b$ metric space. For this new kind of spaces it has been proved a common fixed point theorem for four mappings which satisfy generalized contractive condition. We also present example to confirm our theorem.

In this paper we prove a unique common coupled fixed point theorem for two pairs of $w$-compatible mappings in $S_b$-metric spaces satisfying a contrctive type condition. We furnish an example to support our main theorem. We also give a corollary for Junck type maps.

in this paper we study a representation of a fuzzy subgroup $mu$ of a group $g$, as a product of indecomposable fuzzy subgroups called the components of $mu$.  this representation is unique up to the number of components and their isomorphic copies. in the crisp group theory, this is a well-known theorem attributed to remak, krull, and schmidt. we consider the lattice of fuzzy subgroups and som...