......

..

IJCTA-Volume 4 Issue 3/ May-June 2013
S.No
Title/Author Name
Page No
1
Device Policy Manager in Android
-Sumaiya Patel,Darshana Thakur,Sujit Sherkar,Priyanka Dhamane, Nandkishor Karlekar
Abstract
Android is a modern mobile platform that was designed to be truly open. Android has been subjected to a professional security program.Android uses permission based security model which has central role hence it creates security holes in Android OS. Hence we propose a security based application for Android OS. The application allows its user to have two accounts i.e. Administrator and Guest.This is similar to account we make in Desktop OS.The picture of user will be clicked using front camera if logged on using Guest account.
Keywords: Android OS, Permission based security model, central role
374-377


  PDF

2
Reverse Engineering: An Analysis of Dynamic Behavior of Object Oriented Programs by Extracting UML Interaction Diagram
-Mrinal Kanti Sarkar,Trijit Chaterjee
Abstract
The Unified Modeling Language (UML) is widely used as a high level object oriented specification language. UML is a good target language for the reverse engineering models since it is largely used and offers different diagrams. In this paper we present a novel approach in which reverse engineering is performed using UML as the modeling language used to achieve a representation of the implemented system. In this work we have considered java programs. After a brief introduction to the subject we present some analyses which go beyond mere enumeration of methods and fields. We sketch our method of determining association multiplicities, being, in a sense, representative of our approach which produce a simple sequence diagram that can be understood by a programmer when inspecting the source code of a given java programs. To fully understand the behavior of a program, it is crucial to have efficient techniques to reverse dynamic views of the program. In this paper, we focus on the reverse engineering of UML sequence diagram from an object oriented programs and analysis of its dynamic behavior.
Keywords-Reverse; Engineering; OOP; UML; Extraction; Instrumentation; Interaction Diagram; Sequence Diagram
378-383


  PDF

3
Survey on Internet Spam: Classification and Analysis
-Geerthik.S
Abstract
In recent years spam detection and dealing with spam in information retrieval systems is a difficult task. Thisarticle surveys the classification of various spam in the internet based on their properties. The impact of various spams in social networks, email, image, content and links is discussed and the technique applied to prevent the spam in various areas is listed. A detailed analyzes of cloaking and redirection in web search is also given in this paper. Finally this article listed the things to be considered to construct the spam algorithms.
Keywords: email spam, content spam, spam filters, link spam.
384-391

  PDF

4
STAR, DYMO and ZRP Routing Protocols of MANET
-Richa Vats,Dr. Yusuf Mulge
Abstract
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile hosts forming a temporary network without the aid of any stand-alone infrastructure or centralized administration. Most of the proposed MANET protocols do not address security issues. MANETs routing protocols are used to find specific routes between source and destination. The primary goal of any ad-hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish an efficient route between any two nodes with minimum routing overhead and bandwidth consumption. Several protocols are introduced for improving the routing mechanism to find route between any source and destination host across the network. The paper present a logical study on three routing protocols STAR, DYMO, and ZRP.
Keywords- STAR, DYMO, ZRP
392-395

  PDF

5
Two Way Protocols Method to Data Upload
-Ritu Raikwar,Prof. Gireesh Dixit
Abstract
The many-to-one upload trouble arises when many of users needs to upload data to a single server. Uploads correspond to an important class of scenarios, many of which are limited by a deadline. This includes, e.g., electronic submissions of income tax forms, online shopping for limited-time bargain products, and gathering data from sensor networks. Such services create hot spots, which is a major hurdle in achieving scalability in network-based applications. Two-tier protocols attempt to relieve hot spots in many-to-one applications. In this model, clients upload their data to intermediaries (also called bistros), to reduce the traffic to the destination around a deadline. The destination server then computes a schedule for pulling the data from bistros after the deadline. Bistros have limited storage capacity, and each bistro j may fail with some probability 0 < pj < 1. Previous works on reliable data upload report on experimental results. Our main contribution is a theoretical study of several algorithms for the many-to-one upload problem in two-tier protocols. The proposed algorithms achieve reliability through file replication, or by using Forward-error correction codes (FEC).
396-399

  PDF

6
A Questionnaire on Survey of problems in Hostel Life using Data Mining
-Harmeet Kaur,Malkit Singh,RavinderKaur
Abstract
Although now a day’s Hostel life is much necessary for students but still there are some limitations. There are many problems and limitations in the hostel life. We conduct an online survey and present many problems to the hostel life through a questionnaire. We use the data mining for prepare the result after done survey. . Through the use of automated statistical analysis (or "data mining") techniques, businesses are discovering new trends and patterns of behavior that previously went unnoticed. It can be used in a predictive manner for a variety of applications. . We will give some solutions after survey on problems in hostel life using the data mining. We create a questionnaire which highlights the many problems, which are related to hostel life
Keywords:-Hostel life, questionnaire, data mining, satisfaction, management, student
400-403

  PDF

