Let 51 be a generalized Hilbert algebra and let 5 be a closed right ideal of S. Let J-1 denote the pre-Hilbert space orthogonal complement of 3 inï. The problem investigated in this paper is: for which algebras % is it true that SI = J ffi ¡f^for every closed right ideal 3"of 8? In the case that % is achieved, a slightly stronger property is characterized and these characterizations are then us...

Discrete dynamical systems defined on the state space Π = {0, 1, . . . , p − 1}n have been used in multiple applications, most recently for the modeling of gene and protein networks. In this paper we study to what extent well-known theorems by Smale and Hirsch, which form part of the theory of (continuous) monotone dynamical systems, generalize or fail to do so in the discrete case. We show tha...

The proposed encryption algorithm is composed of two parts, permutation and diffusion. we firstly separate the RGB image into R, G, B components, and Generate three chaotic sequences by chaotic maps to encryption. Then, transform the R, G, B components and the chaotic sequences into DNA code, and get DNA sequences matrix. Secondly, DNA matrices of the RGB image is permutated under the Chen’s hy...

Verification of imperative programs means reasoning about modifications of a program state. So proper representation of state spaces is crucial for the usability of a corresponding verification environment. In this paper we discuss various existing state space models under different aspects like strong typing, modularity and scalability. We also propose a variant based on the locale infrastruct...

In this paper, we introduce a modified CQ iterative scheme for finding a common element of the set of solutions of an equilibrium problem, the set of fixed points of an infinite family of nonexpansive mappings and the set of the variational inequality for an α-inverse strongly monotone mapping in a Hilbert space. We obtain a strong convergence theorem for three sequences generated by this proce...

Capacity control, the bias/variance dilemma, and learning unknown functions from data, are all concerned with identifying effective and consistent fits of unknown geometric loci to random data points. A geometric locus is a curve or surface formed by points, all of which possess some uniform property. A geometric locus of an algebraic equation is the set of points whose coordinates are solution...

In this paper, we argue that weak cache consistency mechanisms supported by existing Web proxy caches must be augmented by strong consistency mechanisms to support the growing diversity in application requirements. Existing strong consistency mechanisms are not appealing for Web environments due to their large state space or control message overhead. We focus on the lease approach that balances...

and prove that it is jointly concave for 0 < p ≤ 1 and convex for p = 2. We then derive from this a Minkowski type inequality for operators on a tensor product of three Hilbert spaces, and show how this implies the strong subadditivity of quantum mechanical entropy. For p > 2, Φp is neither convex nor concave. We conjecture that Φp is convex for 1 < p < 2, but our methods do not show this. ∗ Wo...

In this paper, we address the problem of identiication of linear parametrically varying systems, where the system coeecients are rational functions of the parameters. We obtain results for the case of one measurable varying parameter. Under the assumption of full state measurements, we show that this nonlinear identiication problem can be reduced to a set of n (dimension of state space) linear ...