Informatics Publishing Limited

M. Thiagarajan , P. M. Murali

Abstract

The optimum conditions to establish in-vitro plantlets of Neem (Azadirachta indica) from cultures of embryos is described. Embryos were cultured after careful dissection from fruits collected 30 days after pollination. Several combinations of culture media were tried and the optimum conditions for germination was in the presence of high sucrose (12%) with 0.01 mg/1 NAA and 0.1 mg/1 BAP. Embryos of the size range of 3 mm-5 mm were ready for transplantation within 45 days of their rescue.

Full Text

     

M. Thiagarajan ¹, S. Sasikala ²

Affiliations
1 Department of Mathematics, St. Joseph College, Tamil Nadu, IN
2 Department of Mathematics, Cauvery College for Woman, Tamil Nadu, IN

Abstract

In this Paper, an M/M/1/N interdependent queueing model with controllable arrival rates, reverse balking and reverse reneging is considered. This model is much useful in analysing the particular situations arising at the places like a data voice transmission, computer communication system etc. The steady state solution and the system characteristics are derived for this model. The analytical results are numerically illustrated and the effects of the nodal parameters on the system characteristics are studied.

Keywords

Finite Capacity, Interdependent Controllable Arrival and Service Rates, Reverse Balking, Reverse Reneging, Single Server, Bivariate Poisson Process.

Full Text

   

A. R. Rishivarman ¹, B. Parthasarathy ², M. Thiagarajan ³

Affiliations
1 Dr. Pauls Engineering College, Villupuram, TN, IN
2 Mailam Engineering College, Villupuram, TN, IN
3 School of Computing, SASTRA University, Thanjavur, TN, IN

Abstract

Elliptic curve calculation was not introduced to cryptography until 1985. Compared with RSA, the advantage of elliptic curve cryptography lies in its ensuring the same security while the length of key of elliptic curve cryptography is much less than RSA cryptography and its lessening operation load. In this article a change of representation for elements in GF(2⁵) is proposed to use in elliptic curve cryptography. The proposed representation is useful for architectures that implement Montgomery multiplication in the finite field GF(2⁵). In fact, it needs virtually no cost in terms of conversion operations from a standard multiplication into a Montgomery multiplication.

Keywords

Montgomery Multiplications, Finite Field, Elliptic Curve Cryptography (ECC), GF(2⁵), Irreducible Polynomial.

Full Text