i-manager's Journal on Software Engineering (JSE)


Volume 6 Issue 2 October - December 2011

Article

Component Based Software Development Models: A Comparative View

Ravneet Kaur Grewal* , Shivani Goel**
* Software Developer, SAP, Trident, Ludhiana.
** Assistant Professor, CSED, Thapar University, Patiala, India.
Ravneet Kaur Grewal and Shivani Goel (2011). Component Based Software Development Models: A Comparative View. i-manager’s Journal on Software Engineering, 6(2), 1-5. https://doi.org/10.26634/jse.6.2.1692

Abstract

Component Based Software Development is a development paradigm by assembling software systems from a number of components. This approach promises high quality, low budget software with shorter time to market. Software development process models used for writing the traditional programs cannot be used for assembling the application using reusable components. The traditional models need new methodologies to support component — based development. Many component based software development models have been proposed by researchers. This paper discusses the advantages and limitations of current models for developing component based systems.

Article

Design of New Mesh Based Multicast Routing in Dynamically Reconfigured Wireless Network

R. Kalaimagal*
Assistant Professor, Department of Computer Science, Government Arts College, Chennai, Tamilnadu, India.
R. Kalai Magal (2011). Design of New Mesh Based Multicast Routing in Dynamically Reconfigured Wireless Network. i-manager’s Journal on Software Engineering, 6(2), 6-8. https://doi.org/10.26634/jse.6.2.2891

Abstract

Multicasting is one of the most needed field in networking. Technology of this routing is widely used in application of internet. For example Video conferencing, Disaster recovery to distribute collaborative computing etc. In this article, design a new mesh based multicast routing protocol for dynamically reconfigured wireless network is discussed. DVMRP in wireless networks causes un-controlled overhead problem. To Overcome this problem new mesh based on demand routing protocol is designed.

Research Paper

Motion Detection Webcam Using Color Contrast

Mohammed Imad Abdulsattar Aal-Nouman*
Department of Information and Communications, College of Information Engineering, Nahrian University, Iraq-Baghdad.
Mohammed Imad Abdulsattar Aal-Nouman (2011). Motion Detection Webcam using Color Contrast. i-manager’s Journal on Software Engineering, 6(2), 9-14. https://doi.org/10.26634/jse.6.2.2892

Abstract

There are two reasons for creating a motion detecting algorithm; either the result is intended for technical applications, or it is intended as a biological model. Depending on which of these two goals one has in mind, the outcome will be different. For a technical application, speed and reliability are crucial aspects. For biological models, the focus is not so much on speed as on biological realism [2]. The model presented in this paper belongs to technical application so the resolution considerations have not been taken into account. Even so the system has a resolution up to 640 x 480. The proposed project in this paper uses a webcam to record the video stream, take a snap shot - if there is a movement- and then send it to the user's email. The motion detection can be found by calculating the difference in picture color with the next picture for each pixel.

Research Paper

Automatic Color and Shape Based Reassembly of Fragmented Images

T. Rani Mangammal* , G. Prema Priya**
* M.E Student, CSE, Sri Shakthi Institute of Engineering and Technology, Anna University, Coimbatore.
** Assistant Professor, CSE, Sri Shakthi Institute of Engineering and Technology, Anna University, Coimbatore.
T. Rani Mangammal and G. Prema Priya (2011). Automatic Color And Shape Based Reassembly Of Fragmented Images. i-manager’s Journal on Software Engineering, 6(2),15-19. https://doi.org/10.26634/jse.6.2.2893

Abstract

The manual execution of reassembling a fragmented image is very difficult and it requires great amount of time. To overcome this difficulty a new technique was introduced in the existing system called “The novel integrated color based image fragments reassembly technique”. This technique is divided into four steps, which is based on color. Initially, the spatial adjacent image fragment is discovered. The second operation is to discovery of matching contour segments of adjacent image fragments. The next step is to find the appropriate geometrical transformation for an image fragments contour alignment. Finally the overall image assembly is done via novel based algorithms. Still it requires more time to assemble the fragment images. In this proposed system, the same reassembly technique is applied but additionally the shape alignment algorithm is used to utilize the shape of the fragment contours in order to perform matching. This will produce very satisfactory reassembly results and also it can lead to more efficient, significant reduction in human effort.

