Monday, October 3, 2011

ADAPTIVE PROVISIONING OF HUMAN EXPERTISE IN SERVICE-ORIENTED SYSTEMS

ADAPTIVE PROVISIONING OF HUMAN EXPERTISE IN

SERVICE-ORIENTED SYSTEMS

ABSTRACT:

Web-based collaborations have become essential in today’s business environments. Due to the availability of various SOA frameworks, Web services emerged as the de facto technology to realize flexible compositions of services. While most existing work focuses on the discovery and composition of software based services, we highlight concepts for a people-centric Web. Knowledge-intensive environments clearly demand for provisioning of human expertise along with sharing of computing resources or business data through software-based services. To address these challenges, we introduce an adaptive approach allowing humans to provide their expertise through services using SOA standards, such as WSDL and SOAP. The seamless integration of humans in the SOA loop triggers numerous social implications, such as evolving expertise and drifting interests of human service providers. Here we propose a framework that is based on interaction monitoring techniques enabling adaptations in SOA-based socio-technical systems.


ARCHITECTURE:


EXISTING SYSTEM:

While most existing work focuses on the discovery and composition of software based services, we highlight concepts for a people-centric Web. Knowledge-intensive environments clearly demand for provisioning of human expertise along with sharing of computing resources or business data through software-based services.

Disadvantages:

To address these challenges, we introduce an adaptive approach allowing humans to provide their expertise through services using SOA standards, such as SOAP.


PROPOSED SYSTEM:

The seamless integration of humans in the SOA loop triggers numerous social implications, such as evolving expertise and drifting interests of human service providers. Here we propose a framework that is based on interaction monitoring techniques enabling adaptations in SOA-based socio-technical systems.

Advantages:

  • These systems are characterized by both technical and human/social aspects that are tightly bound and interconnected.
  • The technical aspects are very similar to traditional SOAs, including facilities to deploy, register and discover services, as well as to support flexible interactions.


HARDWARE & SOFTWARE REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System : Pentium IV 2.4 GHz.

• Hard Disk : 40 GB.

• Floppy Drive : 1.44 Mb.

• Monitor : 15 VGA Colour.

• Mouse : Logitech.

• Ram : 512 MB.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP.

• Coding Language : ASP.Net with C#

• Data Base : SQL Server 2005


MODULE DESSCRIPTION:

COLLABORATION PARTNERS:

The demand for models to support larger-scale flexible collaborations has led to an increasing research interest in adaptation techniques to enable and optimize interactions between collaboration partners. For example, changing interests and expertise of people, evolving interaction patterns due to dynamically changing roles of collaboration partners, or evolving community structures. They provide the means to specify well-defined interfaces and let customers and collaboration partners use an organization’s resources through dedicated operations.

SERVICE INSTANCES:

The concept of personalized provisioning is enabled by creating dedicated service instances for each single customer of service providers. A standard service is instantiated and gradually customized according to a client’s requirements and a provider’s behavior. Web services can help to solve the interoperability problem by giving different applications a way to link their data. With Web services you can exchange data between different applications and different platforms.

INTERACTION MODEL:

User are not statically bound to clients but are discovered at run-time. Thus, interactions are ad-hoc and dynamically performed with often not previously known partners. In SOA, interactions are typically modeled as SOAP messages. Moreover, the document translation service might be successfully used for research papers in computer science, while it is not frequently used to translate business documents.

ADAPTATION STRATEGIES:

Client-driven interventions are the means to protect customers from unreliable services. For example, services that miss deadlines or do not respond at all for a longer time are replaced by other more reliable services in future discovery operations.

Provider-driven interventions are desired and initiated by the service owners to shield themselves from malicious clients. For instance, requests of clients performing a denial of service attack by sending multiple requests in relatively short intervals are blocked (instead of processed) by the service.

Adaptive Fault Tolerant QoS Control Algorithms for Maximizing System Lifetime of Query-Based Wireless Sensor Networks

Adaptive Fault Tolerant QoS Control Algorithms for Maximizing System Lifetime of Query-Based Wireless Sensor Networks

Abstract

Data sensing and retrieval in wireless sensor systems have a widespread application in areas such as security and surveillance monitoring, and command and control in battlefields. In query-based wireless sensor systems, a user would issue a query and expect a response to be returned within the deadline. While the use of fault tolerance mechanisms through redundancy improves query reliability in the presence of unreliable wireless communication and sensor faults, it could cause the energy of the system to be quickly depleted. Therefore, there is an inherent tradeoff between query reliability vs. energy consumption in query-based wireless sensor systems. In this paper, we develop adaptive fault tolerant quality of service (QoS) control algorithms based on hop-by-hop data delivery utilizing “source” and “path” redundancy, with the goal to satisfy application QoS requirements while prolonging the lifetime of the sensor system. We develop a mathematical model for the lifetime of the sensor system as a function of system parameters including the “source” and “path” redundancy levels utilized. We discover that there exists optimal “source” and “path” redundancy under which the lifetime of the system is maximized while satisfying application QoS requirements. Numerical data are presented and validated through extensive simulation, with physical interpretations given, to demonstrate the feasibility of our algorithm design.

