International Journal of Computer Techniques

6-13

Authors: Saad Al-Momen , Loay E. George , Raid K. Naji

This paper presents a method to classify colored textural images of skin tissues. Since medical images have highly heterogeneity, the development of reliable skin-cancer detection process is difficult, and a mono fractal dimension is not sufficient to classify images of this nature. A multifractal-based feature vectors are suggested here as an alternative and more effective tool. At the same time multiple color channels are used to get more descriptive features. Two multifractal based set of features are suggested here. The first set measures the local roughness property, while the second set measure the local contrast property.A combination of all the extracted features from the three color models gives a highest classification accuracy with 99.4048% for training and 95.8333% for testing. Keywords:-Texture Classification, Texture Analysis, Fractal, Multifractal, Wavelet Features

19-24

Authors: NiravKotadia and KeyurUpadhyay

Anonymous communications are vital for several applications of the mobile unplanned networks (MANETs) deployed in someone environments. A significant demand on the network is to produce unidentifiability and unlinkability for mobile nodes and their traffics. Though variety of anonymous secure routing protocols is projected, the necessity isn't absolutely glad. The present protocols are susceptible to the attacks of pretend routing packets or denial-of-service (DoS) broadcasting, even the node identities are protected by pseudonyms. a brand new routing protocol is projected, i.e., documented anonymous secure routing (AASR), to satisfy the necessity and defend the attacks. Additional specifically, the route request packets are documented by a gaggle signature, to defend the potential active attacks while not unveiling the node identities.

33-35

Authors: Geetanjali Shintre, Gowrima E., Prabhudev R., Shilpa M.S,Mrs.Bhat Geetalaxmi Jayram(Associate Professor)

We are developing an application which predicts the traffic and detect accident using sensors. Every person using a smartphone has the GPS facility inbuilt which is in turn connected to the vehicle by which a person can find his location. In this application we can predict traffic by looking at the traffic of GPS at a particular place. The systems should be able to identify each vehicle and track its behavior, and to recognize situations or events that are likely to result from a chain of such behavior. This paper proposes to utilize the capability of a GPS receiver to monitor speed of a vehicle and detect accident based on monitored speed and send accident location to an Alert Service Centre. Using sensors we detect accidents. The smoke, crash and pressure sensors are to be fit in the vehicle and whenever it senses the system will send the accident location acquired from the GPS along with the time by utilizing the GSM network. This will help to reach the rescue service in time and save the valuable human life. The broader area network of this project is wireless networks. Keywords—Accident Detection, Sensor Based Accident Detection, Sensor Based Traffic Prediction, Traffic Prediction

47-50

Authors: Mahendra Deore,Priyanka Dharurkar,Lajawanti Lanjekar,Minal Chavan,Raksha Gound.

The use of mobile technology has become widespread with astonishing speed all over the world, particularly among the poor. The more mobile phones go to the hands of people who formerly lacked access to financial services, the more the notions of mobile money, mobile payment and mobile banking become pervasive as a means of financial inclusion. Micro-business enterprises in the developing world are increasingly deploying the use of mobile payments to enhance the quality of their services and increase growth. The pace of transformation in the micro business sector has speeded up with more micro businesses realizing the potential of using the mobile payments in their service delivery. This paper aims to investigate the success factors related to the use of mobile payments by microbusiness operators. Accessing your accounts with a mobile application is fast and simple, so it’s easy to do things like check balance, transfer money from one account to other. Staying abreast of your finance is as easy as picking up your phone. So considering all this an application is developed in which main feature person to person payments are using mobile number. In this application mobile number acts as proxy account which hide details of bank account i.e. user can make payments without sharing or telling his bank account number. This application is only for small amount transactions.

56-60

Authors: Pradeep A and George T

wide usage of XML it is essential to identify duplicates in it. Various methods like normalization etc are used for duplicate detection in relational database but it cannot be employed in XML due to its complex structure. Detecting and eliminating duplicates correctly has become one of the challenging issues in the areas of places where data integration is performed. Many techniques have been emerged for detecting duplicates in both relational databases and XML data’s. By recognizing and eliminating duplicates in XML data could be the solution, for this a strategy based on Bayesian Network called XMLDup to detect duplicates and use machine learning algorithm like SVM, Bee, Bat algorithms for improving its efficiency and compare them to find out the most efficient method to find out duplicates in XML effectively. Keywords — Bayesian Network, DELPHI, dogmatiX, duplicate detection, network pruning, SXNM, XML, XMLDup, Bee, Bat

68-71

Authors: Ravi Kumar,Garima Garg

The great success of internet that allows the transmission, very wide distribution, and access of digital data in an easy manner.The term "digital watermark" was first coined in 1992 by Andrew Tirkel and Charles Osborne.A digital watermark is a kind of marker covertly embedded in a noise- tolerant signal such as audio or image data. It is typically used to identify ownership of the copyright of such signal. "Watermarking" is the process of computer-aided information hiding in a carrier signal; the hidden information should, but does not need to contain a relation to the carrier signal. Digital watermarks may be used to verify the authenticity or integrity of the carrier signal or to show the identity of its owners. Like traditional watermarks,. Keywords —Digital Video Watermarking, Discrete Wavelet Transform, 3-D digital water marking, Video Frame, Watermark, MATLAB.

