IJCST Logo

 

INTERNATIONAL JOURNAL OF COMPUTER SCIENCE & TECHNOLOGY (IJCST)-VOL III ISSUE III, VER. 1, JULY TO SEPTEMBER, 2012


International Journal of Computer Science and Technology Vol. 3 Issue 3, Ver. 1
S.No. Research Topic Paper ID
   1 Leveraging Information Technology to Stimulate Social Entrepreneurship among the Underprivileged Community

Dr. Ridwan Sanjaya, Dr. Rustina Untari, Tjahjono Rahardjo

Abstract

Information Technology is often associated with the modern and sophisticated things where the most users are usually related with good financial means. Not surprisingly, most success stories on the utilization of Information Technology mostly come from those people who are able to use high-tech devices. For the poor, the gadget and internet usage is still a luxury and requires an additional expenditure beyond their basic necessities. However, the poor should be able to enhance their financial opportunities if the university can recommend the appropriate information technology to them. The technology does not always mean high-tech and expensive. The effectiveness in the Information Technology usage could be learnt by the student and lecturer before they do the community service to obtain the optimum benefit for good impact for their economic welfare. Unfortunately, most of the community service programs are often associated with the only basic needs of the community and the greater potential of information technology is never introduced by the university students and lecturers. This paper will describe a strategy to encourage university’s Social Entrepreneurship to empower underprivileged communities by leveraging Information Technology, as part of the implementation of university’s awareness which should combines the academic advancement and concern for poverty. The expected final result of the proposed social entrepreneurship is to establish financial independence among the poor and their neighborhoods.
Full Paper

IJCST/33/1/
A-853
   2 Trust and Reputation Model Based on Causal Induction Method

Lourembam Suraj Singh, Heisnam Rohen Singh, Arambam Neelima, Sarangthem Ibotombi Singh

Abstract

Trust is an important concept that acts as the building block for successful interaction of any social network. Without trust, it will be difficult to achieve efficient and comfortable interactions among the users. For this reason, trust and reputation have been incorporated in many web services. Nowadays, many web services have become user centric with independent interoperability. This trend requires that interpersonal trust should be examined and maintained. The purpose of this paper is to present an agent based model based on the causal induction method to evaluate the interpersonal trust among the users. In this model, we will try to evaluate how much ‘A’ trust ‘B’ based on their past experience and information from other cliques. One important property of trust is that users prefer recommendations from their trusted cliques than recommendation from unknown source. Thus the closeness of the relationship also plays an important role in shaping the decision of users. To our best knowledge, this work is first to apply causal induction method in building a trust model of online social networks.
Full Paper

IJCST/33/1/
A-854
   3 Some Results on Derivatives of Generalized Modified Baskakov Type Operators (C)

Dr. R. P. Pathak, Shiv Kumar Sahoo

Abstract

Recently Deo N.et.al. (Appl. Maths. Compt., 201(2008), 604-612.) Introduced a new Bernstein type special operators. Motivated by Deo N.et.al., in this paper we introduce generalization of modified Baskakov type positive linear operators (4) which is generator of positive linear operators (6) and (7) .We shall study some approximation results on it.
Full Paper

IJCST/33/1/
A-855
   4 Job Satisfaction Model for the Teaching Employees in Academic Institutes Using Expert System

Dr. Mahesh C. Dabre, Pankaj K. Bharne, Sandip D. Phuse

Abstract

The success of the educational system depends upon the involvement, effort and the contribution of the academic staff or their professional expertise. Job satisfaction causes a series of influences on various aspects of organizational life. The purpose of this model is to investigate the levels of job satisfaction among engineering faculty members in the engineering colleges of Sant Gadge Baba Amravati University, Amravati. This proposed also gives suggestions to maintain or improve faculty members’ job satisfaction level. Our proposed model uses Expert system that provides the solution for Job satisfaction with Human Computer Interaction (HCI) by using a Chatterbot Like application. By using this application any Organization easily measures the feedback from employees and provides the better Job satisfaction to their employees. It helps the organization for achieving their goal of business with good ROI.
Full Paper

IJCST/33/1/
A-856
   5 A Design Approach to Rudder Controller

Dr. S. A. Hariprasad, Pampapathi, Vijay Singh, Dr. Krishna, Sharath. K, T. D. Shashikala

Abstract

The design of a rudder controller for autonomous ship is a challenging task. Designer has to consider various parameters like ship dynamics, sea dynamics as well as the type of control mechanism. Researchers have come up with various ship models, sea models and different control algorithms in order to improve the performance of track keeping. This paper discusses the most widely used Autonomous ship models like Nomoto, Pierson- Markowitz (P-M) model and predictive controllers in detail with MATLAB simulated results.
Full Paper

