Vol. 8 No. 5 AUG 2010

Vol. 8 No. 5 August 2010 International Journal of Computer Science and Information Security

Publication August 2010, Volume 8 No. 5 (Download Full Journal) (Archive)

Copyright © IJCSIS. This is an open access journal distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

1. Paper 29071043: Blind Multiuser Detection in SDMA-aided MIMO OFDM Systems by FastICA Algorithm (pp. 1-5)

Full Text: PDF

Yu Du, Kang Yen, Yechang Fang and Nansong Wu

Department of Electrical and Computer Engineering, Florida International University, Miami, Florida, United States

Abstract —The techniques of MIMO (Multiple Input and Multiple Output) OFDM (Orthogonal Frequency Division Multiplexing) systems have been adopted by IEEE 802.11n wireless communication standard (Wi-Fi). Multiuser Detection by blind signal separation (BSS) techniques in MIMO OFDM systems recently attracts researchers’ interests by their various advantages. The performance of a MIMO OFDM system mainly depends on reliability and effectiveness of the system, and the measurement of reliability is bit error ratio (BER). On the premise of effectiveness, a new blind multiuser detection approach based on FastICA (fast fixed-point algorithm for independent component analysis) is proposed for a SDMA-aided (Spatial Division Multiple Access) MIMO OFDM system with additive white Gaussian noise (AWGN) for the target of better reliability. Compared with the usually-used spatial-multiplexing-based MIMO OFDM system, the proposed method offers better BER performance. Simulation results confirm the better reliability of the proposed approach.

Keywords- Blind Multiuser Detection; SDMA; MIMO OFDM; FastICA

2. Paper 11051004: A Hierarchical Resource Allocation Architecture for Mobile Grid Environments (pp. 6-11)

Full Text: PDF

S. Thenmozhi, Assistant Professor, Department of Computer Applications, Chettinad College of Engineering and Technology, Tamilnadu, India.

A. Tamilarasi, Professor, Department of MCA, Kongu Engineering College, Erode, Tamilnadu, India

Abstract— The mobility issue in grid environments has established new challenges to the research communities particularly in the areas of scheduling, adaptation, security and mobility. Especially, the resource allocation becomes more challenging when mobility is considered in grid environment. Hence it is necessary to consider the mobility of users along with the resource availability while scheduling the resources for the execution of jobs. In this paper, we propose to design a Hierarchical Resource Allocation Architecture (HRAA) which includes resource monitoring and scheduling operations for mobile grid. In this architecture, the Mobile Grid is divided into clusters. Each cluster has one cluster head (CH). A master server (MS) controls each local clusters and has frequent updates of all the CH information. Each CH has a monitoring agent (MA) which will periodically predict the mobility of the cluster nodes and monitor the resource availability and update their values. When the MS forwards the job request of a user to the ideal CH, the CH schedules the jobs based on the predicted time for resource availability and sufficiency of the resources. By simulation results, we show that our proposed architecture achieves good success ratio and throughput with reduced delay and energy consumption.

Keywords- Resource Allocation, monitoring agent (MA), Hierarchical Resource Allocation Architecture (HRAA), cluster head, master server (MS)

3. Paper 23071028: An Efficient Detection and Management of False Accusations in Ad Hoc Network (pp. 12-19)

Full Text: PDF

Yunho Lee , Soojin Lee

Department of Computer & Information Science, Korea National Defense University, Seoul, South Korea

Abstract - Since ad hoc networks rely on the cooperation of all the participating nodes for routing and forwarding, the fast detection of malicious nodes is a critical issue. Therefore, the dissemination of observed behavior information of neighboring nodes is efficiently used for detecting misbehaving nodes. However, this may make ad hoc networks vulnerable to false accusation. In this paper, to detect quickly and manage the false accusations of malicious nodes in the hierarchical ad hoc network such as military tactical ad hoc network, we propose a new efficient way using a Node Weight Management Server (NWMS). The NWMS which is the upper layer node maintains a weight value for every node in their area and detects and isolates malicious nodes using the weight value of nodes. In addition, our system provides a rescuing method for incorrectly imposed weight values. By means of simulation we have evaluated the efficiency of our approach for detecting and managing misbehaving nodes. The simulation results indicate that proposed mechanism is significantly efficient for handling misbehaving nodes.

Keywords; Ad hoc, false accusation, NWMS

4. Paper 11071011: Wavelength Requirements for a Scalable Single-hop WDM Optical Network (pp. 20-26)

Full Text: PDF

Rabi W. Yousif, Faculty of Engineering, Universiti Putra Malaysia, Malaysia

Borhanuddin Mohd Ali, Faculty of Engineering, Universiti Putra Malaysia, Malaysia

Mohd Khazani Abdullah, Significant Technologies Sdn. Bhd. Serdang, Malaysia

Kamaruzzaman Bin Seman, Faculty of Science and Technology, Universiti Sains Islam Malaysia

Mohd Dani Baba, Faculty of Electrical Engineering, University Teknologi Mara, Shah Alam, Malaysia

Abstract—In this paper, we present a method for designing a passive optical based single-hop wavelength division multiplexing multicast architecture that can achieve a scalable structure and form the basis of a wavelength efficient single-hop WDM network. The proposed architecture minimizes the number of wavelengths required for efficient multicast service and also minimizes tunability requirement of the transceivers. The network size scalability is achieved by adding transmitters and receivers to the designated groups. We show that the proposed system can accommodate large tuning delays and keeps with suitable throughput when the number of wavelength is equal to the number of nodes. We also show that the design can lead to a scalable structure while minimizing the number of wavelengths and tunability of the transceivers required for an efficient multicast service resulting in an improved system throughput and delay performance.

Keywords-multicasting, wavelength-division multiplexing, single-hop passive optical network

5. Paper 30071055: Enhanced Dynamic Source Routing Protocol using On Demand Passive Clustering (pp. 27-33)

Full Text: PDF

Shobha. K. R and Dr. K. Rajanikanth

M. S. Ramaiah Institute of Technology, Bangalore, India

