In general, the task of generating provenance is still tedious, and the community still lacks tools to generate provenance easily. In particular, when writing papers, researchers should be able to produce the provenance of their papers, make it available online, and embed provenance metadata directly in their PDF files. To address this goal, we introduce prov.sty, a PROV style for LTEX, allowin...

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

in this paper, we show that every element of a discrete module is a sum of two units if and only if its endomorphism ring has no factor ring isomorphic to $z_{2}$. we also characterize unit sum number equal to two for the endomorphism ring of quasi-discrete modules with finite exchange property.

in this paper we introduce the concept of dirac structures on (hermitian) modules and vectorbundles and deduce some of their properties. among other things we prove that there is a one to onecorrespondence between the set of all dirac structures on a (hermitian) module and the group of allautomorphisms of the module. this correspondence enables us to represent dirac structures on (hermitian)mod...

Let  be a commutative ring and  be a unitary  module. We define a semi prime sub module of a module and consider various properties of it. Also we define semi-radical of a sub module of a module and give a number of its properties. We define modules which satisfy the semi-radical formula and present the existence of such a module.

A C-Language program which tabulates the isoscalar factors and ClebschGordan coefficients for products of representations in SU(3) is presented. These are efficiently computed using recursion relations, and the results are presented in exact precision as square roots of rational numbers. Output is in LTEX format.

At OM2013, the author suggested and sketched a system that would use LTEX documents as Literate Programming sources for content dictionaries. This paper reports on the progress that has since been made with this system. One important milestone that has been reached is that valid .ocd files with CDDefinitions, FMPs, CMPs, and Examples are being generated.

Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many practical cryptographic applications such as identification schemes, group signatures, and secure multi-party computation (SMPC). Currently, first applications that essentially rely on ZK-PoKs are being deployed in the real world. The most prominent example is the Direct Anonymous Attestation (DAA) protocol,...

Most learning systems applied to problem solving have the goal of learning knowledge for solving problems more eeciently. However, very few systems have focused on the acquisition of planning operator descriptions. In this paper, we present a system that learns operator deenitions from the interaction with a completely unknown environment. In order to achieve better learning convergence, severa...

Most learning systems applied to problem solving have the goal of learning knowledge for solving problems more eeciently. However, very few systems have focused on the acquisition of planning operator descriptions. In this paper, we present a system that learns operator deenitions from the interaction with a completely unknown environment. In order to achieve better learning convergence, severa...