78-85

Authors: Jyotsana Dixit, Abha Choubey

Data mining technology has emerged as a means of discovering hidden patterns and trends among large volumes of data and thus it can be considered as an important step in the knowledge discovery (KDD) process. In the area of data mining the task of Association rule (AR) mining is to discover interesting relations among various items in the database. One of the subfield of artificial intelligence is Swarm Optimization which is intended to study the cooperative performance of simple agents. The Particle Swarm Optimization (PSO) is one of the swarm optimization algorithms which can be used for mining improved quality rules. PSO is one of the population based heuristic search technique which is used for solving various NP-complete problems. But PSO has a basic limitation that it gets stuck in local optima. Hence, this research work focuses on; the Binary Particle Swarm Optimization (BPSO) algorithm with cross over operator of Genetic algorithm (GA) for generating better quality association rules among bulky datasets. Due to the better exploration property crossover operator is used with Binary Particle Swarm Optimization (BPSO) algorithm. This algorithm mines improved quality association rules in terms of fitness value without specifying minimum support and minimum confidence thresholds. To prove the practical significance of the approach, this algorithm is tested on three datasets viz. Book dataset, Chess dataset, Connect dataset, using MATLAB and the results obtained has been compared with standard BPSO and GA algorithm. Keywords — Association rule (AR), knowledge discovery (KDD), Particle Swarm Optimization (PSO), Binary Particle Swarm Optimization (BPSO), Genetic algorithm (GA), Support and Confidence.

90-98

Authors: Snehal Goverdhan , Aakanksha Choubey

Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. The main objective of such an ad hoc network routing protocol is accurate and efficient route establishment between a pair of nodes so that messages may be delivered in a well-timed manner. In this paper we examines two routing protocols for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV), the table- driven protocol and the Ad hoc On- Demand Distance Vector routing (AODV), an On –Demand protocol and evaluates both protocols with varying pause time, sources based on:-Average End-to-End Delay, Packet Delivery Ratio, Packet Drop Ratio, Throughput, Normalizing Routing Load. In this research work we try to switch nodes between active and inactive states to save energy. In Ad hoc network nodes does not sleep. However, not every routing node is involved in the data delivery all the time so, allowing redundant routing nodes to sleep may save other routing paths when the previous ones run out of energy. In ad hoc network nodes switch between active and inactive states to save energy, thus improving the throughput of AODV routing protocol. The performance comparison has been evaluated using widely recognized and improved network simulator NS-2 version 2.34. Keywords — AODV, DSDV, MANET, Routing Protocol, NS2, Performance Parameters.

106-109

Authors: Gowtham R, Govindaraj V

In VLSI Technologies, according to Moore’s law the density of a semiconducting material increases rapidly. The verification technology in this industry is complex. For verification process, manually generating test cases is difficulty and time consuming process for verifying complex problem in design. For reducing complexity of the verification process is to generate a graph scenario model for each Intellectual Property (IP) blocks in system on chip (SOC) design. The main objective is to verify the IP block of AMBA (Advanced Microcontroller Bus Architecture) APB (Advanced Peripheral Bus) via SPI (Serial Peripheral Interface) using graph based scenario model. This concept includes generation of graph of APB_WB (Advanced Peripheral Bus Wishbone) and integration of test cases generated by the graph to APB. The graph is generated by the software called trek by Breker verification systems. This software automatically generates test cases. These test cases are self-verifying. Trek takes input information from scenario models describing the desired outcomes, developed by the user which is integrated with DUT (Device Under Test) and outcome is verified by Trek mailbox. For more accuracy of SPI protocol, the test cases has to be generated for transmit register using trek. Keywords — AMBA_APB, SPI, Signal, Transfers, Graph Scenario model, Trek.

116-122

Authors: Litty Tressa George, Asha Rose Thomas

Web Utility mining has recently been a bloomingtopic in the field of data mining and so is the web mining, animportant research topic in database technologies. Thus, the web utility mining is effective in not only discovering the frequent temporal web transactions & generating high utility item sets, but also identifying the profit of webpages. For enhancing the web utility mining, this study proposes a mixed approach to the techniques of web mining, temporal high utility item sets& On shelf utility mining algorithms, to provide web designers and decision makers more useful and meaningful web information. In the two Phases of the algorithm, we came out with the more efficient and modern techniques of web & utility mining in order to yield excellentresults on web transactional databases. Mining most valuableitemsets from a transactional dataset refers to theidentification of the itemsets with high utility value as profits.Although there are various algorithms for identifying highutility item sets, this improved algorithm is focused on online shopping transaction data. The other similar algorithm sproposed so far arise a problem that is they all generate large set of candidate item sets for Most Valuable Item sets and also require large number database scans. Generation of large number of item sets decreases the performance of mining with respect to execution time and space requirement.This situation may worse when database contains a large number of transactions. In the proposed system,information of valuable item sets are recorded in tree based data structure called Utility Pattern Tree which is a compact representation of items in transaction database. By the creation of Utility Pattern Tree,candidate item sets are generated with only two scans of the database. Recommended algorithms not only reduce a number of candidate item sets but also work efficiently when data base has lots of long transactions. Keywords —Utility Mining, Itemset utility, Valuable itemsets, Most valuable itemsets.