Abstract— In this paper an enhancement technique for Dynamic Source Routing (DSR) protocol using on demand passive clustering is proposed. DSR is a popular reactive protocol in Mobile Adhoc Networks (MANETs) which uses flooding for route discovery and route maintenance. Flooding can be easily restricted using clustering. Clustering restricts the set of forwarding nodes during flooding which in turn reduces the energy, cost and traffic overhead during routing in dynamic traffic and dynamic topology environment of MANET. Active clustering mechanisms require periodic refresh of neighborhood information and tend to introduce a large amount of communication maintenance overhead. This can be overcome using passive clustering which executes only when the user has data to transmit. Passive clustering dynamically partitions the network into clusters interconnected by gateways. Existing Passive Clustering techniques exploit the data packets for cluster formation and thus reduce the periodic exchange of explicit control packets. We have proposed an enhanced passive clustering technique which makes use of the control packets used for route discovery in DSR to establish a cluster. We have used the Lowest ID technique and first declaration wins technique to form clusters. We have analyzed the performance of this technique to reduce flooding by using single cluster head called primary cluster head. Then an analysis has been carried out with two cluster heads called primary and secondary cluster heads. Simulation results on DSR have shown that this enhanced passive clustering technique can reduce redundant flooding, with negligible overhead; - thus making DSR more efficient.

Keywords- MANETs; DSR; Flooding; Clustering; Passive clustering; Primary cluster head; Secondary cluster head;

6. Paper 11071009: Quality of Service Enhanced Routing in Mobile Ad Hoc Networks (pp. 34-40)

Full Text: PDF

D.S. Thenmozhi, Institute of Road and Transport Technology, Erode, Tamilnadu, India.

R. Lakshmipathi, St. Peter’s Engineering College, Chennai, Tamilnadu,India.

Abstract—The importance of Mobile Ad hoc Networks (MANETs) has been increasing everyday. Attractive features of MANETs are no need for infrastructure and decentralized nature. Many applications that use MANETs include multimedia data that require Quality of Service (QoS) support for effective communication. Also QoS routing feature is important for a mobile network to interconnect wired network having QoS support. We approach the problem of providing Quality of Service for mobile ad hoc networks (MANETs) by the technique of bandwidth based path finding. The Ad hoc On demand Distance Vector routing protocol provides efficient route establishment between nodes with minimal control overhead and minimal route acquisition latency. The normal route finding method of AODV is improved as Quality of Service Enhanced Ad hoc On demand Distance Vector (QEAODV) routing. In our work QEAODV establishes a path between the source and the destination meeting the application stipulated throughput requirement. Contention which is the inherent problem in MANET is considered effectively in QEAODV. QEAODV is implemented so that additional overhead requirement will be very less. In this paper, we present a scalable and efficient QEAODV to support QoS in ad hoc networks. Simulation results show significant performance advantages of our protocol when compared with normal AODV.

Keywords—Mobile Ad hoc Networks (MANETs), quality of service routing, bandwidth estimation, contention, admission control, simulations.

7. Paper 11071010: PC 2 Phone Event Announcer (pp. 41-45)

Full Text: PDF

Behrang Parhizkar, Faculty Of Information & Communication Technology, Limkokwing University, Cyberjaya, Selangor, Malaysia

Abdulbasit Mohammad Abdulrahman Alazizi, Faculty Of Information & Communication Technology, Limkokwing University Cyberjaya, Selangor, Malaysia

Mohammad Nabil Sadegh Ali, Faculty Of Information & Communication Technology, Limkokwing University, Cyberjaya, Selangor, Malaysia

Anand Ramachandran, Faculty Of Information & Communication Technology, Limkokwing University, Cyberjaya, Selangor, Malaysia

Sujata Navaratnam, Faculty Of Information & Communication Technology, Limkokwing University, Cyberjaya, Selangor, Malaysia

Abstract- Nowadays, mobile phones are indispensable devices; it has become a trend now that college and university students are owners of such devices and this particular factor plays a very important role behind the coming up with the proposed system. “PC 2 Phone event Announcer”, is the name of the new proposed system suggested to solve the existing communication problem between the College staff and students. As the name suggests, it can be deduced that the system will involve computers and phones, more specifically mobile phones.

Keywords-component; Mobile; SMS; Phone;

8. Paper 1507105: A Review on Ontology-Driven Query-Centric Approach for INDUS Framework (pp. 46-53)

Full Text: PDF

L. Senthilvadivu, Dept of Software Technology, SSM College of Engineering, Komarapalayam, Tamilnadu, India

Dr. K. Duraiswamy, Dean(Academic), K.S.R College of Technology, Tiruchengode, Tamilnadu, India

Abstract- This paper stimulates and describes the data integration component of INDUS that is, Intelligent Data Understanding System, environment for data-driven information extraction and integration from heterogeneous, distributed, autonomous information sources. INDUS employs ontologies and inter-ontology mappings, to enable a user or an application to view a collection of physically distributed autonomous, semantically heterogeneous data sources regardless of location, internal structure and query interfaces as though they were a collection of tables structured according to an ontology supplied by the user. This allows INDUS to answer user queries against distributed, semantically heterogeneous data sources without the need for a centralized data warehouse or a common global ontology. The design of INDUS is motivated by the requirements of applications such as scientific discovery, in which it is desirable for users to be able to access, flexibly interpret, and analyze data from diverse sources from different perspectives in different contexts. INDUS implements a federated, query-centric approach to data integration using user-specified ontologies. More than 13 systems are studied and it is realized that INDUS is the most preferred system for Information Extraction, Integration, and Knowledge Acquisition from Heterogeneous, Distributed and Autonomous Information Sources. PROSITE, MEROPS, SWISSPROT, and MEME are examples of data sources used by Computational Biologists.

Keywords- INDUS (Intelligent Data Understanding System), Querycentric approach, PROSITE, MEROPS, SWISSPROT, MEME, MIPS2GO, EC2GO.

9. Paper 23081020: Fingerprint Image Enhancement using Successive Mean Quantization Transform (pp. 54-58)

Full Text: PDF

Dr.R.Seshadri , Director, S. V. U. Computer Center, S.V. University, Tirupati

Yaswanth Kumar Avulapati, Research Scholar, Dept of Computer Science, S. V. University, Tirupati

Abstract - Fingerprint based identification is one of the core methodologies for person identification. A finger print is the representation of the epidermis of a finger. In this paper we presents a novel approach to enhancing fingerprint images using a SMQT(Successive Mean Quantization Transform ) for automatic enhancement of fingerprint gray scale images. There are so many approaches are there for image enhancement. Here we introduced the Fingerprint enhancement capabilities and properties of the transform are analyzed. The transform is capable to perform both a nonlinear and a shape preserving stretch of the fingerprint histogram.

Keywords:-

10. Paper 27071032: Conversion of English Text to Braille Code vibration signal for Visually Impaired People (pp. 59-63)

Full Text: PDF

M. Rajasenathipathi, Assistant professor in Computer Science, N.G.M. College of Arts and Science, Pollachi- 642001, Tamilnadu, India