IJCST/33/1/
A-857
   6 A Proposal and Implementation of a Neural Network Based Hierarchical Temporal Memory to Realize Cognitive Functions

Rajesh Babu, Dr. Jitendra Kumar

Abstract

Hierarchical Temporal Memory (HTM) is a recent innovation in cognition science. Developed in 2005 by Numenta Inc., an artificial intelligence research firm in the US, HTMs attempt to capture the way the human brain learns and infers its environment. One of the most notable characteristics of this model is the consideration of the hierarchical organization of objects in the world. Data in the world is made up of elementary features that aggregate in successive layers to form perceivable objects. This data can be visual, auditory or from other abstract spaces such as stock markets and scientific studies. The amount of raw data that the brain is exposed to throughout its lifetime is beyond imagination. However the brain is known to use a very noble and systematic approach to handle the perception, storage, and inference of this data. Several studies in neuroscience and psychology indicate that the brain makes use of the hierarchies that features in the world exhibit in their organization to form objects. Hence, for instance, ‘corners’ and ‘lines’ can aggregate to form a ‘table’ object in the visual world. These elementary features, however, can use a different aggregation to form a ‘chair’ object. The same is true for data in other types of worlds such as audio. HTMs directly apply a similar handling of world data for their cognition. Furthermore, the structure of HTMs, made up of data processing nodes arranged in a hierarchical tree, mimic the physical arrangement of cortical layers in the brain.
Full Paper

IJCST/33/1/
A-858
   7 Data Cleaning: A Framework for Robust Data Quality In Enterprise Data Warehouse

Chinta Someswara Rao, J Rajanikanth, V Chandra Sekhar, Dr. Bhadri Raju MSVS

Abstract

Now a day’s every second trillion of bytes of data is being generated by enterprises especially in internet. To achieve level best decision for business profits, access to that data in a well-situated and interactive way is always a dream of business executives and managers. Data warehouse is the only viable solution that can bring that dream into reality. The enhancement of future endeavors to make decisions depends on the availability of correct information that is based on quality of data underlying. The quality data can only be produced by cleaning data prior to loading into data warehouse since the data collected from different sources will be dirty. Once the data have been cleaned it will produce accurate results when the data mining query is applied. So correctness of data is essential for well-formed and reliable decision making. In this paper we propose a framework which implements robust data quality to ensure consistent and correct loading of data into data warehouses that is necessary to disciplined, accurate and reliable data analysis, data mining and knowledge discovery.
Full Paper

IJCST/33/1/
A-859
   8 Virtual Remote Display Mechanisms of Cloud Applications on Mobile Environment

Maddali M. V. M. Kumar, Y. Chittibabu, Dr. P. Harini

Abstract

Mobile Cloud Computing is the emerging area with the usage of Cloud Computing in combination with mobile devices. Although they suffer from essential resource limitations, mobile devices have becom-e very popular. Mobile cloud computing provides a solution to meet the accumulative functionality demands of endusers, as all application logic is executed on distant servers and only user interface functionalities reside on the mobile device. A virtual network computing based architecture for accessing the desktops of remote computers from a cellular phone. A viewer is provided on the cellular phone that enables the user to see and manipulate the desktop of various remote systems such as Windows and UNIX. The mobile device acts as a remote display, capturing user input and rendering the display updates received from the distant server. Varying wireless channel conditions, short battery lifetime and communication latency present major challenges for the remote display of cloud applications on mobile devices. In this paper, we deliberate a number of adequate solutions that have recently been proposed to tackle the main disputes associated with the remote display of cloud services on mobile devices.
Full Paper

IJCST/33/1/
A-860
   9 Parallel Algorithms for String Matching Problem Baesd on Butterfly Model

K K V V V S Reddy, Dr. S. Viswanadha Raju, Chinta Someswara Rao, K Butchi Raju

Abstract

The string matching problem is one of the most studied problems in computer science. While it is very easily stated and many of the simple algorithms perform very well in practice, numerous works have been published on the subject and research is still very active. In this paper we propose a butterfly parallel computing model for parallel string matching. Experimental results show that, on a multi-processor system, the butterfly model implementation of the proposed parallel string matching algorithm can reduce string matching time by more than 40%.
Full Paper

IJCST/33/1/
A-861
   10 Random Routing Algorithm for Secured Data Collection Accessed in Wireless Sensor Networks

Dr. S. Tamilarasan

Abstract

We can send secured data from sender to destination; it is possible through Wireless Sensor Networks with network monitoring data on a host, they can used to detect compromised node and denialof- service is two key attacks. In this article, we studied and present four “Multi-path randomized routing Algorithm” a method to send the data multiple ways to classify the data in to normal and attacks in wireless sensor networks. The Pure Random Propagation shares are propagated based on one-hop neighborhood information, sink TTL initial value N in each share and remaining algorithms improve the efficiency of shares based on using two-hop neighborhood information. Our work studies the best algorithm by detecting the comprised nodes with black holes and denial of service in the packet information with Multipath routing algorithms that has not been used before. We analyses the algorithm that have the best efficiency and describes the proposed system.
Full Paper

