Scheduling number of jobs in a single machine is a "Uni-machine job scheduling problem". The mean of variation of job's waiting time is called Waiting time Variance (WTV). Minimization of WTV directly improves the quality of service (QoS) of systems involved with job scheduling. WTV minimization is a NP-hard problem. As a matter of fact minimization of the WTV on computer networks can lead to stable and predictable network performance. The main objective of this paper is to provide a secure and predictable computer and network systems by proposing a heuristic based novel approach to minimize the WTV. This approach illustrated with small size problems along with randomly new generated problems. The experimental results are compared with existing approaches. The experimental result shows the proposed approach gives best performance for the compared approaches and problems tested. The findings of intended algorithm are shown in the form of table for consonant problems.

No abstract

The integration of virtual reality (VR), augmented reality (AR), and mixed reality (MR) in urological practices and medical education has led to modern training systems that are cost-effective and with an increased expectation toward surgical performance and outcomes. VR aids the user in interacting with the virtual environment realistically by providing a three-dimensional (3D) view of the structures inside the body with high-level precision. AR enhances the real environment around users by integrating experience with virtual information over physical models and objects, which in turn has improved understanding of physiological mechanisms and anatomical structures. MR is an immersive technology that provides virtual content to interact with real elements. The field of urolithiasis has adapted the technological advancements, newer instruments, and methods to perform endourologic treatment procedures. This mini-review discusses the applications of Virtual Reality, Augmented Reality, and Mixed Reality in endourology and urolithiasis.

No abstract

In real computational world, scheduling is a decision making process. This is nothing but a systematic schedule through which a large numbers of tasks are assigned to the processors. Due to the resource limitation, creation of such schedule is a real challenge. This creates the interest of developing a qualitative scheduler for the processors. These processors are either single or parallel. One of the criteria for improving the efficiency of scheduler is waiting time variance (WTV). Minimizing the WTV of a task is a NP-hard problem. Achieving the quality of service (QoS) in a single or parallel processor by minimizing the WTV is a problem of task scheduling. To enhance the performance of a single or parallel processor, it is required to develop a stable and none overlap scheduler by minimizing WTV. An automated scheduler's performance is always measured by the attributes of QoS. One of the attributes of QoS is 'Timeliness'. First, this chapter presents the importance of heuristics with five heuristic-based solutions. Then applies these heuristics on 1kWTV minimization problem and three heuristics with a unique task distribution mechanism on Q m |prec|WTV minimization problem. The experimental result shows the performance of heuristic in the form of graph for consonant problems.