International Journal of Scientific Research in Science, Engineering and Technology
Cloud Computing is becoming a dominant trend in providing information technology (IT) services. T... more Cloud Computing is becoming a dominant trend in providing information technology (IT) services. The cloud comprises many hardware and software resources today, and more people are switching to such services. Users' requests for cloud resources must incur a minimum amount of load on the system while getting a rapid response. In the cloud today, there is too much computational power. Load balancing makes it possible for various components of the cloud computing environment to work efficiently. To balance client requests to available resources so that the system is not overloaded, and the requested resources are delivered as quickly as possible, an effective load balancing strategy is essential. In this research article, we have presented a critical analysis of various existing cloud load balancing and scheduling algorithms. Several task scheduling approaches have been proposed in the literature review, but there appears to be a lack of scheduling algorithms for real-time task work...
A Comparitive Analysis of Different Algorithms Used in Iot Based Smart Car Parking Systems
1Department of Computer Engineering, Atmiya Institute of Technology & Science Rajkot, Gujarat, In... more 1Department of Computer Engineering, Atmiya Institute of Technology & Science Rajkot, Gujarat, India 2,3Assistant Professor of Computer Engineering, Atmiya Institute of Technology & Science Rajkot, Gujarat, India ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract -Internet of Things (IoT) is an ecosystem of connected physical objects that are accessible through the internet. The ‘thing’ in IoT could be a person with a heart monitor or an automobile with built-in-sensors, i.e. objects that have been assigned an IP address and have the ability to collect and transfer data over a network without any human interaction. Using IoT we can developed a smart parking system that automatically handle the parking and traffic using many techniques, algorithms and sensors. There are many algorithms are used for handle traffic and parking related situation. This paper contains the overview of differen...
Energy efficient algorithm for Neighbor discovery using modify OLSR in wireless sensor network
OLSR is a Proactive table driven routing protocol in which each nodes sends HELLO message periodi... more OLSR is a Proactive table driven routing protocol in which each nodes sends HELLO message periodically to the neighboring nodes as link state routing protocol. Optimized Link State Routing is extension of link state routing where each node selects MPR (Multi Point Relay) as neighboring node to reduce the overall broadcasting. Proposed work is the modification of HELLO message and TC message with consideration of residual energy. Reserved bits in HELLO and TC message will be placed by the Residual energy of the next hope. All source-destination path will be calculated and stored in topology table. We Provide multiple path from source to destination so if any best path fails due to reduce residual energy of MPR, an alternate path will come into scenario so as to increase throughput of the network system. Keywords— wireless sensor network, OLSR, MPR, HELLO, TC.
Energy is a primary constraint for mobile systems. Smartphones are started also being used for vo... more Energy is a primary constraint for mobile systems. Smartphones are started also being used for voice communication; instead, they are used for acquiring and watching videos online, online gaming, web surfing, and many other purposes. As a result, these systems will likely consume more power. And usage of network is the first parameter to lower the performance of device. Algorithm given contains taking a meaningful decision between offloading and Local Computation. And if offloading is needed, it also provides the cheapest way of it. So with the increasingly use of mobile cloud computing we can make a device performance better in Dynamic Environment.
In this paper, we examine the issue of mining association rules among items in a large database o... more In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. The mining of association rules can be mapped into the problem of discovering large itemsets where a large itemset is a group of items which appear in a sufficient number of transactions. The problem of discovering large itemsets can be solved by constructing a candidate set of itemsets first and then, identifying, within this candidate set, those itemsets that meet the large itemset requirement. Generally this is done iteratively for each large k -itemset in increasing order of k where a large k -itemset is a large itemset with k items. To determine large itemsets from a huge number of candidate large itemsets in early iterations is usually the dominating factor for the overall data mining performance. To address this issue, we propose an effective hash-based algorithm for the candidate set generation. Explicitly, the number of candidate 2-itemsets generated by the...
Automatic Text Detection, Removal and Restoration Using Image Inpainting
ejournal.aessangli.in
ABSTRACT: In this paper, I have explain that how to detect the text from image using various text... more ABSTRACT: In this paper, I have explain that how to detect the text from image using various text detection algorithm. After text detection how to generate mask image of given text and how to apply image in painting technique on given original image using resulted mask ...
Now a day the database is becoming large. The Apriori algorithm is used to find frequent itemsets... more Now a day the database is becoming large. The Apriori algorithm is used to find frequent itemsets but in the apriori algorithm there is requirement to scan the database many times this is significant when we work with the small database but we concern with large database so we will use hash based technique which reduce the size of the candidate generation. Here we have used H-bit array hashing algorithm and N-hash algorithm to create new hashing algorithm which is having advantages of both the algorithm. The generated algorithm does not use the lengthy and complex process of mapping items into the bucket by hashing algorithm. The proposed algorithm is efficient and requires less space for hash table and maps items into hash table without collision.
Uploads
Papers by Dhaval Nimavat