African Journal of
Mathematics and Computer Science Research

  • Abbreviation: Afr. J. Math. Comput. Sci. Res.
  • Language: English
  • ISSN: 2006-9731
  • DOI: 10.5897/AJMCSR
  • Start Year: 2008
  • Published Articles: 246

Table of Content: June 2011; 3(6)

June 2011

One way functions and public key cryptography

The problem faced with symmetric ciphers has always been key exchange. Hellman and Diffie (1976) proposed the idea for key exchange (public key cryptography). Their idea was based on the difficulty in inverting certain mathematical functions; one way functions. The RSA was one of the first practical solutions of key exchange. This paper identifies one way functions and their corresponding public key encryption system,...

Author(s): Kenekayoro Patrick T.

June 2011

The formulation of complex queries and interactions using SMS text messages

  There is no question that short message service (SMS) has achieved huge success in the wireless world. Billions of SMS text messages are sent every day worldwide. SMS is now a major revenue generator for wireless carriers like expresso and MTN of Ghana. A lot of innovative applications are now built on top of the SMS technology and more are being developed. One of the emerging applications is the use of text...

Author(s): Stephen Agyepong, Michael Franklin Bosu and James Ben Hayfron-Acquah

June 2011

A new algorithm for static task scheduling for heterogeneous distributed computing systems

  Effective task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (HeDCSs). However, finding an effective task scheduling in HeDCSs should take into consideration the heterogeneity of processors and inter-processor communication over head, which results from non-trivial data movement between tasks scheduled on different processors. In this paper, a new high...

Author(s): Nirmeen A. Bahnasawy, Magdy A. Koutb, Mervat Mosa and Fatma Omara

June 2011

Some results on principal ideal graph of a ring

  Let R be an associative (not necessarily commutative) ring. In the present paper, we introduced a new type of graph (called ‘Principal Ideal Graph’, denoted by PIG(R)) related to a given associative ring R.  We presented some examples. We obtained few fundamental important relations between rings and graphs with respect to the properties: simple ring, complete graph, etc. We also observed...

Author(s): Satyanarayana Bhavanari, Godloza Lungisile and Nagaraju Dasari