Few tools exist for decomposing complex security policies into simpler modules. The policy-engineering tools that do exist either encapsulate entire policies as atomic, indecomposable modules or allow fine-grained modularization but are complicated and lack policyvisualization capabilities. This paper briefly presents PoliSeer, the first tool we are aware of that allows complex policies to be s...

the concepts of free modules, projective modules, injective modules and the likeform an important area in module theory. the notion of free fuzzy modules was introducedby muganda as an extension of free modules in the fuzzy context. zahedi and ameriintroduced the concept of projective and injective l-modules. in this paper we give analternate definition for projective l-modules. we prove that e...

an r-module m is called strongly noncosingular if it has no nonzero rad-small (cosingular) homomorphic image in the sense of harada. it is proven that (1) an r-module m is strongly noncosingular if and only if m is coatomic and noncosingular; (2) a right perfect ring r is artinian hereditary serial if and only if the class of injective modules coincides with the class of (strongly) noncosingula...

Atomic decomposition of ontologies has been suggested as a tool to understand the modular structure of ontologies. It consists of a polynomial size representation of potentially exponentially many modules of an ontology. Tractable algorithms for computing the atomic decomposition for locality-based modules have been introduced, albeit leaving room for improvement in terms of running time. In th...

0

let $r=oplus_{nin bbb n_0}r_n$ be a noetherian homogeneous ring with local base ring $(r_0,frak{m}_0)$, $m$ and $n$ two finitely generated graded $r$-modules. let $t$ be the least integer such that $h^t_{r_+}(m,n)$ is not minimax. we prove that $h^j_{frak{m}_0r}(h^t_{r_+}(m,n))$ is artinian for $j=0,1$. also, we show that if ${rm cd}(r_{+},m,n)=2$ and $tin bbb n_0$, then $h^t_{frak{m}_0r}(h^2_{...

We describe new algorithms and modules for protein structure prediction available as part of the PROTINFO web server. The modules, comparative and de novo modelling, have significantly improved back-end algorithms that were rigorously evaluated at the sixth meeting on the Critical Assessment of Protein Structure Prediction methods. We were one of four server groups invited to make an oral prese...