IJCST/33/1/
A-862
   11 3G Mobile Wireless Communication: A Catalyst for Development of E-Commerce in India

Pradeep Kaur, Dr. Mukesh M Joshi

IJCST/33/1/
A-863
   12 Cloud Computing: A Review

Neeraj Chopra, Tanvir Singh, Amit Kumar

IJCST/33/1/
A-864
   13 Spreading and Investigation of Containment Worms

Mohammad Nazeer, Md. Shareef

Abstract

In this paper, we investigate a new class of active worms, referred to as Containment Worm (C-Worm in short). The C-Worm is different from traditional worms because of its ability to intelligently manipulate its scan traffic volume over time. Thereby, the C-Worm containments its propagation from existing worm detection systems based on analyzing the propagation traffic generated by worms. We analyze characteristics of the C-Worm and conduct a comprehensive comparison between its traffic and non-worm traffic (background traffic). We observe that these two types of traffic are barely distinguishable in the time domain. However, their distinction is clear in the frequency domain, due to the recurring manipulative nature of the C-Worm. Motivated by our observations, we design a novel spectrum-based scheme to detect the C-Worm. Our scheme uses the Power Spectral Density (PSD) distribution of the scan traffic volume and its corresponding Spectral Flatness Measure (SFM) to distinguish the C-Worm traffic from background traffic. Using a comprehensive set of detection metrics and real-world traces as background traffic, we conduct extensive performance evaluations on our proposed spectrum-based detection scheme. The performance data clearly demonstrates that our scheme can effectively detect the C-Worm propagation. Furthermore, we show the generality of our spectrumbased scheme in effectively detecting not only the C-Worm, but traditional worms as well.
Full Paper

IJCST/33/1/
A-865
   14 AI and Skillful Systems in Reporting Informations: Study and Extensions

Naveen Kumar

Abstract

The purpose of this paper is to survey and extend the use of Artificial Intelligence and expert systems in accounting databases. The paper elicits a number of concerns often voiced about accounting databases. The use of Artificial Intelligence and expert system is investigated as a basis to mitigate those problems. The literature is surveyed and extended. Demons and objects are found to be useful devises to facilitate the organization, storage and application of intelligence for accounting database systems. Models for their use are presented.
Full Paper

IJCST/33/1/
A-866
   15 A Plan and Design to Achieve the State of Unacknowledgement and Obsoleteness in Wireless Mesh Networks

MD. Razia Sultana, B. Rajesh war Singh, M. Srinivas

Abstract

Anonymity is otherwise called as the state of being unacknowledged. It has received increasing attention in the literature due to the users’ awareness of their privacy nowadays. It provides security by providing protection for users to enjoy network services without being traced. The issues were mainly used in the field of ecommerce mainly in the peer to peer systems.Moreover the computer network authority requires conditional anonymity such that misbehaving entities in the network remain traceable. In this paper, we propose a security architecture to ensure unconditional anonymity for honest to trace out the unauthorized and legitimate users.This security architecture strives to resolve the conflicts between the anonymity and traceability objectives, in addition to guaranteeing fundamental security requirements including authentication, confidentiality, data integrity, and non repudiation. Thorough analysis on security and efficiency is incorporated, demonstrating the feasibility and effectiveness of the proposed architecture.
Full Paper

IJCST/33/1/
A-867
   16 From Cause to Effect: An Empirical Study of Cause – Effect Graphing Testing Techniques and Its Test-Measurement: A Review

Jawahar Lal, Satinder Singh

Abstract

This paper discusses a review on Empirical Investigation of Cause-Effect Graphing Testing Techniques and Its Test- Measurements. A Cause-Effect Graph in Software Testing has been defined as: “It is a directed Graph that maps a set of causes to a set of effects. The Causes may be thought of as input and the effect is thought of as the output”. Usually the graph shows the nodes representing the causes on the left hand side and the nodes representing the effects on the right hand side. There may be intermediate nodes in between that combine inputs using logical operators such as AND, OR, Not etc.
Full Paper

IJCST/33/1/
A-868
   17 Supporting Efficient and Scalable Multicasting over Mobile Ad-Hoc Networks

D. Prasad, Syedauzma, A. Simhadri babu

Abstract