Dr. M. Arthanari, Director, Bharathidasan School of Computer Applications, Ellispettai-638116, Tamilnadu, India

M. Sivakumar, Doctoral Research Scholar, Anna University, Coimbatore, Tamilnadu, India

Abstract - This paper is concerned with the translation of text to Braille code vibration signal in an electronic hand glove using an algorithm based on mathematical logic. It is built on a translation system that combines a finite state machine with left and right context matching and a set of translation rules. This allows the translation of different languages and different grades of Braille contraction, and text-to-Braille conversion. All the implementations perform translation correctly on a range of different operating systems and machines, demonstrating that they are platform-independent. English to Braille code signal vibration conversion responds to increased demands on the Braille code that is integrated education of blind children. The changes inherent in English To Braille code signal conversion are mostly minor for literary Braille and most evident for mathematics and science notations making Braille easier to learn by all stakeholders and easier to read and write for blind people. English to Braille Conversion is optimised for use by students integrated into regular schools, ideal for students using English as their primary or secondary language; and well-suited to the needs of blind students in developing countries

Keywords: Braille; cell; hand glove; viberation; characte; dot

11. Paper 27071036: Study Of Multimedia Watermarking Techniques (pp. 64-72)

Full Text: PDF

Mrs. Chhaya S. Gosavi, Department of Computer Engg, Cummins College of Engg. For Women, Karvenagar, Pune, India

Dr. C. S. Warnekar, Department of Information Technology, Cummins College of Engg. For Women, Karvenagar,Pune, India

Abstract—With the recent burgeoning of networked multimedia systems, techniques are needed to prevent illegal copying / forgery in distributed digital audio/ visual/text document. It may be also desirable to determine where and by how much the multimedia file has been changed from the original due to attacks. This is attributed to increasing instances of hacking during digital communication Digital watermarking has been proposed as a solution to the above problem to protect multimedia document. There are two important issues that watermarking algorithms need to address. Firstly, watermarking schemes are required to provide trustworthy evidence for protecting rightful ownership. Secondly, good watermarking schemes should satisfy the requirement of robustness and resist distortions due to common manipulations (such as truncation, compression etc.) In this paper, various techniques to secure Multimedia data are discussed.

Keywords-Digital watermarking; DCT; IDCT; DFT; DWT; Singular value decomposition; Security.

12. Paper 29071041: Adaptive e-Learning: A Conceptual Solution for the analysis of link between Medium of Instruction and Performance (pp. 73-78)

Full Text: PDF

Damodaran Venkatesan, Director, CUIC, Anna University Tiruchirappalli, Tiruchirapalli, Tamil Nadu, India

RM. Chandrasekaran, Registrar, Anna University Tiruchirappalli, Tiruchirappalli

Abstract- e-Learning system emphasizes on the available content to all learners irrespective of their knowledge level and relevance. This paper concentrates on the result oriented investigation of the impact of learner’s primary medium of instruction (MI) at school in understanding the content given to them in English and proposes a design for developing an Adaptive e-Learning (AeL) system personalized to the learner. An appropriate statistical model has been developed to analyze the impact and the results implied that the MI (Regional language / English) at school has greater impact on the performance compared to the region (Rural / Urban) the students hailed from, when the same content is given to them in English using e-

Learning. Based upon the significant gap in the performance between the rural regional language medium students and urban English medium students, the decision procedure rules for providing personalized content to the learner were developed. The AeL system personalized to the leaner was successfully implemented with the help of an extensive survey to bridge the gap in performance between the regional language medium students and English medium students.

Keywords-Components: e-Learning (eL), Adaptive e-Learning (AeL), MI, Multiple Regression, Urban / Rural Capacity gap

13. Paper 29071049: Image Retrieval using Row Means of Column Transformed Even and Odd Parts of Image with Walsh, Haar and Kekre Transforms (pp. 79-84)

Full Text: PDF

Dr. H.B. Kekre, Sudeep D. Thepade , Akshay Maloo

Computer Engineering Department, MPSTME, SVKM’s NMIMS (Deemed-to-be University), Mumbai, India

Abstract— The paper presents an innovative content based image retrieval (CBIR) technique based on row mean of column transformed even and odd part of image. Here the performance of proposed CBIR technique is tested for different transforms like Walsh transform, Haar transform and Kekre transform. Instead of using all pixels of image as feature vector for image retrieval, row mean of transform applied on columns of odd and even part of image is used, resulting into better performance with much lower computations. The proposed CBIR techniques are tested on generic image database having 1000 images spread across 11. For each transform 55 queries (5 per category) were fired. Then the precision and recall for all queries are computed. While considering the relevance of result images for calculation of precision and recall the results of odd image part and even image part both are ORED. The average precision and average recall values of all queries gives the performance comparison of proposed CBIR methods as compared to considering full image data as feature vector or considering the simple row mean as feature vector. The results have shown the performance improvement (higher precision and recall values) with proposed methods compared to all pixel data of image at reduced computations resulting in faster retrieval. The comparison of transforms for CBIR performance gives Walsh transform surpassing the other two considered here.

Keywords-content based image retrival (CBIR), row mean, Walsh transform, Haar transform, Kekre transform.

14. Paper 30071057: IEEM Programming Procedure For Detecting Boundary Of Carotid Artery (pp. 85-88)

Full Text: PDF

V. Savithri, Research Scholar, Mother Teresa Women’s University, Kodaikanal, India

S. Purushothaman, Principal, Sun College of Engineering and Technology, Kanyakumari district-629902, India

Abstract--This paper presents an IEEM programming procedure for use on noisy B-mode ultrasound images of the carotid artery. This programming procedure is based on Image Enhancement, Edge detection and Morphological operations in Boundary detection. This procedure may simplify the job of the practitioner for analyzing accuracy and variability of segmentation results. Possible plaque regions are also highlighted. A thorough evaluation of the method in the clinical environment shows that inter observer variability is evidently decreased and so is the overall analysis time. The results demonstrate that it has the potential to perform qualitatively better than applying existing methods in intima and adventitial layer detection on B-mode images.

Keywords- Artery, boundary detection , imaging, Ultrasonic, parallel programming.

15. Paper 30071064: A Scenario-Based Mobile Application for Robot-Assisted Smart Digital Homes (pp. 89-96)

Full Text: PDF

Ali Reza Manashty*, Amir Rajabzadeh and Zahra Forootan Jahromi

Department of Computer Engineering, Razi University, Kermanshah, Iran

