Home Page
Education:
M.Sc [Mathematics] from Ramanujan Institute [RIASM], University of Madras, Chennai, India
M.Tech [Computer Science and Engineering] from Indian
Institute of Technology, Kharagpur, India
Title: Text Categorization using External Knowledge Concepts M.Tech Thesis
Ph.D [Mathematics - Computer Science] from University of Madras, Chennai, India
Title: Design of Algorithms for Shared Resource Allocation and Certain Selected
Problems in Distributed Systems Ph.D Thesis
Download detailed CV: DOC | PS | PDF
Contact Info:
Communication Empowerment Laboratory
Thakshashila Buildings - Gound Floor
Indian Institute of Technology, Kharagpur - 721302
West Bengal, India
No Wire: (+91) 97344 29269
E-mail: [email protected] , [email protected]
Teaching
Courses taught:
Theory
Distributed Computing
Software Quality Management
Operating Systems
Professional Ethics
Mobile Communication
Fundamentals of Computing
Programming and Data Structure
Practical:
Computer Systems Laboratory
Research
Fields of
Specialisation:
Distributed Algorithms [Message Passing Systems]
Natural Language Processing
Fields of
Interest:
Image Processing & Applications
Complex Networks and its Applications
Projects
Current:
Cross Lingual
Information Access(CLIA) System
Worked with : Prof. Sudeshna Sarkar [[email protected]]
Developed at : Communication Empowerment Laboratory
Dept. of Computer Science & Engineering
Indian Institute of Technology, Kharagpur
Duration : 2 Years [currently in the Second Year]
Sponsored By : Ministry of Information Technology
Govt. of India, New Delhi
Abstract:
In this project, we have developed a Cross Lingual
Information Access System with 6 language supports.
The focused domains are health and Tourism. In this
consortium project, we have developed ranking algorithms
and its evaluation with various orthogonal queries.
Also we have the responsibilities for the complete
integration of the system with other developers of
the CLIA consortia. Also this system supports cross
language queries, snippet generation, summary translation
and transliteration. User can give the query in his/her
preferred language and can get results in other languages
of his interest. This cross lingual information system
is designed in such a way that it uses map reduce
technique to operate at the distributed fashion. The
power of the system depends on the retrieval of relevant
pages across multiple languages.
Output : CLIA System – Deliverables
with the support of Nutch
Product : India Search [Alpha Version] with 6 Languages
Support
Text Classification
using Knowledge Concepts
Worked with : PROF. SUDESHNA SARKAR [[email protected]]
Developed at: Dept of Comp.Sci. and Engg, IIT, Kharagpur
Tools used : Java, mySQL and rainbow tool
Duration : 10 Months
Abstract:
Most of the conventional information
retrieval systems represent documents as bag of words
and are restricted to learning from individual word
occurrences in the training set. In this work, we
have made an attempt to refine the document representation
through automatic use of vast repositories of human
knowledge like Wikipedia articles and ODP categories.
At first, the input documents are analyzed and mapped
into relevant concepts. These concepts give rise to
a set of generated features that improves the standard
bag of words approach. Feature generation is done
through contextual analysis of document text. The
feature generation approach represents the meaning
of text fragments in a high dimensional space of features
based on the concepts identified and described by
the humans. Computing semantic relatedness of text
fragment in this space yields substantial improvements.
Two kinds of classifiers are used in our experiments:
Naive Bayes and k-Nearest Neighbor. Using standard
data sets, the classification accuracy is investigated
with domain knowledge concepts.
Completed:
TamilNews - The search
engine for regional news
Worked with : PROF. SUDESHNA SARKAR [[email protected]]
Developed at: Dept of Comp.Sci. and Engg, IIT, Kharagpur
Tools used : Java - JSP servlet, JavaScript and mySQL
Duration : 1 Month
Abstract:
In this work, we have developed a search engine for searching the Tamil news items collected from popular Tamil news site. Our work follows the behaviour of standard web search engines like Crawling, Indexing and Searching. Based on the centralized architecture, our search engine crawls the news item for every couple of hours and performs the indexing of text over crawled data by choosing the appropriate scan area and omits other noisy data like advertisements, unrelated URL redirections (link filtering). Then the indexer uses standard scoring on texts documents and classifies them under different categories. Then two types of the graphical user interface is provided to make the process of giving input in regional language easy. The searcher follows morphological analysis with keywords using the dictionary based approach and supports cross language reference.
Garbage Collection
- Handling dynamic memory management
Worked with : PROF. RAJEEV KUMAR [[email protected]]
Developed at: Dept of Comp.Sci. and Engg, IIT, Kharagpur
Tools used : C, Java (JVM)
Duration : 1 Month
Abstract:
In this proposed project, we have
made an attempt to understand the basic concepts and
implementation mechanisms about effective implementation
of collectors. This work leads us to concentrate on
Generational collectors that focus on young objects
because they have the highest mortality rate. At the
same, the youngest objects include the most recently
allocated objects. We focus on age-based (generational)
algorithms, namely those in which the dynamic heap
is divided into regions, each of which contains the
data allocated during a contiguous interval, and a
collection step examines one or more regions to determine
which objects within it are live (potentially used
by the program in the future) and which are dead (garbage).
Based on the fact to capture cache and paging effects,
we are currently focusing on a selection of the best
performing oldest-first collectors to compare them
to our existing generational collectors, and hence
to further explore and understand their performance.
We have also studied some of the implementations using
JVM at the end of this work.
A study on design
of Distributed algorithms, Neural networks and applications
Worked with : PROF. P.Thangavel [[email protected]]
Developed at: Dept of Computer Science, University
of Madras
Duration : 1 Year 2 Months
Sponsored BY: All India Council for Technical Education
[AICTE], New Delhi
Abstract:
In this Thrust Area Programme in
Technical Education (TAPTEC) research project, we
have developed algorithms for shared resource alllocation
in general networks and for distibuted sorting on
a line network and static ad hoc mobile networks.
Very small improvement in distributed
protocols will reduce response time in potential critical
applications requiring real time performance such
as medical information processing, military applications,
mission critical real time applications, etc. The
results of problems in distributed architectures will
be forming basis for future distributed systems design
and such in depth understanding will help to solve
the related problems in synchronisation of shared
resources in multi-computing systems. In this project,
we have developed distributed protocols for single
shared resource allocation and its related problems
in graphs. Also we have investigated the efficient
parallel prefix algorithms on multiport message passing
systems. In this architecture, each processing element
can communicate with any other PE directly. In a communication
step each PE can send k messages to k other PEs and
receive k messages from k PEs, for some k>=1. Such
a k port model has been recognized multi-computers
in programming environments. Our aim is to have an
extensive study of multi-port message problems in
this architecture. Also we have developed algorithms
for distributed soring in various networks like line
and static adhoc mobile networks.
Study of parallel
algorithms for message passing and related problems
in parallel architectures and selected combinatorial
problems
Worked with : PROF. P.Thangavel [[email protected]]
Developed at: Dept of Computer Science, University
of Madras
Duration : 3 Years
Sponsored BY: Council of Scienctific and Industrial
Research [CSIR], New Delhi
Abstract:
In this MAJOR research project we
have developed many algorithms for shared resource
alllocation in various Interconnection Networks.
The study of designing parallel algorithms
for message passing systems and its related communication
problems in parallel architectures is of great interest
and essential for achieving parallel and concurrent
computation. In tightly coupled multi processor systems,
processors memory units are interconnected in a network
and computation enabling data are passed through a
message passing protocol. Request messages used for
communication are passed towards their destination
according to a specific routing scheme and the efficiency
of the network as a whole is evaluated by the performance
of the routing scheme. Thus devising such an efficient
routing scheme is important in distributed network
architectures. We have investigated request message-based
token passing strategy for allocating a single shared
resource in various interconnection networks such
as rings, meshes, graphs and different variations.
At first, we have developed an algorithm for bidirectional
ring network in which token as well as request messages
move in opposite directions and for linear array(s)
- a ring network with a faulty node(s). Then we have
extended this strategy to augmented ring topologies
like touching rings and interconnected rings. The
algorithm for touching rings network can be applied
for multi-rings also. The algorithm for an interconnected
rings network gives rise to higher dimensional topologies
like meshes, torus and k-ary n-cubes. Next we have
developed algorithms for single side wrap around meshes
and intersecting rings network using this message
based token passing strategy. Also we have developed
an algorithm for a unidirectional chordal rings network.
In this algorithm, we do not require a separate routing
record to store all the shortest paths from source
to destination nodes.
Awards
International:
Served as referee for the Journals: IEEE/ACM Transactions
on Networking, Information Sciences
Reviewer for Springer - Verlag, Heidelberg, Germany and Society for Industrial and Applied Mathematics (SIAM), Philadelphia, USA.
Listed in the 6th edition of Marquis' Who is Who
in science and engineering, USA
National:
Awarded University Research Fellowship (URF) by University
of Madras, from November 2001 to April 2003
List of Publications
Master's Thesis:
1. R.Rajendra Prasath, Enhancing Text Categorization using External Knowledge Repositories, Indian Institute of Technology, Kharagpur, May 2008 |
Synopsis | Thesis |
Ph.D Thesis:
1. R.Rajendra Prasath, Design of Algorithms for Shared Resource Allocation and Certain Selected Problems in Distributed Systems, University of Madras, February 2004 |
Synopsis | Thesis |
Under Preparation:
1. R.Rajendra Prasath, Distributed algorithms for sorting and prefix computation on a static ad hoc mobile network
Communicated:
1. R.Rajendra Prasath, An alternative time-optimal distributed sorting algorithm on a line network (Communicated to HiPC2008)
2. R.Rajendra Prasath and Sudeshna Sarkar, Augmenting Texts for Improving Categorization using External Knowledge Repository (Communicated to CIKM2008)
3. R.Rajendra Prasath and Sudeshna Sarkar, Enhancing Text Categorization using External Knowledge Repositories (Communicated)
Published:
Journals:
1. R.Rajendra Prasath, and P.Thangavel, Shared resource allocation using token passing strategy in interconnected networks, Information: An International Journal, 6(2)(2003) 197-206. (Cited by 1)
2.P.Thangavel and R.Rajendra Prasath, A note on token based control in rings and linear arrays, The Journal of Computer Society of India, 32(3)(2002) 62-65.
3. R.Rajendra Prasath, and P.Thangavel, Token based message passing in bi-directional ring extensions, JMU, 52(2000) 145-159.
Books(Edited):
1. R.Suguna and R.Rajendra Prasath (Eds.), Proceedings of the National Workshop on Network Security, Misrimal Navajee Munoth Jain Engineering College, Chennai - 96, September 2004
Articles in Edited Volumes / Conference Proceedings:
1. R.Rajendra Prasath, and P.Thangavel, Token based control algorithms for shared resource allocation in general networks, in: Proc. 3rd Int. Conf. on Information, (Info’2004), 2004, 520-523.
2. R.Rajendra Prasath, and P.Thangavel, Token based control algorithm with central coordinators, in: Algorithms and Artificial Systems, P.Thangavel (Ed.), Allied Publishers Private Limited, 2003, pp.25-40
3. R.Rajendra Prasath and P.Thangavel, Shared resource allocation in Chordal ring networks using token based control mechanism, in: Proc. of the International Conference on Industrial Mathematics (ICIM'2000), held at Indian Institute of Technology, Madras during August 2001.
4. R.Rajendra Prasath, and P.Thangavel, Shared resource allocation strategy using token based control strategy in ring extension topologies, in: Recent Trends in Mathematical Sciences, J.C. Misra and S.B.Sinha(Eds.), Narosa Publishing House, 2000, pp.53-63.
5. R.Rajendra Prasath, Shared resource allocation using baked potato routing, in: Proc. of International Conference Asia-Pacific Telecom 2000 (APT - 2000) on Advances in Telecommunication and Information Technology, December 2000, pp. 144-152.
Technical Reports:
1. R.Rajendra Prasath, Mayank Gupta and Sudeshna Sarkar, TamilNews - The Search Engine for Regional News, Dept of CSE, IIT, Kharagpur, April 2007.
2. D.Bordoloi, Asit Kumar Biswas, Ashish Kumar and R.Rajendra Prasath, Routing Issues in Sensor Network, Dept of SIT, IIT, Kharagpur, April 2007.
3. R.Rajendra Prasath, Debasis Samanta and Vinay Gupta, Interaction Styles using Haptic Devices - The Designer Approach, Dept of SIT, IIT, Kharagpur, May 2007.
4. R.Rajendra Prasath and Niloy Ganguly, Modeling Epidemics on Complex Networks, Dept of CSE, IIT, Kharagpur, March 2007.
5. R.Rajendra Prasath and B.Satish, Garbage Collection – Handling Dynamic Memory Management, Dept of CSE, IIT, Kharagpur, November 2006.
6. R.Rajendra Prasath and Arobinda Gupta, Delay Tolerant Routing, Dept of CSE, IIT, Kharagpur, November 2006.
Short Notes:
R.Rajendra Prasath, The power of Parallel Computation – Basic Design Issues (Monograph), in: “EXPLORA: Knowledge Unleashed” of Epoch’02, Univ. of Madras, Sep. 2002, pp. 115-121.
Students [at
MNMJEC]
Current:
NIL
Graduated:
2005-2006:
Hemalatha.S (31002205018) and Lakshmi.V (31002205023)
Madhu Bala.L (31002205025)
B.Ramalakshmi (31002205041) and J.Brindha (31002205009)
2004-2005:
P. Ramachandran (31001205051) and C. Nithyasree (31001205042)
Padma priya. S (31001205043), Renuka Rajagopalan (31001205049) and V. Santhana Lakshmi (31001205057)
Anju abraham vadakkel (31001205007) and Prashanth. S (31001205046)
Sangeetha. S (31001205055) and Sudha. S (31001205070)
Memberships
Member, Young Researchers Committee, World Federation on Soft Computing
Member of Computer Society of India, Mumbai.
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
Gallery
Back
Next
My Blog
TamilNews - For details: Blog
minekey - my Widgets: News
|