Group communications are important in Mobile Ad-Hoc Networks (MANET). Multicast is an efficient method for implementing group communications. However, it is challenging to implement efficient and scalable multicast in MANET due to the difficulty in group membership management and multicast packet forwarding over a dynamic topology. We propose a novel Efficient Geographic Multicast Protocol (EGMP). EGMP uses a virtual-zone-based structure to implement scalable and efficient group membership management. A network-wide zone-based bi-directional tree is constructed to achieve more efficient membership management and multicast delivery. The position information is used to guide the zone structure building, multicast tree construction and multicast packet forwarding, which efficiently reduces the overhead for route searching and tree structure maintenance. Several strategies have been proposed to further improve the efficiency of the protocol, for example, introducing the concept of zone depth for building an optimal tree structure and integrating the location search of group members with the hierarchical group membership management. Finally, we design a scheme to handle empty zone problem faced by most routing protocols using a zone structure. The scalability and the efficiency of EGMP are evaluated through simulations and quantitative analysis. Our simulation results demonstrate that EGMP has high packet delivery ratio, and low control overhead and multicast group joining delay under all test scenarios, and is scalable to both group size and network size. Compared to Scalable Position-Based Multicast (SPBM), EGMP has significantly lower control overhead, data transmission overhead, and multicast group joining delay.
Full Paper

IJCST/33/1/
A-869
   18 The Implementation of An Object-Oriented Database to Analyze Concurrent Engineering

Amit Ahuja

Abstract

In this paper, we discuss the requirements and design of a Database that can be used to support a Concurrent Engineering (CE) philosophy. We identify three fundamental support services that are of use in a concurrent engineering environment: distribution support, computer supported co-operative working support and database support. These requirements are modeled and applied in conjunction with the design and implementation of a concurrent engineering support Database.
Full Paper

IJCST/33/1/
A-870
   19 Genetic Algorithm Based Call Drop Reduction Model During Handoff in Mobile Communication

Kaushlendra Singh Chauhan, Anu Sharma

Abstract

This paper highlights the potential of using genetic algorithms to solve cellular resource allocation problems. Generally, cellular resource allocation deals with how and when to allocate radio frequency channels to mobile hosts. The algorithm exploits the potential of genetic algorithm to design a fault-tolerant cellular resource allocation model. In some cases the load over a single cell is increased, so it needs more channels than it actually has to minimize the traffic problem and the number of the blocked hosts. On the other hand it is possible that the load on a cell is less than its channel capacity, so there is wastage of channels. We solved this problem by taking the extra channels from the cells that have a less load and allocate it to the cells that have an over load, temporarily. The algorithm is also solved the problem of handover using reserved channel technique, so we implement the dynamic channel allocation using genetic algorithm to minimize the number of blocked hosts and the handoff failures (as a part of the blocked hosts) in the mobile computing network system.
Full Paper

IJCST/33/1/
A-871
   20 Multi-Decision Tree Classification in Master Data Management System

V. Geetha, S. Jessica Saritha

Abstract

To be more conceptual, the basic idea is to provide the simplified decision tree ID3 algorithm. It overcomes the existing bias of ID3 (Iterative Dichotomiser 3) algorithm A multi-decision tree classifier were constituted by combining AdaBoost and improved ID3 algorithm. The master data management system is an application we use, it greatly reduces the manual labor by grouping the redundant data together and also it saves the consumption of human and material resources. The accuracy is better compared to the original decision tree.
Full Paper

IJCST/33/1/
A-872
   21 Wireless Telecommunication and Sensor Network Services

Nikhil Ranjan, Anuj Kumar Singh, Vibhor Sharma

Abstract

Wireless telecommunication is the transfer of information between two or more points that are not physically connected. Wireless operations permits services, such as a long range communications, that are impossible or impractical to implement with the use of wires. In this paper, we discuss about the wireless telecommunication systems, wireless networks, and its services along with its wireless sensor networks.
Full Paper

IJCST/33/1/
A-873
   22 An amplified Echo State Network for Nonlinear Adaptive Filtering of intricate Noncircular Signals

V. V. Durga Bhavani

Abstract

This combination of augmented intricate statistics and enhanced adaptively within ESNs also facilitates the processing of bivariate signals with strong component correlations. A narrative intricate Echo State Network (ESN), utilizing full second-order statistical information in the intricate domain, is introduced. This is achieved through the use of the so-called augmented intricate statistics, thus making intricate ESNs suitable for processing the generality of complex-valued signals, both second-order circular (proper) and noncircular (improper). Next, in order to deal with nonstationary processes with large nonlinear dynamics, a nonlinear readout layer is introduced and is further equipped with an adaptive amplitude of the nonlinearity. Simulations in the prediction setting on both circular and noncircular synthetic benchmark processes and realworld noncircular and nonstationary wind signals support the analysis.
Full Paper

IJCST/33/1/
A-874
   23 Data Compression on Group Movement Patterns