Abstract—Smart homes are becoming more popular, as every day a new home appliance can be digitally controlled. Smart Digital Homes are using a server to make interaction with all the possible devices in one place, on a computer or webpage. In this paper we designed and implemented a mobile application using Windows Mobile platform that can connect to the controlling server of a Smart Home and grants the access to the Smart Home devices and robots everywhere possible. UML diagrams are presented to illustrate the application design process. Robots are also considered as devices that are able to interact to other object and devices. Scenarios are defined as a set of sequential actions to help manage different tasks all in one place. The mobile application can connect to the server using GPRS mobile internet and Short Message System (SMS). Interactive home map is also designed for easier status checking and interacting with the devices using the mobile phones.

Keywords- smart homes; mobile applications; remote home controls; automated digital homes; robot assisted at home; general packet radio service (GPRS); short message system (SMS); robot assisted at home; scenario based smart home.

16. Paper 30071065: Predicting Students' Academic Performance Using Artificial Neural Networks: A Case Study (pp. 97-100)

Full Text: PDF

Ghaleb A. El-Refae, Faculty of Economics and Admin. Sciences, Al-Zaytoonah University of Jordan, Amman, Jordan

Qeethara Kadhim Al-Shayea, Faculty of Economics and Admin. Sciences, MIS Dep., Al-Zaytoonah University of Jordan, Amman, Jordan

Abstract—Predicting students’ academic performance is critical for universities because strategic programs can be planned in improving or maintaining students’ performance. The goal of this study is to predict the factors affecting the university students' performance using Artificial Neural Networks (ANN) model. Various factors that may likely influence the performance of a student were identified. Generalized Regression Neural Network (GRNN) is used to predict the university students' performance. It is noticed a significant improvement in the prediction made by GRNN due to its generalization property. The most important predictor variable influencing performance is consistently having the largest regression. Results showed that secondary school performance which is measured by scores in secondary school certificate examination, measured in a percentage form having the largest regression value.

Keywords-component; regression, student performance; Artificial neural networks; general regression network

17. Paper 30071070: Vast Educational Mobile Content Broadcasting using ARMrayan Multimedia Mobile CMS (pp. 101-106)

Full Text: PDF

Somayeh Fatahi Department of Computer Engineering, Kermanshah University of Technology, Kermanshah, Iran

Ali Reza Manashty* and Zahra Forootan Jahromi, Department of Computer Engineering, Razi University, Kermanshah, Iran

Abstract— The huge information flow currently available to young generation makes it difficult for educational centers to train them as needed. Most of these information flows occur in transportation time or while on public areas. Competing with commercial information streams is far out of educational centers time and budget. For creating enough mobile applications for vast educational mobile content broadcasting that can match young spirits as well, we designed and developed the ARMrayan Multimedia Mobile CMS as the software that helps communities, educational, cultural or marketing centers in a way that ordinary operators be able to create a variety of fully functional multimedia mobile applications such as tutorials, catalogues, books, and guides in minutes without writing even a line of code. In this paper, we present the role of our developed software in our proposed vast educational content broadcasting system using kiosks and Bluetooth advertising, which will lead to a great leap in Mcommerce marketing and public education solutions. Related experiences are described and diagrams are used to illustrate the solution. Upon release of the software, it achieved two titles and prizes in different festivals and various cultural and commercial centers became its customers.

Keywords- mobile education; m-commerce; mobile CMS; multimedia cms; mobile; content broadcasting; mobile catalogue; education; J2ME.

18. Paper 31071076: Performance Evaluation of SVM based Abnormal Gait Analysis with Normalization (pp. 107-113)

Full Text: PDF

M. Pushpa Rani, Associate Professor in Computer Science, Mother Teresa Women’s University, Kodaikanal, Tamil Nadu, India

G. Arumugam, Professor & Head, Dept. of Computer Science, Madurai Kamaraj University, Madurai, Tamil Nadu, India

Abstract—Support Vector Machine classifiers are powerful toolsthat are specifically designed to solve large-scale classification problems. In 1990s, Vapnik along with a group of other mathematicians and scientists developed a new statistical approach that is more efficient particularly in dealing with large classification problems which they called as Support Vector Machines (SVM). An SVM method is being broadly used in gait analysis because of its remarkable learning ability. In this paper, a two stage SVM algorithm is proposed for children abnormal gait analysis. The algorithm uses T-Test based preprocessing methods for feature selection, normalization and combines SVM for Classification. Only samples that have weak relationships with all the clusters are involved in SVM. Experimental results reveal that this algorithm based on T-Test-SVM combination achieves a remarkable recognition performance for children abnormal gait analysis with reduced Computational cost.

Keywords: Abnormal Gait Analysis, Support Vector Machine (SVM), Gait Data Classification, T-Test

19. Paper 31071077: Design of a Dynamic Intelligent Intrusion Detection System Model (pp. 114-117)

Full Text: PDF

Vivian Ogochukwu Nwaocha, School of Science and Technology, National Open University of Nigeria, Lagos, Nigeria

Abstract—Most industries require the internet in order to function effectively. We do our banking online, purchase items online and store a wealth of personal information on the hard drive. Unfortunately, thieves know this, and go to great lengths to get our information. As a growing number of companies are connected over the Internet to branch offices in other parts of the country or world, they expose themselves to potential attacks from other individuals or companies after their trade secrets. This could result in losses in the millions or even billions, if important, confidential information is stolen and ends up in the wrong hands. Thus, several organizations invest a great deal in network security in order to ensure that their systems do not fall prey to attacks. However, the existing intrusion detection systems are restricted in their monitoring functionality and require frequent updates and patches. This study presents a dynamic Intelligent Intrusion Detection System model. The proposed model applies fuzzy logic and data mining techniques and a simultaneous implementation of counter measures as the effective means of dynamic intrusion detection.

Keywords- artificial intelligence; business, dynamic intelligent intrusion detection system model; information; network; organization; security;

20. Paper 31071082: Multipath Routing for Self-Organizing Hierarchical Mobile Ad-Hoc Networks – A Review (pp. 118-121)

Full Text: PDF

Udayachandran Ramasamy, Department of Computer Science & Engineering, Sri Ramakrishna Institute of Technology, Coimbatore – 641 010, India,

K. Sankaranarayanan, Principal, Akshaya College of Engineering and Technology, Kinathukadavu, Coimbatore – 642 109, India

Abstract— Security has become a primary concern for providing protected communication between mobile nodes in a hostile environment. The characteristics of Ad-hoc networks (dynamic topology, infrastructure less, variable capacity links, etc) are origin of many issues. Limited bandwidth, energy constraints, high cost security are the encountered problems. This type of networks pose particular challenges in terms of Quality of Service (QoS) and performance. In this paper, the issues of multipath routing in MANETs are reviewed and performances of such MANETs are compared to discuss the application of multipath routing and its effects on different layers to support QoS.

