A version of Dieudonné theorem is proved for lattice group-valued modular measures on lattice ordered effect algebras. In this way we generalize some results proved in the real-valued case.
This paper presented a new image encryption algorithm. The algorithm includes two steps: first, by using Cubic map and wavelet function to produce the 2D chaotic sequences to scramble the location of pixel points from the image, then using DNA sequence and chaotic sequence produced by Logistic chaotic map to disturb the gray of the pixel points from image. The experimental results and security analysis show that our algorithm can get good encryption effect, has widest secret key's space, strong sensitivity to secret key, and has the ability of resisting exhaustive attack and statistic attack.
We give a new proof of the Weiss conjecture for analytic semigroups. Our approach does not make any recourse to the bounded
$H^{\infty }$-calculus and is based on elementary analysis.
BL-algebras, introduced by P. Hájek, form an algebraic counterpart of the basic fuzzy logic. In the paper it is shown that BL-algebras are the duals of bounded representable DRl-monoids. This duality enables us to describe some structure properties of BL-algebras.
This paper deals with the global position control problem of robot manipulators in joint space, a new family of control schemes consisting of a suitable combination of hyperbolic functions is presented. The proposed control family includes a large class of bounded hyperbolic-type control schemes to drive both position error and derivative action terms plus gravity compensation. To ensure global asymptotic stability of closed-loop system equilibrium point, we propose an energy-shaping based strict Lyapunov function. To verify the efficiency of the proposed control algorithm, an experimental comparative analysis between the well known unbounded linear PD control and three hyperbolic-type control schemes of the proposed family on a three degrees of freedom direct-drive robot manipulator is analysed.
We investigate the category $\text{mod}\Lambda $ of finite length modules over the ring $\Lambda =A\otimes _k\Sigma $, where $\Sigma $ is a V-ring, i.e. a ring for which every simple module is injective, $k$ a subfield of its centre and $A$ an elementary $k$-algebra. Each simple module $E_j$ gives rise to a quasiprogenerator $P_j=A\otimes E_j$. By a result of K. Fuller, $P_j$ induces a category equivalence from which we deduce that $\text{mod}\Lambda \simeq \coprod _jbad hbox P_j$. As a consequence we can (1) construct for each elementary $k$-algebra $A$ over a finite field $k$ a nonartinian noetherian ring $\Lambda $ such that $\text{mod}A\simeq \text{mod}\Lambda $, (2) find twisted versions $\Lambda $ of algebras of wild representation type such that $\Lambda $ itself is of finite or tame representation type (in mod), (3) describe for certain rings $\Lambda $ the minimal almost split morphisms in $\text{mod} \Lambda $ and observe that almost all of these maps are not almost split in $\text{Mod}\Lambda $.
In this paper, we demonstrate the computational consequences of making a simple assumption on production cost structures in capacitated lot-size problems. Our results indicate that our cost assumption of increased productivity over time has dramatic effects on the problem sizes which are solvable. Our experiments indicate that problems with more than 1000 products in more than 1000 time periods may be solved within reasonable time. The Lagrangian decomposition algorithm we use does of course not guarantee optimality, but our results indicate surprisingly narrow gaps for such large-scale cases - in most cases significantly outperforming CPLEX. We also demonstrate that general CLSP's can benefit greatly from applying our proposed heuristic.
The paper presents a simple method to check a positiveness of symmetric multivariate polynomials on the unit multi-circle. The method is based on the sampling polynomials using the fast Fourier transform. The algorithm is described and its possible applications are proposed. One of the aims of the paper is to show that presented algorithm is significantly faster than commonly used method based on the semi-definite programming expression.
The perturbed Laplacian matrix of a graph G is defined as DL = D−A, where D is any diagonal matrix and A is a weighted adjacency matrix of G. We develop a Fiedler-like theory for this matrix, leading to results that are of the same type as those obtained with the algebraic connectivity of a graph. We show a monotonicity theorem for the harmonic eigenfunction corresponding to the second smallest eigenvalue of the perturbed Laplacian matrix over the points of articulation of a graph. Furthermore, we use the notion of Perron component for the perturbed Laplacian matrix of a graph and show how its second smallest eigenvalue can be characterized using this definition., Israel Rocha, Vilmar Trevisan., and Obsahuje seznam literatury
Matrix polynomials play an important role in the theory of matrix differential equations. We develop a fixed point method to compute solutions of matrix polynomials equations, where the matricial elements of the matrix polynomial are considered separately as complex polynomials. Numerical examples illustrate the method presented.