P Mahesh Kumar, M Jayapal, V Shiva Narayana Reddy, K Karthik, J Swathi

Abstract

In this work, we exploit the characteristics of group movements to discover the information about groups of moving objects in tracking applications. we first propose an efficient distributed mining algorithm to jointly identify a group of moving objects and discover their movement patterns in wireless sensor networks. With the discovered information, we propose a compression algorithm, called 2P2D algorithm, which exploits the obtained group movement patterns to reduce the amount of delivered data. The compression algorithm includes a sequence merge and an entropy reduction phases. In the sequence merge phase, we propose a Merge algorithm to merge and compress the location data of a group of moving objects. In the entropy reduction phase, we formulate a Hit Item Replacement (HIR) problem and propose a Replace algorithm that obtains the optimal solution. Moreover, we devise three replacement rules and derive the maximum compression ratio. Our experimental results show that the proposed compression algorithm effectively reduces the amount of delivered data and enhances compressibility and, by extension, reduces the energy consumption expense for data transmission in WSNs. We are using these algorithms to find out the performances on the bases on time complexity and space complexity by using visualization technique.
Full Paper

IJCST/33/1/
A-875
   24 Hierarchical Clustering Based Activity Tracking System in a Smart Environment

Amitha. R, K. Rajakumari

Abstract

The Healthcare industries have very great advantages of using a remote monitoring system. The machine learning and pervasive sensing technologies found in smart homes offer unprecedented opportunities for providing health monitoring and assistance to individuals experiencing difficulties living independently at home. In a smart home environment where the sensors are installed in important places. All the activity of the patients at home are monitored each and every second and that data is analyzed using the activity detection algorithm, which categorize the activities based on the set of records that are obtained from the sensor. When an abnormal activity is identified, then that information will be sent to the concerned care givers to get the immediate attention. Such cases like activities of the elderly people with Alzheimer’s diseases are monitored. The system can deduce what a person is doing and act appropriately. The different set of activities that are categorized into Models. The Computer system constructs and maintains a model describing the environment. In normal activity detection algorithm, each model is defined based on the inputs that are passed on regular intervals. But in this activity tracking and mining approach based on Hierarchical Agglomerative Clustering algorithm (HAC), so that no input is needed for the model selection and the accuracy can be improved for each model.
Full Paper

IJCST/33/1/
A-876
   25 Phishing Defense Mechanism

Ritika Arora, Sunny Behal

Abstract

Phishing is a significant problem involving fraudulent email and web sites that trick unsuspecting users into revealing private information. Phishing scams pose a serious threat to end users and commercial institutions alike. Email continues to be the favorite vehicle to inculcate such scams mainly due to ability to easily spoof them. Several approaches, both generic and specialized, have been proposed in the literature to address this issue .Phishing came into existence as nowdays people have very least knowledge about the security measures of and people get easily fool to phished site and all there information is lost.This paper covers the technologies and security flaws Phishers exploit to conduct their attacks, and rendered mechanism has been proposed in this paper which consist of various prevention and detection techniques.
Full Paper

IJCST/33/1/
A-877
   26 Energy Efficient Clustering Scheme with Multiple Mobile Base Station for Wireless Sensor Networks

Ashish Kumar Nayyar

Abstract

One major challenging issue in wireless sensor networks has been developing energy-efficient protocols. Clustering provides a way to extend the lifetime of a wireless network and at the same time adding multiple mobile base stations may lead to the development of energy-efficient and robust wireless sensor network. In this paper, I propose an energy-efficient and robust hybrid model that use Clustering scheme and deploys multiple base stations.
Full Paper

IJCST/33/1/
A-878
   27 Access Control for XML Messaging Systems using Web Services

Vinaya V, Praveen M. S, Pradeep G. S, Jeevan Vijay, Alok Ranjan

Abstract

Web services over the Internet are widely used nowadays. We describe the design of an Access Control System using Web Services for information and content management. XML is quickly emerging as the standard data format for Internet technology. It is also very popular for the broader range of component technologies. XML is a useful way to introduce structure into the body of HTTP requests. Here we described the solution for control mechanism of the information systems which have unique message id, requesting and giving permissions to different channels, and accessibility of the user to the specific channels by giving permissions to the user to use XML Messaging Systems using Web Services.
Full Paper

IJCST/33/1/
A-879
   28 An Approach for Text Detection in Images

Sandeep Sharma, Jai Prakash

Abstract

We present a novel text detection technique for the application of image in databases of consumer pictures and videos. Images are annotated using information only from the picture itself. It needs to be fast, efficient and robust in order to feed an OCR classifier with the correct input. In other words, segmented regions must correspond to the actual text. A lot of work has been done for detecting text in images and a lot has to be done. This paper gives detailed survey on image to text detection mechanism. This paper gives the description of work has been done for automatically detection of text from images, localize and extract horizontally aligned text in images (and digital videos) with complex backgrounds is presented.
Full Paper

