R. Ponalagusamy

  • Citations Per Year
Learn More
The biological deoxyribonucleic acid (DNA) strand has been increasingly seen as a promising computing unit. A new algorithm is formulated in this paper to design any DNA Boolean operator with molecular beacons (MBs) as its input. Boolean operators realized using the proposed design methodology is presented. The developed operators adopt a uniform(More)
An analysis of blood flow through a tapered artery with stenosis and dilatation has been carried out where the blood is treated as incompressible Herschel-Bulkley fluid. A comparison between numerical values and analytical values of pressure gradient at the midpoint of stenotic region shows that the analytical expression for pressure gradient works well for(More)
The information received froma source, represented by an information system, involves quantitative, qualitative and incomplete information. Such incomplete information are fed into the intelligent system for enhancing accuracy using interval-valued intuitionistic fuzzy numbers (IVIFN). Ranking of IVIFN is an important component of any incomplete interval(More)
In the present paper, the magnetohydrodynamics effects on flow parameters of blood carrying magnetic nanoparticles flowing through a stenosed artery under the influence of periodic body acceleration are investigated. Blood is assumed to behave as a Casson fluid. The governing equations are nonlinear and solved numerically using finite difference schemes.(More)
A study of the steady flow of blood through a horizontally symmetric artery with mild stenosis is presented by considering blood as a micropolar fluid. The viscosity of blood is considered as radial coordinate dependent. The non-linear pressure equations governing the flow are solved numerically using finite difference technique. The effects of micropolar(More)
This paper proposes a new parallel algorithm for the maximal elements problem with no constraints. It is proposed for a linear array with reconfigurable pipelined bus system (LARPBS) model and on its latest variant, LARPBS(p) model also. It runs in O(log log n ldr log n) time with O(n) processors. Its significance is that it works for any instance of the(More)