7
Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
-Rahul Mathur,Imran Khan,Vikas Choudhary
Abstract
Many of the network topology design problems include CMST, which means to find a minimum cost tree that connects all the nodes of the network to the central node with some capacity constraint. The links of edges have associated costs that could be based on their distance, capacity, quality of line etc, and the nodes have their associated demand. Usually most of the network obtained from CMST are static in nature, but there are situations where the network is subjected to change by addition (or deletion) of nodes, such a network is known as dynamic network and identifying CMST in this case is known as Dynamic CMST or DCMST. EW algorithm is one of fundamental method to solve the DCMST problems, but it doesn’t always provide optimal solution. This thesis explores the Genetic Algorithm approach in finding better solution than EW Algorithm to DCMST problem.
Keyword: - CMST, DCMST
404-413

  PDF

8
User Profile Construction Based on Ontology in order to Merge the Results of Metasearch Engines
-Issam Abdelbaki, Zineb Rachik, El habib Ben lahmar, Elhoussin Labriji
Abstract
The information seeking tends to model the users according to a profile for them to take a full account of the information system, in order to meet their specific needs. This paper presents a fusion approach based on the moderate voting system Borda, we see the fusion of results from different search engines as an election to elect a set of candidate documents in a certain order, thus it defines the search engines as electorates. To properly apply the Borda Method, we need to know the popularity of each research engine (number of electors for each search engine), it represents the weight of the search engine to the query. This value heavily depends on the specific need of the user, so we can give a weight to each search engine relative to the user query according to his profile. It was chosen to give a semantic representation to the user profile based on weighted concepts using the ODP ontology reference. We have evaluated our approach on the collection of TREC documents and we will present some experienced results.
KEYWORDS: metasearch engine, Fusion, ranking, user profile, Borda, Ontologie, vote.
414-418


  PDF

9
The Major Uncertainity Factors Affecting in SOftware Cost Estimation
-G. Rajkumar, Dr.K.Alagarsamy
Abstract
The majority of uncertainty factors that caused major problems were operational in the sense that they invoked problems that are normally within the responsibility of the Software Project Management. Each project will have a different capacity for uncertainty. This is a measure of how much uncertainty the project can tolerate. Accurate software cost and schedule estimations are essential especially for large software projects. However, once the required efforts have been estimated, little is done to recalibrate and reduce the uncertainty of the initial estimates. Uncertainties in estimates of resource requirements for future systems arise from many sources. One of the top reasons for the failures is inadequate or inconsistent application of proven project Uncertainty methods. All projects have some uncertainties. Most practitioners agree that improved estimation practices and processes have changed the uncertainty scale. This paper reviews the numbers of Uncertainty factors involved in the software cost estimation, which interact with each other.
Keywords: Software Project Management, Uncertainty Factors, Managing Uncertainty.
419-424

  PDF

10
CloudTPS : Availibility,Scalability Based Online Transition System For Cloud Computing
-Bankar Shashikant Mahadu,Prof. Bansode S. M,Deshmukh Amit Amrutrao
Abstract
Cloud computing is the most used paradigms in the world of advanced technology. Cloud Computing is a style of computing which must cater to the following computing needs :Dynamism, Abstraction, Resource Sharing. It is used to deploy highly available and scalable systems. These systems demand huge amount of data management. The traditional database systems or the replicated database systems cannot resolve such demand of the scalable systems. There are different solutions that benefit in different ways. Some solutions uses special key value structure, but they lack consistency as they trade for high scalability and availability. The traditional replication protocols for cloud environment also do not scale up well. A new class of data storage had come up called NoSQL (Not Only SQL) that complemented the traditional database systems. High availability and scalability properties for web applications are provided by NoSQL Cloud data stores. NoSQL Cloud data stores sacrifice data consistency. Rejection of general ACID transaction is common feature of NoSQL. Weaker consistency allows better availability, lower latency and other benefits for platform provider. However, now-a-days many web applications or other applications cannot afford any type of data inconsistency. In this paper we provide with a newer concept called CloudTPS. CloudTPS is a scalable transaction manager. It guarantees full ACID properties. It can be used for multi-item transactions issued by web applications as it guarantees consistency, even in presence of network partitions and server failures. We focus on CloudTPS, ACID Properties and describe the key role it playsin achieving consistency with high scalability.
Keywords: ACID, Cloud computing CloudTPS, Scalability.
425-433


  PDF