IJCST/33/1/
A-880
   29 Clones: A Survey

Sonam Gupta, Dr. P. C Gupta

Abstract

Various types of clones are available in a code which ultimately leads to a redundant code. But every redundant code is not a clone. It can be thought of as a duplicate code which can be either duplicate or somewhat changed as duplicate. In this paper we have described various types of clones which include both similar and identical clones and their classifications in further sub categories.
Full Paper

IJCST/33/1/
A-881
   30 A Conceptual Approach of Data Warehouse Maintenance Systems using Materialized Data Mining Views

P. R. Vishwanath, Dr. Rajylakshmi, Dr. M. Sreedharreddy, Dr. P. V. Lakshmi

Abstract

Data mining, also referred to as database mining or Knowledge Discovery In Databases (KDD), aims at discovery of useful patterns from large databases or warehouses. Currently we are observing the evolution of data mining environments from specialized tools to multi-purpose data mining systems offering some level of integration with existing management systems. From a user’s point of view data mining can be seen as advanced querying a user specifies the source data set and the requested class of patterns, the system chooses the right data mining algorithm and returns discovered patterns to the user. The most serious problem concerning data mining queries is a long response time Current systems consume minutes or hours to answer simple queries. Another important feature of data mining is that it is an interactive and interactive process. Users very often periodically perform the same data mining tasks to get the up-to-date information. We claim that data mining systems should provide support for such repetitive queries. It is desirable to store the results of a data mining query that will be repeated after some changes to the database because there are known algorithms for incremental data mining. In this paper we propose using periodically refreshed Materialized Data Mining Views (MDMVs) for repetitive data mining queries in the same manner as materialized views are used in relations database management systems to store results of complex and time consuming queries. Benefits of using MDMVs to answer data mining quries where the query to be answered is the same as the query defining an existing MDMV are obvious. The question we try to answer in this paper is can we use MDMVs to efficiently answer a data mining query that is not equal but only similar to the query defining some MDMV? We consider two data mining queries similar, if they have the same scheme of source datasets and resulting patterns, and differ in selection predicates applied to the query on the source dataset and/or constraints concerning statistical strength and contents of patterns. the concept of MDMVs and their application in the discovery of frequent item sets and association rules. Since it is straightforward to generate association rules from frequent itemsets, we focus on the frequent itemsets only. We illustrate our optimization rules with any examples expressed in Mine SQL, which is a declarative, multi-purpose SQL-like language for interactive and iterative data mining in relations databases, developed by us over the last couple of years.
Full Paper

IJCST/33/1/
A-882
   31 Safety Measures For Achieving Anonymity and Traceability in Wireless Mesh Networks

V. Redya Jadav, N. S. S Durga Vanama

Abstract

Due to the users’ awareness of their privacy nowadays Anonymity has received increasing attention in the literature While anonymityrelated issues have been extensively studied in payment-based systems such as e-cash and peer-to-peer (P2P) systems, little effort has been devoted to wireless mesh networks (WMNs). Anonymity provides protection for users to enjoy network services without being traced. On the other hand, the network authority requires conditional anonymity such that misbehaving entities in the network remain traceable. In this paper, we propose a security architecture to ensure unconditional anonymity for honest users and traceability of misbehaving users for network authorities in WMNs. The proposed architecture strives to resolve the conflicts between the anonymity and traceability objectives, in addition to guaranteeing fundamental security requirements including authentication, confidentiality, data integrity, and non-repudiation. Thorough analysis on security and efficiency is incorporated, demonstrating the feasibility and effectiveness of the proposed architecture.
Full Paper

IJCST/33/1/
A-883
   32 Paper Removed Due to Copyright Issue
   33 Enterprise Resource Planning: Factors and Procedures that Leads to Success in Implementation

Richa Sharma

Abstract

Enterprise resource planning (ERP) systems are highly complex information systems. The implementation of these systems is a difficult and high cost proposition that places tremendous demands on corporate time and resources. Many ERP implementations have been classified as failures because they did not achieve predetermined corporate goals. This article identifies success factors, software selection steps, and implementation procedures critical to a successful implementation. A case study of a largely successful ERP implementation is presented and discussed in terms of these key factors.
Full Paper

IJCST/33/1/
A-885
   34 Scenarios for Leveraging Predicate Based Encryption (PBE) in the Cloud

S. Neelima, M. Padmavathi, Y. Lakshmi Prasanna

Abstract

