The characteristics of impulse bursts in remote sensing images are analyzed and a model for this noise is proposed. The model also takes into consideration other noise types, for example, the multiplicative noise present in radar images. As a case study, soft morphological filters utilizing a training-based optimization scheme are used for the noise removal. Different approaches for the trainin...

the submodules with the property of the title ( a submodule $n$ of an $r$-module $m$ is called strongly dense in $m$, denoted by $nleq_{sd}m$, if for any index set $i$, $prod _{i}nleq_{d}prod _{i}m$) are introduced and fully investigated. it is shown that for each submodule $n$ of $m$ there exists the smallest subset $d'subseteq m$ such that $n+d'$ is a strongly dense submodule of $m$...

In this paper, we study collective additive tree spanners for families of graphs enjoying special Robertson-Seymour’s tree-decompositions, and demonstrate interesting consequences of obtained results. We say that a graph G admits a system of μ collective additive tree r-spanners (resp., multiplicative tree t-spanners) if there is a system T (G) of at most μ spanning trees of G such that for any...

Abstract This article presents observer-based negative imaginary positive feedback control of satellite orbit dynamical model. In this article, orbital model is transformed into a strongly strict system using transformation scheme, and then, theory applied to achieve stability robustness in the presence multiplicative uncertainty. The solutions problem are investigated with two thrusters input ...

Let A' be a compact C -manifold. Let || ||, || || denote the supremum norm and the C -norm, respectively, and let \P \ be a Markovian semigroup on C(X). The semigroup's infinitesimal generator A, with domain 3), is defined by Af= lim Q t~ (P'f f), whenever the limit exists in || ||. Theorem. Assume that \P s preserves C -junctions and that the restriction of {PA to C2(X), I I' is strongly conti...

We prove that a graph admits a strongly 2-connected orientation if and only if it is 4-edge-connected, and every vertex-deleted subgraph is 2-edge-connected. In particular, every 4-connected graph has such an orientation while no cubic 3-connected graph has such an orientation.

We discuss relations of linear Nambu-Poisson structures to Filippov algebras and define a Filippov algebroid – a generalization of a Lie algebroid. We also prove results describing multiplicative Nambu-Poisson structures on Lie groups. In particular, it is shown that simple Lie groups do not admit multiplicative Nambu-Poisson structures of order > 2.

This paper studies the integers that belong the multiplicative semigroup W generated by { 2n+1 : n ≥ 0} and 1 2 . They form a multiplicative semigroup W(Z) of integers which we call the wild integer semigroup, and the wild numbers are the generators of W(Z). It presents convincing evidence that the wild numbers consist of all prime numbers excluding 3.

This lecture is based on the corresponding paper of Freund and Schapire [2], though with some differences in notation and analysis. We introduce and study the multiplicative weights (MW) algorithm, which is an external regret minimizing (i.e., Hannan consistent) algorithm for playing a game. The same algorithm has been analyzed in various forms, particularly in the study of online learning; see...