S. Kannan

Publication List Details

Period

1996 - 2008

Number

32

Co-Authors

Minimally invasive pediatric surgery: Our experience (2008)

Saravanan, K, Kumaran, V, Rajamani, G, Kannan, S, Mohan, N Venkatesa, Nataraj, M, ...

Aim: Departmental survey of the pediatric laparoscopic and thoracoscopic procedures. Materials and Methods: It is a retrospective study from January 1999 to December 2007. The various types of...

Fatal cellulitis caused by Apophysomyces elegans   (2007)

Kindo, AJ, Shams, NR, Kumar, K, Kannan, S, Vidya, S, Kumar, AR, ...

A case of cellulitis of the left lateral side of the face caused by the zygomycete Apophysomyces elegans in a healthy male following a road traffic accident is reported. The contaminated soil was the...

Study of the Factors Responsible for the Dropouts from the BSc Programme of Indira Gandhi National Open University (2006)

Bharat Inder Fozdar; Indira Gandhi National Open University, Lalita S. Kumar; Indira Gandhi National Open University, S. Kannan; Sikkim Manipal University

A sample of dropout learners enrolled in the B.Sc. programme of School of Sciences, Indira Gandhi National Open University, India was surveyed to study the factors which influenced them to withdraw...

Study of the Factors Responsible for the Dropouts from the BSc Programme of Indira Gandhi National Open University (2006)

Bharat Inder Fozdar, Lalita S. Kumar, S. Kannan

This paper presents a report on students who decided to drop out of the BSc programme offered by Indira Gandhi National Open University (IGNOU). This study was designed to determine the reasons...

Java-MaC: a Run-time Assurance Tool for Java Programs (2001)

M. Kim, S. Kannan, I. Lee, O. Sokolsky, M. Viswanathan

We describe Java-MaC, a prototype implementation of the Monitoring and Checking (MaC) architecture for Java programs. The MaC architecture provides assurance about the correct execution of target...

An Open Software Infrastructure For Reconfigurable Control Systems (2000)

L. Wills, S. Kannan, B. Heck, G. Vachtsevanos, C. Restrepo, D. Schrage, ...

Recent advances in software technology have the potential to revolutionize control system design. This paper describes a new software infrastructure for complex control systems, which exploits new...

An Open Software Infrastructure For Reconfigurable Control Systems (2000)

L. Wills, S. Kannan, B. Heck, G. Vachtsevanos, C. Restrepo, D. Schrage, ...

Recent advances in software technology have the potential to revolutionize control system design. This paper describes a new software infrastructure for complex control systems, which exploits new...

Complexity of Problems on Graphs Represented as OBDDs (1999)

J. Feigenbaum, S. Kannan, M. Y. Vardi, M. Viswanathan

. To analyze the complexity of decision problems on graphs, one normally assumes that the input size is polynomial in the number of vertices. Galperin and Wigderson [13] and, later, Papadimitriou and...

Runtime Assurance Based On Formal Specifications (1999)

I. Lee, S. Kannan, M. Kim, O. Sokolsky, M. Viswanathan

We describe the Monitoring and Checking (MaC) framework which assures the correctness of the current execution at run-time. Monitoring is performed based on a formal specification of system...

Runtime Assurance Based On Formal Specifications (1999)

I. Lee, S. Kannan, M. Kim, O. Sokolsky, M. Viswanathan

We describe the Monitoring and Checking (MaC) framework which assures the correctness of the current execution at run-time. Monitoring is performed based on a formal specification of system...

A Monitoring and Checking Framework for Run-time Correctness Assurance (1998)

Insup Lee, H. Ben-abdallah, S. Kannan, M. Kim, O. Sokolsky, M. Viswanathan

Computer systems are often monitored for performance evaluation and enhancement, debugging and testing, control or to check for the correctness of the system. Recently, the problem of designing...

Complexity of Problems on Graphs Represented as OBDDs (1998)

J. Feigenbaum, S. Kannan, M. Y. Vardi, M. Viswanathan

. To analyze the complexity of decision problems on graphs, one normally assumes that the input size is polynomial in the number of vertices. Galperin and Wigderson [13] and, later, Papadimitriou and...

Complexity of Problems on Graphs Represented as OBDDs (1997)

J. Feigenbaum, S. Kannan, M. Y. Vardi, M. Viswanathan

. To analyze the complexity of decision problems on graphs, one normally assumes that the input size is polynomial in the number of vertices. Galperin and Wigderson [13] and, later, Papadimitriou and...

Complexity of Problems on Graphs Represented as OBDDs (1997)

J. Feigenbaum, S. Kannan, M. Y. Vardi, M. Viswanathan

. To analyze the complexity of decision problems on graphs, one normally assumes that the input size is polynomial in the number of vertices. Galperin and Wigderson [13] and, later, Papadimitriou and...

On the Complexity and Approximation of Syntenic Distance (1996)

B. Dasgupta, T. Jiang, S. Kannan, M. Li, Z. Sweedyk

The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nadeau and Sankoff....

Expression of p53 in leukoplakia and squamous cell carcinoma of the oral mucosa: correlation with expression of Ki67

Kannan, S, Chandran, G Jagadeesh, Pillai, K Raveendran, Mathew, Babu, Sujathan, K, Nalinakumary, K R, ...

Aim—To study p53 expression in relation to proliferative status in normal and nondysplastic, dysplastic and malignant lesions of the oral mucosa.

Expression of p53 in leukoplakia and squamous cell carcinoma of the oral mucosa: correlation with expression of Ki67

Kannan, S, Chandran, G Jagadeesh, Pillai, K Raveendran, Mathew, Babu, Sujathan, K, Nalinakumary, K R, ...

Aim—To study p53 expression in relation to proliferative status in normal and nondysplastic, dysplastic and malignant lesions of the oral mucosa.