An R-module A is called GF-regular if, for each a ∈ A and r ∈ R, there exist t ∈ R and a positive integer n such that r(n)tr(n)a = r(n)a. We proved that each unitary R-module A contains a unique maximal GF-regular submodule, which we denoted by M GF(A). Furthermore, the radical properties of A are investigated; we proved that if A is an R-module and K is a submodule of A, then MGF(K) = K∩M GF(A...

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...

Displacement-based seismic design and assessment procedures require as key input parameter estimates of displacement capacities of the critical elements. The displacement capacities of unreinforced masonry (URM) walls are typically determined by means of quasistatic cyclic tests. This paper shows that for URM walls failing in shear the number of applied cycles in quasi-static cyclic tests influ...

In a finite-dimensional vector space, every subspace is finite-dimensional and the dimension of a subspace is at most the dimension of the whole space. Unfortunately, the naive analogue of this for modules and submodules is wrong: (1) A submodule of a finitely generated module need not be finitely generated. (2) Even if a submodule of a finitely generated module is finitely generated, the minim...

In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and Reed-Solomon codes. This allows us to adapt the Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper we show that quasi-BCH codes can ...