Research Paper

Fuzzy Entropic Thresholding Using Gray Level Spatial Correlation Histogram

M. Seetharama Prasad* , C. Naga Raju**, L. S. S. Reddy***
* Singhania University, Pacheri Bari, Rajasthan, India.
** LBR College of Engineering, Mylavaram, India.
*** LBR College of Engineering, Mylavaram, India.
M. Seetharama Prasad, C. Naga Raju and LSS. Reddy (2011). Fuzzy Entropic Thresholding Using Gray Level Spatial Correlation Histogram. i-manager’s Journal on Software Engineering, 6(2), 20-30. https://doi.org/10.26634/jse.6.2.2894

Abstract

Threshold based segmentation is a popular technique in the preprocessing phase of image processing applications. In Abutaleb's two dimensional entropy, it is combined with local properties of the image to compute the optimal threshold. Yang Xiao et al. simplification on this procedure worked well with the inclusion of spatial correlation features which reduces the time complexity of the methodology. Seetharama Prasad et al. improvised further in the process of obtaining the varying similarity measure. In this paper fuzzy membership degrees of gray values are employed for conditional probabilities of the image object and background in the computation of entropy criterion function with local properties of the image as spatial correlation parameters are used in the obtainment of optimal threshold of the image. For low contrast images contrast enhancement is assumed. Experimental results demonstrate a quantitative improvement against existing techniques by calculating the parameter efficiency η based on the misclassification error and variations in various yielding towards ground truth threshold on two dimensional histogram of image.

Research Paper

Automatic Recognition Of Activities In Smart Environment

L. Karthik* , A.C. Sumathi**
* M.E Student CSE, Sri Shakthi Institute of Engineering and Technology, Anna University, Coimbatore.
**Assistant Professor, Department of CSE, Sri Shakthi Institute of Engineering and Technology, Anna University, Coimbatore.
L. Karthika and A.C. Sumathi (2011). Automatic Recognition Of Activities In Smart Environment. i-manager’s Journal on Software Engineering, 6(2), 31-35. https://doi.org/10.26634/jse.6.2.2895

Abstract

Recent advancements in machine learning caused interest in the development of smart environments to emerge and assist with valuable functions such as activity monitoring and intervention. In order to monitor the activities of smart home residents, there is a need of designing technologies that recognize and track the activities that people perform at home. Machine learning techniques can perform this task, but the software algorithms rely upon large amounts of sample data that is correctly matched with the corresponding activity. The data stream captured by recording inhabitant-device interactions in an environment can be mined to discover significant patterns, which an intelligent agent could use to automate device interactions. For this, an automated approach is proposed for activity tracking that identifies frequent activities that naturally occur in an individual's routines. With this capability, the occurrences of regular activities are monitored and also can detect the changes in an individual's patterns.

Research Paper

A Multi-Hop Wireless Multicast Broadcast Service Using An Adaptive Network Code

Yuvaraj N* , Kalaiselvi R**
* M.E Student, CSE, Sri Shakthi Institute of Engineering and Technology, Anna University, Coimbatore.
** Assistant Professor, CSE, Sri Shakthi Institute of Engineering and Technology, Anna University, Coimbatore.
Yuvaraj, N., and Kalaiselvi, R. (2011). A Multi-Hop Wireless Multicast Broadcast Service Using An Adaptive Network Code. i-manager’s Journal on Software Engineering, 6(2),36-40. https://doi.org/10.26634/jse.6.2.2896

Abstract