Architecture

Architecture of WSN

Algorithm

1. Adaptive fault tolerant QoS control (AFTQC) algorithm:

Algorithm developed in this paper takes two forms of redundancy. The first form is path redundancy. That is, instead of using a single path to connect a source cluster to the processing center, mp disjoint paths may be used. The second is source redundancy. That is, instead of having one sensor node in a source cluster return requested sensor data, ms sensor nodes may be used to return readings to cope with data transmission and/or sensor faults. The above architecture illustrates a scenario in which mp = 2 (two paths going from the CH to the processing center) and ms = 5 (five SNs returning sensor readings to the CH).

2. Clustering Algorithm:

A clustering algorithm that aims to fairly rotate SNs to take the role of CHs has been used to organize sensors into clusters for energy conservation purposes. The function of a CH is to manage the network within the cluster, gather sensor reading data from the SNs within the cluster, and relay data in response to a query. clustering algorithm is executed during the system lifetime.

• Aggregation of readings

• Each cluster has a CH

• Users issue queries through any CH.

• CH that receives the query is called the Processing Center (PC)

• Each non-CH node selects the CH candidate with the highest residual energy, sends it a cluster join message (includes the non-CH node’s location). The CH will acknowledge this message.

• Randomly rotates role of CH among nodes -> nodes consume their energy evenly

Existing System:

Existing research efforts related to applying redundancy to satisfy QoS requirements in query-based WSNs fall into three categories: traditional end-to-end QoS, reliability assurance, and application specific QoS . Traditional end-to-end QoS solutions are based on the concept of end-to-end QoS requirements. The problem is that it may not be feasible to implement end-to-end QoS in WSNs due to the complexity and high cost of the protocols for resource constrained sensors.

This method does not consider the reliability issue.

Disadvantages:

1. Complexity and high cost of the protocols for resource constrained sensors

2. Does not consider the reliability issue.

3. Does not consider energy issues.

4. Data delivery such as reliability and timelines are not considered.

Proposed System:

In this paper, we develop adaptive fault tolerant quality of service (QoS) control algorithms based on hop-by-hop data delivery utilizing “source” and “path” redundancy, with the goal to satisfy application QoS requirements while prolonging the lifetime of the sensor system. We develop a mathematical model for the lifetime of the sensor system as a function of system parameters including the “source” and “path” redundancy levels utilized. We discover that there exists optimal “source” and “path” redundancy under which the lifetime of the system is maximized while satisfying application QoS requirements.

Advantages:

1. To applying redundancy to satisfy application specified reliability and timeliness requirements for query-based WSNs.

2. We develop the notion of “path” and “source” level redundancy

3. Lifetime of the system is maximized.

4. Timeliness, Multiple data delivery speed options.

5. Reliability, Multi-path forwarding.

Modules:

1. General Approach

In this paper we are also interested in applying redundancy to satisfy application specified reliability and timeliness requirements for query-based WSNs. Moreover, we aim to determine the optimal redundancy level that could satisfy QoS requirements while prolonging the lifetime of the WSN. Specifically, we develop the notion of “path” and “source” level redundancy. When given QoS requirements of a query, we identify optimal path and source redundancy such that not only QoS requirements are satisfied, but also the lifetime of the system is maximized. We develop adaptive fault tolerant QoS control (AFTQC) algorithms based on hop-by-hop data delivery to achieve the desired level of redundancy and to eliminate energy expended for maintaining routing paths in the WSN.

2. Software Fault

For source redundancy, ms SNs are used for returning sensor readings. If we consider both hardware and software failures of SNs, the system will fail if the majority of SNs does not return sensor readings (due to hardware failure), or if the majority of SNs returns sensor readings incorrectly (due to software failure). Assume that all SNs have the same software failure probability, denoted by qs. Also assume that all sensors that sense a given event make the same measurements. The probability that the majority of ms SNs failing to return sensor readings due to hardware failure, and the second expression is the probability that the majority of ms SNs returning sensor readings but no majority of them agrees on the same sensor reading as the output because of software failure.

3. Data Aggregation

The analysis performed thus far assumes that a source CH does not aggregate data. The CH may receive up to ms redundant sensor readings due to source redundancy but will just forward the first one received to the PC. Thus, the data packet size is the same. For more sophisticated scenarios, conceivably the CH could also aggregate data for query processing and the size of the aggregate packet may be larger than the average data packet size. We extend the analysis to deal with data aggregation in two ways. The first is to set a larger size for the aggregated packet that would be transmitted from a source CH to the PC. This will have the effect of favoring the use of a smaller number of redundant paths (i.e., mp) because more energy would be expended to transmit aggregate packets from the source CH to the PC. The second is for the CH to collect a majority of sensor readings from its sensors before data are aggregated and transmitted to the PC.