Keywords- MANET, Mobile Ad-hoc networks and QoS.

21. Paper 31071085: Density Based Clustering Algorithm using Sparse Memory Mapped File (pp. 122-128)

Full Text: PDF

J. Hencil Peter, Kallukuttam, Elavuvilai Post, Kanyakumar District, TamilNadu, India – 629 171,

Dr. A. Antonysamy, S.J, Principal, St. Xavier’s College, Kathmandu, Nepal.

Abstract - The DBSCAN [1] algorithm is a popular algorithm in Data Mining field as it has the ability to mine the noiseless arbitrary shape Clusters in an elegant way. As the original DBSCAN algorithm uses the distance measures to compute the distance between objects, it consumes so much processing time and it’s computation complexity comes as O(N^2). In this paper we have proposed a new algorithm for mining the density based clusters using Sparse Memory Mapped File (Spares MMF) [3]. All the given objects are initially loaded into their corresponding Sparse Memory Mapped File’s locations and during the SparseMemoryRegionQuery operation each objects’ surrounding cells will be visited for the neighbour objects instead of computing the distance between each of the objects in the data set. Using the Sparse MMF approach, it is proved that the DBSCAN algorithm can process huge amount of objects without having any runtime issues and the new algorithm’s performance analysis shows that proposed solution is super fast than the existing algorithm.

Keywords: Sparse Memory Mapped File; Sparse MMF; Sparse Memory; Neighbour Cells; Sparse Memory DBSCAN.

22. Paper 07071001: Mapping Cloud Computing onto Useful e-Governance (pp. 129-133)

Full Text: PDF

Ajay Prasad, Department of CSE, Sir Padampat Singhania University, Udaipur, India

Sandeep Chaurasia, Department of CSE, Sir Padampat Singhania University, Udaipur, India

Arjun Singh, Department of CSE, Sir Padampat Singhania University, Udaipur, India

Deepak Gour, Department of CSE, Sir Padampat Singhania University, Udaipur, India

Abstract— Most of the services viewed in context to grid and cloud computing are mostly confined to services that are available for intellectual purposes. The grid or cloud computing are large scale distributed systems. The essence of large scale distribution can only be realized if the services are rendered to common man. The only organization which has exposure to almost every single resident is the respective governments in every country. As the size of population increases so the need for a larger purview arises. The problem of having a large purview can be solved by means of large scale grid for online services. The government services can be rendered through fully customized Service-oriented Clouds. In this paper we are presenting tight similarities between generic government functioning and the service oriented grid/cloud approach. Also, we will discuss the major issues in establishing services oriented grids for governmental organization.

Keywords- Grid computing, cloud computing, service oriented grids, e-governance, SOA, CMMS.

23. Paper 09071007: Honey-Bee Mating based Bound Time Approach for Energy minimization in Wireless Sensor Networks (pp. 134-141)

Full Text: PDF

J Senthilkumar, Assistant Professor/IT, Sona College of Technology, Salem, Tamilnadu, India

Dr. R. Lakshmipathi, Professor/EEE, St. Peters Engineering College, Chennai, Tamilnadu, India

V. Mohanraj, Assistant Professor/IT, Sona College of Technology, Salem, Tamilnadu, India

Y. Suresh, Assistant Professor/IT, Sona College of Technology, Salem, Tamilnadu, India

Abstract—In Wireless Sensor Network, dynamic cluster based routing protocol approach is widely used. Such practiced approach, quickly depletes the energy of cluster heads and induces the execution of frequent re-election algorithm. This repeated cluster head re-election algorithm increases the number of advertisement messages which in turn depletes the energy of overall sensor network. Here, we proposed the Bound Time and Honey Bee Mating Approach (BT-HBMA) that reduces the cluster set up communication overhead and elects the stand by node in advance for current cluster head which has the capability to withstand for many rounds Our proposed BT-HBMA method uses the Honey bee mating behaviour in electing the stand by node for current cluster head. This approach really outperforms the other methods in achieving reduced number of re election and maintaining high energy nodes between the rounds.

Keywords- Cluster based Routing; Wireless sensor network; Honey Bee mating; Bound Time

24. Paper 20071023: Multi-Label Image Segmentation for Medical Applications Based on Graph- Cuts (pp. 142-147)

Full Text: PDF

R. Rajeswari, Department of Information Technology, MIT campus, Anna University, Chennai-44, India

P. Anandhakumar, Department of Information Technology, MIT campus, Anna University, Chennai-44, India

Abstract - Mathematical morphology is very attractive for automatic image segmentation because it efficiently deals with geometrical descriptions such as size, area, shape, or connectivity that can be considered as segmentation-oriented features. This paper presents a new approach for some theoretical and practical improvements of image segmentation based on graph cuts. The method is based on the use of the region adjacency graph produced by the watershed transform from mathematical morphology. Marker extraction identifies the presence of homogeneous regions. The combination of morphological and graph cuts segmentation permits us to speed up and define new classes of energy functions that can be minimized using graph cuts. The use of region graphs gives promising results and can potentially become a leading method for interactive medical image segmentation.

Keywords- Image segmentation, marker extraction, morphology, Graphs, Watershed Transform.

25. Paper 24071029: Hybrid Model of Texture Classification using 2D Discrete Wavelet Transform and Probablistic Neural Network (pp. 148-154)

Full Text: PDF

Reem Abd El-Salam El-Deeb, Department of Computer Science, Faculty of Computer and Information Sciences, Mansoura University, Egypt, P.O. BOX: 35516

Taher. Hamza, Department of Computer Science, Faculty of Computer and Information Sciences, Mansoura University, Egypt, P.O. BOX: 35516

Elsayed Radwan, Department of Computer Science, Faculty of Computer and Information Sciences, Mansoura University, Egypt, P.O. BOX: 35516

Abstract— In this paper, we present a combinational approach for texture classification. The proposed method analyzes texture by 2D Discrete Wavelet Transforms (DWT); wavelet energy and some statistical features construct the features vector that characterizes texture. For improving accuracy the Probabilistic Neural Network (PNN), which is considered as a good estimator to the probability density function, is used as a classifier that maps input features vectors to the most appropriate texture classes. Two comparative evaluations have been done in order to ensure the effectiveness and efficiency of this model.

Keywords- Texture classification, feature extraction, discrete wavelet transform, probabilistic neural network

