Concurrent communication constitutes one of the challenging issues associated with IoT networks, as it is highly likely that multiple devices may start communication simultaneously. This issue has become more complex as devices belonging... more
Concurrent communication constitutes one of the challenging issues associated with IoT networks, as it is highly likely that multiple devices may start communication simultaneously. This issue has become more complex as devices belonging to the IoT networks increasingly become mobile. To resolve this issue, various mechanisms have been reported in the literature. However, none of these approaches has considered the neighborhood information of a server module to resolve this issue. In this paper, a neighborhood-based smart slot allocation scheme for the IoT is presented where member devices are mobile. In this scheme, every CH or server module is bound to maintain two different types of slots, i.e., dedicated and reserved. Dedicated slots are assigned to every device on a First-Come-First-Serve (FCFS) basis, whereas reserved slots are assigned to the migrated devices. Additionally, as long as a device Ci is located inside the server module’s coverage area, it is required to use these...
Research Interests:
Research Interests:
In this paper, the results of survey, conducted to study the self-serving bias in the teams working on the different software projects in the Pakistan software houses, are reported. The survey was conducted through questionnaires and... more
In this paper, the results of survey, conducted to study the self-serving bias in the teams working on the different software projects in the Pakistan software houses, are reported. The survey was conducted through questionnaires and interviews among multiple software houses in the Pakistan to study the gap between a person’s own perception about his performance towards the project andthe perception of the others towards his contribution. According to the results it is clear that there is statistically a huge difference between a person’s own perception about his contribution and the contribution that was perceived by his team matesand this gap can act as a source of conflict or other psychological problems among the teammates and in the long run, these problem act as a hindrance towards achievements of the team goals. This paper highlights this difference and its implications for the proper working of
Research Interests:
ATM and frame relay technologies are used in collaboration with each other, Network designer can easily make choice from this study, network choice depends upon availability of the network related equipments, in case of upgrading... more
ATM and frame relay technologies are used in collaboration with each other, Network designer can easily make choice from this study, network choice depends upon availability of the network related equipments, in case of upgrading developer should think about the possibilities of enhancements in the network. Network choice also depends on the financial considerations. In this research paper researcher has done the comparative analysis of technologies and protocols of Frame Relay and ATM Networks on the basis of their application, all communication methods presented in this research paper are listed regarding their frames. Therefore survey offers two broad concepts of networking; hence after comparison reliable method could be choose for WAN communication.
This paper examines that promotional tools such as TV advertisement, Print Media, Billboards and LCD’s create boosting impact on short-term sales. Advertisement is primarily used to attract new customers and increase purchases by existing... more
This paper examines that promotional tools such as TV advertisement, Print Media, Billboards and LCD’s create boosting impact on short-term sales. Advertisement is primarily used to attract new customers and increase purchases by existing consumers. Publicity and advertising straightforwardly have an effect on the power of loyalty a buyer has for its beloved product. Therefore, if the preferred brand puts together a strong advertisement companion, the devotion of the customer will definitely increase but on the other side if the competitor brand also goes on advertising, the loyalty may decrease. Results are positively associated and have a strong relationship of promotional tools on sales growth under occasional study of advertisement campaign by Olpers milk Pakistan in the month of Ramadan.
Research Interests:
Research Interests:
Current trends in hand-held devices pose new challenges to embedded system industry. Among them, the most vitals are that these devices must be lightweight, smart in size and long lasting. The displays, keypads and batteries are usually... more
Current trends in hand-held devices pose new challenges to embedded system industry. Among them, the most vitals are that these devices must be lightweight, smart in size and long lasting. The displays, keypads and batteries are usually the most prominent ...
Research Interests:
Heterogeneous computing (HC) environment consists of different resources connected with high-speed links to provide a variety of computational capabilities for computing-intensive applications having multifarious computational... more
Heterogeneous computing (HC) environment consists of different resources connected with high-speed links to provide a variety of computational capabilities for computing-intensive applications having multifarious computational requirements. The problem of optimal assignment of ...
Research Interests:
Research Interests:
Research Interests:
Extracting salient and most prominent features from a given video sequence is one of the most critical steps in human action recognition. In this article, proposed a novel method for human action recognition, which efficiently addresses... more
Extracting salient and most prominent features from a given video sequence is one of the most critical steps in human action recognition. In this article, proposed a novel method for human action recognition, which efficiently addresses the problem of selection of most prominent and robust features in the feature selection step. Three types of features are fused based on their highest values and later most optimal features are selected with an implementation of a novel Euclidean distance (ED) and strong correlation (SC) method. In the final phase, selected features are classified using multi-class support vector machine (M-SVM). Four publically available datasets are utilized including Weizmann, KTH, UCF YouTube, and HMDB51 with an improved classification accuracy of average more than 94%. Experimental results authenticate our claim that the proposed method outperforms compared to several existing methods.
Research Interests:
Research Interests:
Research Interests:
Research Interests:
In medical imaging, brain tumor detection and recognition from magnetic resonance imaging examination are essential for both the analysis and processing of brain cancers. From the literature, it is quite clear that the recognition of... more
In medical imaging, brain tumor detection and recognition from magnetic resonance imaging examination are essential for both the analysis and processing of brain cancers. From the literature, it is quite clear that the recognition of brain tumors with high accuracy depends on the multi-levels features fusion. In this book chapter, we proposed an integrated framework for brain tumor recognition based on fuzzy C-means and multi-properties feature reduction. Three primary steps are involved in this work. In the first step, auto-skull stripping and tumor contrast stretching is performed through a combination of well-known filtering methods, and then segment the tumor region by fuzzy C-means. In the second step, multi-properties features are fused such as shape, texture, point, and Gabor wavelet by weights assignment. In the third step, NCA (neighborhood component analysis)-based irrelevant features are removed from fused feature vector (FV). The final compressed FV is fed to one-against-all support vector machine and achieved an accuracy of 100% and 96.3% on BRATS2013 and BRATS2015 dataset, respectively. Comparison with other techniques shows that the NCA-based reduction approach outperforms on selected datasets.
Research Interests:
Research Interests:
ABSTRACT Based on location information, users’ mobility profile building is the main task for making different useful systems such as early warning system, next destination and route prediction, tourist guide, mobile users’ behavior-aware... more
ABSTRACT Based on location information, users’ mobility profile building is the main task for making different useful systems such as early warning system, next destination and route prediction, tourist guide, mobile users’ behavior-aware applications, and potential friend recommendation. For mobility profile building, frequent trajectory patterns are required. The trajectory building is based on significant location extraction and the user’s actual movement prediction. Previous works have focused on significant places extraction without considering the change in GSM (global system for mobile communication) network and is based on complete data analysis. Since network operators change the GSM network periodically, there are possibilities of missing values and outliers. These missing values and outliers must be addressed to ensure actual mobility and for the efficient extraction of significant places, which are the basis for users’ trajectory building. In this paper, we propose a methodology to convert geo-coordinates into semantic tags and we also purposed a clustering methodology for recovering missing values and outlier detection. Experimental results prove the efficiency and effectiveness of the proposed scheme.
Research Interests:
Research Interests:
An exponential growth in multimedia applications has led to fast adoption of digital watermarking phenomena to protect the copyright information and authentication of digital contents. A novel spatial domain symmetric color image robust... more
An exponential growth in multimedia applications has led to fast adoption of digital watermarking phenomena to protect the copyright information and authentication of digital contents. A novel spatial domain symmetric color image robust watermarking scheme based on chaos is presented in this research. The watermark is generated using chaotic logistic map and optimized to improve inherent properties and to achieve robustness. The embedding is performed at 3 LSBs (Least Significant Bits) of all the three color components of the host image. The sensitivity of the chaotic watermark along with redundant embedding approach makes the entire watermarking scheme highly robust, secure and imperceptible. In this paper, various image quality analysis metrics such as homogeneity, contrast, entropy, PSNR (Peak Signal to Noise Ratio), UIQI (Universal Image Quality Index) and SSIM (Structural Similarity Index Measures) are measures to analyze proposed scheme. The proposed technique shows superior r...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests: Computer Science, Software Engineering, Software Development, Capability Maturity Model Integration, Process Improvement, and 7 moreAgent Technology, Design Process Model (Software engineering), Personal Software Process, Manufacturing Industry, Software Process, Software Development Process, and Team Software Process
Page 1. Empirical Study on Benchmarking Software Development Tasks Li Ruan1,2, Yongji Wang1, Qing Wang1, Mingshu Li1, Yun Yang1,3, Lizi Xie1,2, Dapeng Liu1,2, Haitao Zeng1,2, Shen Zhang1,2, Junchao Xiao1,2, Lei Zhang1,2, M.Wasif Nisar1,2,... more
Page 1. Empirical Study on Benchmarking Software Development Tasks Li Ruan1,2, Yongji Wang1, Qing Wang1, Mingshu Li1, Yun Yang1,3, Lizi Xie1,2, Dapeng Liu1,2, Haitao Zeng1,2, Shen Zhang1,2, Junchao Xiao1,2, Lei Zhang1,2, M.Wasif Nisar1,2, and Jian Dai1,2 ...
Research Interests:
Research Interests:
Research Interests:
Anomaly detection is currently an important and active research problem in many fields and involved in numerous applications. Most of the existing methods are based on dis-tance measure. But in case of Data Stream these methods are not... more
Anomaly detection is currently an important and active research problem in many fields and involved in numerous applications. Most of the existing methods are based on dis-tance measure. But in case of Data Stream these methods are not very efficient as computational point of ...
Research Interests:
AbstractAnomaly detection is currently an important and active research problem in many fields and involved in numerous applications. Most of the existing methods are based on distance measure which can produce better results as compared... more
AbstractAnomaly detection is currently an important and active research problem in many fields and involved in numerous applications. Most of the existing methods are based on distance measure which can produce better results as compared to other methods. But in case of ...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
ABSTRACT Task scheduling has vital importance in heterogeneous systems because efficient task scheduling can enhance overall system performance considerably. This paper addresses the task scheduling problem by effective utilization of... more
ABSTRACT Task scheduling has vital importance in heterogeneous systems because efficient task scheduling can enhance overall system performance considerably. This paper addresses the task scheduling problem by effective utilization of evolution based algorithm. Genetic algorithms are promising to provide near optimal results even in the large problem space but at the same time the time complexity of Genetic Algorithms are higher. The proposed algorithm, Performance Effective Genetic Algorithm (PEGA) not only provides near optimal schedule but also has a low time complexity. The PEGA efficiently finds the best solution from the search space; PEGA is performance effective due to effective utilization of genetic operators (crossover and mutation) through rigorous search. In addition the chromosome encoding with b-level introduces simplicity with efficiency. The performance is compared through extensive simulations with standard genetic algorithm (SGA). The comparison of results proved that the PEGA outperforms SGA in providing near optimal schedules with considerable less run time.
Research Interests:
Task scheduling optimization is crucial in order to achieve maximum advantage out of available resources having diverse characteristics. In heterogeneous environment scheduling set of dependent tasks involve two dimensional... more
Task scheduling optimization is crucial in order to achieve maximum advantage out of available resources having diverse characteristics. In heterogeneous environment scheduling set of dependent tasks involve two dimensional considerations. Tasks are supposed to be assigned to best suited machines while avoiding the extra overhead of communication cost which should ultimately enhance the performance mostly in terms of minimizing the completion time of a job. Extensive research work has been done addressing the same problem domain and number of well-known heuristics has been proposed. In this paper a new heuristic is proposed which assign priorities to the set of dependent tasks based on three different parameters which are average computation cost, average communication cost and mean of both. A segmented approach is introduced which schedules tasks based on nature set of tasks in terms of computation cost and there precedence constraints. The experimental results show the better performance of proposed heuristic.
Research Interests:
ABSTRACT A heterogeneous computing system (HCS) efficiently utilizes the heterogeneity of diverse computational resources interconnected with high speed networks to execute a group of compute intensive tasks. These are typically... more
ABSTRACT A heterogeneous computing system (HCS) efficiently utilizes the heterogeneity of diverse computational resources interconnected with high speed networks to execute a group of compute intensive tasks. These are typically represented by means of a directed acyclic graph (DAG) with varied computational requirements and constraints. The optimal scheduling of the given set of precedence-constrained tasks to available resources is a core concern in HCS and is known to be NP-complete problem. Task prioritization has been a major criterion for achieving high performance in HCS. This paper presents a SD-Based Algorithm for Task Scheduling (SDBATS) which uses the standard deviation of the expected execution time of a given task on the available resources in the heterogeneous computing environment as a key attribute for assigning task priority. This new approach takes into account the task heterogeneity and achieves a significant reduction in the overall execution time of a given application. The performance of the proposed algorithm has been extensively studied under a variety of conditions on standard task graphs from Graph Partition Archive as well as on some real world application DAGs such as Gaussian Elimination and Fast Fourier Transformation application DAGs. Our results show that SDBATS outperforms well known existing DAG scheduling algorithms in terms of schedule length (make span) and speedup.
Research Interests:
Research Interests:
ABSTRACT Today's multi-computer systems are heterogeneous in nature, i.e., the machines they are composed of, have varying processing capabilities and are interconnected through high speed networks, thus, making them suitable... more
ABSTRACT Today's multi-computer systems are heterogeneous in nature, i.e., the machines they are composed of, have varying processing capabilities and are interconnected through high speed networks, thus, making them suitable for performing diverse set of computing-intensive applications. In order to exploit the high performance of such a distributed system, efficient mapping of the tasks on available machines is necessary. This is an active research topic and different strategies have been adopted in literature for the mapping problem. A novel approach has been introduced in the paper for the efficient mapping of the DAG-based applications. The approach that takes into account the lower and upper bounds for the start time of the tasks. The algorithm is based on list scheduling approach and has been compared with the well known list scheduling algorithms existing in the literature. The comparison results for the randomly synthesized graphs as well as the graphs from the real world elucidate that the proposed algorithm significantly outperforms the existing ones on the basis of different cost and performance metrics.