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: 262

Table of Content: December 2010; 3(12)

December 2010

Key exchange scheme with higher security and its analysis

    Proposed paper gives a secure key exchange scheme using block upper triangular matrices of higher order. By using this method it is possible to generate keys of large orders without the need of large primes thereby avoiding the common ciphertext attacks. The element used for generating shared key is the element of (1, 3) block of the matrix which depends upon the elements of (1, 2) as...

Author(s):   H. K. Pathak and Manju Sanghi

December 2010

A dynamic programming approach to optimal manpower recruitment and promotion policies for the two grade system

    Many manpower models play a dominant role in efficient design and control of manpower system.  In this paper, a mathematical model has been developed with the objective of minimizing the manpower system cost during the recruitment and promotion period which are determined by the changes that take place in the system.  It resulted in the form of recursive optimization, a dynamic...

Author(s):   S. Nirmala and M. Jeeva

December 2010

Performance analysis of QoS in PMP mode WiMAX networks

    IEEE 802.16 standard supports two different topologies: Point to multipoint (PMP) and mesh. In this paper, a QoS mechanism for point to multipoint of IEEE 802.16 and BS scheduler for PMP mode is proposed. This paper also describes quality of service over WiMAX networks. Average WiMAX delay, average WiMAX load and average WiMAX throughput at base station is analyzed and compared by applying...

Author(s):   Harwinder Singh and Maninder Singh

December 2010

A metaheuristic and PTAS approach for NP-hard scheduling problem with controllable processing times

    Most of the applied and interesting problems in industry and real world are difficult to solve. These problems are often NP-hard and the problem in this paper is strongly NP-hard. Approximation and metaheuristic algorithms are used to find a solution to these problems. In this paper we have used a polynomial time approximation algorithm, this algorithm is a suboptimal approach that provably works...

Author(s):   Hamed Bayat, Hassan Akbari and Hamid Davoudpour