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...

This work addresses the problem of covariance matrix estimation for ocean clutter modeling. For ship detection based on polarimetric synthetic aperture radar (PolSAR) imagery and constant false alarm rate (CFAR) detectors, accurate ocean clutter modeling is essential. The covariance matrix provides all the polarimetric information of the ocean clutter and its estimate is always involved in PolS...

The melting point of gallium (29.7646 °C) is a defining thermometric fixed point of the International Temperature Scale of 1990 (ITS-90). Realization of this melting point is performed using a fixedpoint cell containing high-purity (≥99.999 99 wt. % pure) gallium. A 30 kg single lot of gallium (99.999 9956 wt. % pure) constituting Standard Reference Material (SRM) 1751 was evaluated, and certif...

We introduce a complexity measure of modal properties of finite structures which generalises the automaticity of languages. It is based on graph-automata like devices called labelling systems. We define a measure of the size of a structure that we call rank, and show that any modal property of structures can be approximated up to any fixed rank n by a labelling system. The function that takes n...

We propose a new language, RLucid, which is Lucid with one new operator. RLucid is intended for real time (or, more precisely, reactive) programming and is based on a simple synchronous dataflow model of computation. RLucid is therefore similar to the Lustre language but is more general in that it does not require that operators be strict: in the RLucid model a filter may respond when input arr...