Apurva Shah

Apurva Shah
The Maharaja Sayajirao University of Baroda | MSU · Department of Computer Science and Engineering

Ph.D. (Computer Engineering)

About

41
Publications
4,618
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
229
Citations
Citations since 2017
21 Research Items
126 Citations
2017201820192020202120222023010203040
2017201820192020202120222023010203040
2017201820192020202120222023010203040
2017201820192020202120222023010203040
Introduction
Myself Apurva Shah working as Professor and Head, Department of Computer Science & Engineering as well as Director, Computer Center of the Maharaja Sayajirao University of Baroda, Vadodara, India. I have total 19 years of teaching , research and administrative experience.
Additional affiliations
May 2013 - November 2018
The Maharaja Sayajirao University of Baroda
Position
  • Professor (Associate)
July 2000 - April 2013
G H Patel College of Engineering and Technology (GCET)
Position
  • Professor (Associate)
Education
June 2005 - January 2010
Sardar Patel University
Field of study
  • Computer Science and Engineering

Publications

Publications (41)
Article
We are not able to deal with a mammoth text corpus without summarizing them into a relatively small subset. A computational tool is extremely needed to understand such a gigantic pool of text. Probabilistic Topic Modeling discovers and explains the enormous collection of documents by reducing them in a topical subspace. In this work, we study the b...
Article
Full-text available
Scheduling of tasks in Real-Time Systems is based on static or dynamic priority like earliest deadline first (EDF) and rate monotonic, respectively. The static scheduler does not give assurance of scheduling all tasks during the underload scenario, whereas dynamic scheduler performs poorly during an overload scenario. This paper has proposed a swar...
Article
Full-text available
A topic model is one of the best stochastic models for summarizing an extensive collection of text. It has accomplished an inordinate achievement in text analysis as well as text summarization. It can be employed to the set of documents that are represented as a bag-of-words, without considering grammar and order of the words. We modeled the topics...
Article
In the Soft Real-Time System scheduling process with the processor is a critical task. The system schedules the processes on a processor in a time interval, and hence the processes get chance to executes on the processor. Priority-driven scheduling algorithms are sub-categorized into mainly two categories called Static Priority and Dynamic Priority...
Article
The Ant Colony Optimization (ACO) algorithm is a mathematical model enlivened by the system searching conduct of ants. By taking a gander at the qualities of ACO, it is most suitable for scheduling of tasks in soft real-time systems. In this paper, the ACO based scheduling method for the soft real-time operating system (RTOS) has been profound with...
Method
Full-text available
Recently, the work load is gradually increasing in distributed operating system. Hence it is mandatory to balance such load in this environment. There are various methods to balance the load. In this paper, process division and migration based technique has been used to balance the load. The proposed algorithm has given best result for CPU bound pr...
Method
Recently, the work load is gradually increasing in distributed operating system. Hence it is mandatory to balance such load in this environment. There are various methods to balance the load. In this paper, process division and migration based technique has been used to balance the load. The proposed algorithm has given best result for CPU bound pr...
Chapter
Since long time memory management algorithms have been studied widely, inadequate devotion has been concentrated on the real-time characteristic. Furthermost algorithms are general-purpose and do not fulfill the necessities of real-time systems. Moreover, the few allocators supporting real-time systems do not emphasizes well on multiprocessors arch...
Chapter
Every country has its own currency in terms of coins and paper notes. Each of the currency of Individual County has its unique features, colors, denominations, and international value. Though it is easy for us to identify the denomination but for the blind people, it is a not at all possible to do this! Especially when size of currency of different...
Article
Full-text available
Stemmer is very important and required module for any morphological system. Stemming process is language dependent, which separates stem and suffix from a given word. Even after notable growth, specifically work at morphological level for Indian resource poor languages like Sanskrit, Assamese, Bengali, Bishnupriya, Manipuri, Bodo etc. are less atte...
Conference Paper
God created this universe along with all living and non-living beings. Human is one of the best among his creations and in Human beings, eyes are the gift of God to see His creations. As of now, humans are considered as the only developed creatures among His creations and have developed themselves from Stone Age to the Computing Era. As the human c...
Conference Paper
God created this universe along with all living and non-living beings. Human is one of the best among his creations and in Human beings, eyes are the gift of God to see His creations. As of now, humans are considered as the only developed creatures among His creations and have developed themselves from Stone Age to the Computing Era. As the human c...
Article
Full-text available
The present article reviews work on morphological analysis, a subfield of computational linguistics. Special focus is given on statistical approach for morpheme segmentation. We delineate morphological analysis as a problem of persuading a narrative of some kind. However, this paper considered the problem of morpheme segmentation. Morpheme segmenta...
Article
Biologically inspired data mining techniques have been intensively used in different data mining applications. Ant Colony Optimization (ACO) has been applied for scheduling real-time distributed systems in the recent time. Real-time processing requires both parallel activities and fast response. It is required to complete the work and deliver servi...
Conference Paper
The most challenging part of scheduling in real time systems is to achieve successful completion of a job before its deadline. Mainly two categories of algorithms i.e. static and dynamic tried to achieve this but both categories failed either in under-loaded condition or in over-loaded condition. Dynamic algorithms achieve optimum results in under-...
Chapter
The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this...
Conference Paper
Full-text available
A scheduling algorithm decides a schedule for a set of tasks. There are numbers of algorithm for scheduling tasks on a processor. Some of these algorithms are used for scheduling tasks on multiprocessor system either under the partitioning scheme or under the global scheduling scheme. The most common scheduling algorithms are: Earliest Deadline Fir...
Article
The Ant Colony Optimization ACO algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this pa...
Conference Paper
The Ant Colony Optimization algorithms (ACO) are computational models inspired by the collective foraging behavior of ants. By looking at the strengths of ACO, they are the most appropriate for scheduling of tasks in soft real-time systems. In this paper, ACO based scheduling algorithm for real-time operating systems (RTOS) has been proposed. Durin...
Article
Dynamic scheduling has been always a challenging problem for real-time distributed systems. EDF (Earliest Deadline First) algorithm has been proved to be optimal scheduling algorithm for single processor real-time systems and it performs well for distributed systems also. In this paper, we have proposed scheduling algorithms for client/server distr...
Article
Purpose – In client/server distributed systems, the server is often the bottleneck. Improving the server performance is thus crucial for improving the overall performance of distributed information systems. Real‐time system is required to complete its work and deliver its services on a timely basis. The purpose of this paper is to propose a new sch...
Conference Paper
EDF (earliest deadline first) has been proved to be optimal scheduling algorithm for single processor real-time system. It also performs well for multiprocessor system. Limitation of EDF is that its performance decreases exponentially when system becomes slightly overloaded. ACO (ant colony optimization) based scheduling algorithm performs well in...
Article
Dynamic scheduling has been always a challenging problem for real-time distributed systems. EDF (Earliest Deadline First) algorithm has been proved to be optimal scheduling algorithm for single processor real-time systems and it performs well for distributed systems also. Limitation of EDF is that it cannot perform well when the system becomes over...
Conference Paper
EDF (earliest deadline first) has been proved to be optimal scheduling algorithm for single processor realtime operating systems when the systems are preemptive and underloaded. The limitation of this algorithm is, its performance decreases exponentially when system becomes slightly overloaded. Authors have already proved ability of ACO (Ant Colony...
Conference Paper
In this paper, Fuzzy Base Management System (FBMS) is designed to identify colors by their names. As a case, a fuzzy membership function has been discussed to identify colors by their name for color monitors, supporting true color quality. Since, color provides a significant portion of visual information to human beings, it is one of the important...
Conference Paper
EDF (Earliest Deadline First) has been proved to be optimal algorithm for single processor real-time system when the system is preemptive and underloaded. Limitation of EDF algorithm is that its performance decreases exponentially when system becomes slightly overloaded. Our aim is to improve the performance of EDF algorithm in overloaded condition...
Article
The problem of process scheduling in distributed system is one of the important and challenging area of research in computer engineering. Scheduling in distributed operating system has a important role in overall system performance. Process scheduling in distributed system can be defined as allocating processes to processor so that total execution...

Network

Cited By

Projects

Project (1)
Project
This project is aimed to provide a helping hand to visually challenged people for objects detection in their daily life. It is being developed in the form of an Android App based on IoT concepts for all regional languages of India.