11
Energy Efficient Protocols for Wireless Sensor Networks: A Review
-Nihal Srivastava, Sandeep Seth, Mohit Kumar, Rakesh Kumar
Abstract
Wireless Sensor Networks are gaining popularity day by day due to their wide scale deployment in most of the environmental scenarios including hostile ones. They consist of number of tiny nodes, consisting low computational and communication power. Also, ever draining energy of these nodes requires energy efficient protocols for WSN (Wireless Sensor Network); that have become one of the most discussed areas of computer networks these days. Broadly, protocols proposed till date mainly deals with either one of the field. First, WSN are data-centric, so there is a need to analyze data to avoid redundancy, before data dissemination. On the other hand, energy efficiency also depends on the communication; no redundant transmissions are favorable in WSN. Most of these facts are considered in medium access. Families of MAC protocols were suggested exclusively for WSN. In this paper, we explored major methodologies on data dissemination and also cover proposed MAC protocols that are feasible with WSN as on date and provide comparative study on key factors.
Keywords- Wireless sensor networks, Medium access protocols, data-centricity, Collision avoidance, CSMA.
434-444

  PDF

12
A Novel Method for Gender Classification Using DWT and SVD Techniques
-Pallavi Chand,Shubhendu Kumar Sarangi
Abstract
In today’s time fingerprint plays a very important role, whether it is to link the suspect in a crime scene or to find an unknown person. Fingerprints are one of the most mature biometric technologies and are considered legitimate proofs of evidence in courts of law all over the world. The main objective of this paper is to find a link between gender of a person and his/her fingerprint. The gender of an unknown fingerprint was found out by classifying the frequency and spatial domain vector of the input image. The 2D-Discrete Wavelet Transformation (DWT) was used to find the frequency domain vector and Singular Value Decomposition (SVD) was implemented in order to find the spatial feature of the non-zero singular values. Both the outputs of SVD and DWT are combined to form the feature vector. The K-nearest neighbour classifier is used to classify the fingerprint. The method is experimented with the internal database of 100 fingerprints of left hand index finger, 50 males and 50 females belonging to same age group.
Keywords— Fingerprint, Biometric technologies, Discrete Wavelet Transformation, Singular Value Decomposition, Knearest neighbour classifier.
445-449

  PDF

13
Path Establishment Algorithm for Mobile Ad Hoc Network : A Novel Approach
-Santanu Santra,Puspanjali Maji
Abstract
Ad-hoc on-demand routing protocols like ZRP establish and maintain routes on-demand. However, the paths established by on-demand protocols, which are optimal during route establishment phase, become sub-optimal over time due to node mobility. In this paper, we propose a Path Establishment Algorithm (PEA) that optimizes the established routes when feasible without incurring extra overhead. By utilizing promiscuous mode of operation, sender node „hears‟ the border neighbour node within each zone to forward a packet, hop counts embedded in IP-optional header of data packets to find shorter paths. PEA avoids unnecessary aggressive and ephemeral route updates, which improves the protocol performance. Routing path optimality is important as optimal path reduces the packet drop ratio, end-to-end delay, and reduces energy dissipation of end-to-end data transmission. It will also be easier to secure multicast routing. PEA for ZRP fits well for MANETs where bandwidth is limited, topology changes frequently, power is constrained and security problem is serious. Simulation results are presented to support our claim.
450-455


  PDF

14
An Improved Fault Tolerant System Using Clustering for Multiple Object Tracking in Wireless Sensor Networks
-Venkatesh S, Dr.K.M.Mehata
Abstract
In Wireless Sensor Networks (WSNs), Efficient clustering is key for optimal use of available nodes. Fault tolerance to any failure on the network or node level is an essential requirement in this context. Hence, a novel approach towards clustering and multiple object tracking in WSNs is being explored. The Proposed method employs improved K-means clustering algorithm which employs judicious mix of burdening all available nodes including CH (Cluster Head) to earn energy efficiency and fault tolerance. Initially, node with the maximum residual energy and least distance with fewer faults prone in a cluster become cluster head and node with the second maximum residual energy with minimum distance as next in hierarchy ranked accordingly. Later on, selection of cluster head will be based on available residual energy with no permanent fault due to energy drain and hence the object is being tracked with least fault occurrence. We use Matlab software as simulation platform to check energy consumption at cluster by evaluation of proposed algorithm. Eventually we evaluated and compare this proposed method against previous method and we demonstrate our model is better optimization than other method such as Traditional clustering in energy consumption rate.
Keywords: Wireless sensor network, Fault tolerant, energy efficiency, lifetime, K-means clustering
456-461


  PDF