26. Paper 27071034: A New Learning Method for Cellular Neural Networks Templates based on Hybrid of Rough Sets and Genetic Algorithms (pp. 155-164)

Full Text: PDF

Elsayed Radwan ^*1, Omaima Nomir ², Eiichiro Tazaki ³

^1,2Department of Computer Science, Faculty of CIS, Mansoura University, Egypt,

³Department of Control and Systems Engineering, Toin University of Yokohama, Japan

Abstract— A simple method for synthesizing and optimizing Cellular Neural Networks is proposed. Based on the Rough Sets concept and the comparison principles for ordinary differential equations, a mathematical system of inequalities and the optimal cloning template structure are discovered. By solving this system of inequalities, the derived parameters are represented to be the Cellular Neural Networks templates. These parameters guarantee correct operations of the network. To represent a more robust template, a randomized search and an optimization technique guided by the principles of evolution and nature genetics with constrained fitness and, penalty functions, has been introduced. Applying our introduced method to different applications shows that our new method is robust.

Keywords-component; Rough Sets; Cellular Neural Networks, Comparison principles; Template Robustness; Genetic Algorithms

27. Paper 27071037: Fuzzy-Based Dynamic Rough Set Resource Discovery According to User Preferences in Grid Environment (pp. 165-174)

Full Text: PDF

Iraj Ataollahi, Computer Engineering Department, Iran University of Science and Technology, Tehran, Iran

Mahdi Bakhshi, Department of Computer, Islamic Azad University, Shahrbabak Branch, Shahrbabak, Iran

Morteza Analoui, Computer Engineering Department, Iran University of Science and Technology , Tehran, Iran

Abstract — Grid environment is a service oriented infrastructure in which many heterogeneous resources participate to provide high performance computation. One of the bug issues in the grid environment is the uncertainty among registered resources. Furthermore, in an environment such as grid dynamicity is considered as a crucial issue which must be dealt with. Using dynamic rough set theory to deal with uncertainty and dynamicity has shown good results. Addition to this, compounding this theory with Fuzzy system will improve its efficiency by applying fuzzy system in matchmaking phase. In this work we propose a solution, called Fuzzy-Based Dynamic Rough Set Resource Discovery (FDRSRD), in which dynamic Rough set theory is used in order to deal with uncertainty and fuzzy system for resource matchmaking according to the user preferences. In matchmaking phase, in order to improve accuracy and speedup, fuzzy system is used to rank resources. We also report the result of the solution obtained from the simulation in GridSim simulator along with FuzzyJ Toolkit. The comparison has been made between FDRSRD, Dynamic and Classical Rough Set based algorithms. FDRSRD shows much better precision and more speed for the cases with uncertainty in a dynamic system such as the grid rather than the two other algorithms.

Keywords- Grid; Rough Set; Dynamic Rough Set; Resource Discovery; Ontology; Fuzzy System; User Preferences

28. Paper 28071038: Convergence Time Evaluation of AODV and AODV+G in MANETs (pp. 175-181)

Full Text: PDF

Annapurna P Patil, Harish. R

Department of Computer Science and Engineering, M.S. Ramaiah Institute of Technology, Bangalore-54, India.

Abstract -Wireless mobile ad-hoc networks are characterized as networks without any physical connections. In these networks there is no fixed topology due to the mobility of nodes, interference, mulitpath propagation and path loss. Hence a dynamic routing protocol is needed for these networks to function properly. Many routing protocols have been developed for accomplishing this task. Selecting most appropriate routing protocol for a particular network scenario is the critical issue. Most attempts made at evaluating these algorithms so far have focused on parameters such as throughput, packet delivery ratio, overhead etc. An analysis of the convergence times of these algorithms is still an open issue. The work carried out fills this gap by evaluating the algorithms on the basis of convergence time. In this paper we present and examine the convergence time evaluation of routing protocols AODV and AODV+G . The algorithm performances are compared by simulating them in ns2. Tcl is used to conduct the simulations, while perl is used to extract data from the simulation output and calculate convergence time. After extensive testing we observed that AODV+G converged well in all situations than AODV. The paper also evaluates the algorithms using the rudimentary metrics-throughput and packet delivery ratio.

Keywords- Routing Protocols, MANETS, Convergence Time.

29. Paper 30071059: An Improvement of Link Failure Maintenance in Ad-Hoc Wireless Network on AODV Protocol (pp. 182-188)

Full Text: PDF

Sayid Mohamed Abdule, InterNetWorks Research Group, UUM College of Arts and Sciences, University Utara Malaysia, 06010 UUM Sintok, Malaysia

Suhaidi Hassan, InterNetWorks Research Group, UUM College of Arts and Sciences, University Utara Malaysia, 06010 UUM Sintok, Malaysia

Mohammed M. Kadhum, InterNetWorks Research Group, UUM College of Arts and Sciences, University Utara Malaysia, 06010 UUM Sintok, Malaysia

Abstract— In mobile ad-hoc wireless network, the link failure is a major challenge. It causes a reduction in performance and efficiency of network resources. This paper presents an enhancement to AODV-DFRP protocol. This developed protocol utilizes the link state prediction method to avoid a link failure in a different way from the existing solutions. The paper focuses only the link failure caused by the nodes mobility, which can be avoided if the routing protocol responses quickly to the network topology change. In this paper, we propose a Local Route Request (LRREQ) mechanism which is expected to show better performance than Local Repair method that is used in standard AODV.

Keyword: Ad-hoc; AODV;

30. Paper 30071060: EFRRA: An Efficient Fault-Resilient-Replica-Algorithm for Content Distribution Networks (pp. 189-197)

Full Text: PDF

Amutharaj. J, Assistant Professor, CSE, Arulmigu Kalasalingam College of Engineering, Krishnankoil, Virudhunagar, India

Radhakrishnan. S., Senior Professor, CSE, Arulmigu Kalasalingam College of Engineering, Krishnankoil, Virudhunagar, India

