International Journal of Emerging Trends in Computing and Information Sciences (E-ISSN 2218-6301/ ISSN 2079-8407) is an International refereed research publishing journal with a focused aim of promoting and publishing original high quality research dealing with theoretical and scientific aspects in all disciplines of Computing and Information Sciences. http://cisjournal.org/Research_Volumes.aspx http://blogs.law.harvard.edu/tech/rss Sat, 14 May 2011 21:10:54 +0500 Sat, 14 May 2011 21:10:04 +0500 FeedForAll v2.0 (2.0.3.1) unlicensed version http://www.feedforall.com Research Volumes http://cisjournal.org/Research_Volumes.aspx 39819CC0-1C37-4261-9E44-B85455306954 Sat, 14 May 2011 21:10:04 +0500 The paper presents fraud detection method to predict and analyze fraud patterns from data. To generate classifiers, we apply the Naïve Bayesian Classification, and Decision Tree-Based algorithms. A brief description of the algorithm is provided along with its application in detecting fraud. The same data is used for both the techniques. We analyze and interpret the classifier predictions. The model prediction is supported by Bayesian Naïve Visualization, Decision Tree visualization, and Rule-Based Classification. We evaluate techniques to solve fraud detection in automobile insurance. http://www.cisjournal.org/archive/vol2no4/vol2no4_1.pdf 99FB0BF7-F707-4B96-858A-CFB79A6165B2 Sat, 14 May 2011 21:10:05 +0500 This paper focuses on the implications of employing CORBA Middleware in today’s wireless telecommunications services and applications developments. It seeks to understand what current opportunities exist to support the use of this technology and assesses some of the performance implications that might be encountered. Discussion also revolves around the use of Component Oriented Development techniques in this same vertical and observations are made as to the benefits and practical problems associated with pursuit of this methodology in wireless telecommunications development programmes. Interest in this topic was aroused after observing the continued development of wireless telecommunications technology (Third Generation - 3G) that allows users to maintain permanent but connectionless contact with more traditional Wide Area Network (WAN) & Local Area Network (LAN) based services. As the boundaries between cellular, wireless LAN and traditional fixed network technologies become increasingly blurred, trends are emerging that seek to extend and migrate the technologies that are currently employed on cabled and wireless LAN networks over to the cellular networks and mass market user equipment. http://cisjournal.org/archive/vol2no4/vol2no4_2.pdf 6AE7AB4D-3EC0-45AB-8171-0E05906F87F2 Sat, 14 May 2011 21:10:06 +0500 It took Norwegian police thirty-two years to capture the Pocket Man who was responsible for more than hundred sexual abuses over that same time period. This article presents a study police investigations of the abuses by applying the value shop configuration. Primary activities in the value shop are (i) problem definition; (ii) investigation steps; (iii) investigation decision; (iv) investigation implementation; and (v) police performance evaluation. As discussed in this article, each value shop activity had serious deficiencies in the investigations of Pocket Man cases. http://cisjournal.org/archive/vol2no4/vol2no4_3.pdf 270020F7-8A25-4586-AEB0-AB20396466C0 Sat, 14 May 2011 21:10:07 +0500 To detect and track eye images with complex background, distinctive features of user eye are used. Generally, an eye-tracking and detection system can be divided into four steps: Face detection, eye region detection, pupil detection and eye tracking. To find the position of pupil, first, face region must be separated from the rest of the image, this will cause the images background to be non effective in our next steps. We used the horizontal projection obtained from face region, to separate a region of face containing eyes and eyebrow. This will result in decreasing the computational complexity and ignoring some factors such as bread. Finally, by proposed algorithm we will obtain the pupil position. In the next step, we perform eye tracking. In the proposed method, eye detection and tracking are applied on testing sets, gathered from different images of face data with complex backgrounds. Experiments indicate correct detection rate of 94.9%, which is indicative of the method’s superiority and high robustness. http://cisjournal.org/archive/vol2no4/vol2no4_4.pdf 8DD22E6F-52C6-47C4-8082-8A0F65D02FE0 Sat, 14 May 2011 21:10:08 +0500 We propose a self-stabilizing leader election algorithm that can tolerate multiple concurrent topological changes. By introducing the time interval based computation concept, the algorithm ensures that a network partition within a finite time converge to a legitimate state even if topological changes occur during the convergence time. An ad hoc network is a collection of mobile nodes forming a temporary network without any form of centralized administration or predefined infrastructure. In such a network, each node participating in the network acts as both a host and a router. Two nodes can communicate if they are within the transmission range of each other. Due to node mobility, link breakages and link formations might occur frequently. The failure of some links considered as critical and can split up the network into several disjoint network components. In addition, multiple components can also merge into a single connected component. In this paper we have investigated the functional system with the proposed algorithm and how it monitors the mobile non static hosts and the transmission process between them. http://cisjournal.org/archive/vol2no4/vol2no4_5.pdf AD28A980-9ADC-453F-8C9C-2416AC1A5D79 Sat, 14 May 2011 21:10:09 +0500 Clustering is a process of discovering group of objects such that the objects of the same group are similar, and objects belonging to different groups are dissimilar. A number of clustering algorithms exist that can solve the problem of clustering, but most of them are very sensitive to their input parameters. Minimum Spanning Tree clustering algorithm is capable of detecting clusters with irregular boundaries. Detecting outlier in database (as unusual objects) is a big desire. In data mining detection of anomalous pattern in data is more interesting than detecting inliers. In this paper we propose a Minimum Spanning Tree based clustering algorithm for noise-free or pure clusters. The algorithm constructs hierarchy from top to bottom. At each hierarchical level, it optimizes the number of cluster, from which the proper hierarchical structure of underlying data set can be found. The algorithm uses a new cluster validation criterion based on the geometric property of data partition of the data set in order to find the proper number of clusters at each level. The algorithm works in two phases. The first phase of the algorithm create clusters with guaranteed intra-cluster similarity, where as the second phase of the algorithm create dendrogram using the clusters as objects with guaranteed inter-cluster similarity. The first phase of the algorithm uses divisive approach, where as the second phase uses agglomerative approach. In this paper we used both the approaches in the algorithm to find Best number of Meta similarity clusters. http://cisjournal.org/archive/vol2no4/vol2no4_6.pdf 0E75840F-F0CC-40A3-AE41-4B7D408D7F9E Sat, 14 May 2011 21:10:10 +0500 In the last decade, empirical studies on object-oriented design metrics have shown some of them to be useful for predicting the faults-proneness of classes in object-oriented software systems. It would be valuable to know how object-oriented design metrics and class fault-proneness are related when fault severity is taken into account. In this paper we use logistic regression and principal component methods to empirically investigate the usefulness of object-oriented design metrics, specially a subset of the Chidamber and Kemerer suite in predicting fault-proneness when taking fault severity into account. In the era of Object Oriented software metrics demand for quality software has undergone with rapid growth during the last few years. This is leading to an increase in the development of metrics for measuring the properties of software such as coupling, cohesion and inheritance that can be used in early Quality assessments. Much effort has been developed to the development and empirical validation of software metrics. Quality models that explore the relationship between these properties and quality attributes such as fault proneness, maintainability, effort or productivity are needed to use these metrics effectively. The goal of this work is to empirically explore the relationship between Object Oriented Design Metrics and Fault Proneness of object oriented system classes. The object oriented spatial complexity measures proposed in literature were formulated by keeping C++ language in mind, and there were no spatial complexity measures available for the Java language. Keeping in view the increasing popularity of Java, this paper attempts to define the spatial complexity measures for Java applications. Our results are based on Open Source Java Projects and Post Graduate Engineering student’s projects. We are empirically analyzed and tested with our Software Tool. http://cisjournal.org/archive/vol2no4/vol2no4_7.pdf 4E56F147-67D1-4699-98B2-F623A9DF5660 Sat, 14 May 2011 21:10:11 +0500