Network coding has recently attracted attention as a substantial improvement to packet retransmission schemes in wireless multicast broadcast services (MBS). In this paper, it is concentrating on increasing the efficiency of bandwidth and reducing the retransmission of packets on wireless multicast broadcast services. In the existing system they used three main schemes: ONCR (Opportunistic network coding retransmission), FNCR (Full network coding retransmission) and ANCR (Adaptive network coding retransmission). First two schemes are not efficient because, in ONCR it will transmit the packets which are not intent to the receiver. In FNCR, it decreases the bandwidth efficiency because of retransmitting all the packets in addition with the required packets. In order to overcome the above drawbacks, Adaptive network coded schemes are used to improve the bandwidth efficiency in MBS using a combination of opportunistic and full network coded retransmission. It can be applied for the single-hop wireless broadcast services. In the proposing system, this transmission scheme is applied for the multi-hop wireless broadcast service. It has the advantage of more effective bandwidth usage and reducing the retransmission.

Research Paper

Intrusion Response System for Relational Database To Avoid Anomalous Request

Akila L* , Deviselvam**
* M.E Student, CSE, Sri Shakthi Institute of Engineering and Technology, Anna University, Coimbatore.
** Assistant Professor, CSE, Sri Shakthi Institute of Engineering and Technology, Anna University, Coimbatore.
Akila L., and Deviselvam (2011). Intrusion Response System for Relational Database to Avoid Anomalous Request. i-manager’s Journal on Software Engineering, 6(2), 41-45. https://doi.org/10.26634/jse.6.2.2897

Abstract

The intrusion response component of an overall intrusion detection system is responsible for issuing a suitable response to an anomalous request. In the existing system, Intrusion Detection mechanism consists of two main elements, specifically tailored to a DBMS: Anomaly Detection (AD) system and an anomaly response system. In anomaly response system conservative actions, fine-grained actions, and aggressive actions methods are used. The proposed system mainly concentrates on response policies by using policy matching and policy administration. For the policy matching problem, The authors propose two algorithms that efficiently search the policy database for policies that match an anomalous request. They also extend the PostgreSQL DBMS with our policy matching mechanism, and report experimental results. The other issue that we address is that of administration of response policies to prevent malicious modifications to policy objects from legitimate users. They propose a novel Joint Threshold Administration Model (JTAM) that is based on the principle of separation of duty. The key idea in JTAM is that a policy object is jointly administered by at least k database administrator (DBAs), that is, any modification made to a policy object will be invalid unless it has been authorized by at least k DBAs out of L. They present design details of JTAM which is based on a cryptographic threshold signature scheme, and show how JTAM prevents malicious modifications to policy objects from authorized users.

Research Paper

Minimizing Navigation Cost Using Opt-Edgecut Algorithm

Tamilanban R* , M. Ramkumar**
Tamilanban R and M. Ramkumar (2011). Minimizing Navigation Cost Using Opt-Edgecut Algorithm. i-manager’s Journal on Software Engineering, 6(2), 46-52. https://doi.org/10.26634/jse.6.2.2898

Abstract

Search queries on large databases, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization, which can also be combined, have been proposed to alleviate this information overload problem. Results categorization of large databases is the main focus of this work. A natural way to organize biomedical citations is according to their MeSH annotations. MeSH is a comprehensive concept hierarchy used by PubMed. In this paper, the authors present the BioNav system, a novel search interface that enables the user to navigate large number of query results by organizing them using the MeSH concept hierarchy. First, the query results are organized into a navigation tree. At each node expansion step, BioNav reveals only a small subset of the concept nodes, selected such that the expected user navigation cost is minimized. In contrast, previous works expand the hierarchy in a predefined static manner, without navigation cost modeling. They shows that the problem of selecting the best concepts to reveal at each node expansion is NP-complete and propose an efficient heuristic as well as a feasible optimal algorithm for relatively small trees. They shows experimentally that BioNav outperforms state-of-the-art categorization systems by up to an order of magnitude, with respect to the user navigation cost. The Medline dataset are retrieved from US National library of Medicine.