15
Dynamic Resource Provisioning for Deadline and Budget Constrained Application in Cloud Environment
-Naimisha S Trivedi,Devyaniba S Chudasama
Abstract
Due to missing deadlines, the jobs are being rejected. The rejection rate increases. We want to propose on-demand provisioning in order to maintain QoS we need to give extra resource to the job. Mapping performance requirements to the underlying resources in the cloud is challenging. Resource under-provisioning will inevitably hurt performance and resource over-provisioning can result in idle instances, thereby incurring unnecessary costs. There is an increasing demand to efficient management of large-scale application under cost and deadline constrained. To counter such lack of solutions for cost and deadline constrained dynamic resource provisioning and scheduling, we present a coordinated dynamic resource provisioning and scheduling approach that is able to maximize no. of completed execution application within their deadlines and budget. We define the problem of scheduling prioritized jobs of application under budget and deadline constraints.
Keywords - Cloud Computing, Dynamic Resource Provisioning, CloudSim, Quality of Service
462-465


  PDF

16
HSNORT: A Hybrid Intrusion Detection System using Artificial Intelligence with Snort
-Divya,Surender Lakra
Abstract
Mobile Ad Hoc Network (MANETs) is collection of mobile/semi mobile nodes with no existing pre-established infrastructure, forming a temporary network. Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Another issue that effects the QoS routing is routing overhead. Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In this paper we described the impact of routing overhead in a real-time-time MANET environment with suitable scenarios. And also we suggested some methods to reduce the routing overhead over the network such that to improve the Quality of Service (QoS) routing in MANETS.
Index Terms - Mobile ad hoc networks, network connectivity, dynamic networks, routing overhead.
466-470


  PDF
17
A New Framework for Block Cipher
-Bhupchandra Kumhar,Prof. Gireesh Dixit
Abstract
there is no arguing about the importance of encryption in today’s world. We make frequent use, sometimes unaware, of encryption. We encrypt information that we send over the Internet, cellular phone calls, cable broadcasts, and more. Block ciphers provide us with fast encryption, and can be used as building blocks of various encryption schemes (called modes of operation). Advanced Block Cipher, or shortly ABCframework defines a new interface, and new modes of operation. This framework protects against dictionary attacks, differential and linear attacks, and eliminates the weaknesses of most modes of operation. This new framework shares a common structure with the HAIFA hash function framework, and can share the same logic with HAIFA compression functions.
471-473

  PDF
18
OpenFlow: An Approach towards Centralizing the Routing Decision
-Viral Parmar,Amit Patel
Abstract
Software Defined Networking (SDN) approach which allows the network operator to manage network elements using software running on external server. This is accomplished by a split in the architecture between the forwarding element and the control element. This paper proposes the OpenFlow as a way of networking where the controlling software is moved to one or more hardware module (controllers) which can control many switches. Flow table in all the forwarding elements (Switches) are modified by the centralized controller, and so all the routing information is centralized to controller. OpenFlow provides a standardize interface for remotely controlling the forwarding tables in network switch, routers and access Finally this paper shows the features and the concept of information centralization.
Keywords: OpenFlow, Software Defined Networking, Ethernet switch, Flow Table
474-477

  PDF
19
Skew Detection in Image Processing
-Ruby Singh,Ramandeep kaur
Abstract
Many researchers proposed different methodologies for the text skewestimation in binary images/gray scale images. They have been used widely for the skew identification of the printed text. There exist so many ways algorithms for detecting and correcting a slant or skew in a given document or image. Some of them provide better accuracy but are slow in speed, others have angle limitation drawback. So a new technique for skew detection in the paper, will reduce the time and cost.
Keywords— Document image processing, Skew detection, Nearest-neighbour approach, Moments, Hough transformation.
478-485

  PDF
20
Association Rule Mining by Implementing Apriori Algorthim using Disconnected Approach
-Rajneesh Kumar Singh,Manoj Kumar Pandey,Jawed Ahmed
Abstract
There is a huge amount of data around us and to extract valuable information from it can be done through data mining. Data Miming is the process of extracting useful information from the huge amount of data stored in databases. Association Rule Mining is one of the data mining techniques used to extract hidden knowledge from datasets that can be used by an organization’s decision makers to improve overall profit. One of the most famous association rule learning algorithms is Apriori. Apriori algorithm is one of algorithms for generation of association rules. The drawback of Apriori Rule algorithm is the number of time to read data in the database equally number of each candidate were generated. A disconnected approach is implemented in this paper. The implementation of the algorithm would need to scan the database one time. Through this implementation of Apriori Algorithm greatly reduces the database scan which reduces time, network consumption and can improve the efficiency of algorithm.
Keywords- Data mining; Association rule; Apriori algorithm; Disconnect approach; ADO.NET; Frequent pattern
486-493


  PDF
 

 

 

 

IJCTA © Copyrights 2010| All Rights Reserved.

This work is licensed under a Creative Commons Attribution 2.5 India License.