4. Forward Traffic

The analysis performed in the paper considers only the reserve traffic for response propagation from SNs to the PC but neglects the forward traffic for query dissemination from the sink to the CH and SNs. The reliability and energy consumption of the forward traffic due to hop-by-hop query delivery can be calculated by following a similar analysis as for the reverse traffic. The success probability (Rq) would be adjusted by considering the forward traffic and reverse traffic together as a series system. The energy consumption of a query (Eq) would be used to calculate the maximum number of queries the system can possibly process.

HARDWARE & SOFTWARE REQUIREMENTS:

HARDWARE REQUIREMENTS:

· System : Pentium IV 2.4 GHz.

· Hard Disk : 40 GB.

· Floppy Drive : 1.44 Mb.

· Monitor : 15 VGA Color.

· Mouse : Logitech.

· Ram : 512 MB.

SOFTWARE REQUIREMENTS:

· Operating system : Windows XP Professional.

· Coding Language : C#.NET

Wednesday, August 3, 2011

IEEE 2011 DOTNET PROJECTS

IEEE 2011 DOTNET PROJECTS

KNOWLEDGE AND DATA ENGINEERING

1. Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud.

2. Adaptive Provisioning of Human Expertise in Service-oriented Systems.

3. Bridging Socially-Enhanced Virtual Communities.

4. Data integrity proofs in cloud storage.

5. Efficient Computing of Range Aggregates against Uncertain Location Based Collections.

6. Exploring Application-Level Semantics for Data Compression.

7. Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques.

8. Integration of Sound Signature in Graphical Password Authentication System.

9. Monitoring Service Systems from a Language-Action Perspective.

10. One Size Does Not Fit All Towards User- and Query-Dependent Ranking For Web Databases.

11. Optimal Service Pricing for a Cloud Cache.

12. A Personalized Ontology Model for Web Information Gathering.

13. Publishing Search Logs-A Comparative Study of Privacy Guarantees.

14. Scalable Scheduling of Updates in Streaming Data Warehouse.

15. The Awareness Network, To Whom Should I Display My Actions? And, Whose Actions Should I Monitor?.

16. The World in a Nutshell Concise Range Queries.

17. A Unified Probabilistic Framework for Name Disambiguation in Digital Library.

18. Effective Navigation of Query Results Based on Concept Hierarchies.

19. Bridging Domains Using World Wide Knowledge for Transfer Learning.

20. Automatic Template Extraction from Heterogeneous Web Pages.

21. Mining Web Graphs for Recommendations.

22. Horizontal Aggregations in SQL to prepare Data Sets for Data Mining Analysis.

23. Document Clustering in Correlations Similarity Measure Space.

24. Scalable learning of collective behavior.

25. Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators.

26. A Query Formulation Language for Data web.

27. On the Complexity of View Update Analysis and its Application to Annotation Propagation.

28. Concise Range Queries.

29. A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases.

30. Exploring Application-Level Semantics for Data Compression.

WIRELESS COMMUNICATIONS

31. Network Coding Based Privacy Preservation against Traffic Analysis in Multi-hop Wireless Networks.

32. Throughput Optimization in High Speed Downlink Packet Access (HSDPA).

33. Distributed Adaptation of Quantized Feedback for Downlink Network MIMO Systems.

34. A Spatiotemporal Approach for Secure Range Queries in Tiered Sensor Networks.

NETWORKING

35. Live Streaming with Receiver-based Peer-division Multiplexin.

36. Continuous Neighbor Discovery in Asynchronous Sensor Networks.

37. Jamming-Aware Traffic Allocation for Multiple-Path Routing Using Portfolio Selection.

SECURE COMPUTING

38. A Policy Enforcing Mechanism for Trusted Ad Hoc Network.

39. A Tamper-Resistant Programming Language System.

40. Adaptive Fault Tolerant QoS Control Algorithms for Maximizing System Lifetime of Query-Based Wireless Sensor Networks.

41. Robust Correlation of Encrypted Attack Traffic through Stepping Stones by Flow Watermarking.

42. The Geometric Efficient Matching Algorithm for Firewalls.

SERVICE COMPUTING (SOA)

43. Vulnerability Analysis in SOA-based Business Processes.

42. Automated Certification for Compliant Cloud-based Business Processes.

NETWORK COMPUTING

45. Improved division by invariant integers.


Download Link:

http://www.scribd.com/ieeexploreprojects


IEEE Projects 2011 Titles JAVA

