We present a picture of phase transitions of the system with colored multiplicative noise. Considering the noise amplitude as the power– law dependence of the stochastic variable xa we show the way to phase transitions disorder–order and order–disorder. The governed equations for the order parameter and one-time correlator are obtained and investigated in details. The long–time asymptotes in th...

The problem of estimating the frequencies of harmonics in multiplicative and additive noise is addressed. The cyclic mean (CM) can be used if the multiplicative noise has nonzero mean; the cyclic variance (CV) can be used whether or not the multiplicative noise has zero mean. This paper answers the following question: Under what conditions should we use CV instead of CM? The criteria used are t...

The paper presents a novel approach to estimate harmonics in multiplicative and additive noise using a Genetic Algorithm (GA). The estimation of parameters is formulated as a nonlinear optimization problem and simulations are carried out to assess the performance of the proposed GA-based harmonics estimation.

Many statistical agencies nowadays operate or envision tools for ad hoc creation and visualization of aggregate tables, ideally with web-access facilities. Users should be able to easily create their own customized tables. However, especially with heavily skewed business data, disclosure control issues usually are a big obstacle in this context, hardly solvable by traditional methods like cell ...

For Fr$acute{mathbf{text{e}}}$chet algebras $(A, (p_n))$ and $(B, (q_n))$, a linear map $T:Arightarrow B$ is textit{almost multiplicative} with respect to $(p_n)$ and $(q_n)$, if there exists $varepsilongeq 0$ such that $q_n(Tab - Ta Tb)leq varepsilon p_n(a) p_n(b),$ for all $n in mathbb{N}$, $a, b in A$, and it is called textit{weakly almost multiplicative} with respect to $(p_n)$ and $(q_n)$...

We develop a new hybrid tabu search method for optimizing a continuous diieren-tiable function over the extreme points of a polyhedron. The method combines extreme point tabu search with traditional descent algorithms based on linear programming. The tabu search algorithm utilizes both recency-based and frequency-based memory and oscillates between local improvement and diversiication phases. T...

We prove some properties of analytic multiplicative and sub-multiplicative cocycles. The results allow to construct natural invariant analytic sets associated to complex dynamical systems. AMS classification: 37F, 32H Key-words: multiplicative cocycle, sub-multiplicative cocycle, exceptional set

Abstract We obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.

In this paper the complexity of provability of polarized additive, multiplicative, and exponential formulas in the (initial) Cockett-Seely polarized game logic is discussed. The complexity is ultimately based on the complexity of finding a strategy in a formula which is, for polarized additive formulas, in the worst case linear in their size. Having a proof of a sequent is equivalent to having ...