The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...
Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens ...
In this paper, we defined the concept of the grouped distributed objects[10-14], as a logical unit of distributed application service, and developed a distributed programming deve...
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Organic programming (OP) is our proposed and already emerging programming model which overcomes some of the limitations of current practice in software development in general and ...
Parametric polymorphism has become a common feature of mainstream programming languages, but software component architectures have lagged behind and do not support it. We examine ...