IEEE 2011 JAVA PROJECTS

MOBILE COMPUTING

1. Secure High-Throughput Multicast Routing in Wireless Mesh Networks.

2. Supporting Efficient and Scalable Multicasting over Mobile Ad Hoc Networks.

3. A Privacy-Preserving Location Monitoring System for Wireless Sensor Networks.

4. Optimal Stochastic Location Updates in Mobile Ad Hoc Networks.

5. Throughput Optimization in Mobile Backbone Networks.

WIRELESS COMMUNICATIONS

6. Utility-Optimal Multi-Pattern Reuse in Multi-Cell Networks.

7. Generalized Analysis of a Distributed Energy Efficient Algorithm for Change Detection.

8. A Threshold-Selective Multiuser Downlink MAC scheme for 802.11n Wireless Networks.

9. Blind Channel Estimation for STBC Systems Using Higher-Order Statistics.

10. Improving the Performance of Wireless Ad Hoc Networks through MAC Layer Design.

11. Fundamental Limits of Information Dissemination in Wireless Ad Hoc Networks–Part II: Multi-Packet Reception.

12. Weighted Energy Detection for No coherent Ultra-Wideband Receiver Design.

NETWORKING

13. ProgME: Towards Programmable Network Measurement.

14. Buffer Sizing for 802.11 Based Networks.

15. Monitoring Service Systems from a Language-Action Perspective.

16. Is Cloned Code older than Non-Cloned Code?.

17. A Unified Approach to Optimizing Performance in Networks Serving Heterogeneous Flows.

18. Delay Analysis and Optimality of Scheduling Policies for Multi-Hop Wireless Networks

19. Selfish Overlay Network Creation and Maintenance.

20. SPAF: Stateless FSA-based Packet Filters.

21. Topological Transformation Approaches to TCAM-Based Packet Classification.

SECURE COMPUTING

22. A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree.

23. SAT: A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks.

24. Chip Self-Organization and Fault-Tolerance in Massively Defective Multicore Arrays.

25. Comparative Evaluation of Spoofing Defenses.

26. Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET.

27. Modeling and Detection of Camouflaging Worm.

28. Nymble: Blocking Misbehaving Users in Anonym zing Networks.

29. RITAS: Services for Randomized Intrusion Tolerance.

NETWORK AND SERVICE MANAGEMENT

30. Locating Equivalent Servants over P2P Networks.

31. Achieving Bounded Matching Delay and Maximized Throughput in Information Dissemination Management Improved division by invariant integers.

KNOWLEDGE AND DATA ENGINEERING

32. Decision Trees for Uncertain Data.

33. Ranking Spatial Data by Quality Preferences.

34. A Link-Analysis Extension of Correspondence Analysis for Mining Relational Databases.

35. Load Shedding in Mobile Systems with MobiQual .

36. Adaptive Cluster Distance Bounding for High Dimensional Indexing.

37. Effective Navigation of Query Results Based on Concept Hierarchies.

38. Discovering Conditional Functional Dependencies.

39. The CoQUOS Approach to Continuous Queries in Unstructured Overlays.

40. Extended XML Tree Pattern Matching: Theories and Algorithms.

41. Learning Semi-Riemannian Metrics for Semi supervised Feature Extraction .

SOFTWARE ENGINEERING

42. Semi-Proving: An Integrated Method for Program Proving, Testing, and Debugging .

43. Verifying the Evolution of Probability Distributions Governed by a DTMC .

44. Software Module Clustering as a Multi–Objective Search Problem .

45. Genetic Algorithms for Randomized Unit Testing.

46. Developing a Single Model and Test Prioritization Strategies for Event-Driven Software.

CLOUD COMPUTING

48. Improving Utilization of Infrastructure Clouds.

49. Secure and Practical Outsourcing of Linear Programming in Cloud Computing.

50. Going Back and Forth: Efficient Multideployment and Multisnapshotting on Clouds.


Download Link:

http://www.scribd.com/ieeexploreprojects

Friday, September 17, 2010

2010 IEEE Project Title Base Paper

2010 IEEE Project Title Base Paper- Dot NET

1. Download Link: 

http://rapidshare.com/files/419563061/Dot_NET_2010.rar

MD5: 781C23EB3BA7DF159C8AFF7C7999C55A

------------------------------------------------------------------------------------

2010 IEEE Project Title Base Paper - Java

1. Download Link:

http://rapidshare.com/files/419562650/Java_2010.rar
MD5: BEDFA78C6E1A2A871AE2E9B930B9B070

Saturday, August 28, 2010

2008_IEEE_Project_Title_Base_Paper

1. Download Link: Click here to download file

http://rapidshare.com/files/415596690/2008_IEEE_Project_Title_Base_Paper.rar
MD5: 78A5BF827298D399D52529D5BCB8BF59