Abstract— Nowadays, content distribution is an important peer-to-peer application on the Internet that has received considerable research attention. Content distribution applications typically allow personal computers to function in a coordinated manner as a distributed storage medium by contributing, searching, and obtaining digital content. The primary task in CDN is to replicate the contents over several mirrored web servers (i.e., surrogate servers) strategically placed at various locations in order to deal with the flash crowds. Geographically distributing the web servers’ facilities is a method commonly used by service providers to improve performance and scalability. Hence, contents in CDN are replicated in many surrogate servers according to some content distribution strategies dictated by the application environment. Devising an efficient and resilient content replication policy is crucial since, the content distribution can be limited by several factors in the network. Hence, we propose a novel Efficient Fault Resilient Replica Algorithm (EFRRA) to replicate the content from the origin server to a set of surrogate servers in an efficient and reliable manner. The contributions of this paper are twofold. First we introduce a novel EFRRA distribution policy and theoretically analyze its performance with traditional content replication algorithms. Then, by means of a simulation based performance evaluation, we assess the efficiency and resiliency of the proposed EFRR Algorithm, and compare its performance with traditional content replication algorithms stated in the literature. We demonstrate in experiment that EFRRA significantly reduces the file replication time and maintaining the Delivery ratio as compared with traditional strategies such as sequential unicast, multiple unicast, Fast Replica (FR), Resilient Fast Replica(R-FR), and Tornado codes (TC). This paper also analyzes the performance of sequential unicast, multiple unicast, Fast Replica (FR), Resilient Fast Replica(R-FR), Tornado codes, and EFRRA algorithms in terms of average replication time and maximum replication time.

Keywords- CDN, Fast Replica, Resilient Fast Replica, Efficient Fault Resilient Replica Algorithm, Tornado Codes.

31. Paper 30071063: Comparison of Face Recognition Approach through MPCA Plus LDA and MPCA Plus LPP (pp. 198-202)

Full Text: PDF

Shermina. J, The Department of Computing, Muscat College, University of Stirling, UK, Muscat, The Sultanate of Oman

Abstract - Face recognition technology has been evolved as an enchanting solution to perform identification and the verification of identity claims. By advancing the feature extraction methods and dimensionality reduction techniques in the application of pattern recognition, a number of face recognition systems has been developed with distinct degrees of success. In this paper, we have presented a biometric face recognition approach based on Multilinear principal component analysis (MPCA) and Locality Preserving Projection (LPP) and the comparison of this to the existing Multilinear principal component analysis (MPCA) and Linear Discriminant Analysis (LDA). This approach consists of four major steps: 1) Face image preprocessing, 2) Dimensionality reduction using MPCA 3) Feature Extraction using LPP and 4) Face recognition using L2 similarity distance measure. Validation of this approach and its comparison with MPCA plus LDA is done with FERET and AT&T face databases. Experimental results show the effectiveness of MPCA plus LPP in comparison with MPCA plus LDA in performance.

Keywords- Image Processing; Object Recognition; Face Recognition; Image Compression; Multilinear Systems.

32. Paper 30071073: Performance Analysis of Estimation of Distribution Algorithm and Genetic Algorithm in Zone Routing Protocol (pp. 203-207)

Full Text: PDF

Mst. Farhana Rahman, Computer Science and Engineering Discipline, Khulna University, Khulna 9208, Bangladesh

S. M. Masud Karim, Computer Science and Engineering Discipline, Khulna University, Khulna 9208, Bangladesh

Kazi Shah Nawaz Ripon, Computer Science and Engineering Discipline, Khulna University, Khulna 9208, Bangladesh

Md. Iqbal Hossain Suvo, Computer Science and Engineering Discipline, Khulna University, Khulna 9208, Bangladesh

Abstract — In this paper, Estimation of Distribution Algorithm (EDA) is used for Zone Routing Protocol (ZRP) in Mobile Ad-hoc Network (MANET) instead of Genetic Algorithm (GA). It is an evolutionary approach, and used when the network size grows and the search space increases. When the destination is outside the zone, EDA is applied to find the route with minimum cost and time. The implementation of proposed method is compared with Genetic ZRP, i.e., GZRP and the result demonstrates better performance for the proposed method. Since the method provides a set of paths to the destination, it results in load balance to the network. As both EDA and GA use random search method to reach the optimal point, the searching cost reduced significantly, especially when the number of data is large.

Keywords-Mobile Ad-hoc Network, Zone Routing Protocol, Estimation of Distribution Algorithm, Genetic Algorithm

33. Paper 31071090: Security risk assessment of Geospatial Weather Information System (GWIS): An OWASP based approach (pp. 208-218)

Full Text: PDF

K. Ram Mohan Rao*, Durgesh Pant**

*Geoinformatics Division, Indian Institute of Remote Sensing (NRSC) , Dehradun, Uttarakhand, India

**Department of computer science, Kumaun University, Nainital Uttarakhand, India.

Abstract — Security assessment is crucial in web application development environment. The Rapid Application Development (RAD) process makes the application extremely short and makes it difficult to eliminate the vulnerabilities. Here we study how web application risk assessment technique such as risk rating process can be applied to web application. We implement our proposed mechanism the application risk assessment methodology using Open Web Application Security Project (OWASP) model for the security assessment of web application. The study led to quantifying different levels of risk for Geospatial Weather Information System (GWIS) using OWASP model.

Keywords - Security assessment; Rapid Application Development; Risk rating.

34. Paper 30071054: Design and Implementation of GSM based Remote Monitoring and Control system for Industrial process Parameters (pp. 219-225)

Full Text: PDF

Dr. B. Ramamurthy, Dept of Instrumentation, S K University, Anantapur, Andhra Pradesh India

S. Bhargavi, Dept of E&C, SJCIT, Chikballapur, Karnataka, India

Dr. R.ShashiKumar, Dept of E&C, SJCIT, Chikballapur, Karnataka, India

Abstract - The benefits of remote monitoring and control have long been realized in the industrial sector for uses in automation as well as increase of safety/security standards. This led to the emergence of the Remote Monitoring and Control System (RMACS) [1]. In this paper we have developed an integrated Wireless RMACS for monitoring, controlling and accessing the performance of remotely situated device parameters such as Temperature, Pressure, Humidity and Level on real time basis. This paper explores the feasibility of tapping into the short message service component of existing mobile communications network infrastructure, particularly the GSM (Global System for Mobile communication) [2] network to act as a medium for the communication of control signals. From the Wireless RMACS, which is proposed in set up the temperature, pressure, humidity, level could be sufficiently recorded from the remote location, and whenever it crosses the set point the ARM LPC2148 Processor will sends as SMS to a user(s) mobile phone. The user can control the system through his mobile phone. The properly designed Wireless RMACS enable the achievement of truly mobile monitoring, control and other industrial processes; as well as security and safety applications.

Key words: RMACS, Automation, GSM, ARM LPC2148, Mobile phone, SMS.

35. Paper 31071078: SOA based Adaptive Reliable Service Delivery Framework using QoS: A Fuzzy-Bayesian Network Approach (pp. 226-230)

Full Text: PDF

