Remote Queue Handling At Filling Stations (EasyQ)
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2016, Vol 18, Issue 2
Abstract
Abstract: In countries with social and economic disorder, people are daily part of different queues in different situations, especially for the working class after a hectic day at office when they have to be part of long queues at Filling stations. And after waiting for several hours, they aren’t sure that they will be able to get the Fuel. It makes the people uncomfortable because it disturbs their daily routine. This factor effects heavily and adversely on the economy of developing countries.
Authors and Affiliations
Salman Afghani, Saad Ahmed Khan, Hassaan Shahid Butt, Muhammad Waqas and Muhammad Ishfaq Javed
Keywords
Related Articles
- EP ID EP133293
- DOI -
- Views 115
- Downloads 0
A Survey on Authorization Systems for Web Applications
Abstract: Web services are the most important point of usage for the modern web architecture. The Serviceoriented architecture (SOA) used in web services offers a simple platform for integrating heterogeneousdistri...
An Entropy-based Feature in Epileptic Seizure Prediction Algorithm
Abstract : Epilepsy prediction is a vital demand for people suffering from epileptic onset. Prediction of seizure onsets could be very useful for drug-resistant epileptic patients. We propose an epileptic seizure predict...
Hand Gesture Recognition System for Creating & Controlling Media Player using Mat Lab Tool
Abstract: In this paper we have discussed a dynamic hand gesture recognition system for creating and controlling the media player. The system is made possible by using the concepts of threshold and color detection. The...
Nanobiosensors: Ideas And Variations
Biosensing has been one amongst the most popular topic attracting scientific minds since long back. It’s therefore as biological entities square measure terribly complicated and square measure directly related to the exi...
An Optimized Algorithm for Solving Combinatorial Problems using Reference Graph
Abstract: In this paper a novel optimized graph referencing method is proposed to tackle combinatorial problems with greater ease. The proposed algorithm is a modification of the existing backtracking algorithm....