Top-down design methodology is one of the widely used approaches to the design of complex concurrent systems. In this approach, the speciication of a system is decomposed into a set of submodules whose concurrent behavior is equivalent to that of the system speciication. The following problem is of particular importance when using this methodology: given the speciication of a system and some of...

The Hardy space H(D) can be viewed as a module over the polynomial ring C[z, w] with module action defined by multiplication of functions. The core operator is a bounded self-adjoint integral operator defined on submodules of H(D), and it gives rise to some interesting numerical invariants for the submodules. These invariants are difficult to compute or estimate in general. This paper computes ...

let $r$ be a commutative ring with identity and $m$ an $r$-module. in this paper, we associate a graph to $m$, say ${gamma}({}_{r}m)$, such that when $m=r$, ${gamma}({}_{r}m)$ coincide with the zero-divisor graph of $r$. many well-known results by d.f. anderson and p.s. livingston have been generalized for ${gamma}({}_{r}m)$. we show that ${gamma}({}_{r}m)$ is connected with ${diam}({gamma}({}_...

primary-like and weakly primary-like submodules are two new generalizations of primary ideals from rings to modules. in fact, the class of primary-like submodules of a module lie between primary submodules and weakly primary-like submodules properly.  in this note, we show that these three classes coincide when their elements are submodules of a multiplication module and satisfy the primeful pr...

On the basis of the concept of the interval valued intuitionistic fuzzy sets introduced by K.Atanassov, the notion of interval valued intuitionistic fuzzyHv-submodules of anHv-module with respect to t-norm T and s-norm S is given and the characteristic properties are described. The homomorphic image and the inverse image are investigated.In particular, the connections between interval valued in...

At Eurocrypt 2010, Freeman proposed a transformation from pairing-based schemes in composite-order bilinear groups to equivalent ones in prime-order bilinear groups. His transformation can be applied to pairing-based cryptosystems exploiting only one of two properties of composite-order bilinear groups: cancelling and projecting. At Asiacrypt 2010, Meiklejohn, Shacham, and Freeman showed that p...

Given a ring of ternions R, i. e., a ring isomorphic to that of upper triangular 2×2 matrices with entries from an arbitrary commutative field F , a complete classification is performed of the vectors from the free left R-module R, n ≥ 1, and of the cyclic submodules generated by these vectors. The vectors fall into 5 + |F | and the submodules into 6 distinct orbits under the action of the gene...

We introduce the concept of "uniformly primary submodules" of a module over a commutative ring R, which generalizes the concept of "uniformly primary ideals" of R, a concept that imposes a certain boundedness condition on the usual notion of "primary ideal". Several results on uniformly primary submodules are proved. Also, we characterize uniformly primary submodules of a multiplication module....

A classical problem in the literature seeks minimal number of proper subgroups whose union is a given finite group. different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces over fields by (minimally many) subspaces. In this note we cover $R$-modules submodules for commutative rings $R$, thereby subsuming recovering both cases above. Sp...