R. Sivaraman, Dr. R M. Chandrasekeran

Anna University Tiruchirappalli

Abstract - Service Oriented Architecture has gained a universal acceptance as a strategy for developing new applications in dynamic environments through self contained, reusable and configurable services. By adherence to the web services standards stack, these services can interoperate with other services and can also be transformed into a composition of services. The behavior and operation of a service has to be closely monitored for an efficient delivery to the client. Ranking and selection of the services among various service providers have become an important factor for a successful business solution. Quality of Service (QoS) determines the quality and usability of a service and is determined after analyzing the QoS attributes collected from various sources. Hence it has become our research motivation for transfer and reception of QoS data. In this paper, we propose an adaptive and reliable service delivery framework, which adopts a Fuzzy-Bayesian Network (FBN) approach through which the web services can be ranked and selected automatically. Also this framework offers reliability and availability aspects of QoS demand.

Keywords: Web service selection, QoS, Fuzzy-Bayesian Network (FBN), Web Services ranking

36. Paper 31071079: Feasibility Analysis of using Cannon Method to Perform Block Rhotrix Multiplication (pp. 231-239)

Full Text: PDF

Abdullahi M., Ezugwu El-Shamir Absalom, Ahmed B. I., Tukur S. M.

Department of Mathematics, Ahmadu Bello University, Zaria, Nigeria.

Abstract-This paper introduces the concept of parallel rhotrix – rhotrix multiplication, algorithm design and analysis based on the idea of parallelization of matrix–matrix multiplication with Cannon algorithm.

Keywords: Rhotrix, rhotrix blocking, alignment operation, shift operation, main entries, heart entries.

37. Paper XX0710X: Clinical Data Warehouse on Insect Vector Diseases to Human of Andhra Pradesh (pp. 240-244)

Full Text: PDF

1 Dr.M. Usha Rani, 2 M.Kalpana Devi, 3 Dr.D.M. Mamatha, 4 Dr.R.Seshadri , 5 Yaswanth Kumar.Avulapti

1 Associate Professor, 2 Research Scholar, Dept. of Computer Science,

3 Associate Professor, Dept. of Seri-Bio Sciences, SPMVV, Tirupati

4 Director, S.V.U.Computer Center S.V.University, Tirupati

5 Research Scholar, Dept of Computer Science ,S.V.University, Tirupati

Abstract - The Widespread of Insect Vector Diseases to humans is causing substantial morbidity and economic loss to our nation. The year 2006 is likely to go down as one of the worst years in terms of public health, which has witnessed a high incidence of Insect Vector Diseases such as Malaria, Chikungunya, Dengue, Lymphatic Filariasis, And Japanese Encephalitis. This stressed the need to track the relevant information about these diseases. The reliable and quickly retrievable clinical data on disease wise is a need of the hour with which planners can prepare their strategies to control and curb the diseases. From the aforesaid point of view this particular data warehouse (DWH) going to be handy to the planners.

Key Words: Insect Vector diseases, Chikungunya, Malaria, Dengue, Lymphatic Filariasis & Japanese Encephalitis, Clinical data, Data warehouse

38. Paper 31071091: Development of an Expert System for Diagnosis and appropriate Medical Prescription of Heart Disease Using SVM and RBF (pp. 245-254)

Full Text: PDF

Shaikh Abdul Hannan , Lecturer, Department of Computer Science, Vivekanand College, Aurangabad, Maharashtra, India,

V. D. Bhagile, Lecturer, Department of Computer Science, Sayali College, Aurangabad, Maharashtra, India.

R. R. Manza, Lecturer, Dept. of Comp. Science and I.T. Dr. B.A.M.University, Aurangabad, Maharashtra

R. J. Ramteke, Reader, Dept. of Computer Science, North Maharashtra University, Jalgaon, Maharashtra

Abstract- Human disease diagnosis is a complicated process and requires high level of expertise. Any attempt of developing a expert system dealing with human disease diagnosis has to overcome various difficulties. This paper describes a project work aiming to develop a expert system for diagnosing of heart disease using neural network technique. Now a days neural network are being used successfully in an increasing number of application areas. This project includes the detailed information about patient and preprocessing was done. The Support Vector Machine (SVM) and Radial Basis Function (RBF) have been applied over the data for the experiment. This research project focuses on the research and development of a web-based clinical tool designed to improve the quality of the exchange of health information between health care professionals and patients. Practitioners can also use this web-based tool to corroborate diagnosis. The proposed system is experimented on various scenarios in order to evaluate it’s performance. In all the cases, proposed system exhibits satisfactory results.

Keywords – Neural Network, Support Vector Machine (SVM),RBF (Radial Basis Function), Symptoms, Medicine.

39. Paper 27071035: A Novel Approach for Cardiac Disease Prediction and Classification Using Intelligent Agents (pp. 255-262)

Full Text: PDF

Murugesan Kuttikrishnan Department of Computer Science and Engineering, Anna University, Chennai, India.

Manjula Dhanabalachandran Department of Computer Science and Engineering, Anna University, Chennai, India.

Abstract— The goal is to develop a novel approach for cardiac disease prediction and diagnosis using intelligent agents. Initially the symptoms are preprocessed using filter and wrapper based agents. The filter removes the missing or irrelevant symptoms. Wrapper is used to extract the data in the data set according to the threshold limits. The classification is based on the prior and posterior probability of the symptoms with the evidence value. Finally the symptoms are classified in to five classes namely absence, starting, mild, moderate, serious. Using the cooperative approach the cardiac problem is solved and verified.

Keywords- Traditional Chinese Medicine (TCM), Naïve Bayesian Classification (NBC), Bayesian Networks (BN).

40. Paper: Document Image Segmentation Based On Gray Level Co- Occurrence Matrices and Feed Forward Neural Network (pp. 263-268)

Full Text: PDF

S. Audithan, Research Scholar, Dept of CSE, Annamalai University, Annamalai NagarTamil Nadu, India

Dr. RM. Chandrasekaran, Professor, Dept of CSE, Annamalai University, Annamalai Nagar Tamil Nadu, India

Abstract — This paper presents a new method for extracting text region from the document images employing the combination of gray level co-occurrence matrices (GLCM) and artificial neural networks (ANN). We used GLCM features quantitatively to evaluate textural parameters and representations and to determine which parameter values and representations are best for extracting text region. The detection of text region is achieved by extracting the statistical features from the GLCM of the document image and these features are used as an input of neural network for classification. Experimental results show that our method gives better text extraction than other methods.

Keywords-component; Document segmentation, GLCM, ANN, Haralick features