This paper is concerned with the relation between local cohomology modules defined by a pair of ideals and the Serre subcategories of the category of modules. We characterize the membership of local cohomology modules in a certain Serre subcategory from lower range or upper range.

We state several conditions under which comultiplication and weak comultiplication modulesare cyclic and study strong comultiplication modules and comultiplication rings. In particular,we will show that every faithful weak comultiplication module having a maximal submoduleover a reduced ring with a finite indecomposable decomposition is cyclic. Also we show that if M is an strong comultiplicati...

Joyce observed that the Alexander invariant and medial quandle of a classical knot are equivalent to each other, as invariants. In this paper, we discuss rather complicated extension Joyce’s observation several different quandles reduced (one-variable) modules associated with links. The theme is for links, provide stronger invariants than modules.

In [1], Berger and Colmez introduced a theory of families of étale (φ,Γ)-modules associated to families of p-adic Galois representations. Inspired by their works, we consider families of φ-modules over a reduced affinoid algebra where the base is fixed by Frobenius actions. We prove some results in this framework including the semicontinuity of variation of HN-polygons. These results will be ap...

Abstract. Certain facts about frames and generalized frames (g- frames) are extended for the g-frames for Hilbert C*-modules. It is shown that g-frames for Hilbert C*-modules share several useful properties with those for Hilbert spaces. The paper also character- izes the operators which preserve the class of g-frames for Hilbert C*-modules. Moreover, a necessary and suffcient condition is ob- ...

This article shows the results obtained during simulations that measured runtime and energy consumption of a security module (SEMO) when it executes in ARM processor. For the simulations, we considered the impacts of four algorithms (i.e. RSA, SHA-1, Random Numbers Generator and AES). We have used the Sim-Panalyzer simulator and obtained an average energy consumption (x2 Joules) and runtime (x2...

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security module. The security modules trust each other but can only communicate by exchanging messages through their untrusted host parties, that could drop those messages. We describe a synchronous algorithm that ensures determ...

Security focused OS (Secure OS) is attracting attention as a method for minimizing damage caused by various intrusions. Secure OSes can restrict the damage due to an attack by using Mandatory Access Control (MAC). In some projects, secure OSes for Linux have been developed. In these OSes, different implementation methods have been adopted. However, there is no method for easily evaluating the p...

In this paper, we use a feedback to change the orientation and the shape of the center manifold of a system with uncontrollable linearization. This change will directly affect the reduced dynamics on the center manifold, and hence will change the stability properties of the original system.

The block cipher GOST was proposed in former Soviet Union in 1989. In this paper we present the principal algorithm of GOST block with reduced number of rounds. By introducing the idea reduced round version of GOST the modules speed processing of using a set of differential characteristics, we can simply increase the effectiveness and estimate the efficient for cryptosystem. We describe GOST an...