DETERMINIZATION OF QUERY AWARE UNCERTAIN OBJECTS
[View]
K.JAHNAVI, Ch. RAVINDRA REDDY, J.V.KRISHNA
This paper considers the problem of determinizing probabilistic data to enable such data to be stored in legacy systems that accept only deterministic input. Probabilistic data may be generated by automated data analysis/enrichment techniques such as entity resolution, information extraction, and speech processing. The legacy system may corr1espond to pre-existing web applications such as Flicker, Picasa, etc. The goal is to generate a deterministic representation of probabilistic data that optimizes the quality of the end-application built on deterministic data. We explore such a determinization problem in the context of two different data processing tasks triggers and selection queries. We show that approaches such as thresholding or top-1 selection traditionally used for determinization lead to suboptimal performance for such applications. Instead, we develop a query-aware strategy and show its advantages over existing solutions through a comprehensive empirical evaluation over real and synthetic datasets.
K.JAHNAVI, Ch. RAVINDRA REDDY, J.V.KRISHNA
This paper considers the problem of determinizing probabilistic data to enable such data to be stored in legacy systems that accept only deterministic input. Probabilistic data may be generated by automated data analysis/enrichment techniques such as entity resolution, information extraction, and speech processing. The legacy system may corr1espond to pre-existing web applications such as Flicker, Picasa, etc. The goal is to generate a deterministic representation of probabilistic data that optimizes the quality of the end-application built on deterministic data. We explore such a determinization problem in the context of two different data processing tasks triggers and selection queries. We show that approaches such as thresholding or top-1 selection traditionally used for determinization lead to suboptimal performance for such applications. Instead, we develop a query-aware strategy and show its advantages over existing solutions through a comprehensive empirical evaluation over real and synthetic datasets.
PARALLEL GRAPH COMPUTATION USING PARTITION AWARE ENGINE
[View]
B. SATYA SALINI, CH. RAVINDRA REDDY, J.V.KRISHNA
Graph partition quality affects the overall efficiency of parallel graph computation systems. The high-quality of a graph partition is measured by means of the steadiness aspect and edge reduce ratio. A balanced graph partition with small area reduce ratio is customarily preferred for the reason that it reduces the steeply-priced community conversation fee. Nonetheless, in line with an empirical study on Graph, = the efficiency over well partitioned graph perhaps even two instances worse than simple randomfor the easy partition tactics and are not able to successfully manage the increasing workload of regional partitions. This is when you consider that these systems best optimize message processing when a high great graph partition is used. On this paper, we endorse a novel partition aware graph computation engine named web page, which equips a new message processor and a dynamic concurrency manipulate mannequin. The brand new message processor simultaneously procedures neighborhood and far of messages in a unified manner. The dynamic model adaptively adjusts the concurrency of the processor established on the web facts. The experimental evaluation demonstrates the superiority of web page over the graph partitions with various features.
B. SATYA SALINI, CH. RAVINDRA REDDY, J.V.KRISHNA
Graph partition quality affects the overall efficiency of parallel graph computation systems. The high-quality of a graph partition is measured by means of the steadiness aspect and edge reduce ratio. A balanced graph partition with small area reduce ratio is customarily preferred for the reason that it reduces the steeply-priced community conversation fee. Nonetheless, in line with an empirical study on Graph, = the efficiency over well partitioned graph perhaps even two instances worse than simple randomfor the easy partition tactics and are not able to successfully manage the increasing workload of regional partitions. This is when you consider that these systems best optimize message processing when a high great graph partition is used. On this paper, we endorse a novel partition aware graph computation engine named web page, which equips a new message processor and a dynamic concurrency manipulate mannequin. The brand new message processor simultaneously procedures neighborhood and far of messages in a unified manner. The dynamic model adaptively adjusts the concurrency of the processor established on the web facts. The experimental evaluation demonstrates the superiority of web page over the graph partitions with various features.
USER-DEFINED PRIVACY GRID SYSTEMFOR CONTINUOUSLOCATION BASEDSERVICES
[View]
Ch.Navya Jyothi, Ch.Ravindra Reddy
Locationbasedservicesrequireuserstocontinuouslyreporttheirlocationtoapotentiallyuntrustedservertoobtainservicesbasedontheirlocation,whichcanexposethemtoprivacyrisks.Thesystemonlyrequiresasemi-trusted third party, responsible for carrying uts imple matching operations correctly. This semi trusted third party doesnot have any information about a user’s location. Although we only focus on range and k-nearest-neighbor queries in this work, our system can be easily extended to support others patialquerieswithoutchangingthealgorithms.
Ch.Navya Jyothi, Ch.Ravindra Reddy
Locationbasedservicesrequireuserstocontinuouslyreporttheirlocationtoapotentiallyuntrustedservertoobtainservicesbasedontheirlocation,whichcanexposethemtoprivacyrisks.Thesystemonlyrequiresasemi-trusted third party, responsible for carrying uts imple matching operations correctly. This semi trusted third party doesnot have any information about a user’s location. Although we only focus on range and k-nearest-neighbor queries in this work, our system can be easily extended to support others patialquerieswithoutchangingthealgorithms.
A FRAMEWORK TO FACILITATE DECISION OF CLOUD CARRIER VENDORS
[View]
V.Sainaresh, K.Venkateswara Rao, J.V.Krishna
With fast technological developments, cloud marketplace witnessed regularly occurring emergence of new carrier vendors with an identical offerings. However, provider stage agreements (SLAs), which record assured exceptional of carrier phases, have now not been found to be regular amongst providers, even though they offer services with identical performance. In service outsourcing environments, like cloud, the excellent of service levels are of top importance to customers, as they use 1/3-party cloud offerings to retailer and procedure their consumers’ knowledge. If loss of knowledge happens because of an outage, the patron’s trade will get affected. Consequently, the predominant undertaking for a patron is to pick an proper carrier supplier to ensure guaranteed carrier first-class. To aid patrons in reliably deciding upon superb carrier provider, this work proposes a framework, SelCSP, which mixes trustworthiness and competence to estimate threat of interaction. Trustworthiness is computed from private experiences gained by means of direct interactions or from feedbacks concerning reputations of providers. Competence is assessed headquartered on transparency in provider’s SLA guarantees. A case be taught has been offered to demonstrate the appliance of our method. Experimental outcome validate the practicability of the proposed estimating mechanisms.
V.Sainaresh, K.Venkateswara Rao, J.V.Krishna
With fast technological developments, cloud marketplace witnessed regularly occurring emergence of new carrier vendors with an identical offerings. However, provider stage agreements (SLAs), which record assured exceptional of carrier phases, have now not been found to be regular amongst providers, even though they offer services with identical performance. In service outsourcing environments, like cloud, the excellent of service levels are of top importance to customers, as they use 1/3-party cloud offerings to retailer and procedure their consumers’ knowledge. If loss of knowledge happens because of an outage, the patron’s trade will get affected. Consequently, the predominant undertaking for a patron is to pick an proper carrier supplier to ensure guaranteed carrier first-class. To aid patrons in reliably deciding upon superb carrier provider, this work proposes a framework, SelCSP, which mixes trustworthiness and competence to estimate threat of interaction. Trustworthiness is computed from private experiences gained by means of direct interactions or from feedbacks concerning reputations of providers. Competence is assessed headquartered on transparency in provider’s SLA guarantees. A case be taught has been offered to demonstrate the appliance of our method. Experimental outcome validate the practicability of the proposed estimating mechanisms.
BEHAVOIR RULE BASED ON MEDICAL CYBER PHYSICAL SYSTEMS
[View]
M.Kishore kumar, K.Venkateswara Rao, J.V.Krishna
We propose and analyze a behavior-rule specification-based technique for intrusion detection of medical devices embedded in a medical cyber physical system (MCPS) in which the patient’s safety is of the utmost importance. We propose a methodology to transform behavior rules to a state machine, so that a device that is being monitored for its behavior can easily be checked against the transformed state machine for deviation from its behavior specification. Using vital sign monitor medical devices as an example, we demonstrate that our intrusion detection technique can effectively trade false positives off for a high detection probability to cope with more sophisticated and hidden attackers to support ultra safe and secure MCPS applications. Moreover, through a comparative analysis, we demonstrate that our behavior-rule specification-based IDS technique outperforms two existing anomaly-based techniques for detecting abnormal patient behaviors in pervasive healthcare applications.
M.Kishore kumar, K.Venkateswara Rao, J.V.Krishna
We propose and analyze a behavior-rule specification-based technique for intrusion detection of medical devices embedded in a medical cyber physical system (MCPS) in which the patient’s safety is of the utmost importance. We propose a methodology to transform behavior rules to a state machine, so that a device that is being monitored for its behavior can easily be checked against the transformed state machine for deviation from its behavior specification. Using vital sign monitor medical devices as an example, we demonstrate that our intrusion detection technique can effectively trade false positives off for a high detection probability to cope with more sophisticated and hidden attackers to support ultra safe and secure MCPS applications. Moreover, through a comparative analysis, we demonstrate that our behavior-rule specification-based IDS technique outperforms two existing anomaly-based techniques for detecting abnormal patient behaviors in pervasive healthcare applications.
DESIGN OF UNMANNED PETROL BUNK SYSTEM USING RFID TECHNOLOGY
[View]
T.LAKSHMI PRASANNA, P.N.S. MADHUSUDHANA RAO
Today almost all petrol pumps havea microcontroller to control the electrical pump,drive the display,measure the flow & accordingly turnOFF the electrical pump.Butstillapersonisrequiredtocollectthemoney.Ourprojectisdesignedtoeliminatethishumaninteractionsothatthereisnoneedofworkerstofillthepetrol;Ingeneral,asmartcardisanintegratedcircuitcardwithmemorycapableofmakingdecisions.Thisprojectcanbeusedforrecordingtheattendanceofanemployeeinanorganizationorastudentinaclass.ThesmartcardcontainsanARM7 microcontroller, a voltageregulator, serialcableconnections, and an LED which glows whenever a car disinserted into the reader and also it glowswheneveritissuesanycommandorreceivesanycommand.TheSmartCardReaderisinterfacedwiththemicrocontrollerthroughserialinterface.
T.LAKSHMI PRASANNA, P.N.S. MADHUSUDHANA RAO
Today almost all petrol pumps havea microcontroller to control the electrical pump,drive the display,measure the flow & accordingly turnOFF the electrical pump.Butstillapersonisrequiredtocollectthemoney.Ourprojectisdesignedtoeliminatethishumaninteractionsothatthereisnoneedofworkerstofillthepetrol;Ingeneral,asmartcardisanintegratedcircuitcardwithmemorycapableofmakingdecisions.Thisprojectcanbeusedforrecordingtheattendanceofanemployeeinanorganizationorastudentinaclass.ThesmartcardcontainsanARM7 microcontroller, a voltageregulator, serialcableconnections, and an LED which glows whenever a car disinserted into the reader and also it glowswheneveritissuesanycommandorreceivesanycommand.TheSmartCardReaderisinterfacedwiththemicrocontrollerthroughserialinterface.
VIDEO TRAFFIC IN WIRELESS MULTI HOP NETWORKS USING DISTORTION-RESISTANT ROUTING FRAMEWORK
[View]
G. Indraja, K.Venkateswara Rao, J.V.Krishna
Traditional routing metrics designed for wireless networks are application-agnostic. In this paper, we consider a wireless network where the application flows consist of video traffic. From a user perspective, reducing the level of video distortion is critical. We ask the question “Should the routing policies change if the end-to-end video distortion is to be minimized?” Popular link- quality-based routing metrics (such as ETX) do not account for dependence (in terms of congestion) across the links of a path; as a result, they can because video flows to converge onto a few paths and, thus, cause high video distortion. To account for the evolution of the video frame loss process, we construct an analytical framework to, first, understand and, second, assess the impact of the wireless network on video distortion. The framework allows us to formulate a routing policy for minimizing distortion, based on which we design a protocol for routing video traffic. We find via simulations and test-bed experiments that our protocol is efficient in reducing video distortion and minimizing the user experience degradation.
G. Indraja, K.Venkateswara Rao, J.V.Krishna
Traditional routing metrics designed for wireless networks are application-agnostic. In this paper, we consider a wireless network where the application flows consist of video traffic. From a user perspective, reducing the level of video distortion is critical. We ask the question “Should the routing policies change if the end-to-end video distortion is to be minimized?” Popular link- quality-based routing metrics (such as ETX) do not account for dependence (in terms of congestion) across the links of a path; as a result, they can because video flows to converge onto a few paths and, thus, cause high video distortion. To account for the evolution of the video frame loss process, we construct an analytical framework to, first, understand and, second, assess the impact of the wireless network on video distortion. The framework allows us to formulate a routing policy for minimizing distortion, based on which we design a protocol for routing video traffic. We find via simulations and test-bed experiments that our protocol is efficient in reducing video distortion and minimizing the user experience degradation.
Pages [1]
This work is licensed under a Creative Commons Attribution 3.0 License.
© 2011 - 2012 International Journal of Engineering In Advanced Research Science and Technology
Managed By IJEARST Foundation
International Journal of Engineering In Advanced Research Science and Technology ISSN : 2278-2566 (Online)
All rights reserved witheditor@IJEARST.COM.
To make sure that you can receive messages from us, please add the 'IJEARST.COM' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.
For any Technical Support contact @complaint@IJEARST.COM