-
Assess Agent Guilt Model and Handling Data Allocation Strategies for Data Distribution
C Sakthivel ; S Poovarasan; A Velkuppannasamy; T Karthikeyan
Computer Science and Engineering
Year: 2015, Volume:1, Issue : 9
Pages: 70 - 73
A data distributor has given sensitive data to a set of supposedly trusted agents (third parties). The data are leaked and found in an unauthorized place (e.g., on the web or somebody’s laptop). The distributor must assess the likelihood that the leaked data came from one or more agents, as opposed to have independent that gathered by other means. Data allocation strategies that we proposed (across the agents) improve the probability of identifying leakages. The model doesn’t rely on alterations of the released data (e.g., watermarks). In the proposed system, injected “realistic but fake†data records to further improve the chances of detecting leakage and identifying the guilty party.
Read More...
-
Improvements in Design and Usage for Resurgence of the Technology of Fiber Reinforced Plastics (FRP) Paraboloidal Dish Type Solar Cookers-I
Dipesh D.Kundaliya ; Dr S.T.Rajan
Mechanical Engineering
Year: 2015, Volume:1, Issue : 9
Pages: 74 - 77
Fiber reinforced plastics (FRP) dish type solar cookers is one of the best technologies within the portfolio of solar cookers, having its own advantages. Unfortunately the only Indian company which has been producing them has stopped its manufacture since three years ago. Here we present a few ways of improving the design and usage aspects this technology for its revival and popularization in its modified forms in the larger interests of promoting renewable energy, sustainable technology and rural development.
Read More...
-
Spectrum Aware Mobility Management In Cognitive Radio-A Survey
Mutturaj Basavaraj Sajjan ; T. Y. Melligeri; Mallikarjun N Deshmukh; Manjunath Gidaveer
Wireless communication
Year: 2015, Volume:1, Issue : 9
Pages: 78 - 84
Cognitive radio (CR) enables the efficient utilization of the limited radio spectrum, network resources and an unlicensed user can communicate in licensed spectrum without interfering a licensed user. In CR expected to address several operational challenges such as spectrum access in dynamic manner, providing Quality of Service (QOS) between end-to-end and spectral heterogeneity. Hence it become an all-encompassing term for a wide variety of technologies and emerges as a promising solution to improve current spectrum utilization efficiently. In this paper we proposed spectrum mobility management in cognitive radio.
Read More...
-
Bug Report Triaging Using Textual, Categorical and Contextual Features Using Latent Dirichlet Allocation
Anuradha Sharma ; Sachin Sharma
Computer Engineering
Year: 2015, Volume:1, Issue : 9
Pages: 85 - 96
Software Bugs occur for a wide range of reasons. Bug reports can be generated automatically or drafted by user of software. Bug reports can also go with other malfunctions of the software, mostly for the beta or unsteady versions of the software. Most often, these bug reports are improved with user contributed experiences as to know what in fact faced by him/her. Addressing these bugs accounts for the majority of effort spent in the maintenance phase of a software project life cycle. Most often, several bug reports, sent by different users, match up to the same defect. Nevertheless, every bug report is to be analyzed separately and carefully for the possibility of a potential bug. The person responsible for processing the newly reported bugs, checking for duplicates and passing them to suitable developers to get fixed is called a Triager and this process is called Triaging. The utility of bug tracking systems is hindered by a large number of duplicate bug reports. In many open source software projects, as many as one third of all reports are duplicates. This identification of duplicacy in bug reports is time-taking and adds to the already high cost of software maintenance. In this dissertation, a model of automated triaging process is proposed based on textual, categorical and contextual similarity features. The contribution of this dissertation is twofold. In the proposed scheme a total of 80 textual features are extracted from the bug reports. Moreover, topics are modeled from the complete set of text corpus using Latent Dirichlet Allocation (LDA). These topics are specific to the category, class or functionality of the software. For e.g., possible list of topics for android bug repository might be Bluetooth, Download, Network etc. Bug reports are analyzed for context, to relate them to the domain specific topics of the software, thereby; enhancing the feature set which is used for tabulating similarity score. Finally, two sets are made for duplicates and non-duplicate bug reports for binary classification using Support Vector Machine. Simulation is performed over a dataset of Bugzilla. The proposed system improves the efficiency of duplicacy checking by 15 % as compared to the contextual model proposed by Anahita Alipour et.al. The system is able to reduce development cost by improvising the duplicity checking while allowing at least one bug report for each real defect to reach developers.
Read More...
-
Detection of Non-Technical Loss in Power Utilities Using Data Mining Techniques
Rajesh. R ; E.Siva Sankari; P.Matheswaran
computer science and engineering
Year: 2015, Volume:1, Issue : 9
Pages: 97 - 101
This paper presents Non-Technical loss (NTL) in power utilities and it describes how to handle. Non-technical loss has been an influential factor on the benefits of electric power utilities. At the same time, with distribute generation extensively installed, the consumption patterns having many similarities between dishonest users and normal customers. Non-Technical Loss may be theft of electricity, illegal connection, fault metering and billing error. Improving the reliability of NTL detection algorithm becomes particularly important. Data mining techniques are used to detect the Non-Technical Loss using classification algorithm. The implementation of a intelligent computational tool to identify the non-technical losses and to select its most close feature, considering information from the database with consumers profiles. This work presents using the weka software to the proposed objective, comparing various classification techniques and optimization through intelligent algorithm.
Read More...
-
Registration and Segmentation for Finding the Affected Region in Kidneys
Baby. D. Dayana ; N. Meffiya; Dr.P.Latha
COMPUTER SCIENCE AND ENGINEERING
Year: 2015, Volume:1, Issue : 9
Pages: 102 - 106
The kidney failure is the major threat in medical field. The kidneys dysfunction and disease can be filtered using the parameter Glomerular Filtration Rate (GFR). Finding the affected part is the most critical phenomenon in medical field. This method gives the exact area detection in kidney so that the diagnosis and treatment is easily carried out. The aim of the project is to find the Glomerular Filtration Rate (GFR) according to it the affected part in kidney is find out. It deals with renal failure and it applies the concept of Registration and segmentation and classification.
Read More...
-
Energy Efficient Data Aggregation Using Packet Driven Timing Algorithm in Wireless Sensor Network
G.KALAISELVI ; G.Kalaiselvi; D.Anitha
computer science and engineering
Year: 2015, Volume:1, Issue : 9
Pages: 107 - 111
Energy in wireless sensor networks (WSNs) are quite limited. Since sensor nodes are usually much dense, data sampled by sensor nodes have much redundancy, data aggregation becomes an effective method to eliminate redundancy, minimize the number of transmission, and then to save energy. Many applications can be deployed in WSNs and various sensors are embedded in nodes, the packets generated by heterogenous sensors or different applications have different attributes. The packets from different applications cannot be aggregated. Otherwise, most data aggregation schemes employ static routing protocols, which cannot dynamically or intentionally forward packets according to network state or packet types. The spatial isolation caused by static routing protocol is un favourable to data aggregation. To make data aggregation more efficient, in this paper, we introduce the concept of packet attribute, and then propose an attribute-aware data aggregation (ADA) scheme consisting of a packet-driven timing algorithm and a special dynamic routing protocol. Inspired by the concept of potential in physics and pheromone in ant colony, a potential-based dynamic routing is elaborated to support an ADA strategy it.
Read More...
-
Maintaining lifetime of Wireless Ad Hoc Sensor Networks by Mitigating Vampire Attacks
A.Anto Jenifer ; V.Thangam ; N.Jeenath Laila
Computer Science and Engineering
Year: 2015, Volume:1, Issue : 9
Pages: 112 - 117
Wireless sensor network is a communication network across the sensors nodes. Sensor nodes collect information about the physical environment. Now-a-days one main issue in wireless adhoc sensor network is wastage of energy at each sensor nodes. Energy is the one most important factor while considering sensor nodes. Wireless sensor networks require solution for conserving energy level. One new type of attack called vampire attack, which occurring at network layer. It leads to resource depletion (energy) at each sensor nodes, by destroying battery power of any node. It transmits a small complaint messages to disable a whole network, hence it is very difficult to detect and prevent. Existing protocols are not focusing on this vampire attack happening on routing layer, hence there exist two types of attacks namely, carousel and stretch attack. Hence there is a large of energy loss. New protocol called PLGP, a valuable and secure protocol is proposed along with one-way signature chaining algorithm to avoid this vampire attack. By using this, existing problems can be overcome.
Read More...
-
Estimation of Groundwater Vulnerability using Remote Sensing and GIS Techniques
Ashokraj C ; Kirubakaran M; Colins Johnny J
Civil Engineering
Year: 2015, Volume:1, Issue : 9
Pages: 118 - 125
Groundwater is a good source for human water requirement because it has low susceptibility to pollution and its natural availability is good when compared to surface water. Groundwater is primarily used for domestic, agriculture and industrial activities. Groundwater is a nonrenewable source and at same time over exploitation and pollution of groundwater is spoiling the groundwater. So developments of groundwater resource and prevention of contamination are prominent task in the groundwater management. The primary objective of the study is to map groundwater vulnerability of Palayamkottai taluk in Tirunelveli district Tamil Nadu by applying SINTACS model. This model uses the input from remote sensing and geographical information system (GIS) techniques. SINTACS model is based on overlay index methodology. The SINTACS model comprising of seven hydro geological parameters namely water table depth, net Recharge, unsaturated zone, soil media, aquifer media, hydraulic conductivity and slope. These parameters are integrated to delineate the area that is more susceptible to pollution. The SINTACS model classified the Palayamkottai taluk into low (108.1 km2) and moderate (191.9 km2) vulnerable area.
Read More...
-
A Novel and Efficient Packet Scheduling Scheme for Wireless Sensor Network
E.Indumathi ; J.Antony Jeyanna ; Dr.D.Shalini Punithavathani
computer science and engineering
Year: 2015, Volume:1, Issue : 9
Pages: 126 - 132
Scheduling different types of packets, such as real time and non-real time data packet at sensor nodes with resource constraints in wireless sensor network, to reduce the sensor energy consumption and end- to-end data transmission delay. Most of the existing system based on the FCFS (First Come First Serve), non-preemptive priority and preemptive priority concepts. This algorithm incurs a large processing overhead and more energy consumption. It does not support dynamic packet scheduling scheme. In this paper, a Dynamic Multilevel Priority packet scheduling scheme proposed. In this scheme, it should maintain the virtual hierarchy the zone based topology of WSN, has three levels of priority queues. Real time packets are placed in to the highest priority queue. Non-real time packets are placed into two other queues based on a certain threshold of their estimated processing time. Leaf nodes have two queues for real-time and non-real time data packets since they do not receive data from other nodes and thus, reduce end-to-end delay. According to the priority of packet node will route the packet to the destination. The result of this paper is reduce average data waiting time and end to end delay.
Read More...
Abstract
