Usability assessment of interactive systems has been a hot topic in human-computer interaction. P... more Usability assessment of interactive systems has been a hot topic in human-computer interaction. People at different times and places have attempted to evaluate software, websites, and other tools to ascertain their levels of usability. The essence is to indicate the extent to which such interactive systems are easy to learn, easy to use, easy to remember to use, effective, efficient, error tolerant, aesthetically pleasing and satisfying by users. This work adopts a user-centered approach to usability evaluation of university of Maiduguri website (www.unimaid.edu.ng) by applying a systematic methodology of involving users in performing set tasks (user testing) and using the tasks completion time as metric. The perspective of users due to their ability to allow quick tasks performance,fast downloads, effective navigation, error tolerant, consistency, and minimal background coloring was used in the evaluation. Data collected from the tasks completion time were statistically analyzed for usability criteria of learnability, efficiency, and satisfaction. Feedbacks were obtained from users through questionnaires on areas where improvements are desired from the site and the design-evaluate-redesign cycle recommended to the University' Web Teams to amend poorly developed interfaces and contents.
Usability assessment of interactive systems has been a hot topic in human-computer interaction. P... more Usability assessment of interactive systems has been a hot topic in human-computer interaction. People at different times and places have attempted to evaluate software, websites, and other tools to ascertain their levels of usability. The essence is to indicate the extent to which such interactive systems are easy to learn, easy to use, easy to remember to use, effective, efficient, error tolerant, aesthetically pleasing and satisfying by users. This work adopts a user-centered approach to usability evaluation of university of Maiduguri website (www.unimaid.edu.ng) by applying a systematic methodology of involving users in performing set tasks (user testing) and using the tasks completion time as metric. The perspective of users due to their ability to allow quick tasks performance,fast downloads, effective navigation, error tolerant, consistency, and minimal background coloring was used in the evaluation. Data collected from the tasks completion time were statistically analyzed for usability criteria of learnability, efficiency, and satisfaction. Feedbacks were obtained from users through questionnaires on areas where improvements are desired from the site and the design-evaluate-redesign cycle recommended to the University' Web Teams to amend poorly developed interfaces and contents.
Parallel scalability, flow of speech is a fascinating digital signal which stands many applicatio... more Parallel scalability, flow of speech is a fascinating digital signal which stands many applications like voice and multimedia based. These enable to transmit and recognize the category of voices in different scales. Here, it has been tried to look on the noises, accuracy and identification through Discrete Wavelet Transform (DWT) of speech recognition (SR) data. Findings has been tried to bring using DWT and Hidden Markov Model (HMM) model which is in various dimension. Speech is used to recognize and control the need of Tele-services like Tele-conferencing, video conferencing, remote calls, shopping callers, Tele-Businesses and information services. On effect of the speech segment quality and distance measures of voices determines the genders. Technical effects on its strength and weakness have tried to identify to assist forthcoming research.
Process management is one of the important tasks performed by the operating system. The performan... more Process management is one of the important tasks performed by the operating system. The performance of the system depends on the CPU scheduling algorithms. The main aim of the CPU scheduling algorithms is to minimize waiting time, turnaround time, response time and context switching and maximizing CPU utilization. First-Come-First-Served (FCFS) Round Robin (RR), Shortest Job First (SJF) and, Priority Scheduling are some popular CPU scheduling algorithms. In time shared systems, Round Robin CPU scheduling is the preferred choice. In Round Robin CPU scheduling, performance of the system depends on the choice of the optimal time quantum. This paper presents an improved Round Robin CPU scheduling algorithm coined enhancing CPU performance using the features of Shortest Job First and Round Robin scheduling with varying time quantum. The proposed algorithm is experimentally proven better than conventional RR. The simulation results show that the waiting time and turnaround time have been reduced in the proposed algorithm compared to traditional RR.
One of the most important components of the computer resource is the CPU. CPU scheduling involves... more One of the most important components of the computer resource is the CPU. CPU scheduling involves a careful examination of pending processes to determine the most efficient way to service the requests. CPU scheduling is the basis of multiprogrammed operating systems. Most CPU scheduling algorithms concentrate on maximizing CPU utilization and throughput and minimizing turnaround time, waiting time, response time and number of context switching for a set of requests. Some of the popular CPU scheduling algorithms are First-Come-First-Served (FCFS), Shortest Job First (SJF), Priority Scheduling and Round Robin (RR). FCFS is the simplest form of CPU scheduling algorithm. This algorithm is simple to implement, but it generally does not provide the fastest service. Round Robin being the most popular choice in time shared system, but it may not be suitable for real time systems because of larger waiting time, turnaround time and more number of context switches. This paper describes an improvement in RR. A simulator program has been designed and tested the Improved Round Robin (IRR). After improvement in RR it has been found that the waiting time and turnaround time have been reduced drastically.
I/O performance has been improved by proper scheduling of disk accesses since the time movable he... more I/O performance has been improved by proper scheduling of disk accesses since the time movable head disk came into existence. Disk scheduling is the process of carefully examining the pending requests to determine the most efficient way to service the pending requests. Scheduling algorithms generally concentrate on reducing seek times for a set of requests, because seek times tend to be an order of magnitude greater than latency times. Some important scheduling algorithms are First-Come-First-Served (FCFS), Shortest Seek Time First (SSTF), SCAN, Circular Scan (C-SCAN) and LOOK. This paper proposes a new disk scheduling algorithm called Major Half Served First (MHSF). Simulation results show that using MHSF the service is fast and seek time has been reduced drastically.
The proportional-integral-derivative (PID) controllers are the most popular controllers used in i... more The proportional-integral-derivative (PID) controllers are the most popular controllers used in industry because of their remarkable effectiveness, simplicity of implementation and broad applicability. However, manual tuning of these controllers is time consuming, tedious and generally lead to poor performance. This tuning which is application specific also deteriorates with time as a result of plant parameter changes. This paper presents an artificial intelligence (AI) method of particle swarm optimization (PSO) algorithm for tuning the optimal proportional-integral derivative (PID) controller parameters for industrial processes. This approach has superior features, including easy implementation, stable convergence characteristic and good computational efficiency over the conventional methods. Ziegler-Nichols, tuning method was applied in the PID tuning and results were compared with the PSO-Based PID for optimum control. Simulation results are presented to show that the PSO-Based optimized PID controller is capable of providing an improved closed-loop performance over the Ziegler-Nichols tuned PID controller Parameters. Compared to the heuristic PID tuning method of Ziegler-Nichols, the proposed method was more efficient in improving the step response characteristics such as, reducing the steady-states error; rise time, settling time and maximum overshoot in speed control of DC motor.
This study aims at studying the use of Internet by teachers and research scholars in Kurukshetra ... more This study aims at studying the use of Internet by teachers and research scholars in Kurukshetra University. Structured questionnaire was designed to collect the data. Out of 150 questionnaires, 120 were received back. The survey found that 100% respondents use Internet for e-mail followed by 83.33% for research purpose. 60% respondents use Google as their favourite search engine for accessing information.
Since the time movable head disk came into existence, the I/O performance has been improved by pr... more Since the time movable head disk came into existence, the I/O performance has been improved by proper scheduling of disk accesses. Disk scheduling involves a careful examination of pending requests to determine the most efficient way to service the requests. The two most common types of scheduling are seek optimization and rotational (or latency) optimization. Most of the scheduling algorithms concentrate on reducing seek times for a set of requests, because seek times tend to be an order of magnitude greater than latency times. Some of the most important scheduling algorithms are First-Come-First-Served (FCFS), Shortest Seek Time First (SSTF), SCAN, Circular Scan (C-SCAN) and LOOK. FCFS is the simplest form of disk scheduling algorithm. This algorithm is simple to implement, but it generally does not provide the fastest service. This paper describes an improvement in FCFS. A simulator program has been designed and tested the improved FCFS. After improvement in FCFS it has been found that the service is fast and seek time has been reduced drastically.
The mobile agent approach is a relatively new concept in the distributed systems environment. The... more The mobile agent approach is a relatively new concept in the distributed systems environment. The agents migrate from Client to server in a network where the state of the running program is saved, transported to the new host, and are stored, allowing the program to continue from the point where it stopped. In this paper, we evaluate the performance of the JADE and Aglet mobile agents. We developed a simulation program to evaluate the performance of the two mobile agents using the Encryption time, Decryption time and file transfer time. Our findings revealed that there is no significant difference between the performances of these two mobile agents using the parameters mentioned before.
Usability assessment of interactive systems has been a hot topic in human-computer interaction. P... more Usability assessment of interactive systems has been a hot topic in human-computer interaction. People at different times and places have attempted to evaluate software, websites, and other tools to ascertain their levels of usability. The essence is to indicate the extent to which such interactive systems are easy to learn, easy to use, easy to remember to use, effective, efficient, error tolerant, aesthetically pleasing and satisfying by users. This work adopts a user-centered approach to usability evaluation of university of Maiduguri website (www.unimaid.edu.ng) by applying a systematic methodology of involving users in performing set tasks (user testing) and using the tasks completion time as metric. The perspective of users due to their ability to allow quick tasks performance,fast downloads, effective navigation, error tolerant, consistency, and minimal background coloring was used in the evaluation. Data collected from the tasks completion time were statistically analyzed for usability criteria of learnability, efficiency, and satisfaction. Feedbacks were obtained from users through questionnaires on areas where improvements are desired from the site and the design-evaluate-redesign cycle recommended to the University' Web Teams to amend poorly developed interfaces and contents.
Usability assessment of interactive systems has been a hot topic in human-computer interaction. P... more Usability assessment of interactive systems has been a hot topic in human-computer interaction. People at different times and places have attempted to evaluate software, websites, and other tools to ascertain their levels of usability. The essence is to indicate the extent to which such interactive systems are easy to learn, easy to use, easy to remember to use, effective, efficient, error tolerant, aesthetically pleasing and satisfying by users. This work adopts a user-centered approach to usability evaluation of university of Maiduguri website (www.unimaid.edu.ng) by applying a systematic methodology of involving users in performing set tasks (user testing) and using the tasks completion time as metric. The perspective of users due to their ability to allow quick tasks performance,fast downloads, effective navigation, error tolerant, consistency, and minimal background coloring was used in the evaluation. Data collected from the tasks completion time were statistically analyzed for usability criteria of learnability, efficiency, and satisfaction. Feedbacks were obtained from users through questionnaires on areas where improvements are desired from the site and the design-evaluate-redesign cycle recommended to the University' Web Teams to amend poorly developed interfaces and contents.
Parallel scalability, flow of speech is a fascinating digital signal which stands many applicatio... more Parallel scalability, flow of speech is a fascinating digital signal which stands many applications like voice and multimedia based. These enable to transmit and recognize the category of voices in different scales. Here, it has been tried to look on the noises, accuracy and identification through Discrete Wavelet Transform (DWT) of speech recognition (SR) data. Findings has been tried to bring using DWT and Hidden Markov Model (HMM) model which is in various dimension. Speech is used to recognize and control the need of Tele-services like Tele-conferencing, video conferencing, remote calls, shopping callers, Tele-Businesses and information services. On effect of the speech segment quality and distance measures of voices determines the genders. Technical effects on its strength and weakness have tried to identify to assist forthcoming research.
Process management is one of the important tasks performed by the operating system. The performan... more Process management is one of the important tasks performed by the operating system. The performance of the system depends on the CPU scheduling algorithms. The main aim of the CPU scheduling algorithms is to minimize waiting time, turnaround time, response time and context switching and maximizing CPU utilization. First-Come-First-Served (FCFS) Round Robin (RR), Shortest Job First (SJF) and, Priority Scheduling are some popular CPU scheduling algorithms. In time shared systems, Round Robin CPU scheduling is the preferred choice. In Round Robin CPU scheduling, performance of the system depends on the choice of the optimal time quantum. This paper presents an improved Round Robin CPU scheduling algorithm coined enhancing CPU performance using the features of Shortest Job First and Round Robin scheduling with varying time quantum. The proposed algorithm is experimentally proven better than conventional RR. The simulation results show that the waiting time and turnaround time have been reduced in the proposed algorithm compared to traditional RR.
One of the most important components of the computer resource is the CPU. CPU scheduling involves... more One of the most important components of the computer resource is the CPU. CPU scheduling involves a careful examination of pending processes to determine the most efficient way to service the requests. CPU scheduling is the basis of multiprogrammed operating systems. Most CPU scheduling algorithms concentrate on maximizing CPU utilization and throughput and minimizing turnaround time, waiting time, response time and number of context switching for a set of requests. Some of the popular CPU scheduling algorithms are First-Come-First-Served (FCFS), Shortest Job First (SJF), Priority Scheduling and Round Robin (RR). FCFS is the simplest form of CPU scheduling algorithm. This algorithm is simple to implement, but it generally does not provide the fastest service. Round Robin being the most popular choice in time shared system, but it may not be suitable for real time systems because of larger waiting time, turnaround time and more number of context switches. This paper describes an improvement in RR. A simulator program has been designed and tested the Improved Round Robin (IRR). After improvement in RR it has been found that the waiting time and turnaround time have been reduced drastically.
I/O performance has been improved by proper scheduling of disk accesses since the time movable he... more I/O performance has been improved by proper scheduling of disk accesses since the time movable head disk came into existence. Disk scheduling is the process of carefully examining the pending requests to determine the most efficient way to service the pending requests. Scheduling algorithms generally concentrate on reducing seek times for a set of requests, because seek times tend to be an order of magnitude greater than latency times. Some important scheduling algorithms are First-Come-First-Served (FCFS), Shortest Seek Time First (SSTF), SCAN, Circular Scan (C-SCAN) and LOOK. This paper proposes a new disk scheduling algorithm called Major Half Served First (MHSF). Simulation results show that using MHSF the service is fast and seek time has been reduced drastically.
The proportional-integral-derivative (PID) controllers are the most popular controllers used in i... more The proportional-integral-derivative (PID) controllers are the most popular controllers used in industry because of their remarkable effectiveness, simplicity of implementation and broad applicability. However, manual tuning of these controllers is time consuming, tedious and generally lead to poor performance. This tuning which is application specific also deteriorates with time as a result of plant parameter changes. This paper presents an artificial intelligence (AI) method of particle swarm optimization (PSO) algorithm for tuning the optimal proportional-integral derivative (PID) controller parameters for industrial processes. This approach has superior features, including easy implementation, stable convergence characteristic and good computational efficiency over the conventional methods. Ziegler-Nichols, tuning method was applied in the PID tuning and results were compared with the PSO-Based PID for optimum control. Simulation results are presented to show that the PSO-Based optimized PID controller is capable of providing an improved closed-loop performance over the Ziegler-Nichols tuned PID controller Parameters. Compared to the heuristic PID tuning method of Ziegler-Nichols, the proposed method was more efficient in improving the step response characteristics such as, reducing the steady-states error; rise time, settling time and maximum overshoot in speed control of DC motor.
This study aims at studying the use of Internet by teachers and research scholars in Kurukshetra ... more This study aims at studying the use of Internet by teachers and research scholars in Kurukshetra University. Structured questionnaire was designed to collect the data. Out of 150 questionnaires, 120 were received back. The survey found that 100% respondents use Internet for e-mail followed by 83.33% for research purpose. 60% respondents use Google as their favourite search engine for accessing information.
Since the time movable head disk came into existence, the I/O performance has been improved by pr... more Since the time movable head disk came into existence, the I/O performance has been improved by proper scheduling of disk accesses. Disk scheduling involves a careful examination of pending requests to determine the most efficient way to service the requests. The two most common types of scheduling are seek optimization and rotational (or latency) optimization. Most of the scheduling algorithms concentrate on reducing seek times for a set of requests, because seek times tend to be an order of magnitude greater than latency times. Some of the most important scheduling algorithms are First-Come-First-Served (FCFS), Shortest Seek Time First (SSTF), SCAN, Circular Scan (C-SCAN) and LOOK. FCFS is the simplest form of disk scheduling algorithm. This algorithm is simple to implement, but it generally does not provide the fastest service. This paper describes an improvement in FCFS. A simulator program has been designed and tested the improved FCFS. After improvement in FCFS it has been found that the service is fast and seek time has been reduced drastically.
The mobile agent approach is a relatively new concept in the distributed systems environment. The... more The mobile agent approach is a relatively new concept in the distributed systems environment. The agents migrate from Client to server in a network where the state of the running program is saved, transported to the new host, and are stored, allowing the program to continue from the point where it stopped. In this paper, we evaluate the performance of the JADE and Aglet mobile agents. We developed a simulation program to evaluate the performance of the two mobile agents using the Encryption time, Decryption time and file transfer time. Our findings revealed that there is no significant difference between the performances of these two mobile agents using the parameters mentioned before.
Uploads
Papers by Manish Mishra