The transport and continuum equations exhibit a number of conservation laws. For example, scalar multiplication is conserved by the transport equation, while positivity of probabilities is conserved by the continuum equation. Certain discretization techniques, such as particle based methods, conserve these properties, but converge slower than spectral discretization methods on smooth data. Stan...

We consider an eddy current problem in time-domain relying on impedance boundary conditions on the surface of the conductor(s). We pursue its full discretization comprising (i) a finite element Galerkin discretization by means of lowest order edge elements in space, and (ii) temporal discretization based on Runge-Kutta convolution quadrature (CQ) for the resulting Volterra integral equation in ...

In this paper we address the problem of discretization in the context of learning Bayesian networks (BNs) from data con­ taining both continuous and discrete vari­ ables. We describe a new technique for multivariate discretization, whereby each continuous variable is discretized while tak­ ing into account its interaction with the other variables. The technique is based on the use of a Bayesian...

This paper presents a new method for filtering the impulse noise in images. This is a two-stage approach in which an impulse is first detected by thresholding the energy of the prediction error in a block-based twodimensional linear prediction of the image intensity. The median filter is subsequently applied to the pixels detected to be corrupted by the impulse noise. Simulation results show th...

The performance of many machine learning algorithms can be substantially improved with a proper discretization scheme. In this paper we describe a theoretically rigorous approach to discretization of continuous attribute values, based on a Bayesian clustering framework. The method produces a probabilistic scoring metric for diierent discretizations, and it can be combined with various types of ...

Discretization is used in click-based graphical passwords so that approximately correct entries can be accepted by the system. We show that the existing discretization scheme of Birget et al.(2006) allows for false accepts and false rejects because the tolerance region is not guaranteed to be centered on the original click-point, causing usability and security concerns. Using empirical data fro...

This brief investigates the resilient consensus control for multiagent systems over a time-varying directed random network. We propose median-based strategy, which is purely distributed and, as opposed to Weighted-Mean-Subsequence-Reduced approaches in existing literature, shared estimate regarding number of malicious agents neighborhood each cooperative agent not required. offers more applicab...

Modulated feedback control introduces periodicity. The global attracting property of the periodic points is established for a simple scalar discrete-time system under ∆-modulated feedback. Attracting regions of the periodic points are also characterized. When the discretization effects of the equivalent control based sliding mode control systems are studied, we show that the zero-order-hold dis...

We study the discretization accuracy for first-order system least squares (FOSLS) applied to Poisson’s equation as a model problem. The FOSLS formulation is based on an H1 elliptic bilinear form F . Since the order of convergence of the discretization in the L2 and H1 norms depends on the regularity of F , we examine this property in detail. We then use these results together with an Aubin-Nits...