Cloud computing has become one of the most significant data security issue in recent years. That is due to the dramatically emerging applications and required services of cloud computing. However, in order to safely utilize and enjoy the benefit of cloud computing through wired/wireless networking, sufficient assurance of data security such as confidentiality, authentication, nonrepudiation, and integrity is the most critical factor for adoption. Data that was once housed under the security domain of the service user has now been placed under the protection of the service provider. Users have lost control over the protection of their data. No longer is our data kept under our own watchful eyes. This paper explains how Predicate Based Encryption (PBE) could be leveraged within the Cloud to protect data. Five scenarios for using Predicate Based Encryption within the Cloud are presented. These scenarios differ in terms of mode of operation, predicate placement, and ownership over the Key Authority.
Full Paper

IJCST/33/1/
A-886
   35 Customer Segmentation in Online Electronic Retail Store based on Customer’s Expectations as Values using Social Media Analytics

Swetha S

Abstract

Customer segmentation for online electronic retail store is very important because the services are provided based on the customer segments generated. The improper customer segments force the online electronic retail store to service wrong customers. The traditional ways of customer segmentation like behavioral segmentation, demographic segmentation, and attitudinal segmentation have disadvantages because of which the customer segments are not much effective. Only with the availability of customers’ personal information and transactional database it is not possible to understand the expectations. Here we proposed a value based segmentation focuses on the value of customers. Value of customer segmentation is based on the customers’ Expectations, Needs, and wants and how the online electronic retail store can serve these which make use of social media, a rich source of about customers’ expectations. Since the social media data is dynamic, the information is collected regularly. The value based customer segmentation is built by merging the social media information with the available customer details of a online electronic retail store into a data warehouse using dimensional modeling. Then the analytics is done on the aggregated data using neural networks and k-means algorithm. The resultant customer segments will be dynamic and more valuable for decision making process compared to traditional methods.
Full Paper

IJCST/33/1/
A-887
   36 Global Transaction Models on Mobile Computing

V Shiva Narayana Reddy, A Venkat Reddy, P Mahesh Kumar, B Seshagiri

Abstract

The issues mobile computing paradigm introduces new technical properties in the area of database systems. However, techniques for traditional distributed database management have been based on the assumption that the location of end connections among hosts in the distributed system does not change. Distributed systems are expected to support mobile computations executed over a network of fixed and mobile hosts. On the other hand, in mobile computing, these assumptions are no longer valid and mobility of hosts creates a new kind of locality that migrates as hosts move. Consequently, existing solutions for traditional distributed database management may not be applicable directly to the mobile computing environment. Many research proposals that focus on supporting transaction processing models in mobile computing environments have been developed. However, there are still major issues that have not been completely solved. One of the problems is to support the requirement for mobile transaction processing system. Here in this paper, I have presented a comparative analysis of existing mobile transaction models on the basis of reporting transactions.
Full Paper

IJCST/33/1/
A-888
   37 FCIR Tree – A Novel Method to Build Index for Handling Geographic Document Search

A. Krishna Mohan, Harika Yelisala, A.Suekha, MHM Krishna Prasad

Abstract

In response to a location based query, a geographic search engine is expected to return the documents that are highly relevant to both textual and spatial information. To access the documents in short time they have to be indexed properly. As there are many documents indexing plays a vital role. In this paper, we propose an efficient index called FCIR Tree i.e., Fuzzy Clustering Information Retrieval tree, which indexes textual and spatial information in an integrated way. FCIR Tree along with Fuzzy clustering technique performs spatial and textual filtering, relevance computation. We use efficient Fuzzy similarity based membership function for efficient clustering of textual information this makes searching easy and with this proposed algorithm satisfactory results are obtained.
Full Paper

IJCST/33/1/
A-889
   38 A Modified Approach to KERBEROS Authentication Protocol using Improved BLOWFISH Scheme

Hemraj Shobharam Lamkuche, T. Santha

Abstract

An authentication mechanism is the most basic requirement for developing a highly secure environment. Authentication itself means confirming the truth of data. Since the information stored on the computer which is transmitted over internet need to ensure security and measuring safety to information, so without our awareness, the intruders can attempt to obtain and gain control over the system to access secure confidential information by using most common method like DoS Attack, Backdoor, Trojan horse, Packet Sniffing, etc. So there must not be any compromise in securing our resources. Hence Cryptography is arguably the most important tool a security expert has [1]; Cryptography only allows the solution for different security zones including Authentication Mechanism, Access Control, Data Confidentiality, Data Integrity, and Non-Repudiation. In this paper we have strongly focused to improve Kerberos authentication protocol to be more secure and unbeatable [2]; as we have also make use of the improved Blowfish encryption algorithm which is a block cipher with fixed 64bit block size and key size varies from 32 – 448 bits which will enhanced more security to the Kerberos network realm.
Full Paper

