We develop a model of an electrorheological fluid such that the fluid is considered as an anisotropic one with the viscosity depending on the second invariant of the rate of strain tensor, on the module of the vector of electric field strength, and on the angle between the vectors of velocity and electric field. We study general problems on the flow of such fluids at nonhomogeneous mixed bounda...

1 (a) Claim: R[X, Y ] is not a Euclidean domain. Proof: If R[X, Y ] was a Euclidean domain, then it would be a principal ideal domain. But consider I = (x, y) = (x) + (y). I is certainly not a principal ideal, as if it were, there would be some polynomial, g that divides everything in I, so g would divide x, implying that g does not contain any monomials with positive degree in y, and likewise ...

The objective of this contribution is to characterize the so-called finite fixed poles of the Almost Disturbance Decoupling Problem by state feedback (ADDP) ′ . The most important step towards this result relies on the extension to almost invariant subspaces of the key notion of self-boundedness, as initially introduced by Basile and Marro for perfect controlled-invariants, namely, we introduce...

An algorithm was developed to obtain reconstructions from truncated projections by utilizing cross-correlation of a “knowledge set” of a priori nontruncated cross-sections with a similar structure. A cross-correlation matrix was constructed for the known set of cross-sectional images. The eigenvectors of this matrix form a set of orthogonal basis vectors for the reconstructed image. The basis s...

For a separable rearrangement invariant space X on $$(0,\infty )$$ of fundamental type we identify the set all $$p\in [1,\infty ]$$ such that $$\ell ^p$$ is finitely represented in way unit basis vectors ( $$c_0$$ if $$p=\infty $$ ) correspond to pairwise disjoint and equimeasurable functions. This characterization hinges upon description approximate eigenvalues doubling operator $$x(t)\mapsto ...

We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimization problem. In preliminary experiments, our algorithm outperforms a state-of-the-art LP solver and LPBoost especially when the solution is given by a small set of relevant hypotheses and support vectors.

All known approaches for the design of increasing translation-invariant binary window "lters involve combinatoric searches. This paper proposes a new switching algorithm having the advantage that the search is over a smaller set than other algorithms. Beginning with an estimate from image realizations of the optimal generic (nonincreasing) window function, the algorithm switches (exchanges) a s...

We extend our method of partner symmetries to the hyperbolic complex Monge-Ampère equation and the second heavenly equation of Plebañski. We show the existence of partner symmetries and derive the relations between them for both equations. For certain simple choices of partner symmetries the resulting differential constraints together with the original heavenly equations are transformed to syst...

We study the class of $$ \mathfrak{o} _{2n+1}$$ -invariant quantum integrable models in framework algebraic Bethe ansatz and propose a construction vector terms Drinfeld currents for Yangian double \mathcal{D}Y ( _{2n+1})$$ . calculate action monodromy matrix elements on off-shell vectors these obtain recurrence relations vectors. The formulas can be used to investigate scalar products models.