IJCST/33/1/
A-890
   39 Fuzzy Keyword Search over Encrypted Data in Cloud Computing

Seemakurthi Durga Prasad, P. Venkata Narayana, J. Karthik

Abstract

As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. Although traditional searchable encryption schemes allow a user to securely search over encrypted data through keywords and selectively retrieve files of interest, these techniques support only exact keyword search. In this paper, for the first time we formalize and solve the problem of effective fuzzy keyword search over encrypted cloud data while maintaining keyword privacy. Fuzzy keyword search greatly enhances system usability by returning the matching files when users’ searching inputs exactly match the predefined keywords or the closest possible matching files based on keyword similarity semantics, when exact match fails. In our solution, we exploit edit distance to quantify keywords similarity and develop two advanced techniques on constructing fuzzy keyword sets, which achieve optimized storage and representation overheads. We further propose a brand new symbol-based tiretraverse searching scheme, where a multi-way tree structure is built up using symbols transformed from the resulted fuzzy keyword sets. Through rigorous security analysis, we show that our proposed solution is secure and privacy-preserving, while correctly realizing the goal of fuzzy keyword search. Extensive experimental results demonstrate the efficiency of the proposed solution.
Full Paper

IJCST/33/1/
A-891
   40 Improving Security and Enhancing Energy Efficiency in Routing for Wireless Sensor Networks

Sangeeta Malik, Sitender Malik

Abstract

Wireless sensor networks are a new type of networked systems, characterized by severely constrained computational and energy resources, and an ad hoc operational environment. Wireless Sensor Networks (WSNs) have been increasingly available for large-scale applications in which energy efficiency & security is an important performance measure. Driven by the energy & security limitation nature of WSNs lots of research works have been done in aspects such as nodes replication,data aggregation routing, clustering for better coverage of network security moniroting etc.In this paper we implement a grid network.Then we propose a Horizontal –Vertical method for load balancing of the grid network.
Full Paper

IJCST/33/1/
A-892
   41 Non Linear Filter Design in Spatial Domain for High Density Impulse Noise Removal

B. Srinivasa Rao, K. Srinivas

Abstract

A spatial domain non linear filtering algorithm for the restoration of gray scale, and Color images that are corrupted by high density impulse noise is proposed. The proposed algorithm well suited for suppressing impulse and also Gaussian noises with different noise leves.It shows better results than the Standard Median Filter (MF), Trimmed Median Filter (TMF) and Weighted Median Filter. Experiment Result shows the proposed algorithm has advantages over regularizing methods in terms of both edge preservation and noise removal and it gives the better Peak Signal to Noise Ratio (PSNR) compared to other techniques even in the high noise densities.
Full Paper

IJCST/33/1/
A-893
   42 A Data-Analysis Technique of Multiple Correspondence Analysis for Discovering Relationships in a Graph

K Phalguna Rao, Ramudu Jonnalagadda

Abstract

It introduces a data-analysis procedure for discovering relationships in a graph, generalizing both simple and multiple correspondence analysis. It is based on a random-walk model through the graph defining a Markov chain having as many states as nodes in the graph. Suppose we are interested in analyzing the relationships between some nodes (or records) contained in a graph. To this end, in a first step, a reduced, much smaller, Markov chain containing only the elements of interest and preserving the main characteristics of the initial chain is extracted by stochastic complementation. This reduced chain is then analyzed by projecting jointly the nodes of interest in the diffusion-map subspace and visualizing the results. A kernel version of the diffusion-map distance, generalizing the basic diffusion-map distance to directed graphs, is also introduced and the links with spectral clustering are discussed. Several datasets are analyzed by using the proposed methodology, showing the usefulness of the technique for extracting relationships in graphs or relational databases.
Full Paper

IJCST/33/1/
A-894
   43 CBRP Strategy for Two-Level Hierarchical Clustering in MANET’s

Shuchita Upadhyaya, Vidushi Rawal

Abstract

MANET is a self-organizing, self-configuring wireless ad-hoc network where all the nodes in a network are free to move anywhere anytime and does not need any pre-existing setup for communication. This dynamic behavior of nodes makes the communication in MANET most difficult task. Mobility is one of the major issues, which causes frequent link breakages and every time a new path for routing is to be searched. Clustering is the scheme where nodes with similar behavior are virtually grouped together and make the efficient routing. Each cluster is headed by a special node called cluster-head. In this paper, a new two-level hierarchical clustering formation scheme is presented aims to control the cluster stability of nodes and can reduce the cluster change rate to avoid frequent updates in network that creates unnecessary overheads. The routing protocol which is the extension of CBRP routing protocol is also implemented on the proposed cluster formation scheme to present packet transmission procedure and controls the network traffic.
Full Paper

IJCST/33/1/
A-895